@ours.network/fleet 1.2.0-nightly.3 → 1.2.0-nightly.31

package/dist/web-app/assets/swimlanes-42K2YHIH-Pv3Wv8c7.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"swimlanes-42K2YHIH-Pv3Wv8c7.js","sources":["../../../node_modules/mermaid/dist/chunks/mermaid.core/swimlanes-42K2YHIH.mjs"],"sourcesContent":["import {\n  createCommonLayoutRenderer\n} from \"./chunk-2E4U76K2.mjs\";\nimport \"./chunk-L3NEJ4N5.mjs\";\nimport {\n  markerOffsets\n} from \"./chunk-OSK3NFVY.mjs\";\nimport \"./chunk-GVQU2GXP.mjs\";\nimport \"./chunk-4HAMMTFA.mjs\";\nimport \"./chunk-P2QGCYS3.mjs\";\nimport \"./chunk-GMAD6QVW.mjs\";\nimport \"./chunk-PWAF6VOD.mjs\";\nimport \"./chunk-75Z2AOVW.mjs\";\nimport \"./chunk-DU6HZSFF.mjs\";\nimport {\n  log\n} from \"./chunk-X3CZISLH.mjs\";\nimport {\n  __name\n} from \"./chunk-Y2CYZVJY.mjs\";\n\n// src/rendering-util/rendering-elements/lineJump.ts\nvar ROUNDED_CORNER_RADIUS = 5;\nvar CORNER_EPSILON = 1e-5;\nvar ENDPOINT_EPSILON = 1e-6;\nfunction buildSegmentList(points) {\n  const segments = [];\n  for (let i = 0; i < points.length - 1; i++) {\n    segments.push({ a: points[i], b: points[i + 1] });\n  }\n  return segments;\n}\n__name(buildSegmentList, \"buildSegmentList\");\nfunction segmentIntersection(a1, a2, b1, b2) {\n  const dxA = a2.x - a1.x;\n  const dyA = a2.y - a1.y;\n  const dxB = b2.x - b1.x;\n  const dyB = b2.y - b1.y;\n  const denom = dxA * dyB - dyA * dxB;\n  if (denom === 0) {\n    return null;\n  }\n  const dx = b1.x - a1.x;\n  const dy = b1.y - a1.y;\n  const tA = (dx * dyB - dy * dxB) / denom;\n  const tB = (dx * dyA - dy * dxA) / denom;\n  if (tA <= ENDPOINT_EPSILON || tA >= 1 - ENDPOINT_EPSILON || tB <= ENDPOINT_EPSILON || tB >= 1 - ENDPOINT_EPSILON) {\n    return null;\n  }\n  return {\n    point: { x: a1.x + tA * dxA, y: a1.y + tA * dyA },\n    tA,\n    tB\n  };\n}\n__name(segmentIntersection, \"segmentIntersection\");\nfunction isHorizontalSeg(seg) {\n  return Math.abs(seg.b.x - seg.a.x) >= Math.abs(seg.b.y - seg.a.y);\n}\n__name(isHorizontalSeg, \"isHorizontalSeg\");\nfunction findEdgeIntersections(edges) {\n  const crossings = [];\n  for (let i = 0; i < edges.length; i++) {\n    const edgeA = edges[i];\n    const segmentsA = buildSegmentList(edgeA.points);\n    for (let j = i + 1; j < edges.length; j++) {\n      const edgeB = edges[j];\n      const segmentsB = buildSegmentList(edgeB.points);\n      for (const [si, segA] of segmentsA.entries()) {\n        for (const [sj, segB] of segmentsB.entries()) {\n          const hit = segmentIntersection(segA.a, segA.b, segB.a, segB.b);\n          if (!hit) {\n            continue;\n          }\n          const aHoriz = isHorizontalSeg(segA);\n          const bHoriz = isHorizontalSeg(segB);\n          const orthogonalPair = aHoriz !== bHoriz;\n          const jumpOnA = orthogonalPair ? aHoriz : false;\n          if (jumpOnA) {\n            crossings.push({\n              jumpEdgeId: edgeA.id,\n              otherEdgeId: edgeB.id,\n              segIndex: si,\n              t: hit.tA,\n              point: hit.point\n            });\n          } else {\n            crossings.push({\n              jumpEdgeId: edgeB.id,\n              otherEdgeId: edgeA.id,\n              segIndex: sj,\n              t: hit.tB,\n              point: hit.point\n            });\n          }\n        }\n      }\n    }\n  }\n  return crossings;\n}\n__name(findEdgeIntersections, \"findEdgeIntersections\");\nfunction fmt(n) {\n  const rounded = Math.round(n * 1e3) / 1e3;\n  return Number.isInteger(rounded) ? `${rounded}` : `${rounded}`;\n}\n__name(fmt, \"fmt\");\nfunction pointToString(p) {\n  return `${fmt(p.x)},${fmt(p.y)}`;\n}\n__name(pointToString, \"pointToString\");\nfunction getArcSweepFlag(seg) {\n  const dx = seg.b.x - seg.a.x;\n  const dy = seg.b.y - seg.a.y;\n  if (Math.abs(dx) >= Math.abs(dy)) {\n    return dx >= 0 ? 1 : 0;\n  }\n  return dy >= 0 ? 1 : 0;\n}\n__name(getArcSweepFlag, \"getArcSweepFlag\");\nvar MIN_JUMP_RADIUS = 1e-3;\nfunction applyMarkerOffsets(points, edge) {\n  if (points.length < 2) {\n    return points.map((p) => ({ ...p }));\n  }\n  const out = points.map((p) => ({ ...p }));\n  const startOff = edge.arrowTypeStart && markerOffsets[edge.arrowTypeStart];\n  if (startOff) {\n    const a = points[0];\n    const b = points[1];\n    const ang = Math.atan2(b.y - a.y, b.x - a.x);\n    out[0].x = a.x + startOff * Math.cos(ang);\n    out[0].y = a.y + startOff * Math.sin(ang);\n  }\n  const endOff = edge.arrowTypeEnd && markerOffsets[edge.arrowTypeEnd];\n  if (endOff) {\n    const n = points.length;\n    const a = points[n - 2];\n    const b = points[n - 1];\n    const ang = Math.atan2(b.y - a.y, b.x - a.x);\n    out[n - 1].x = b.x - endOff * Math.cos(ang);\n    out[n - 1].y = b.y - endOff * Math.sin(ang);\n  }\n  return out;\n}\n__name(applyMarkerOffsets, \"applyMarkerOffsets\");\nfunction emitJump(jump, ux, uy, sweep, style) {\n  const cx = jump.point.x;\n  const cy = jump.point.y;\n  const pre = { x: cx - ux * jump.r, y: cy - uy * jump.r };\n  const post = { x: cx + ux * jump.r, y: cy + uy * jump.r };\n  const out = [`L${pointToString(pre)}`];\n  if (style === \"arc\") {\n    out.push(`A${fmt(jump.r)},${fmt(jump.r)} 0 0 ${sweep} ${pointToString(post)}`);\n  } else {\n    out.push(`M${pointToString(post)}`);\n  }\n  return out;\n}\n__name(emitJump, \"emitJump\");\nfunction computeRoundedCorner(prev, curr, next, radius) {\n  const dx1 = curr.x - prev.x;\n  const dy1 = curr.y - prev.y;\n  const dx2 = next.x - curr.x;\n  const dy2 = next.y - curr.y;\n  const len1 = Math.hypot(dx1, dy1);\n  const len2 = Math.hypot(dx2, dy2);\n  if (len1 < CORNER_EPSILON || len2 < CORNER_EPSILON) {\n    return null;\n  }\n  const nx1 = dx1 / len1;\n  const ny1 = dy1 / len1;\n  const nx2 = dx2 / len2;\n  const ny2 = dy2 / len2;\n  const dot = nx1 * nx2 + ny1 * ny2;\n  const clamped = Math.max(-1, Math.min(1, dot));\n  const angle = Math.acos(clamped);\n  if (angle < CORNER_EPSILON || Math.abs(Math.PI - angle) < CORNER_EPSILON) {\n    return null;\n  }\n  const cutLen = Math.min(radius / Math.sin(angle / 2), len1 / 2, len2 / 2);\n  return {\n    startX: curr.x - nx1 * cutLen,\n    startY: curr.y - ny1 * cutLen,\n    endX: curr.x + nx2 * cutLen,\n    endY: curr.y + ny2 * cutLen,\n    ctrlX: curr.x,\n    ctrlY: curr.y,\n    cutLen\n  };\n}\n__name(computeRoundedCorner, \"computeRoundedCorner\");\nfunction rewriteEdgePath(edge, jumps, config) {\n  const rawPoints = edge.points;\n  if (rawPoints.length < 2) {\n    return \"\";\n  }\n  const points = applyMarkerOffsets(rawPoints, edge);\n  const rounded = edge.curve === \"rounded\";\n  const segments = buildSegmentList(points);\n  const bySeg = /* @__PURE__ */ new Map();\n  for (const j of jumps) {\n    const seg = segments[j.segIndex];\n    if (!seg) {\n      continue;\n    }\n    const segLen = Math.hypot(seg.b.x - seg.a.x, seg.b.y - seg.a.y);\n    const list = bySeg.get(j.segIndex) ?? [];\n    list.push({\n      t: j.t,\n      point: j.point,\n      d: j.t * segLen,\n      r: config.jumpRadius\n    });\n    bySeg.set(j.segIndex, list);\n  }\n  const parts = [`M${pointToString(points[0])}`];\n  for (let i = 0; i < segments.length; i++) {\n    const seg = segments[i];\n    const segLen = Math.hypot(seg.b.x - seg.a.x, seg.b.y - seg.a.y);\n    const ux = segLen === 0 ? 0 : (seg.b.x - seg.a.x) / segLen;\n    const uy = segLen === 0 ? 0 : (seg.b.y - seg.a.y) / segLen;\n    const sweep = getArcSweepFlag(seg);\n    let segStartConsumed = 0;\n    if (rounded && i > 0) {\n      const corner = computeRoundedCorner(\n        points[i - 1],\n        points[i],\n        points[i + 1] ?? points[i],\n        ROUNDED_CORNER_RADIUS\n      );\n      if (corner) {\n        segStartConsumed = corner.cutLen;\n      }\n    }\n    let segEndStop = segLen;\n    let upcomingCorner = null;\n    if (rounded && i < segments.length - 1) {\n      upcomingCorner = computeRoundedCorner(\n        points[i],\n        points[i + 1],\n        points[i + 2] ?? points[i + 1],\n        ROUNDED_CORNER_RADIUS\n      );\n      if (upcomingCorner) {\n        segEndStop = segLen - upcomingCorner.cutLen;\n      }\n    }\n    const segJumps = [...bySeg.get(i) ?? []].sort((a, b) => a.t - b.t);\n    for (const j of segJumps) {\n      j.r = Math.min(j.r, j.d - segStartConsumed, segEndStop - j.d);\n    }\n    for (let k = 0; k < segJumps.length - 1; k++) {\n      const gap = segJumps[k + 1].d - segJumps[k].d;\n      if (segJumps[k].r + segJumps[k + 1].r > gap) {\n        const half = gap / 2;\n        segJumps[k].r = Math.min(segJumps[k].r, half);\n        segJumps[k + 1].r = Math.min(segJumps[k + 1].r, half);\n      }\n    }\n    for (const j of segJumps) {\n      if (j.r < MIN_JUMP_RADIUS) {\n        continue;\n      }\n      parts.push(...emitJump(j, ux, uy, sweep, config.jumpStyle));\n    }\n    if (rounded && upcomingCorner) {\n      parts.push(`L${fmt(upcomingCorner.startX)},${fmt(upcomingCorner.startY)}`);\n      parts.push(\n        `Q${fmt(upcomingCorner.ctrlX)},${fmt(upcomingCorner.ctrlY)} ${fmt(upcomingCorner.endX)},${fmt(upcomingCorner.endY)}`\n      );\n    } else {\n      parts.push(`L${pointToString(seg.b)}`);\n    }\n  }\n  return parts.join(\" \");\n}\n__name(rewriteEdgePath, \"rewriteEdgePath\");\nfunction isStraightPath(d) {\n  return /^[\\d\\s+,.LMelm-]*$/.test(d);\n}\n__name(isStraightPath, \"isStraightPath\");\nfunction curveSupportsLineHops(curve) {\n  if (!curve) {\n    return true;\n  }\n  return curve === \"linear\" || curve === \"rounded\" || curve === \"step\" || curve === \"stepBefore\" || curve === \"stepAfter\";\n}\n__name(curveSupportsLineHops, \"curveSupportsLineHops\");\nfunction decodeDataPoints(raw) {\n  if (!raw) {\n    return null;\n  }\n  try {\n    const json = typeof atob === \"function\" ? atob(raw) : Buffer.from(raw, \"base64\").toString();\n    const parsed = JSON.parse(json);\n    if (!Array.isArray(parsed)) {\n      return null;\n    }\n    const pts = [];\n    for (const p of parsed) {\n      if (p && typeof p.x === \"number\" && typeof p.y === \"number\") {\n        pts.push({ x: p.x, y: p.y });\n      }\n    }\n    return pts.length >= 2 ? pts : null;\n  } catch {\n    return null;\n  }\n}\n__name(decodeDataPoints, \"decodeDataPoints\");\nfunction applyLineJumpsToSvg(edgePathsGroup, edges, config) {\n  if (!config.enabled) {\n    return;\n  }\n  const groupNode = edgePathsGroup.node();\n  if (!groupNode) {\n    return;\n  }\n  const edgeMeta = /* @__PURE__ */ new Map();\n  for (const e of edges) {\n    edgeMeta.set(e.id, e);\n  }\n  const renderedEdges = [];\n  const pathById = /* @__PURE__ */ new Map();\n  for (const e of edges) {\n    const escapedId = typeof CSS !== \"undefined\" && CSS.escape ? CSS.escape(e.id) : e.id;\n    const pathEl = groupNode.querySelector(`path[data-id=\"${escapedId}\"]`);\n    if (!pathEl) {\n      continue;\n    }\n    pathById.set(e.id, pathEl);\n    const decoded = decodeDataPoints(pathEl.getAttribute(\"data-points\"));\n    const points = decoded ?? e.points;\n    renderedEdges.push({ ...e, points });\n  }\n  const crossings = findEdgeIntersections(renderedEdges);\n  if (crossings.length === 0) {\n    return;\n  }\n  const jumpsByEdge = /* @__PURE__ */ new Map();\n  for (const c of crossings) {\n    const list = jumpsByEdge.get(c.jumpEdgeId) ?? [];\n    list.push(c);\n    jumpsByEdge.set(c.jumpEdgeId, list);\n  }\n  for (const renderedEdge of renderedEdges) {\n    const jumps = jumpsByEdge.get(renderedEdge.id);\n    if (!jumps || jumps.length === 0) {\n      continue;\n    }\n    const meta = edgeMeta.get(renderedEdge.id);\n    const curveHint = meta?.curve;\n    if (curveHint !== void 0 && !curveSupportsLineHops(curveHint)) {\n      continue;\n    }\n    const pathEl = pathById.get(renderedEdge.id);\n    if (!pathEl) {\n      continue;\n    }\n    if (curveHint === void 0) {\n      const currentD = pathEl.getAttribute(\"d\") ?? \"\";\n      if (!isStraightPath(currentD)) {\n        continue;\n      }\n    }\n    const originalStyle = pathEl.getAttribute(\"style\") ?? \"\";\n    const dasharrayMatch = /stroke-dasharray\\s*:\\s*0\\s+([\\d.]+)\\s+[\\d.]+\\s+([\\d.]+)/.exec(\n      originalStyle\n    );\n    const preservedOValueS = dasharrayMatch ? Number.parseFloat(dasharrayMatch[1]) : null;\n    const preservedOValueE = dasharrayMatch ? Number.parseFloat(dasharrayMatch[2]) : null;\n    const newD = rewriteEdgePath(renderedEdge, jumps, config);\n    pathEl.setAttribute(\"d\", newD);\n    if (preservedOValueS !== null && preservedOValueE !== null && typeof pathEl.getTotalLength === \"function\") {\n      const newLen = pathEl.getTotalLength();\n      const onLen = Math.max(0, newLen - preservedOValueS - preservedOValueE);\n      const newDasharray = `0 ${preservedOValueS} ${onLen} ${preservedOValueE}`;\n      const cleaned = originalStyle.replace(/stroke-dasharray\\s*:[^;]*;?/g, `stroke-dasharray: ${newDasharray};`).replace(/;\\s*;+/g, \";\");\n      pathEl.setAttribute(\"style\", cleaned);\n    }\n  }\n}\n__name(applyLineJumpsToSvg, \"applyLineJumpsToSvg\");\n\n// src/rendering-util/layout-algorithms/swimlanes/adjustLayout.ts\nfunction applySwimlaneLineJumps(data4Layout, { measure }) {\n  const lineHopsConfig = data4Layout.config?.swimlane?.lineHops;\n  if (lineHopsConfig === false) {\n    return;\n  }\n  const jumpStyle = lineHopsConfig === \"gap\" ? \"gap\" : \"arc\";\n  const edgeGeometries = data4Layout.edges.filter((edge) => Array.isArray(edge.points) && edge.points.length >= 2).map((edge) => ({\n    id: edge.id,\n    points: edge.points,\n    curve: edge.curve,\n    arrowTypeStart: edge.arrowTypeStart,\n    arrowTypeEnd: edge.arrowTypeEnd\n  }));\n  applyLineJumpsToSvg(measure.groups.edgePaths, edgeGeometries, {\n    enabled: true,\n    jumpRadius: 6,\n    jumpStyle\n  });\n}\n__name(applySwimlaneLineJumps, \"applySwimlaneLineJumps\");\n\n// src/rendering-util/layout-algorithms/swimlanes/helpers.ts\nvar DEFAULT_SWIMLANE_ID = \"__swimlane_default__\";\nvar TOP_LANE_TITLE_BAND_HEIGHT = 21;\nvar MIN_TOP_LANE_HORIZONTAL_PADDING = 20;\nfunction topLaneHorizontalPadding(lane) {\n  return Math.max(lane.padding ?? MIN_TOP_LANE_HORIZONTAL_PADDING, MIN_TOP_LANE_HORIZONTAL_PADDING);\n}\n__name(topLaneHorizontalPadding, \"topLaneHorizontalPadding\");\nfunction assignTopLaneTitleRect(lane) {\n  const { x, y, width, height } = lane;\n  const contentTop = lane.swimlaneContentTop;\n  if (typeof x !== \"number\" || typeof y !== \"number\" || typeof width !== \"number\" || typeof height !== \"number\" || typeof contentTop !== \"number\" || !Number.isFinite(x) || !Number.isFinite(y) || !Number.isFinite(width) || !Number.isFinite(height) || !Number.isFinite(contentTop) || width <= 0 || height <= 0) {\n    delete lane.groupTitleRect;\n    return;\n  }\n  const top = y - height / 2;\n  const headerBottom = Math.min(contentTop, y + height / 2);\n  const titleHeight = Math.min(TOP_LANE_TITLE_BAND_HEIGHT, Math.max(0, headerBottom - top));\n  const bottom = top + titleHeight;\n  if (bottom <= top) {\n    delete lane.groupTitleRect;\n    return;\n  }\n  lane.groupTitleRect = {\n    left: x - width / 2,\n    right: x + width / 2,\n    top,\n    bottom\n  };\n}\n__name(assignTopLaneTitleRect, \"assignTopLaneTitleRect\");\nfunction prepareLayoutForSwimlanes(layout) {\n  const direction = layout.direction;\n  const nodes = layout.nodes ??= [];\n  for (const node of layout.nodes ?? []) {\n    if (node.isGroup && !node.parentId) {\n      node.shape = \"swimlane\";\n      if (direction) {\n        node.direction = direction;\n      }\n    }\n  }\n  const looseNodes = nodes.filter((node) => !node.isGroup && !node.parentId);\n  if (looseNodes.length === 0) {\n    return;\n  }\n  let defaultLane = nodes.find((node) => node.id === DEFAULT_SWIMLANE_ID);\n  if (!defaultLane) {\n    defaultLane = {\n      id: DEFAULT_SWIMLANE_ID,\n      label: \"\",\n      isGroup: true,\n      shape: \"swimlane\",\n      padding: 20,\n      ...direction ? { direction } : {}\n    };\n    nodes.push(defaultLane);\n  } else if (defaultLane.isGroup) {\n    defaultLane.shape = \"swimlane\";\n    if (direction) {\n      defaultLane.direction = direction;\n    }\n  }\n  for (const node of looseNodes) {\n    node.parentId = DEFAULT_SWIMLANE_ID;\n  }\n}\n__name(prepareLayoutForSwimlanes, \"prepareLayoutForSwimlanes\");\nfunction toGraphView(layout) {\n  const nodeById = /* @__PURE__ */ new Map();\n  for (const n of layout.nodes ?? []) {\n    nodeById.set(n.id, n);\n  }\n  const edges = [];\n  for (const e of layout.edges ?? []) {\n    const src = typeof e.start === \"string\" ? e.start : void 0;\n    const dst = typeof e.end === \"string\" ? e.end : void 0;\n    if (!src || !dst) {\n      continue;\n    }\n    if (e.labelNodeId) {\n      continue;\n    }\n    edges.push({ id: e.id, src, dst, ref: e });\n  }\n  const allNodes = layout.nodes ?? [];\n  const groupNodes = allNodes.filter((n) => n.isGroup);\n  const nonGroupNodes = allNodes.filter((n) => !n.isGroup);\n  const nodesInGroupOrder = [...groupNodes].reverse();\n  const nodes = [...nodesInGroupOrder, ...nonGroupNodes].map((n) => n.id);\n  return { nodes, edges, layout, nodeById };\n}\n__name(toGraphView, \"toGraphView\");\nfunction writeBackToLayoutData(g, ordered, coords, opts) {\n  const { layout } = g;\n  const nodeMap = g.nodeById;\n  const layerGap = opts?.layerGap ?? 100;\n  const nodeGap = opts?.nodeGap ?? 40;\n  let layerIndex = 0;\n  for (const layer of ordered.layers) {\n    let orderIndex = 0;\n    for (const id of layer) {\n      const node = nodeMap.get(id);\n      if (!node) {\n        orderIndex++;\n        continue;\n      }\n      node.layer = layerIndex;\n      node.order = orderIndex;\n      const x = coords.x[id] ?? orderIndex * nodeGap;\n      const y = coords.y[id] ?? layerIndex * layerGap;\n      node.x = x;\n      node.y = y;\n      orderIndex++;\n    }\n    layerIndex++;\n  }\n  const allNodes = layout.nodes ?? [];\n  const groupBounds = /* @__PURE__ */ new Map();\n  const topLevelGroups = [];\n  for (const group of allNodes) {\n    if (!group?.isGroup) {\n      continue;\n    }\n    if (!group.parentId) {\n      topLevelGroups.push(group);\n    }\n    const children = allNodes.filter((n) => n.parentId === group.id);\n    let minX = Infinity;\n    let maxX = -Infinity;\n    let minY = Infinity;\n    let maxY = -Infinity;\n    for (const child of children) {\n      const cx = child.x ?? coords.x[child.id];\n      const cy = child.y ?? coords.y[child.id];\n      const cw = child.width ?? 0;\n      const ch = child.height ?? 0;\n      if (cx != null && cy != null) {\n        minX = Math.min(minX, cx - cw / 2);\n        maxX = Math.max(maxX, cx + cw / 2);\n        minY = Math.min(minY, cy - ch / 2);\n        maxY = Math.max(maxY, cy + ch / 2);\n      }\n    }\n    if (minX === Infinity || minY === Infinity) {\n      group.x = group.x ?? 0;\n      group.y = group.y ?? 0;\n      group.width = group.width ?? 0;\n      group.height = group.height ?? 0;\n    } else {\n      const pad = group.padding ?? 20;\n      const horizontalPad = group.parentId ? pad : 2 * topLaneHorizontalPadding(group);\n      const verticalPad = pad;\n      const w = Math.max(0, maxX - minX) + horizontalPad;\n      const h = Math.max(0, maxY - minY) + verticalPad;\n      const cx = (minX + maxX) / 2;\n      const cy = (minY + maxY) / 2;\n      group.x = cx;\n      group.y = cy;\n      group.width = w;\n      group.height = h;\n      groupBounds.set(group.id, { minX, maxX, minY, maxY });\n    }\n  }\n  if (topLevelGroups.length > 0 && groupBounds.size > 0) {\n    let globalMinY = Infinity;\n    let globalMaxY = -Infinity;\n    let maxPad = 0;\n    for (const lane of topLevelGroups) {\n      const pad = lane.padding ?? 20;\n      if (pad > maxPad) {\n        maxPad = pad;\n      }\n      const b = groupBounds.get(lane.id);\n      if (!b) {\n        continue;\n      }\n      globalMinY = Math.min(globalMinY, b.minY);\n      globalMaxY = Math.max(globalMaxY, b.maxY);\n    }\n    if (globalMinY !== Infinity && globalMaxY !== -Infinity) {\n      const contentHeight = Math.max(0, globalMaxY - globalMinY);\n      const minHeaderMargin = 36;\n      const verticalMargin = Math.max(maxPad, minHeaderMargin);\n      const laneHeight = contentHeight + 2 * verticalMargin;\n      const centerY = (globalMinY + globalMaxY) / 2;\n      for (const lane of topLevelGroups) {\n        lane.y = centerY;\n        lane.height = laneHeight;\n        lane.swimlaneContentTop = globalMinY;\n      }\n      const sortedLanes = [...topLevelGroups].sort((a, b) => {\n        const ax = a.x ?? 0;\n        const bx = b.x ?? 0;\n        return ax - bx;\n      });\n      const laneIds = [];\n      const centers = [];\n      const baseWidths = [];\n      for (const lane of sortedLanes) {\n        const b = groupBounds.get(lane.id);\n        if (!b) {\n          continue;\n        }\n        const contentWidth = Math.max(0, b.maxX - b.minX) + 2 * topLaneHorizontalPadding(lane);\n        const cx = (b.minX + b.maxX) / 2;\n        laneIds.push(lane.id);\n        centers.push(cx);\n        baseWidths.push(contentWidth);\n      }\n      const count = laneIds.length;\n      if (count > 0) {\n        const laneWidths = /* @__PURE__ */ new Map();\n        if (count === 1) {\n          laneWidths.set(laneIds[0], baseWidths[0]);\n        } else {\n          const d = [];\n          for (let i = 0; i < count - 1; i++) {\n            d.push(centers[i + 1] - centers[i]);\n          }\n          const u = new Array(count);\n          u[0] = 0;\n          for (let i = 0; i < count - 1; i++) {\n            u[i + 1] = 2 * d[i] - u[i];\n          }\n          let lowerBound = 0;\n          let upperBound = Number.POSITIVE_INFINITY;\n          for (let i = 0; i < count; i++) {\n            const baseW = baseWidths[i];\n            if (i % 2 === 0) {\n              lowerBound = Math.max(lowerBound, baseW - u[i]);\n            } else {\n              upperBound = Math.min(upperBound, u[i] - baseW);\n            }\n          }\n          let x = lowerBound;\n          if (lowerBound <= upperBound) {\n            x = (lowerBound + upperBound) / 2;\n          } else {\n            x = lowerBound;\n          }\n          for (let i = 0; i < count; i++) {\n            const w = u[i] + (i % 2 === 0 ? x : -x);\n            const finalWidth = Math.max(baseWidths[i], w);\n            laneWidths.set(laneIds[i], finalWidth);\n          }\n        }\n        for (const lane of topLevelGroups) {\n          const w = laneWidths.get(lane.id);\n          if (w != null) {\n            lane.width = w;\n          }\n          assignTopLaneTitleRect(lane);\n        }\n      }\n    }\n  }\n}\n__name(writeBackToLayoutData, \"writeBackToLayoutData\");\n\n// src/rendering-util/layout-algorithms/swimlanes/edgeLabelNodes.ts\nvar EDGE_LABEL_LOG_PREFIX = \"[EdgeLabelNodes]\";\nfunction createEdgeLabelNodes(data) {\n  const nodesToAdd = [];\n  const layoutOnlyEdges = [];\n  const nodeById = /* @__PURE__ */ new Map();\n  for (const node of data.nodes) {\n    nodeById.set(node.id, node);\n  }\n  for (const edge of data.edges) {\n    if (!edge.label || edge.label.length === 0) {\n      continue;\n    }\n    if (edge.isLayoutOnly) {\n      continue;\n    }\n    if (edge.labelNodeId) {\n      continue;\n    }\n    const sourceNode = edge.start ? nodeById.get(edge.start) : void 0;\n    const targetNode = edge.end ? nodeById.get(edge.end) : void 0;\n    if (!sourceNode || !targetNode) {\n      log.warn(EDGE_LABEL_LOG_PREFIX, `Edge ${edge.id} has missing source or target node`);\n      continue;\n    }\n    const labelNodeId = `edge-label-${edge.start}-${edge.end}-${edge.id}`;\n    const isCrossLane = sourceNode.parentId !== targetNode.parentId;\n    const labelLane = isCrossLane ? targetNode.parentId : sourceNode.parentId;\n    const labelNode = {\n      id: labelNodeId,\n      label: edge.label,\n      edgeStart: edge.start ?? \"\",\n      edgeEnd: edge.end ?? \"\",\n      shape: \"labelRect\",\n      width: 0,\n      // populated when rendered / applied from fixture\n      height: 0,\n      isEdgeLabel: true,\n      isDummy: true,\n      parentId: labelLane,\n      isGroup: false,\n      labelStyle: Array.isArray(edge.labelStyle) ? edge.labelStyle[0] : edge.labelStyle ?? \"\",\n      ...sourceNode.dir ? { dir: sourceNode.dir } : {}\n    };\n    nodesToAdd.push(labelNode);\n    edge.labelNodeId = labelNodeId;\n    edge.label = void 0;\n    edge.text = void 0;\n    const toLabelVirtual = {\n      id: `${edge.id}-to-label`,\n      start: edge.start,\n      end: labelNodeId,\n      type: \"normal\",\n      isLayoutOnly: true\n    };\n    const fromLabelVirtual = {\n      id: `${edge.id}-from-label`,\n      start: labelNodeId,\n      end: edge.end,\n      type: \"normal\",\n      isLayoutOnly: true\n    };\n    layoutOnlyEdges.push(toLabelVirtual, fromLabelVirtual);\n  }\n  const newNodes = [...data.nodes, ...nodesToAdd];\n  const newEdges = [...data.edges, ...layoutOnlyEdges];\n  return {\n    ...data,\n    nodes: newNodes,\n    edges: newEdges\n  };\n}\n__name(createEdgeLabelNodes, \"createEdgeLabelNodes\");\n\n// src/rendering-util/layout-algorithms/swimlanes/direction/geometry.ts\nvar EPS = 1e-3;\nfunction measuredNodeRect(node) {\n  const cx = node.x ?? 0;\n  const cy = node.y ?? 0;\n  const width = node.width ?? 0;\n  const height = node.height ?? 0;\n  return width > 0 && height > 0 ? { cx, cy, rect: rectFromCenterSize(cx, cy, width, height) } : void 0;\n}\n__name(measuredNodeRect, \"measuredNodeRect\");\nfunction nodeBoundsInfoFor(node) {\n  if (node.isGroup) {\n    return void 0;\n  }\n  const measured = measuredNodeRect(node);\n  if (!measured) {\n    return void 0;\n  }\n  const id = String(node.id ?? \"\");\n  return {\n    id,\n    cx: measured.cx,\n    cy: measured.cy,\n    rect: measured.rect\n  };\n}\n__name(nodeBoundsInfoFor, \"nodeBoundsInfoFor\");\nfunction samePoint(a, b, epsilon = EPS) {\n  return Math.abs(a.x - b.x) < epsilon && Math.abs(a.y - b.y) < epsilon;\n}\n__name(samePoint, \"samePoint\");\nfunction sameX(a, b, epsilon = EPS) {\n  return Math.abs(a.x - b.x) < epsilon;\n}\n__name(sameX, \"sameX\");\nfunction sameY(a, b, epsilon = EPS) {\n  return Math.abs(a.y - b.y) < epsilon;\n}\n__name(sameY, \"sameY\");\nfunction isHorizontalSegment(a, b, epsilon = EPS) {\n  return sameY(a, b, epsilon) && Math.abs(a.x - b.x) > epsilon;\n}\n__name(isHorizontalSegment, \"isHorizontalSegment\");\nfunction isVerticalSegment(a, b, epsilon = EPS) {\n  return sameX(a, b, epsilon) && Math.abs(a.y - b.y) > epsilon;\n}\n__name(isVerticalSegment, \"isVerticalSegment\");\nfunction overlapLength(a1, a2, b1, b2) {\n  return Math.max(\n    0,\n    Math.min(Math.max(a1, a2), Math.max(b1, b2)) - Math.max(Math.min(a1, a2), Math.min(b1, b2))\n  );\n}\n__name(overlapLength, \"overlapLength\");\nfunction sameAxisSegmentOverlapLength(a, b, epsilon = EPS) {\n  if (a.horizontal && b.horizontal && sameY(a.a, b.a, epsilon)) {\n    return overlapLength(a.a.x, a.b.x, b.a.x, b.b.x);\n  }\n  if (a.vertical && b.vertical && sameX(a.a, b.a, epsilon)) {\n    return overlapLength(a.a.y, a.b.y, b.a.y, b.b.y);\n  }\n  return 0;\n}\n__name(sameAxisSegmentOverlapLength, \"sameAxisSegmentOverlapLength\");\nfunction orthogonalSegmentsForPoints(points, epsilon = EPS) {\n  const result = [];\n  for (let i = 0; i < points.length - 1; i++) {\n    const a = points[i];\n    const b = points[i + 1];\n    const horizontal = isHorizontalSegment(a, b, epsilon);\n    const vertical = isVerticalSegment(a, b, epsilon);\n    if (horizontal || vertical) {\n      result.push({ index: i, a, b, horizontal, vertical });\n    }\n  }\n  return result;\n}\n__name(orthogonalSegmentsForPoints, \"orthogonalSegmentsForPoints\");\nfunction countOrthogonalBends(points, epsilon = EPS) {\n  const segments = orthogonalSegmentsForPoints(points, epsilon);\n  let bends = 0;\n  for (let i = 1; i < segments.length; i++) {\n    if (segments[i - 1].horizontal !== segments[i].horizontal) {\n      bends++;\n    }\n  }\n  return bends;\n}\n__name(countOrthogonalBends, \"countOrthogonalBends\");\nfunction dedupeConsecutivePoints(points, epsilon = EPS) {\n  const result = [];\n  for (const point of points) {\n    const last = result.length > 0 ? result[result.length - 1] : void 0;\n    if (!last || !samePoint(last, point, epsilon)) {\n      result.push({ x: point.x, y: point.y });\n    }\n  }\n  return result;\n}\n__name(dedupeConsecutivePoints, \"dedupeConsecutivePoints\");\nfunction classifyThreeSegmentRoute(points, epsilon = EPS) {\n  if (!points || points.length !== 4) {\n    return void 0;\n  }\n  const [p0, p1, p2, p3] = points;\n  const isHVH = isHorizontalSegment(p0, p1, epsilon) && isVerticalSegment(p1, p2, epsilon) && isHorizontalSegment(p2, p3, epsilon);\n  if (isHVH) {\n    return { kind: \"HVH\", p0, p1, p2, p3 };\n  }\n  const isVHV = isVerticalSegment(p0, p1, epsilon) && isHorizontalSegment(p1, p2, epsilon) && isVerticalSegment(p2, p3, epsilon);\n  return isVHV ? { kind: \"VHV\", p0, p1, p2, p3 } : void 0;\n}\n__name(classifyThreeSegmentRoute, \"classifyThreeSegmentRoute\");\nfunction segmentBoundsOverlapRect(a, b, rect, buffer = 0) {\n  const segMinX = Math.min(a.x, b.x);\n  const segMaxX = Math.max(a.x, b.x);\n  const segMinY = Math.min(a.y, b.y);\n  const segMaxY = Math.max(a.y, b.y);\n  return segMaxX > rect.left - buffer && segMinX < rect.right + buffer && segMaxY > rect.top - buffer && segMinY < rect.bottom + buffer;\n}\n__name(segmentBoundsOverlapRect, \"segmentBoundsOverlapRect\");\nfunction pointInsideRect(point, rect, buffer = 0) {\n  return point.x > rect.left + buffer && point.x < rect.right - buffer && point.y > rect.top + buffer && point.y < rect.bottom - buffer;\n}\n__name(pointInsideRect, \"pointInsideRect\");\nfunction rectContainsRect(outer, inner) {\n  return outer.left <= inner.left && outer.right >= inner.right && outer.top <= inner.top && outer.bottom >= inner.bottom;\n}\n__name(rectContainsRect, \"rectContainsRect\");\nfunction rectsOverlap(a, b) {\n  return a.left < b.right && a.right > b.left && a.top < b.bottom && a.bottom > b.top;\n}\n__name(rectsOverlap, \"rectsOverlap\");\nfunction inflateRect(rect, margin) {\n  return {\n    left: rect.left - margin,\n    right: rect.right + margin,\n    top: rect.top - margin,\n    bottom: rect.bottom + margin\n  };\n}\n__name(inflateRect, \"inflateRect\");\nfunction rectFromCenterSize(cx, cy, width, height) {\n  return {\n    left: cx - width / 2,\n    right: cx + width / 2,\n    top: cy - height / 2,\n    bottom: cy + height / 2\n  };\n}\n__name(rectFromCenterSize, \"rectFromCenterSize\");\nfunction rectOfNodeBounds(node) {\n  return measuredNodeRect(node)?.rect;\n}\n__name(rectOfNodeBounds, \"rectOfNodeBounds\");\nfunction portForRectSide(node, side) {\n  switch (side) {\n    case \"top\":\n      return { x: node.cx, y: node.rect.top };\n    case \"bottom\":\n      return { x: node.cx, y: node.rect.bottom };\n    case \"left\":\n      return { x: node.rect.left, y: node.cy };\n    case \"right\":\n      return { x: node.rect.right, y: node.cy };\n  }\n}\n__name(portForRectSide, \"portForRectSide\");\nfunction buildOrthogonalPortPath(src, srcSide, dst, dstSide, anchor, epsilon = EPS) {\n  const srcH = srcSide === \"left\" || srcSide === \"right\";\n  const dstH = dstSide === \"left\" || dstSide === \"right\";\n  if (srcH && dstH) {\n    const opposingDir = srcSide === \"right\" && dstSide === \"left\" && src.x < dst.x || srcSide === \"left\" && dstSide === \"right\" && src.x > dst.x;\n    if (opposingDir) {\n      if (sameY(src, dst, epsilon)) {\n        return [src, dst];\n      }\n      const midX = (src.x + dst.x) / 2;\n      return [src, { x: midX, y: src.y }, { x: midX, y: dst.y }, dst];\n    }\n    if (srcSide === dstSide) {\n      if (sameY(src, dst, epsilon)) {\n        return void 0;\n      }\n      const intX = srcSide === \"left\" ? Math.min(src.x, dst.x) - anchor : Math.max(src.x, dst.x) + anchor;\n      return [src, { x: intX, y: src.y }, { x: intX, y: dst.y }, dst];\n    }\n    return void 0;\n  }\n  if (!srcH && !dstH) {\n    if (srcSide === dstSide) {\n      if (sameX(src, dst, epsilon)) {\n        return void 0;\n      }\n      const intY = srcSide === \"top\" ? Math.min(src.y, dst.y) - anchor : Math.max(src.y, dst.y) + anchor;\n      return [src, { x: src.x, y: intY }, { x: dst.x, y: intY }, dst];\n    }\n    const sameDir = srcSide === \"bottom\" && dstSide === \"top\" && src.y < dst.y || srcSide === \"top\" && dstSide === \"bottom\" && src.y > dst.y;\n    if (!sameDir) {\n      return void 0;\n    }\n    if (sameX(src, dst, epsilon)) {\n      return [src, dst];\n    }\n    const midY = (src.y + dst.y) / 2;\n    return [src, { x: src.x, y: midY }, { x: dst.x, y: midY }, dst];\n  }\n  if (srcH && !dstH) {\n    const sameDirSrc2 = srcSide === \"right\" && dst.x > src.x || srcSide === \"left\" && dst.x < src.x;\n    const sameDirDst2 = dstSide === \"top\" && src.y < dst.y || dstSide === \"bottom\" && src.y > dst.y;\n    return sameDirSrc2 && sameDirDst2 ? [src, { x: dst.x, y: src.y }, dst] : void 0;\n  }\n  const sameDirSrc = srcSide === \"bottom\" && dst.y > src.y || srcSide === \"top\" && dst.y < src.y;\n  const sameDirDst = dstSide === \"left\" && src.x < dst.x || dstSide === \"right\" && src.x > dst.x;\n  return sameDirSrc && sameDirDst ? [src, { x: src.x, y: dst.y }, dst] : void 0;\n}\n__name(buildOrthogonalPortPath, \"buildOrthogonalPortPath\");\nfunction buildSameSideTrackPath(src, side, dst, track) {\n  return side === \"left\" || side === \"right\" ? [src, { x: track, y: src.y }, { x: track, y: dst.y }, dst] : [src, { x: src.x, y: track }, { x: dst.x, y: track }, dst];\n}\n__name(buildSameSideTrackPath, \"buildSameSideTrackPath\");\nfunction collectRealNodeBounds(nodes) {\n  const nodeInfoById = /* @__PURE__ */ new Map();\n  const realNodeRects = [];\n  for (const node of nodes) {\n    if (node.isEdgeLabel) {\n      continue;\n    }\n    const info = nodeBoundsInfoFor(node);\n    if (!info) {\n      continue;\n    }\n    nodeInfoById.set(info.id, info);\n    realNodeRects.push({ id: info.id, rect: info.rect });\n  }\n  return { nodeInfoById, realNodeRects };\n}\n__name(collectRealNodeBounds, \"collectRealNodeBounds\");\nfunction collectNodeRectEntries(nodes) {\n  const realNodeRects = [];\n  const labelNodeRects = [];\n  for (const node of nodes) {\n    const info = nodeBoundsInfoFor(node);\n    if (!info) {\n      continue;\n    }\n    const entry = { id: info.id, rect: info.rect };\n    if (node.isEdgeLabel) {\n      labelNodeRects.push(entry);\n    } else {\n      realNodeRects.push(entry);\n    }\n  }\n  return { realNodeRects, labelNodeRects };\n}\n__name(collectNodeRectEntries, \"collectNodeRectEntries\");\nfunction collectLayoutNodeRects(nodes, { includeEdgeLabels = true } = {}) {\n  const result = [];\n  for (const node of nodes) {\n    if (node.isGroup || !includeEdgeLabels && node.isEdgeLabel) {\n      continue;\n    }\n    const cx = node.x ?? 0;\n    const cy = node.y ?? 0;\n    const width = node.width ?? 0;\n    const height = node.height ?? 0;\n    result.push({\n      nodeId: node.id,\n      ...rectFromCenterSize(cx, cy, width, height)\n    });\n  }\n  return result;\n}\n__name(collectLayoutNodeRects, \"collectLayoutNodeRects\");\nfunction getNodePairGeometry(edge, nodeInfoById, epsilon = EPS) {\n  const srcId = edge.start;\n  const dstId = edge.end;\n  if (!srcId || !dstId) {\n    return void 0;\n  }\n  const srcInfo = nodeInfoById.get(srcId);\n  const dstInfo = nodeInfoById.get(dstId);\n  if (!srcInfo || !dstInfo) {\n    return void 0;\n  }\n  return {\n    srcId,\n    dstId,\n    srcInfo,\n    dstInfo,\n    collinearX: Math.abs(srcInfo.cx - dstInfo.cx) < epsilon,\n    collinearY: Math.abs(srcInfo.cy - dstInfo.cy) < epsilon\n  };\n}\n__name(getNodePairGeometry, \"getNodePairGeometry\");\nfunction segmentHitsAnyRect(a, b, rects, excludeIds = [], shrink = 0) {\n  for (const entry of rects) {\n    if (excludeIds.includes(entry.id)) {\n      continue;\n    }\n    if (segmentBoundsOverlapRect(a, b, entry.rect, -shrink)) {\n      return true;\n    }\n  }\n  return false;\n}\n__name(segmentHitsAnyRect, \"segmentHitsAnyRect\");\nfunction orthogonalSegmentsCross(a1, b1, a2, b2, epsilon = EPS, endpointTolerance = 1e-6) {\n  const s1H = sameY(a1, b1, epsilon);\n  const s1V = sameX(a1, b1, epsilon);\n  const s2H = sameY(a2, b2, epsilon);\n  const s2V = sameX(a2, b2, epsilon);\n  if (s1H && s2H || s1V && s2V) {\n    return false;\n  }\n  if (!(s1H || s1V) || !(s2H || s2V)) {\n    return false;\n  }\n  const horiz = s1H ? { a: a1, b: b1 } : { a: a2, b: b2 };\n  const vert = s1V ? { a: a1, b: b1 } : { a: a2, b: b2 };\n  const hY = horiz.a.y;\n  const hX1 = Math.min(horiz.a.x, horiz.b.x);\n  const hX2 = Math.max(horiz.a.x, horiz.b.x);\n  const vX = vert.a.x;\n  const vY1 = Math.min(vert.a.y, vert.b.y);\n  const vY2 = Math.max(vert.a.y, vert.b.y);\n  if (vX < hX1 || vX > hX2 || hY < vY1 || hY > vY2) {\n    return false;\n  }\n  const matchesHorizEndpoint = Math.abs(vX - horiz.a.x) < endpointTolerance && Math.abs(hY - horiz.a.y) < endpointTolerance || Math.abs(vX - horiz.b.x) < endpointTolerance && Math.abs(hY - horiz.b.y) < endpointTolerance;\n  const matchesVertEndpoint = Math.abs(vX - vert.a.x) < endpointTolerance && Math.abs(hY - vert.a.y) < endpointTolerance || Math.abs(vX - vert.b.x) < endpointTolerance && Math.abs(hY - vert.b.y) < endpointTolerance;\n  return !(matchesHorizEndpoint && matchesVertEndpoint);\n}\n__name(orthogonalSegmentsCross, \"orthogonalSegmentsCross\");\nfunction sameAxisSegmentsOverlap(a1, b1, a2, b2, epsilon = EPS) {\n  const s1H = sameY(a1, b1, epsilon);\n  const s1V = sameX(a1, b1, epsilon);\n  const s2H = sameY(a2, b2, epsilon);\n  const s2V = sameX(a2, b2, epsilon);\n  if (s1V && s2V && sameX(a1, a2, epsilon)) {\n    return overlapLength(a1.y, b1.y, a2.y, b2.y) > epsilon;\n  }\n  if (s1H && s2H && sameY(a1, a2, epsilon)) {\n    return overlapLength(a1.x, b1.x, a2.x, b2.x) > epsilon;\n  }\n  return false;\n}\n__name(sameAxisSegmentsOverlap, \"sameAxisSegmentsOverlap\");\nfunction segmentConflictsWithAnyEdge(a, b, edges, excludeEdge, {\n  epsilon = EPS,\n  skipDegenerateOther = false\n} = {}) {\n  for (const other of edges) {\n    if (other === excludeEdge || other.isLayoutOnly) {\n      continue;\n    }\n    const points = other.points;\n    if (!points || points.length < 2) {\n      continue;\n    }\n    for (let i = 0; i < points.length - 1; i++) {\n      const oa = points[i];\n      const ob = points[i + 1];\n      if (skipDegenerateOther && samePoint(oa, ob, epsilon)) {\n        continue;\n      }\n      if (orthogonalSegmentsCross(a, b, oa, ob, epsilon) || sameAxisSegmentsOverlap(a, b, oa, ob, epsilon)) {\n        return true;\n      }\n    }\n  }\n  return false;\n}\n__name(segmentConflictsWithAnyEdge, \"segmentConflictsWithAnyEdge\");\nfunction orthogonalSegmentsStrictlyCross(a1, b1, a2, b2, epsilon = EPS) {\n  const aHoriz = sameY(a1, b1, epsilon);\n  const aVert = sameX(a1, b1, epsilon);\n  const bHoriz = sameY(a2, b2, epsilon);\n  const bVert = sameX(a2, b2, epsilon);\n  if (!(aHoriz && bVert || aVert && bHoriz)) {\n    return false;\n  }\n  const horiz = aHoriz ? { a: a1, b: b1 } : { a: a2, b: b2 };\n  const vert = aHoriz ? { a: a2, b: b2 } : { a: a1, b: b1 };\n  const hY = horiz.a.y;\n  const hXmin = Math.min(horiz.a.x, horiz.b.x);\n  const hXmax = Math.max(horiz.a.x, horiz.b.x);\n  const vX = vert.a.x;\n  const vYmin = Math.min(vert.a.y, vert.b.y);\n  const vYmax = Math.max(vert.a.y, vert.b.y);\n  return vX > hXmin + epsilon && vX < hXmax - epsilon && hY > vYmin + epsilon && hY < vYmax - epsilon;\n}\n__name(orthogonalSegmentsStrictlyCross, \"orthogonalSegmentsStrictlyCross\");\nfunction strictlyBetween(value, a, b) {\n  const lo = Math.min(a, b);\n  const hi = Math.max(a, b);\n  return value > lo + EPS && value < hi - EPS;\n}\n__name(strictlyBetween, \"strictlyBetween\");\nfunction isCollinearIntermediate(prev, cur, next) {\n  if (sameX(prev, cur) && sameX(cur, next)) {\n    return strictlyBetween(cur.y, prev.y, next.y);\n  }\n  if (sameY(prev, cur) && sameY(cur, next)) {\n    return strictlyBetween(cur.x, prev.x, next.x);\n  }\n  return false;\n}\n__name(isCollinearIntermediate, \"isCollinearIntermediate\");\nfunction simplifyPolylineOnce(points) {\n  let changed = false;\n  const out = [];\n  for (let i = 0; i < points.length; i++) {\n    const prev = out[out.length - 1];\n    const cur = points[i];\n    const next = i + 1 < points.length ? points[i + 1] : void 0;\n    if (prev && next) {\n      if (samePoint(prev, next)) {\n        i++;\n        changed = true;\n        continue;\n      }\n      if (isCollinearIntermediate(prev, cur, next)) {\n        changed = true;\n        continue;\n      }\n    }\n    out.push(cur);\n  }\n  return { points: out, changed };\n}\n__name(simplifyPolylineOnce, \"simplifyPolylineOnce\");\nfunction orthogonalizePolyline(pts) {\n  const cleaned = [pts[0]];\n  for (let i = 1; i < pts.length; i++) {\n    const prev = cleaned[cleaned.length - 1];\n    const curr = pts[i];\n    if (!sameX(prev, curr) && !sameY(prev, curr)) {\n      const prevPrev = cleaned.length >= 2 ? cleaned[cleaned.length - 2] : void 0;\n      const incomingVertical = prevPrev ? sameX(prevPrev, prev) : false;\n      const corner = incomingVertical ? { x: prev.x, y: curr.y } : { x: curr.x, y: prev.y };\n      cleaned.push(corner);\n    }\n    cleaned.push(curr);\n  }\n  const deduped = [];\n  for (const p of cleaned) {\n    const last = deduped[deduped.length - 1];\n    if (!last || !samePoint(last, p)) {\n      deduped.push(p);\n    }\n  }\n  return deduped;\n}\n__name(orthogonalizePolyline, \"orthogonalizePolyline\");\nfunction simplifyPolyline(pts) {\n  if (pts.length < 3) {\n    return pts;\n  }\n  let work = [...pts];\n  for (let guard = 0; guard < 32; guard++) {\n    const result = simplifyPolylineOnce(work);\n    work = result.points;\n    if (!result.changed) {\n      break;\n    }\n  }\n  return work;\n}\n__name(simplifyPolyline, \"simplifyPolyline\");\n\n// src/rendering-util/layout-algorithms/swimlanes/direction/endpointClip.ts\nvar EPS2 = 1e-3;\nvar INSIDE_EPS = 0.5;\nvar CORNER_CLEARANCE = 4;\nfunction endpointContextFor(edge, nodeByIdMap, minPoints) {\n  const candidate = edge;\n  if (candidate.isLayoutOnly || !candidate.points || candidate.points.length < minPoints) {\n    return void 0;\n  }\n  const src = candidate.start ? nodeByIdMap.get(candidate.start) : void 0;\n  const dst = candidate.end ? nodeByIdMap.get(candidate.end) : void 0;\n  return {\n    edge: candidate,\n    points: candidate.points,\n    srcRect: src ? rectOfNodeBounds(src) : void 0,\n    dstRect: dst ? rectOfNodeBounds(dst) : void 0\n  };\n}\n__name(endpointContextFor, \"endpointContextFor\");\nfunction segmentEnterPoint(outside, inside, r) {\n  if (sameY(outside, inside, EPS2)) {\n    const x = outside.x < r.left ? r.left : r.right;\n    return { x, y: outside.y };\n  }\n  if (sameX(outside, inside, EPS2)) {\n    const y = outside.y < r.top ? r.top : r.bottom;\n    return { x: outside.x, y };\n  }\n  return {\n    x: Math.min(r.right, Math.max(r.left, outside.x)),\n    y: Math.min(r.bottom, Math.max(r.top, outside.y))\n  };\n}\n__name(segmentEnterPoint, \"segmentEnterPoint\");\nfunction clipEndpoint(points, rect, atStart) {\n  const step = atStart ? 1 : -1;\n  let outsideIndex = atStart ? 0 : points.length - 1;\n  while (outsideIndex >= 0 && outsideIndex < points.length && pointInsideRect(points[outsideIndex], rect, INSIDE_EPS)) {\n    outsideIndex += step;\n  }\n  if (outsideIndex < 0 || outsideIndex >= points.length) {\n    return points;\n  }\n  const insideIndex = outsideIndex - step;\n  if (insideIndex < 0 || insideIndex >= points.length) {\n    return points;\n  }\n  const entry = segmentEnterPoint(points[outsideIndex], points[insideIndex], rect);\n  return atStart ? [entry, ...points.slice(outsideIndex)] : [...points.slice(0, outsideIndex + 1), entry];\n}\n__name(clipEndpoint, \"clipEndpoint\");\nfunction clipEdgeEndpointsToNodeBoundaries(edges, nodeByIdMap) {\n  for (const edge of edges) {\n    const context = endpointContextFor(edge, nodeByIdMap, 2);\n    if (!context) {\n      continue;\n    }\n    let next = [...context.points];\n    if (context.srcRect) {\n      next = clipEndpoint(next, context.srcRect, true);\n    }\n    if (context.dstRect) {\n      next = clipEndpoint(next, context.dstRect, false);\n    }\n    next = simplifyPolyline(orthogonalizePolyline(next));\n    next = clearStraightEndpointCornerConnections(next, context.srcRect, context.dstRect);\n    context.edge.points = simplifyPolyline(orthogonalizePolyline(next));\n  }\n}\n__name(clipEdgeEndpointsToNodeBoundaries, \"clipEdgeEndpointsToNodeBoundaries\");\nfunction snapEndpointToBoundary(inner, endpoint, r, useApproachSide = false) {\n  if (sameY(inner, endpoint, EPS2)) {\n    if (endpoint.y < r.top - EPS2 || endpoint.y > r.bottom + EPS2) {\n      return endpoint;\n    }\n    if (useApproachSide) {\n      if (inner.x < r.left - EPS2) {\n        return { x: r.left, y: inner.y };\n      }\n      if (inner.x > r.right + EPS2) {\n        return { x: r.right, y: inner.y };\n      }\n    }\n    const toLeft = Math.abs(endpoint.x - r.left) <= Math.abs(endpoint.x - r.right);\n    return { x: toLeft ? r.left : r.right, y: inner.y };\n  }\n  if (sameX(inner, endpoint, EPS2)) {\n    if (endpoint.x < r.left - EPS2 || endpoint.x > r.right + EPS2) {\n      return endpoint;\n    }\n    if (useApproachSide) {\n      if (inner.y < r.top - EPS2) {\n        return { x: inner.x, y: r.top };\n      }\n      if (inner.y > r.bottom + EPS2) {\n        return { x: inner.x, y: r.bottom };\n      }\n    }\n    const toTop = Math.abs(endpoint.y - r.top) <= Math.abs(endpoint.y - r.bottom);\n    return { x: inner.x, y: toTop ? r.top : r.bottom };\n  }\n  return endpoint;\n}\n__name(snapEndpointToBoundary, \"snapEndpointToBoundary\");\nfunction firstDistinctAdjacent(points, endpointIndex, step) {\n  const endpoint = points[endpointIndex];\n  for (let index = endpointIndex + step; index >= 0 && index < points.length; index += step) {\n    const candidate = points[index];\n    if (!samePoint(candidate, endpoint, EPS2)) {\n      return candidate;\n    }\n  }\n  return points[endpointIndex + step];\n}\n__name(firstDistinctAdjacent, \"firstDistinctAdjacent\");\nfunction cornerClearanceRange(min, max) {\n  const lo = min + CORNER_CLEARANCE;\n  const hi = max - CORNER_CLEARANCE;\n  return lo <= hi ? { lo, hi } : { lo: (min + max) / 2, hi: (min + max) / 2 };\n}\n__name(cornerClearanceRange, \"cornerClearanceRange\");\nfunction clampToCornerClearance(value, min, max) {\n  const { lo, hi } = cornerClearanceRange(min, max);\n  return Math.min(hi, Math.max(lo, value));\n}\n__name(clampToCornerClearance, \"clampToCornerClearance\");\nfunction intersectRanges(ranges) {\n  const lo = Math.max(...ranges.map((range) => range.lo));\n  const hi = Math.min(...ranges.map((range) => range.hi));\n  if (lo > hi) {\n    return void 0;\n  }\n  return { lo, hi };\n}\n__name(intersectRanges, \"intersectRanges\");\nfunction clearanceRangeForSide(r, side) {\n  return side === \"left\" || side === \"right\" ? cornerClearanceRange(r.top, r.bottom) : cornerClearanceRange(r.left, r.right);\n}\n__name(clearanceRangeForSide, \"clearanceRangeForSide\");\nfunction terminalSideForSegment(endpoint, adjacent, r) {\n  const yWithin = endpoint.y >= r.top - EPS2 && endpoint.y <= r.bottom + EPS2;\n  const xWithin = endpoint.x >= r.left - EPS2 && endpoint.x <= r.right + EPS2;\n  if (sameY(endpoint, adjacent, EPS2) && yWithin) {\n    if (Math.abs(endpoint.x - r.left) < EPS2) {\n      return \"left\";\n    }\n    if (Math.abs(endpoint.x - r.right) < EPS2) {\n      return \"right\";\n    }\n  }\n  if (sameX(endpoint, adjacent, EPS2) && xWithin) {\n    if (Math.abs(endpoint.y - r.top) < EPS2) {\n      return \"top\";\n    }\n    if (Math.abs(endpoint.y - r.bottom) < EPS2) {\n      return \"bottom\";\n    }\n  }\n  return void 0;\n}\n__name(terminalSideForSegment, \"terminalSideForSegment\");\nfunction isHorizontalSide(side) {\n  return side === \"left\" || side === \"right\";\n}\n__name(isHorizontalSide, \"isHorizontalSide\");\nfunction straightClearanceRange(start, end, srcRect, dstRect, horizontal) {\n  const ranges = [];\n  const srcSide = srcRect ? terminalSideForSegment(start, end, srcRect) : void 0;\n  const dstSide = dstRect ? terminalSideForSegment(end, start, dstRect) : void 0;\n  if (srcRect && srcSide && isHorizontalSide(srcSide) === horizontal) {\n    ranges.push(clearanceRangeForSide(srcRect, srcSide));\n  }\n  if (dstRect && dstSide && isHorizontalSide(dstSide) === horizontal) {\n    ranges.push(clearanceRangeForSide(dstRect, dstSide));\n  }\n  return ranges.length > 0 ? intersectRanges(ranges) : void 0;\n}\n__name(straightClearanceRange, \"straightClearanceRange\");\nfunction clearStraightEndpointCornerAxis(start, end, srcRect, dstRect, horizontal) {\n  const range = straightClearanceRange(start, end, srcRect, dstRect, horizontal);\n  if (!range) {\n    return void 0;\n  }\n  const current = horizontal ? start.y : start.x;\n  const next = Math.min(range.hi, Math.max(range.lo, current));\n  if (Math.abs(next - current) < EPS2) {\n    return void 0;\n  }\n  return horizontal ? [\n    { x: start.x, y: next },\n    { x: end.x, y: next }\n  ] : [\n    { x: next, y: start.y },\n    { x: next, y: end.y }\n  ];\n}\n__name(clearStraightEndpointCornerAxis, \"clearStraightEndpointCornerAxis\");\nfunction clearStraightEndpointCornerConnections(points, srcRect, dstRect) {\n  if (points.length !== 2) {\n    return points;\n  }\n  const [start, end] = points;\n  if (sameY(start, end, EPS2)) {\n    return clearStraightEndpointCornerAxis(start, end, srcRect, dstRect, true) ?? points;\n  }\n  if (sameX(start, end, EPS2)) {\n    return clearStraightEndpointCornerAxis(start, end, srcRect, dstRect, false) ?? points;\n  }\n  return points;\n}\n__name(clearStraightEndpointCornerConnections, \"clearStraightEndpointCornerConnections\");\nfunction cornerClearedEndpoint(endpoint, r, side) {\n  return isHorizontalSide(side) ? { x: endpoint.x, y: clampToCornerClearance(endpoint.y, r.top, r.bottom) } : { x: clampToCornerClearance(endpoint.x, r.left, r.right), y: endpoint.y };\n}\n__name(cornerClearedEndpoint, \"cornerClearedEndpoint\");\nfunction moveCollinearEndpointRun(points, endpointIndex, step, endpoint, adjusted, horizontalTerminal) {\n  const next = points.map((point) => ({ ...point }));\n  for (let index = endpointIndex; index >= 0 && index < points.length; index += step) {\n    const point = points[index];\n    if (horizontalTerminal && !sameY(point, endpoint, EPS2)) {\n      break;\n    }\n    if (!horizontalTerminal && !sameX(point, endpoint, EPS2)) {\n      break;\n    }\n    if (horizontalTerminal) {\n      next[index].y = adjusted.y;\n    } else {\n      next[index].x = adjusted.x;\n    }\n  }\n  return next;\n}\n__name(moveCollinearEndpointRun, \"moveCollinearEndpointRun\");\nfunction clearEndpointCornerConnection(points, r, atStart) {\n  if (points.length < 2) {\n    return points;\n  }\n  const endpointIndex = atStart ? 0 : points.length - 1;\n  const step = atStart ? 1 : -1;\n  const endpoint = points[endpointIndex];\n  const adjacent = firstDistinctAdjacent(points, endpointIndex, step);\n  if (!adjacent) {\n    return points;\n  }\n  const side = terminalSideForSegment(endpoint, adjacent, r);\n  if (!side) {\n    return points;\n  }\n  const horizontalTerminal = isHorizontalSide(side);\n  const adjusted = cornerClearedEndpoint(endpoint, r, side);\n  if (samePoint(endpoint, adjusted, EPS2)) {\n    return points;\n  }\n  return moveCollinearEndpointRun(\n    points,\n    endpointIndex,\n    step,\n    endpoint,\n    adjusted,\n    horizontalTerminal\n  );\n}\n__name(clearEndpointCornerConnection, \"clearEndpointCornerConnection\");\nfunction borderSideForSegment(a, b, r) {\n  const xWithin = Math.min(a.x, b.x) >= r.left - EPS2 && Math.max(a.x, b.x) <= r.right + EPS2;\n  const yWithin = Math.min(a.y, b.y) >= r.top - EPS2 && Math.max(a.y, b.y) <= r.bottom + EPS2;\n  if (Math.abs(a.y - r.top) < EPS2 && Math.abs(b.y - r.top) < EPS2 && xWithin) {\n    return \"top\";\n  }\n  if (Math.abs(a.y - r.bottom) < EPS2 && Math.abs(b.y - r.bottom) < EPS2 && xWithin) {\n    return \"bottom\";\n  }\n  if (Math.abs(a.x - r.left) < EPS2 && Math.abs(b.x - r.left) < EPS2 && yWithin) {\n    return \"left\";\n  }\n  if (Math.abs(a.x - r.right) < EPS2 && Math.abs(b.x - r.right) < EPS2 && yWithin) {\n    return \"right\";\n  }\n  return void 0;\n}\n__name(borderSideForSegment, \"borderSideForSegment\");\nfunction leavesOutward(side, from, to, r) {\n  switch (side) {\n    case \"top\":\n      return sameX(from, to, EPS2) && to.y < r.top - EPS2;\n    case \"bottom\":\n      return sameX(from, to, EPS2) && to.y > r.bottom + EPS2;\n    case \"left\":\n      return sameY(from, to, EPS2) && to.x < r.left - EPS2;\n    case \"right\":\n      return sameY(from, to, EPS2) && to.x > r.right + EPS2;\n  }\n}\n__name(leavesOutward, \"leavesOutward\");\nfunction collapseOwnBorderStub(points, r, atStart) {\n  if (points.length < 3) {\n    return points;\n  }\n  if (atStart) {\n    const side2 = borderSideForSegment(points[0], points[1], r);\n    if (side2 && leavesOutward(side2, points[1], points[2], r)) {\n      return points.slice(1);\n    }\n    return points;\n  }\n  const last = points.length - 1;\n  const side = borderSideForSegment(points[last - 1], points[last], r);\n  if (side && leavesOutward(side, points[last - 1], points[last - 2], r)) {\n    return points.slice(0, last);\n  }\n  return points;\n}\n__name(collapseOwnBorderStub, \"collapseOwnBorderStub\");\nfunction snapAndCollapseEndpoints(points, srcRect, dstRect) {\n  let next = points;\n  if (srcRect) {\n    const adjacent = firstDistinctAdjacent(next, 0, 1);\n    if (adjacent) {\n      const snapped = snapEndpointToBoundary(adjacent, next[0], srcRect);\n      if (snapped !== next[0]) {\n        next = [snapped, ...next.slice(1)];\n      }\n    }\n    next = collapseOwnBorderStub(next, srcRect, true);\n  }\n  if (dstRect) {\n    const last = next.length - 1;\n    const adjacent = firstDistinctAdjacent(next, last, -1);\n    if (adjacent) {\n      const snapped = snapEndpointToBoundary(adjacent, next[last], dstRect, true);\n      if (snapped !== next[last]) {\n        next = [...next.slice(0, last), snapped];\n      }\n    }\n    next = collapseOwnBorderStub(next, dstRect, false);\n  }\n  const straightCleared = clearStraightEndpointCornerConnections(next, srcRect, dstRect);\n  if (straightCleared !== next || next.length === 2) {\n    return straightCleared;\n  }\n  if (srcRect) {\n    next = clearEndpointCornerConnection(next, srcRect, true);\n  }\n  if (dstRect) {\n    next = clearEndpointCornerConnection(next, dstRect, false);\n  }\n  return next;\n}\n__name(snapAndCollapseEndpoints, \"snapAndCollapseEndpoints\");\nfunction prepareEdgeEndpointsForRenderer(edges, nodeByIdMap) {\n  for (const edge of edges) {\n    const context = endpointContextFor(edge, nodeByIdMap, 2);\n    if (!context) {\n      continue;\n    }\n    const input = dedupeConsecutivePoints(context.points, EPS2);\n    const newPts = snapAndCollapseEndpoints(input, context.srcRect, context.dstRect);\n    if (newPts.length < 3) {\n      context.edge.points = newPts;\n      continue;\n    }\n    const duplicated = [\n      newPts[0],\n      { ...newPts[0] },\n      ...newPts.slice(1, -1),\n      newPts[newPts.length - 1],\n      { ...newPts[newPts.length - 1] }\n    ];\n    context.edge.points = duplicated;\n  }\n}\n__name(prepareEdgeEndpointsForRenderer, \"prepareEdgeEndpointsForRenderer\");\n\n// src/rendering-util/layout-algorithms/swimlanes/direction/lrTransform.ts\nfunction buildNodeMap(nodes) {\n  return new Map(nodes.map((node) => [node.id, node]));\n}\n__name(buildNodeMap, \"buildNodeMap\");\nfunction resolveTopLevelGroupId(node, nodeById) {\n  let parentId = node.parentId;\n  let topLevelGroupId = null;\n  while (parentId) {\n    const parent = nodeById.get(parentId);\n    if (!parent?.isGroup) {\n      break;\n    }\n    topLevelGroupId = parent.id;\n    parentId = parent.parentId;\n  }\n  return topLevelGroupId;\n}\n__name(resolveTopLevelGroupId, \"resolveTopLevelGroupId\");\nfunction groupDepth(group, nodeById) {\n  let depth = 0;\n  let parentId = group.parentId;\n  while (parentId) {\n    const parent = nodeById.get(parentId);\n    if (!parent?.isGroup) {\n      break;\n    }\n    depth++;\n    parentId = parent.parentId;\n  }\n  return depth;\n}\n__name(groupDepth, \"groupDepth\");\nfunction boundsForChildren(children) {\n  let minX = Infinity;\n  let maxX = -Infinity;\n  let minY = Infinity;\n  let maxY = -Infinity;\n  for (const child of children) {\n    const cx = child.x;\n    const cy = child.y;\n    if (typeof cx !== \"number\" || typeof cy !== \"number\") {\n      continue;\n    }\n    const w = child.width ?? 0;\n    const h = child.height ?? 0;\n    minX = Math.min(minX, cx - w / 2);\n    maxX = Math.max(maxX, cx + w / 2);\n    minY = Math.min(minY, cy - h / 2);\n    maxY = Math.max(maxY, cy + h / 2);\n  }\n  if (minX === Infinity || minY === Infinity) {\n    return null;\n  }\n  return { minX, maxX, minY, maxY };\n}\n__name(boundsForChildren, \"boundsForChildren\");\nfunction applyGroupBounds(group, bounds) {\n  const pad = group.padding ?? 20;\n  group.x = (bounds.minX + bounds.maxX) / 2;\n  group.y = (bounds.minY + bounds.maxY) / 2;\n  group.width = Math.max(0, bounds.maxX - bounds.minX) + pad;\n  group.height = Math.max(0, bounds.maxY - bounds.minY) + pad;\n}\n__name(applyGroupBounds, \"applyGroupBounds\");\nfunction recomputeNestedGroupBounds(nodes) {\n  const nodeById = buildNodeMap(nodes);\n  const groupsByDepth = nodes.filter((node) => node.isGroup && node.parentId).sort((a, b) => groupDepth(b, nodeById) - groupDepth(a, nodeById));\n  for (const group of groupsByDepth) {\n    const children = nodes.filter((node) => node.parentId === group.id);\n    const bounds = boundsForChildren(children);\n    if (bounds) {\n      applyGroupBounds(group, bounds);\n    }\n  }\n}\n__name(recomputeNestedGroupBounds, \"recomputeNestedGroupBounds\");\nfunction mirrorAxis(layout, axis) {\n  const nodes = layout.nodes ?? [];\n  const edges = layout.edges ?? [];\n  const contentNodes = nodes.filter((node) => !node.isGroup);\n  let min = Infinity;\n  let max = -Infinity;\n  for (const node of contentNodes) {\n    const value = node[axis];\n    if (typeof value !== \"number\") {\n      continue;\n    }\n    min = Math.min(min, value);\n    max = Math.max(max, value);\n  }\n  if (!Number.isFinite(min) || !Number.isFinite(max)) {\n    return false;\n  }\n  const mirror = /* @__PURE__ */ __name((value) => min + max - value, \"mirror\");\n  for (const node of nodes) {\n    const value = node[axis];\n    if (typeof value === \"number\") {\n      node[axis] = mirror(value);\n    }\n    const titleRect = node.groupTitleRect;\n    if (titleRect) {\n      node.groupTitleRect = axis === \"x\" ? {\n        ...titleRect,\n        left: mirror(titleRect.right),\n        right: mirror(titleRect.left)\n      } : {\n        ...titleRect,\n        top: mirror(titleRect.bottom),\n        bottom: mirror(titleRect.top)\n      };\n    }\n  }\n  for (const edge of edges) {\n    for (const point of edge.points ?? []) {\n      point[axis] = mirror(point[axis]);\n    }\n  }\n  return true;\n}\n__name(mirrorAxis, \"mirrorAxis\");\nfunction applyBtDirectionTransform(layout) {\n  const nodes = layout.nodes ?? [];\n  if (!nodes.some((node) => !node.isGroup)) {\n    return true;\n  }\n  return mirrorAxis(layout, \"y\");\n}\n__name(applyBtDirectionTransform, \"applyBtDirectionTransform\");\nfunction applyLrDirectionTransform(layout, direction = \"LR\") {\n  const nodes = layout.nodes ?? [];\n  const edges = layout.edges ?? [];\n  const contentNodes = nodes.filter((n) => !n.isGroup);\n  let minX = Infinity;\n  let minY = Infinity;\n  for (const n of contentNodes) {\n    const x0 = n.x ?? 0;\n    const y0 = n.y ?? 0;\n    if (x0 < minX) {\n      minX = x0;\n    }\n    if (y0 < minY) {\n      minY = y0;\n    }\n  }\n  if (!Number.isFinite(minX) || !Number.isFinite(minY)) {\n    return false;\n  }\n  const titleBandSize = 36;\n  let totalWidth = 0;\n  let totalHeight = 0;\n  for (const n of contentNodes) {\n    totalWidth += n.width ?? 0;\n    totalHeight += n.height ?? 0;\n  }\n  const avgWidth = totalWidth / contentNodes.length;\n  const avgHeight = totalHeight / contentNodes.length;\n  const horizontalScaleFactor = avgHeight > 0 ? Math.max(1, avgWidth / avgHeight) : 1;\n  for (const n of contentNodes) {\n    const x0 = n.x ?? 0;\n    const y0 = n.y ?? 0;\n    const newX = (y0 - minY) * horizontalScaleFactor + titleBandSize;\n    const newY = x0 - minX;\n    n.x = newX;\n    n.y = newY;\n  }\n  for (const e of edges) {\n    if (!e.points) {\n      continue;\n    }\n    for (const p of e.points) {\n      const x0 = p.x;\n      const y0 = p.y;\n      const newX = (y0 - minY) * horizontalScaleFactor + titleBandSize;\n      const newY = x0 - minX;\n      p.x = newX;\n      p.y = newY;\n    }\n  }\n  recomputeNestedGroupBounds(nodes);\n  const laneNodes = nodes.filter((n) => n.isGroup && !n.parentId);\n  if (laneNodes.length === 0) {\n    if (direction === \"RL\") {\n      mirrorAxis(layout, \"x\");\n    }\n    return true;\n  }\n  const nodeById = buildNodeMap(nodes);\n  const childrenByLane = /* @__PURE__ */ new Map();\n  for (const n of nodes) {\n    if (n.isGroup) {\n      continue;\n    }\n    const laneId = resolveTopLevelGroupId(n, nodeById);\n    if (!laneId) {\n      continue;\n    }\n    const bucket = childrenByLane.get(laneId) ?? [];\n    bucket.push(n);\n    childrenByLane.set(laneId, bucket);\n  }\n  let maxPad = 0;\n  for (const lane of laneNodes) {\n    const pad = lane.padding ?? 0;\n    if (pad > maxPad) {\n      maxPad = pad;\n    }\n  }\n  const laneBounds = [];\n  let globalMinXChild = Infinity;\n  let globalMaxXChild = -Infinity;\n  for (const lane of laneNodes) {\n    const children = childrenByLane.get(lane.id) ?? [];\n    const bounds = boundsForChildren(children);\n    if (!bounds) {\n      continue;\n    }\n    globalMinXChild = Math.min(globalMinXChild, bounds.minX);\n    globalMaxXChild = Math.max(globalMaxXChild, bounds.maxX);\n    laneBounds.push({\n      lane,\n      contentTop: bounds.minY,\n      contentBottom: bounds.maxY,\n      centerY: (bounds.minY + bounds.maxY) / 2\n    });\n  }\n  if (globalMinXChild === Infinity || globalMaxXChild === -Infinity) {\n    return true;\n  }\n  const fullContentWidth = Math.max(0, globalMaxXChild - globalMinXChild);\n  const horizontalMargin = Math.max(maxPad, 10);\n  const bodyWidth = fullContentWidth + 2 * horizontalMargin;\n  const laneWidth = titleBandSize + bodyWidth;\n  const bodyCenter = (globalMinXChild + globalMaxXChild) / 2;\n  const bodyLeft = bodyCenter - bodyWidth / 2;\n  const laneLeft = bodyLeft - titleBandSize;\n  const centerX = laneLeft + laneWidth / 2;\n  const verticalMargin = Math.max(maxPad, titleBandSize);\n  laneBounds.sort((a, b) => a.centerY - b.centerY);\n  for (let i = 0; i < laneBounds.length; i++) {\n    const curr = laneBounds[i];\n    let laneTop;\n    let laneBottom;\n    if (i === 0) {\n      laneTop = curr.contentTop - verticalMargin;\n    } else {\n      const prev = laneBounds[i - 1];\n      laneTop = (prev.contentBottom + curr.contentTop) / 2;\n    }\n    if (i === laneBounds.length - 1) {\n      laneBottom = curr.contentBottom + verticalMargin;\n    } else {\n      const next = laneBounds[i + 1];\n      laneBottom = (curr.contentBottom + next.contentTop) / 2;\n    }\n    const laneHeight = Math.max(0, laneBottom - laneTop);\n    const centerY = (laneTop + laneBottom) / 2;\n    curr.lane.x = centerX;\n    curr.lane.y = centerY;\n    curr.lane.width = laneWidth;\n    curr.lane.height = laneHeight;\n    curr.lane.swimlaneContentTop = curr.contentTop;\n    curr.lane.groupTitleRect = {\n      left: laneLeft,\n      right: laneLeft + titleBandSize,\n      top: laneTop,\n      bottom: laneBottom\n    };\n  }\n  if (direction === \"RL\") {\n    mirrorAxis(layout, \"x\");\n  }\n  return true;\n}\n__name(applyLrDirectionTransform, \"applyLrDirectionTransform\");\n\n// src/rendering-util/layout-algorithms/swimlanes/direction/portSwap.ts\nvar EPS3 = 1e-6;\nvar MIN_PORT_SPACING = 8;\nvar PORT_SHIFT = MIN_PORT_SPACING;\nvar TRY_DELTAS = [0, PORT_SHIFT, -PORT_SHIFT, 2 * PORT_SHIFT, -2 * PORT_SHIFT];\nfunction portSwapToLShape(edges, nodes) {\n  const { nodeInfoById, realNodeRects } = collectRealNodeBounds(nodes);\n  for (const edge of edges) {\n    if (edge.isLayoutOnly) {\n      continue;\n    }\n    const pts = edge.points;\n    if (!pts || pts.length < 4) {\n      continue;\n    }\n    const route = classifyThreeSegmentRoute(dedupeConsecutivePoints(pts, EPS3), EPS3);\n    if (!route) {\n      continue;\n    }\n    const { p3 } = route;\n    const isHVH = route.kind === \"HVH\";\n    const nodePair = getNodePairGeometry(edge, nodeInfoById, EPS3);\n    if (!nodePair) {\n      continue;\n    }\n    const { srcId, dstId, srcInfo, dstInfo, collinearX, collinearY } = nodePair;\n    if (collinearX || collinearY) {\n      continue;\n    }\n    let newPts;\n    const srcRect = srcInfo.rect;\n    for (const delta of TRY_DELTAS) {\n      let np0;\n      let np1;\n      let np2;\n      if (isHVH) {\n        const dstBelow = dstInfo.cy > srcInfo.cy;\n        const newSrcY = dstBelow ? srcRect.bottom : srcRect.top;\n        const newSrcX = srcInfo.cx + delta;\n        if (newSrcX <= srcRect.left + EPS3 || newSrcX >= srcRect.right - EPS3) {\n          continue;\n        }\n        np0 = { x: newSrcX, y: newSrcY };\n        np1 = { x: newSrcX, y: p3.y };\n        np2 = { x: p3.x, y: p3.y };\n      } else {\n        const dstEast = dstInfo.cx > srcInfo.cx;\n        const newSrcX = dstEast ? srcRect.right : srcRect.left;\n        const newSrcY = srcInfo.cy + delta;\n        if (newSrcY <= srcRect.top + EPS3 || newSrcY >= srcRect.bottom - EPS3) {\n          continue;\n        }\n        np0 = { x: newSrcX, y: newSrcY };\n        np1 = { x: p3.x, y: newSrcY };\n        np2 = { x: p3.x, y: p3.y };\n      }\n      const firstSegDegenerate = samePoint(np0, np1, EPS3);\n      const secondSegDegenerate = samePoint(np1, np2, EPS3);\n      if (firstSegDegenerate && secondSegDegenerate) {\n        continue;\n      }\n      if (!firstSegDegenerate && segmentHitsAnyRect(np0, np1, realNodeRects, [srcId], 1)) {\n        continue;\n      }\n      if (!secondSegDegenerate && segmentHitsAnyRect(np1, np2, realNodeRects, [dstId], 1)) {\n        continue;\n      }\n      const firstSegConflicts = !firstSegDegenerate && segmentConflictsWithAnyEdge(np0, np1, edges, edge, {\n        epsilon: EPS3,\n        skipDegenerateOther: true\n      });\n      const secondSegConflicts = !secondSegDegenerate && segmentConflictsWithAnyEdge(np1, np2, edges, edge, {\n        epsilon: EPS3,\n        skipDegenerateOther: true\n      });\n      if (firstSegConflicts || secondSegConflicts) {\n        continue;\n      }\n      if (firstSegDegenerate) {\n        newPts = [np1, np2];\n      } else if (secondSegDegenerate) {\n        newPts = [np0, np1];\n      } else {\n        newPts = [np0, np1, np2];\n      }\n      break;\n    }\n    if (newPts) {\n      edge.points = newPts;\n    }\n  }\n}\n__name(portSwapToLShape, \"portSwapToLShape\");\n\n// src/rendering-util/layout-algorithms/swimlanes/direction/terminalStub.ts\nfunction collapseShortTerminalStub(edges, nodeByIdMap) {\n  const MIN_STUB = 10;\n  const EPS_LOCAL2 = 1e-3;\n  const BUFFER = 2;\n  const { realNodeRects, labelNodeRects: labelRects } = collectNodeRectEntries(\n    nodeByIdMap.values()\n  );\n  for (const edge of edges) {\n    if (edge.isLayoutOnly) {\n      continue;\n    }\n    const rawPts = edge.points;\n    if (!rawPts || rawPts.length < 4) {\n      continue;\n    }\n    const pts = dedupeConsecutivePoints(rawPts, EPS_LOCAL2);\n    if (pts.length < 4) {\n      continue;\n    }\n    const nLast = pts.length - 1;\n    const endPt = pts[nLast];\n    const penultPt = pts[nLast - 1];\n    const prevPt = pts[nLast - 2];\n    const lastDx = endPt.x - penultPt.x;\n    const lastDy = endPt.y - penultPt.y;\n    const lastLen = Math.hypot(lastDx, lastDy);\n    if (lastLen >= MIN_STUB || lastLen < EPS_LOCAL2) {\n      continue;\n    }\n    const penultDx = penultPt.x - prevPt.x;\n    const penultDy = penultPt.y - prevPt.y;\n    const penultLen = Math.hypot(penultDx, penultDy);\n    if (penultLen < EPS_LOCAL2) {\n      continue;\n    }\n    const lastIsHoriz = isHorizontalSegment(penultPt, endPt, EPS_LOCAL2);\n    const lastIsVert = isVerticalSegment(penultPt, endPt, EPS_LOCAL2);\n    const penultIsHoriz = isHorizontalSegment(prevPt, penultPt, EPS_LOCAL2);\n    const penultIsVert = isVerticalSegment(prevPt, penultPt, EPS_LOCAL2);\n    if (!(lastIsHoriz && penultIsVert || lastIsVert && penultIsHoriz)) {\n      continue;\n    }\n    const dstId = edge.end;\n    const srcId = edge.start;\n    const dst = dstId ? nodeByIdMap.get(dstId) : void 0;\n    if (!dst) {\n      continue;\n    }\n    const dstCx = dst.x ?? 0;\n    const dstCy = dst.y ?? 0;\n    const dstRect = rectOfNodeBounds(dst);\n    if (!dstRect) {\n      continue;\n    }\n    let newPrev;\n    let newEnd;\n    if (penultIsVert) {\n      const approachFromBelow = penultDy < 0;\n      newPrev = { x: dstCx, y: prevPt.y };\n      newEnd = { x: dstCx, y: approachFromBelow ? dstRect.bottom : dstRect.top };\n    } else {\n      const approachFromLeft = penultDx > 0;\n      newPrev = { x: prevPt.x, y: dstCy };\n      newEnd = { x: approachFromLeft ? dstRect.right : dstRect.left, y: dstCy };\n    }\n    if (segmentHitsAnyRect(newPrev, newEnd, realNodeRects, dstId ? [dstId] : [], -BUFFER)) {\n      continue;\n    }\n    if (segmentHitsAnyRect(newPrev, newEnd, labelRects, [], -BUFFER)) {\n      continue;\n    }\n    if (srcId) {\n      const src = nodeByIdMap.get(srcId);\n      const srcRect = src ? rectOfNodeBounds(src) : void 0;\n      if (srcRect && pointInsideRect(newPrev, srcRect, BUFFER)) {\n        continue;\n      }\n    }\n    const ownSegmentKey = /* @__PURE__ */ __name((a, b) => `${a.x.toFixed(3)},${a.y.toFixed(3)}|${b.x.toFixed(3)},${b.y.toFixed(3)}`, \"ownSegmentKey\");\n    const selfSegments = /* @__PURE__ */ new Set();\n    for (let i = 0; i < pts.length - 1; i++) {\n      selfSegments.add(ownSegmentKey(pts[i], pts[i + 1]));\n    }\n    const segmentCrossesOtherEdge = /* @__PURE__ */ __name((from, to) => {\n      for (const other of edges) {\n        if (other === edge) {\n          continue;\n        }\n        if (other.isLayoutOnly) {\n          continue;\n        }\n        const oPts = other.points;\n        if (!oPts || oPts.length < 2) {\n          continue;\n        }\n        for (let i = 0; i < oPts.length - 1; i++) {\n          const a = oPts[i];\n          const b = oPts[i + 1];\n          if (selfSegments.has(ownSegmentKey(a, b))) {\n            continue;\n          }\n          if (orthogonalSegmentsStrictlyCross(from, to, a, b, EPS_LOCAL2)) {\n            return true;\n          }\n        }\n      }\n      return false;\n    }, \"segmentCrossesOtherEdge\");\n    if (segmentCrossesOtherEdge(newPrev, newEnd)) {\n      continue;\n    }\n    if (nLast - 3 >= 0) {\n      const beforePrev = pts[nLast - 3];\n      const endpointIds = [srcId, dstId].filter((id) => Boolean(id));\n      if (segmentHitsAnyRect(beforePrev, newPrev, realNodeRects, endpointIds, -BUFFER)) {\n        continue;\n      }\n      if (segmentCrossesOtherEdge(beforePrev, newPrev)) {\n        continue;\n      }\n    }\n    const head = pts.slice(0, nLast - 2);\n    const newPts = [...head, newPrev, newEnd];\n    edge.points = newPts;\n    const labelId = edge.labelNodeId;\n    if (labelId) {\n      const labelNode = nodeByIdMap.get(labelId);\n      if (labelNode) {\n        const lw = labelNode.width ?? 0;\n        const lh = labelNode.height ?? 0;\n        if (lw > 0 && lh > 0) {\n          let bestMidX;\n          let bestMidY;\n          let bestLen = -1;\n          for (let i = 0; i < newPts.length - 1; i++) {\n            const a = newPts[i];\n            const b = newPts[i + 1];\n            const segLen = Math.hypot(b.x - a.x, b.y - a.y);\n            const isHoriz = sameY(a, b, EPS_LOCAL2);\n            const isVert = sameX(a, b, EPS_LOCAL2);\n            const fits = isHoriz && segLen >= lw + 2 || isVert && segLen >= lh + 2;\n            if (!fits) {\n              continue;\n            }\n            if (segLen > bestLen) {\n              bestLen = segLen;\n              bestMidX = (a.x + b.x) / 2;\n              bestMidY = (a.y + b.y) / 2;\n            }\n          }\n          if (bestMidX !== void 0 && bestMidY !== void 0) {\n            labelNode.x = bestMidX;\n            labelNode.y = bestMidY;\n          }\n        }\n      }\n    }\n  }\n}\n__name(collapseShortTerminalStub, \"collapseShortTerminalStub\");\n\n// src/rendering-util/layout-algorithms/swimlanes/direction/materializedGeometry.ts\nvar EPS_LOCAL = 1e-3;\nvar MIN_SHARED = 8;\nvar segmentsFor = orthogonalSegmentsForPoints;\nvar orthogonallyAligned = /* @__PURE__ */ __name((a, b) => sameX(a, b, EPS_LOCAL) || sameY(a, b, EPS_LOCAL), \"orthogonallyAligned\");\nfunction separateSharedRenderedTerminalLanes(edges, nodeByIdMap) {\n  const MIN_FACE_CLEARANCE = 16;\n  const TRACK_SHIFT = 7;\n  const rectIntersect = /* @__PURE__ */ __name((node, point) => {\n    const x = node.x ?? 0;\n    const y = node.y ?? 0;\n    const dx = point.x - x;\n    const dy = point.y - y;\n    let w = (node.width ?? 0) / 2;\n    let h = (node.height ?? 0) / 2;\n    if (Math.abs(dy) * w > Math.abs(dx) * h) {\n      if (dy < 0) {\n        h = -h;\n      }\n      return { x: x + (dy === 0 ? 0 : h * dx / dy), y: y + h };\n    }\n    if (dx < 0) {\n      w = -w;\n    }\n    return { x: x + w, y: y + (dx === 0 ? 0 : w * dy / dx) };\n  }, \"rectIntersect\");\n  const terminalLaneFor = /* @__PURE__ */ __name((edge, atStart) => {\n    const points = dedupeConsecutivePoints(edge.points ?? []);\n    if (points.length < 2) {\n      return void 0;\n    }\n    const nodeId = atStart ? edge.start : edge.end;\n    const node = nodeId ? nodeByIdMap.get(nodeId) : void 0;\n    const rect = node ? rectOfNodeBounds(node) : void 0;\n    if (!node || !nodeId || !rect) {\n      return void 0;\n    }\n    const endpoint = atStart ? points[0] : points[points.length - 1];\n    const adjacent = atStart ? points[1] : points[points.length - 2];\n    const boundary = rectIntersect(node, endpoint);\n    let railEnd = endpoint;\n    if (orthogonallyAligned(adjacent, boundary)) {\n      railEnd = adjacent;\n    }\n    if (sameX(boundary, railEnd, EPS_LOCAL)) {\n      return {\n        edge,\n        edgeId: String(edge.id ?? \"\"),\n        nodeId,\n        atStart,\n        orientation: \"V\",\n        coord: boundary.x,\n        min: Math.min(boundary.y, railEnd.y),\n        max: Math.max(boundary.y, railEnd.y),\n        boundary,\n        railEnd,\n        rect\n      };\n    }\n    if (sameY(boundary, railEnd, EPS_LOCAL)) {\n      return {\n        edge,\n        edgeId: String(edge.id ?? \"\"),\n        nodeId,\n        atStart,\n        orientation: \"H\",\n        coord: boundary.y,\n        min: Math.min(boundary.x, railEnd.x),\n        max: Math.max(boundary.x, railEnd.x),\n        boundary,\n        railEnd,\n        rect\n      };\n    }\n    return void 0;\n  }, \"terminalLaneFor\");\n  const projectedOverlapLength = /* @__PURE__ */ __name((a, b) => Math.max(0, Math.min(a.max, b.max) - Math.max(a.min, b.min)), \"projectedOverlapLength\");\n  const sameTerminalFace = /* @__PURE__ */ __name((a, b) => {\n    if (a.nodeId !== b.nodeId || a.orientation !== b.orientation) {\n      return false;\n    }\n    if (a.orientation === \"H\") {\n      const aOnHorizontalFace = Math.abs(a.boundary.x - a.rect.left) < 1 || Math.abs(a.boundary.x - a.rect.right) < 1;\n      return aOnHorizontalFace && sameX(a.boundary, b.boundary, 1);\n    }\n    const aOnVerticalFace = Math.abs(a.boundary.y - a.rect.top) < 1 || Math.abs(a.boundary.y - a.rect.bottom) < 1;\n    return aOnVerticalFace && sameY(a.boundary, b.boundary, 1);\n  }, \"sameTerminalFace\");\n  const exactTerminalLaneConflict = /* @__PURE__ */ __name((a, b) => {\n    if (a.nodeId !== b.nodeId || a.orientation !== b.orientation) {\n      return false;\n    }\n    const shared = projectedOverlapLength(a, b);\n    return shared >= MIN_SHARED && Math.abs(a.coord - b.coord) < 0.5;\n  }, \"exactTerminalLaneConflict\");\n  const nearTerminalLaneConflict = /* @__PURE__ */ __name((a, b) => {\n    if (a.nodeId !== b.nodeId || a.orientation !== b.orientation || a.orientation !== \"H\" || a.atStart === b.atStart) {\n      return false;\n    }\n    const shared = projectedOverlapLength(a, b);\n    if (shared < MIN_SHARED) {\n      return false;\n    }\n    const faceSpan = a.rect.bottom - a.rect.top;\n    if (shared < faceSpan || shared > 2 * faceSpan) {\n      return false;\n    }\n    return sameTerminalFace(a, b) && Math.abs(a.coord - b.coord) < MIN_FACE_CLEARANCE;\n  }, \"nearTerminalLaneConflict\");\n  const shiftedCandidate = /* @__PURE__ */ __name((lane, shift) => {\n    const points = dedupeConsecutivePoints(lane.edge.points ?? []);\n    if (points.length < 2) {\n      return void 0;\n    }\n    const shiftedBoundary = lane.orientation === \"V\" ? { x: lane.boundary.x + shift, y: lane.boundary.y } : { x: lane.boundary.x, y: lane.boundary.y + shift };\n    const shiftedRailEnd = lane.orientation === \"V\" ? { x: lane.railEnd.x + shift, y: lane.railEnd.y } : { x: lane.railEnd.x, y: lane.railEnd.y + shift };\n    const boundaryStaysOnSameFace = /* @__PURE__ */ __name(() => {\n      if (Math.abs(lane.boundary.y - lane.rect.top) < 1 || Math.abs(lane.boundary.y - lane.rect.bottom) < 1) {\n        return sameY(shiftedBoundary, lane.boundary, EPS_LOCAL) && shiftedBoundary.x >= lane.rect.left + 1 && shiftedBoundary.x <= lane.rect.right - 1;\n      }\n      if (Math.abs(lane.boundary.x - lane.rect.left) < 1 || Math.abs(lane.boundary.x - lane.rect.right) < 1) {\n        return sameX(shiftedBoundary, lane.boundary, EPS_LOCAL) && shiftedBoundary.y >= lane.rect.top + 1 && shiftedBoundary.y <= lane.rect.bottom - 1;\n      }\n      return false;\n    }, \"boundaryStaysOnSameFace\");\n    if (!boundaryStaysOnSameFace()) {\n      return void 0;\n    }\n    if (lane.atStart) {\n      const railEndIsAdjacent2 = points.length > 1 && samePoint(points[1], lane.railEnd, EPS_LOCAL);\n      const rest = points.slice(railEndIsAdjacent2 ? 2 : 1);\n      const next = rest[0];\n      if (next && !orthogonallyAligned(next, shiftedRailEnd)) {\n        return void 0;\n      }\n      return [shiftedBoundary, shiftedRailEnd, ...rest];\n    }\n    const railEndIsAdjacent = points.length > 1 && samePoint(points[points.length - 2], lane.railEnd, EPS_LOCAL);\n    const before = points.slice(0, railEndIsAdjacent ? -2 : -1);\n    const previous = before[before.length - 1];\n    if (previous && !orthogonallyAligned(previous, shiftedRailEnd)) {\n      return void 0;\n    }\n    return [...before, shiftedRailEnd, shiftedBoundary];\n  }, \"shiftedCandidate\");\n  const laneIsStraightCollinearConnector = /* @__PURE__ */ __name((lane) => {\n    const edge = lane.edge;\n    const points = dedupeConsecutivePoints(edge.points ?? []);\n    if (points.length !== 2) {\n      return false;\n    }\n    const startId = edge.start;\n    const endId = edge.end;\n    const start = startId ? nodeByIdMap.get(startId) : void 0;\n    const end = endId ? nodeByIdMap.get(endId) : void 0;\n    if (!start || !end) {\n      return false;\n    }\n    const startX = start.x ?? 0;\n    const startY = start.y ?? 0;\n    const endX = end.x ?? 0;\n    const endY = end.y ?? 0;\n    const [a, b] = points;\n    return sameY(a, b, EPS_LOCAL) && Math.abs(startY - endY) < 1 && Math.abs(startX - endX) > 1 || sameX(a, b, EPS_LOCAL) && Math.abs(startX - endX) < 1 && Math.abs(startY - endY) > 1;\n  }, \"laneIsStraightCollinearConnector\");\n  const shifts = [\n    -TRACK_SHIFT,\n    TRACK_SHIFT,\n    -2 * TRACK_SHIFT,\n    2 * TRACK_SHIFT,\n    -3 * TRACK_SHIFT,\n    3 * TRACK_SHIFT\n  ];\n  for (let iteration = 0; iteration < 8; iteration++) {\n    const lanes = edges.filter((edge) => !edge.isLayoutOnly).flatMap((edge) => [terminalLaneFor(edge, true), terminalLaneFor(edge, false)]).filter((lane) => Boolean(lane));\n    let fixed = false;\n    for (let i = 0; i < lanes.length && !fixed; i++) {\n      for (let j = i + 1; j < lanes.length && !fixed; j++) {\n        const first = lanes[i];\n        const second = lanes[j];\n        if (first.edge === second.edge || !(exactTerminalLaneConflict(first, second) || nearTerminalLaneConflict(first, second))) {\n          continue;\n        }\n        const fixingNearConflict = !exactTerminalLaneConflict(first, second);\n        const candidates = [first, second].sort((a, b) => {\n          const aPreservesStraight = laneIsStraightCollinearConnector(a);\n          const bPreservesStraight = laneIsStraightCollinearConnector(b);\n          if (aPreservesStraight !== bPreservesStraight) {\n            return Number(aPreservesStraight) - Number(bPreservesStraight);\n          }\n          return Number(!b.atStart) - Number(!a.atStart);\n        });\n        for (const lane of candidates) {\n          for (const shift of shifts) {\n            const candidate = shiftedCandidate(lane, shift);\n            if (!candidate) {\n              continue;\n            }\n            const nextLane = terminalLaneFor({ ...lane.edge, points: candidate }, lane.atStart);\n            if (!nextLane || lanes.some(\n              (other) => other.edge !== lane.edge && (exactTerminalLaneConflict(nextLane, other) || fixingNearConflict && nearTerminalLaneConflict(nextLane, other))\n            )) {\n              continue;\n            }\n            lane.edge.points = candidate;\n            fixed = true;\n            break;\n          }\n          if (fixed) {\n            break;\n          }\n        }\n      }\n    }\n    if (!fixed) {\n      return;\n    }\n  }\n}\n__name(separateSharedRenderedTerminalLanes, \"separateSharedRenderedTerminalLanes\");\nfunction collapseRedundantRectangularDoglegs(edges, nodeByIdMap) {\n  const BUFFER = 2;\n  const MAX_ITERATIONS = 8;\n  const { realNodeRects, labelNodeRects: labelRects } = collectNodeRectEntries(\n    nodeByIdMap.values()\n  );\n  const candidateIsSafe = /* @__PURE__ */ __name((edge, candidate) => {\n    const sourceId = edge.start;\n    const targetId = edge.end;\n    const candidateSegments = segmentsFor(candidate);\n    if (candidateSegments.length !== candidate.length - 1) {\n      return false;\n    }\n    const endpointIds = [sourceId, targetId].filter((id) => Boolean(id));\n    for (const segment of candidateSegments) {\n      if (segmentHitsAnyRect(segment.a, segment.b, realNodeRects, endpointIds, -BUFFER)) {\n        return false;\n      }\n      if (segmentHitsAnyRect(segment.a, segment.b, labelRects, [], -BUFFER)) {\n        return false;\n      }\n    }\n    for (const other of edges) {\n      if (other === edge || other.isLayoutOnly) {\n        continue;\n      }\n      const otherPoints = other.points;\n      if (!otherPoints || otherPoints.length < 2) {\n        continue;\n      }\n      for (const candidateSegment of candidateSegments) {\n        for (const otherSegment of segmentsFor(dedupeConsecutivePoints(otherPoints))) {\n          if (sameAxisSegmentOverlapLength(candidateSegment, otherSegment, 0.5) >= MIN_SHARED) {\n            return false;\n          }\n          if (orthogonalSegmentsStrictlyCross(\n            candidateSegment.a,\n            candidateSegment.b,\n            otherSegment.a,\n            otherSegment.b,\n            EPS_LOCAL\n          )) {\n            return false;\n          }\n        }\n      }\n    }\n    return true;\n  }, \"candidateIsSafe\");\n  const withoutDogleg = /* @__PURE__ */ __name((points, i) => {\n    if (i + 4 >= points.length) {\n      return void 0;\n    }\n    const p0 = points[i];\n    const p1 = points[i + 1];\n    const p2 = points[i + 2];\n    const p3 = points[i + 3];\n    const p4 = points[i + 4];\n    const terminalVerticalDogleg = isHorizontalSegment(p0, p1) && isVerticalSegment(p1, p2) && isHorizontalSegment(p2, p3) && isVerticalSegment(p3, p4) && sameX(p0, p3, EPS_LOCAL) && sameX(p0, p4, EPS_LOCAL) && sameX(p1, p2, EPS_LOCAL) && (p1.x - p0.x) * (p3.x - p2.x) < 0;\n    const terminalHorizontalDogleg = isVerticalSegment(p0, p1) && isHorizontalSegment(p1, p2) && isVerticalSegment(p2, p3) && isHorizontalSegment(p3, p4) && sameY(p0, p3, EPS_LOCAL) && sameY(p0, p4, EPS_LOCAL) && sameY(p1, p2, EPS_LOCAL) && (p1.y - p0.y) * (p3.y - p2.y) < 0;\n    if (terminalVerticalDogleg || terminalHorizontalDogleg) {\n      return dedupeConsecutivePoints([...points.slice(0, i + 1), p4, ...points.slice(i + 5)]);\n    }\n    if (i + 5 >= points.length) {\n      return void 0;\n    }\n    const p5 = points[i + 5];\n    const verticalDogleg = isVerticalSegment(p0, p1) && isHorizontalSegment(p1, p2) && isVerticalSegment(p2, p3) && isHorizontalSegment(p3, p4) && isVerticalSegment(p4, p5) && sameX(p0, p4, EPS_LOCAL) && sameX(p0, p5, EPS_LOCAL) && sameX(p2, p3, EPS_LOCAL) && (p2.x - p1.x) * (p4.x - p3.x) < 0;\n    const horizontalDogleg = isHorizontalSegment(p0, p1) && isVerticalSegment(p1, p2) && isHorizontalSegment(p2, p3) && isVerticalSegment(p3, p4) && isHorizontalSegment(p4, p5) && sameY(p0, p4, EPS_LOCAL) && sameY(p0, p5, EPS_LOCAL) && sameY(p2, p3, EPS_LOCAL) && (p2.y - p1.y) * (p4.y - p3.y) < 0;\n    if (!verticalDogleg && !horizontalDogleg) {\n      return void 0;\n    }\n    return dedupeConsecutivePoints([...points.slice(0, i + 1), p5, ...points.slice(i + 6)]);\n  }, \"withoutDogleg\");\n  for (let iteration = 0; iteration < MAX_ITERATIONS; iteration++) {\n    let fixed = false;\n    for (const edge of edges) {\n      if (edge.isLayoutOnly) {\n        continue;\n      }\n      const points = dedupeConsecutivePoints(edge.points ?? []);\n      for (let i = 0; i <= points.length - 5; i++) {\n        const candidate = withoutDogleg(points, i);\n        if (!candidate || !candidateIsSafe(edge, candidate)) {\n          continue;\n        }\n        edge.points = candidate;\n        fixed = true;\n        break;\n      }\n      if (fixed) {\n        break;\n      }\n    }\n    if (!fixed) {\n      return;\n    }\n  }\n}\n__name(collapseRedundantRectangularDoglegs, \"collapseRedundantRectangularDoglegs\");\nfunction liftObstacleHuggingSameSideRails(edges, nodeByIdMap) {\n  const BUFFER = 2;\n  const CLEARANCE = 20;\n  const MAX_ITERATIONS = 8;\n  const { realNodeRects, labelNodeRects: labelRects } = collectNodeRectEntries(\n    nodeByIdMap.values()\n  );\n  const visibleEdges = edges.filter((edge) => !edge.isLayoutOnly);\n  const pointsFor = /* @__PURE__ */ __name((edge, replacementEdge, replacement) => dedupeConsecutivePoints(\n    edge === replacementEdge ? replacement ?? [] : edge.points ?? []\n  ), \"pointsFor\");\n  const strictCrossingCount = /* @__PURE__ */ __name((replacementEdge, replacement) => {\n    let count = 0;\n    for (let i = 0; i < visibleEdges.length; i++) {\n      const firstSegments = segmentsFor(pointsFor(visibleEdges[i], replacementEdge, replacement));\n      for (let j = i + 1; j < visibleEdges.length; j++) {\n        const secondSegments = segmentsFor(\n          pointsFor(visibleEdges[j], replacementEdge, replacement)\n        );\n        for (const firstSegment of firstSegments) {\n          for (const secondSegment of secondSegments) {\n            if (orthogonalSegmentsStrictlyCross(\n              firstSegment.a,\n              firstSegment.b,\n              secondSegment.a,\n              secondSegment.b,\n              EPS_LOCAL\n            )) {\n              count++;\n            }\n          }\n        }\n      }\n    }\n    return count;\n  }, \"strictCrossingCount\");\n  const middleRail = /* @__PURE__ */ __name((points) => {\n    const segments = segmentsFor(points);\n    if (segments.length !== 3) {\n      return void 0;\n    }\n    const middle = segments[1];\n    if (segments[0].horizontal === middle.horizontal || segments[2].horizontal === middle.horizontal) {\n      return void 0;\n    }\n    return {\n      index: middle.index,\n      horizontal: middle.horizontal,\n      vertical: middle.vertical,\n      segment: middle\n    };\n  }, \"middleRail\");\n  const blockingRectsFor = /* @__PURE__ */ __name((edge, rail) => {\n    const endpointIds = [edge.start, edge.end].filter(\n      (id) => Boolean(id)\n    );\n    return realNodeRects.filter((entry) => {\n      if (endpointIds.includes(entry.id)) {\n        return false;\n      }\n      const rect = entry.rect;\n      if (rail.horizontal) {\n        const xOverlap = overlapLength(rail.a.x, rail.b.x, rect.left, rect.right);\n        return xOverlap >= MIN_SHARED && rail.a.y >= rect.top - BUFFER && rail.a.y <= rect.bottom + BUFFER;\n      }\n      const yOverlap = overlapLength(rail.a.y, rail.b.y, rect.top, rect.bottom);\n      return yOverlap >= MIN_SHARED && rail.a.x >= rect.left - BUFFER && rail.a.x <= rect.right + BUFFER;\n    });\n  }, \"blockingRectsFor\");\n  const candidateByMovingRail = /* @__PURE__ */ __name((points, rail, coord) => {\n    const candidate = points.map((point) => ({ ...point }));\n    if (rail.horizontal) {\n      candidate[rail.index].y = coord;\n      candidate[rail.index + 1].y = coord;\n    } else if (rail.vertical) {\n      candidate[rail.index].x = coord;\n      candidate[rail.index + 1].x = coord;\n    } else {\n      return void 0;\n    }\n    const simplified = simplifyPolyline(dedupeConsecutivePoints(candidate));\n    return segmentsFor(simplified).length === simplified.length - 1 ? simplified : void 0;\n  }, \"candidateByMovingRail\");\n  const candidateIsSafe = /* @__PURE__ */ __name((edge, candidate, currentCrossings) => {\n    const endpointIds = [edge.start, edge.end].filter(\n      (id) => Boolean(id)\n    );\n    const candidateSegments = segmentsFor(candidate);\n    if (candidateSegments.length !== candidate.length - 1) {\n      return false;\n    }\n    for (const segment of candidateSegments) {\n      if (segmentHitsAnyRect(segment.a, segment.b, realNodeRects, endpointIds, -BUFFER)) {\n        return false;\n      }\n      if (segmentHitsAnyRect(segment.a, segment.b, labelRects, [], -BUFFER)) {\n        return false;\n      }\n    }\n    for (const other of visibleEdges) {\n      if (other === edge) {\n        continue;\n      }\n      for (const candidateSegment of candidateSegments) {\n        for (const otherSegment of segmentsFor(pointsFor(other))) {\n          if (sameAxisSegmentOverlapLength(candidateSegment, otherSegment, 0.5) >= MIN_SHARED) {\n            return false;\n          }\n        }\n      }\n    }\n    return strictCrossingCount(edge, candidate) <= currentCrossings;\n  }, \"candidateIsSafe\");\n  for (let iteration = 0; iteration < MAX_ITERATIONS; iteration++) {\n    const currentCrossings = strictCrossingCount();\n    let fixed = false;\n    for (const edge of visibleEdges) {\n      const points = pointsFor(edge);\n      const rail = middleRail(points);\n      if (!rail) {\n        continue;\n      }\n      const blockers = blockingRectsFor(edge, rail.segment);\n      if (blockers.length === 0) {\n        continue;\n      }\n      const coords = rail.horizontal ? [\n        Math.min(...blockers.map((entry) => entry.rect.top)) - CLEARANCE,\n        Math.max(...blockers.map((entry) => entry.rect.bottom)) + CLEARANCE\n      ] : [\n        Math.min(...blockers.map((entry) => entry.rect.left)) - CLEARANCE,\n        Math.max(...blockers.map((entry) => entry.rect.right)) + CLEARANCE\n      ];\n      for (const coord of coords) {\n        const candidate = candidateByMovingRail(points, rail.segment, coord);\n        if (!candidate || !candidateIsSafe(edge, candidate, currentCrossings)) {\n          continue;\n        }\n        edge.points = candidate;\n        fixed = true;\n        break;\n      }\n      if (fixed) {\n        break;\n      }\n    }\n    if (!fixed) {\n      return;\n    }\n  }\n}\n__name(liftObstacleHuggingSameSideRails, \"liftObstacleHuggingSameSideRails\");\nfunction liftTopLaneTitleBandsAboveRails(edges, nodeByIdMap) {\n  const CLEARANCE = 4;\n  const validTitleRect = /* @__PURE__ */ __name((node) => {\n    const rect = node.groupTitleRect;\n    if (!rect || typeof rect.left !== \"number\" || typeof rect.right !== \"number\" || typeof rect.top !== \"number\" || typeof rect.bottom !== \"number\" || !Number.isFinite(rect.left) || !Number.isFinite(rect.right) || !Number.isFinite(rect.top) || !Number.isFinite(rect.bottom) || rect.right <= rect.left || rect.bottom <= rect.top) {\n      return void 0;\n    }\n    return { left: rect.left, right: rect.right, top: rect.top, bottom: rect.bottom };\n  }, \"validTitleRect\");\n  const topLaneTitleFor = /* @__PURE__ */ __name((node) => {\n    if (!node.isGroup || node.parentId) {\n      return void 0;\n    }\n    const rawDirection = node.direction;\n    const direction = typeof rawDirection === \"string\" ? rawDirection.toUpperCase() : \"\";\n    if (direction === \"LR\" || direction === \"RL\" || direction === \"BT\") {\n      return void 0;\n    }\n    const rect = validTitleRect(node);\n    const y = node.y;\n    const height = node.height;\n    if (!rect || typeof y !== \"number\" || typeof height !== \"number\" || !Number.isFinite(y) || !Number.isFinite(height) || height <= 0) {\n      return void 0;\n    }\n    const titleWidth = rect.right - rect.left;\n    const titleHeight = rect.bottom - rect.top;\n    if (titleHeight <= 0 || titleWidth < titleHeight) {\n      return void 0;\n    }\n    return { node, rect };\n  }, \"topLaneTitleFor\");\n  const horizontalSegmentIntersectsTitle = /* @__PURE__ */ __name((segment, rect) => {\n    if (!segment.horizontal) {\n      return false;\n    }\n    const y = segment.a.y;\n    if (y <= rect.top + EPS_LOCAL || y >= rect.bottom - EPS_LOCAL) {\n      return false;\n    }\n    return overlapLength(segment.a.x, segment.b.x, rect.left, rect.right) >= MIN_SHARED;\n  }, \"horizontalSegmentIntersectsTitle\");\n  const lanes = [...nodeByIdMap.values()].map(topLaneTitleFor).filter((lane) => Boolean(lane));\n  if (lanes.length === 0) {\n    return;\n  }\n  let topDelta = 0;\n  for (const edge of edges) {\n    if (edge.isLayoutOnly) {\n      continue;\n    }\n    const points = dedupeConsecutivePoints(edge.points ?? []);\n    for (const segment of segmentsFor(points)) {\n      for (const lane of lanes) {\n        if (!horizontalSegmentIntersectsTitle(segment, lane.rect)) {\n          continue;\n        }\n        topDelta = Math.max(topDelta, lane.rect.bottom - segment.a.y + CLEARANCE);\n      }\n    }\n  }\n  if (topDelta <= EPS_LOCAL) {\n    return;\n  }\n  for (const lane of lanes) {\n    const y = lane.node.y;\n    const height = lane.node.height;\n    if (typeof y !== \"number\" || typeof height !== \"number\" || !Number.isFinite(y) || !Number.isFinite(height) || height <= 0) {\n      continue;\n    }\n    lane.node.y = y - topDelta / 2;\n    lane.node.height = height + topDelta;\n    lane.node.groupTitleRect = {\n      ...lane.rect,\n      top: lane.rect.top - topDelta,\n      bottom: lane.rect.bottom - topDelta\n    };\n  }\n}\n__name(liftTopLaneTitleBandsAboveRails, \"liftTopLaneTitleBandsAboveRails\");\nfunction shiftLeftLaneTitleBandsLeftOfRails(edges, nodeByIdMap) {\n  const CLEARANCE = 4;\n  const validTitleRect = /* @__PURE__ */ __name((node) => {\n    const rect = node.groupTitleRect;\n    if (!rect || typeof rect.left !== \"number\" || typeof rect.right !== \"number\" || typeof rect.top !== \"number\" || typeof rect.bottom !== \"number\" || !Number.isFinite(rect.left) || !Number.isFinite(rect.right) || !Number.isFinite(rect.top) || !Number.isFinite(rect.bottom) || rect.right <= rect.left || rect.bottom <= rect.top) {\n      return void 0;\n    }\n    return { left: rect.left, right: rect.right, top: rect.top, bottom: rect.bottom };\n  }, \"validTitleRect\");\n  const leftLaneTitleFor = /* @__PURE__ */ __name((node) => {\n    if (!node.isGroup || node.parentId) {\n      return void 0;\n    }\n    const rawDirection = node.direction;\n    if (rawDirection !== \"LR\") {\n      return void 0;\n    }\n    const rect = validTitleRect(node);\n    const x = node.x;\n    const width = node.width;\n    if (!rect || typeof x !== \"number\" || typeof width !== \"number\" || !Number.isFinite(x) || !Number.isFinite(width) || width <= 0) {\n      return void 0;\n    }\n    const titleWidth = rect.right - rect.left;\n    const titleHeight = rect.bottom - rect.top;\n    if (titleWidth <= 0 || titleHeight < titleWidth) {\n      return void 0;\n    }\n    return { node, rect };\n  }, \"leftLaneTitleFor\");\n  const verticalSegmentIntersectsTitle = /* @__PURE__ */ __name((segment, rect) => {\n    if (!segment.vertical) {\n      return false;\n    }\n    const x = segment.a.x;\n    if (x <= rect.left + EPS_LOCAL || x >= rect.right - EPS_LOCAL) {\n      return false;\n    }\n    return overlapLength(segment.a.y, segment.b.y, rect.top, rect.bottom) >= MIN_SHARED;\n  }, \"verticalSegmentIntersectsTitle\");\n  const horizontalSegmentIntersectsTitle = /* @__PURE__ */ __name((segment, rect) => {\n    if (!segment.horizontal) {\n      return false;\n    }\n    const y = segment.a.y;\n    if (y <= rect.top + EPS_LOCAL || y >= rect.bottom - EPS_LOCAL) {\n      return false;\n    }\n    return overlapLength(segment.a.x, segment.b.x, rect.left, rect.right) >= MIN_SHARED;\n  }, \"horizontalSegmentIntersectsTitle\");\n  const lanes = [...nodeByIdMap.values()].map(leftLaneTitleFor).filter((lane) => Boolean(lane));\n  if (lanes.length === 0) {\n    return;\n  }\n  let leftDelta = 0;\n  for (const edge of edges) {\n    if (edge.isLayoutOnly) {\n      continue;\n    }\n    const points = dedupeConsecutivePoints(edge.points ?? []);\n    for (const segment of segmentsFor(points)) {\n      for (const lane of lanes) {\n        if (verticalSegmentIntersectsTitle(segment, lane.rect)) {\n          leftDelta = Math.max(leftDelta, lane.rect.right - segment.a.x + CLEARANCE);\n        } else if (horizontalSegmentIntersectsTitle(segment, lane.rect)) {\n          const segmentLeft = Math.min(segment.a.x, segment.b.x);\n          leftDelta = Math.max(leftDelta, lane.rect.right - segmentLeft + CLEARANCE);\n        }\n      }\n    }\n  }\n  if (leftDelta <= EPS_LOCAL) {\n    return;\n  }\n  for (const lane of lanes) {\n    const x = lane.node.x;\n    const width = lane.node.width;\n    if (typeof x !== \"number\" || typeof width !== \"number\" || !Number.isFinite(x) || !Number.isFinite(width) || width <= 0) {\n      continue;\n    }\n    lane.node.x = x - leftDelta / 2;\n    lane.node.width = width + leftDelta;\n    lane.node.groupTitleRect = {\n      ...lane.rect,\n      left: lane.rect.left - leftDelta,\n      right: lane.rect.right - leftDelta\n    };\n  }\n}\n__name(shiftLeftLaneTitleBandsLeftOfRails, \"shiftLeftLaneTitleBandsLeftOfRails\");\nfunction swapDestinationTerminalTailsToReduceCrossings(edges, nodeByIdMap) {\n  const BUFFER = 2;\n  const MAX_ITERATIONS = 4;\n  const { realNodeRects } = collectNodeRectEntries(nodeByIdMap.values());\n  const visibleEdges = edges.filter((edge) => !edge.isLayoutOnly);\n  const replacementPointsFor = /* @__PURE__ */ __name((edge, replacements = /* @__PURE__ */ new Map()) => dedupeConsecutivePoints(\n    replacements.get(edge) ?? edge.points ?? []\n  ), \"replacementPointsFor\");\n  const crossingCount = /* @__PURE__ */ __name((replacements = /* @__PURE__ */ new Map()) => {\n    let count = 0;\n    for (let i = 0; i < visibleEdges.length; i++) {\n      const firstSegments = segmentsFor(replacementPointsFor(visibleEdges[i], replacements));\n      for (let j = i + 1; j < visibleEdges.length; j++) {\n        const secondSegments = segmentsFor(replacementPointsFor(visibleEdges[j], replacements));\n        for (const firstSegment of firstSegments) {\n          for (const secondSegment of secondSegments) {\n            if (orthogonalSegmentsStrictlyCross(\n              firstSegment.a,\n              firstSegment.b,\n              secondSegment.a,\n              secondSegment.b,\n              EPS_LOCAL\n            )) {\n              count++;\n            }\n          }\n        }\n      }\n    }\n    return count;\n  }, \"crossingCount\");\n  const totalBends = /* @__PURE__ */ __name((replacements = /* @__PURE__ */ new Map()) => visibleEdges.reduce(\n    (sum, edge) => sum + countOrthogonalBends(replacementPointsFor(edge, replacements)),\n    0\n  ), \"totalBends\");\n  const terminalTailFor = /* @__PURE__ */ __name((edge) => {\n    const points = replacementPointsFor(edge);\n    if (points.length < 4) {\n      return void 0;\n    }\n    const tailStart = points[points.length - 2];\n    const terminal = points[points.length - 1];\n    if (!isHorizontalSegment(tailStart, terminal, EPS_LOCAL) && !isVerticalSegment(tailStart, terminal, EPS_LOCAL)) {\n      return void 0;\n    }\n    return { tailStart, terminal };\n  }, \"terminalTailFor\");\n  const candidateWithDestinationTail = /* @__PURE__ */ __name((edge, tail) => {\n    const points = replacementPointsFor(edge);\n    if (points.length < 3) {\n      return void 0;\n    }\n    const start = points[0];\n    const firstTurn = points[1];\n    let connector;\n    if (isHorizontalSegment(start, firstTurn, EPS_LOCAL)) {\n      connector = { x: firstTurn.x, y: tail.tailStart.y };\n    } else if (isVerticalSegment(start, firstTurn, EPS_LOCAL)) {\n      connector = { x: tail.tailStart.x, y: firstTurn.y };\n    } else {\n      return void 0;\n    }\n    const candidate = simplifyPolyline(\n      dedupeConsecutivePoints([start, firstTurn, connector, tail.tailStart, tail.terminal])\n    );\n    return segmentsFor(candidate).length === candidate.length - 1 ? candidate : void 0;\n  }, \"candidateWithDestinationTail\");\n  const pathHasNodeHit = /* @__PURE__ */ __name((edge, path) => {\n    const endpointIds = [edge.start, edge.end].filter(\n      (id) => Boolean(id)\n    );\n    for (const segment of segmentsFor(path)) {\n      if (segmentHitsAnyRect(segment.a, segment.b, realNodeRects, endpointIds, -BUFFER)) {\n        return true;\n      }\n    }\n    return false;\n  }, \"pathHasNodeHit\");\n  const pathHasSharedTrack = /* @__PURE__ */ __name((edge, path, replacements) => {\n    for (const other of visibleEdges) {\n      if (other === edge) {\n        continue;\n      }\n      for (const candidateSegment of segmentsFor(path)) {\n        for (const otherSegment of segmentsFor(replacementPointsFor(other, replacements))) {\n          if (sameAxisSegmentOverlapLength(candidateSegment, otherSegment, 0.5) >= MIN_SHARED) {\n            return true;\n          }\n        }\n      }\n    }\n    return false;\n  }, \"pathHasSharedTrack\");\n  const candidateIsSafe = /* @__PURE__ */ __name((edge, path, replacements) => !pathHasNodeHit(edge, path) && !pathHasSharedTrack(edge, path, replacements), \"candidateIsSafe\");\n  const edgesByDestination = /* @__PURE__ */ __name(() => {\n    const result = /* @__PURE__ */ new Map();\n    for (const edge of visibleEdges) {\n      const dstId = edge.end;\n      if (!dstId || !nodeByIdMap.has(dstId)) {\n        continue;\n      }\n      const points = replacementPointsFor(edge);\n      if (points.length < 4) {\n        continue;\n      }\n      const bucket = result.get(dstId) ?? [];\n      bucket.push(edge);\n      result.set(dstId, bucket);\n    }\n    return result;\n  }, \"edgesByDestination\");\n  for (let iteration = 0; iteration < MAX_ITERATIONS; iteration++) {\n    const currentCrossings = crossingCount();\n    if (currentCrossings === 0) {\n      return;\n    }\n    const currentBends = totalBends();\n    let bestReplacements;\n    let bestCrossings = currentCrossings;\n    let bestBends = currentBends;\n    for (const destinationEdges of edgesByDestination().values()) {\n      for (let i = 0; i < destinationEdges.length; i++) {\n        for (let j = i + 1; j < destinationEdges.length; j++) {\n          const first = destinationEdges[i];\n          const second = destinationEdges[j];\n          const firstTail = terminalTailFor(first);\n          const secondTail = terminalTailFor(second);\n          if (!firstTail || !secondTail) {\n            continue;\n          }\n          const firstCandidate = candidateWithDestinationTail(first, secondTail);\n          const secondCandidate = candidateWithDestinationTail(second, firstTail);\n          if (!firstCandidate || !secondCandidate) {\n            continue;\n          }\n          const replacements = /* @__PURE__ */ new Map([\n            [first, firstCandidate],\n            [second, secondCandidate]\n          ]);\n          if (!candidateIsSafe(first, firstCandidate, replacements) || !candidateIsSafe(second, secondCandidate, replacements)) {\n            continue;\n          }\n          const candidateCrossings = crossingCount(replacements);\n          const candidateBends = totalBends(replacements);\n          if (candidateCrossings >= currentCrossings) {\n            continue;\n          }\n          if (candidateCrossings > bestCrossings || candidateCrossings === bestCrossings && candidateBends >= bestBends) {\n            continue;\n          }\n          bestReplacements = replacements;\n          bestCrossings = candidateCrossings;\n          bestBends = candidateBends;\n        }\n      }\n    }\n    if (!bestReplacements) {\n      return;\n    }\n    for (const [edge, points] of bestReplacements) {\n      edge.points = points;\n    }\n  }\n}\n__name(swapDestinationTerminalTailsToReduceCrossings, \"swapDestinationTerminalTailsToReduceCrossings\");\nfunction reassignCrossingExternalRailChannels(edges, nodeByIdMap) {\n  const BUFFER = 2;\n  const RAIL_CHANNEL_GAP = 12;\n  const MAX_ITERATIONS = 4;\n  const MAX_EXHAUSTIVE_COMPONENT = 6;\n  const { realNodeRects, labelNodeRects: labelRects } = collectNodeRectEntries(\n    nodeByIdMap.values()\n  );\n  const visibleEdges = edges.filter((edge) => !edge.isLayoutOnly);\n  const replacementPointsFor = /* @__PURE__ */ __name((edge, replacements = /* @__PURE__ */ new Map()) => dedupeConsecutivePoints(\n    replacements.get(edge) ?? edge.points ?? []\n  ), \"replacementPointsFor\");\n  const strictCrossingCount = /* @__PURE__ */ __name((replacements = /* @__PURE__ */ new Map()) => {\n    let count = 0;\n    for (let i = 0; i < visibleEdges.length; i++) {\n      const firstSegments = segmentsFor(replacementPointsFor(visibleEdges[i], replacements));\n      for (let j = i + 1; j < visibleEdges.length; j++) {\n        const secondSegments = segmentsFor(replacementPointsFor(visibleEdges[j], replacements));\n        for (const firstSegment of firstSegments) {\n          for (const secondSegment of secondSegments) {\n            if (orthogonalSegmentsStrictlyCross(\n              firstSegment.a,\n              firstSegment.b,\n              secondSegment.a,\n              secondSegment.b,\n              EPS_LOCAL\n            )) {\n              count++;\n            }\n          }\n        }\n      }\n    }\n    return count;\n  }, \"strictCrossingCount\");\n  const totalBends = /* @__PURE__ */ __name((replacements = /* @__PURE__ */ new Map()) => visibleEdges.reduce(\n    (sum, edge) => sum + countOrthogonalBends(replacementPointsFor(edge, replacements)),\n    0\n  ), \"totalBends\");\n  const endpointRectsFor = /* @__PURE__ */ __name((edge) => {\n    const srcId = edge.start;\n    const dstId = edge.end;\n    const srcNode = srcId ? nodeByIdMap.get(srcId) : void 0;\n    const dstNode = dstId ? nodeByIdMap.get(dstId) : void 0;\n    const src = srcNode ? rectOfNodeBounds(srcNode) : void 0;\n    const dst = dstNode ? rectOfNodeBounds(dstNode) : void 0;\n    return src && dst ? { src, dst } : void 0;\n  }, \"endpointRectsFor\");\n  const externalRailForSegment = /* @__PURE__ */ __name((edge, points, segment) => {\n    if (segment.index <= 0 || segment.index + 1 >= points.length - 1) {\n      return void 0;\n    }\n    const endpointRects = endpointRectsFor(edge);\n    if (!endpointRects) {\n      return void 0;\n    }\n    if (segment.vertical) {\n      const coord = segment.a.x;\n      const leftBound = Math.min(endpointRects.src.left, endpointRects.dst.left);\n      const rightBound = Math.max(endpointRects.src.right, endpointRects.dst.right);\n      const side = coord < leftBound - EPS_LOCAL ? \"left\" : coord > rightBound + EPS_LOCAL ? \"right\" : void 0;\n      if (!side) {\n        return void 0;\n      }\n      return {\n        edge,\n        points,\n        segmentIndex: segment.index,\n        axis: \"vertical\",\n        side,\n        coord,\n        min: Math.min(segment.a.y, segment.b.y),\n        max: Math.max(segment.a.y, segment.b.y)\n      };\n    }\n    if (segment.horizontal) {\n      const coord = segment.a.y;\n      const topBound = Math.min(endpointRects.src.top, endpointRects.dst.top);\n      const bottomBound = Math.max(endpointRects.src.bottom, endpointRects.dst.bottom);\n      const side = coord < topBound - EPS_LOCAL ? \"top\" : coord > bottomBound + EPS_LOCAL ? \"bottom\" : void 0;\n      if (!side) {\n        return void 0;\n      }\n      return {\n        edge,\n        points,\n        segmentIndex: segment.index,\n        axis: \"horizontal\",\n        side,\n        coord,\n        min: Math.min(segment.a.x, segment.b.x),\n        max: Math.max(segment.a.x, segment.b.x)\n      };\n    }\n    return void 0;\n  }, \"externalRailForSegment\");\n  const collectExternalRails = /* @__PURE__ */ __name(() => {\n    const rails = [];\n    for (const edge of visibleEdges) {\n      const points = replacementPointsFor(edge);\n      for (const segment of segmentsFor(points)) {\n        const rail = externalRailForSegment(edge, points, segment);\n        if (rail) {\n          rails.push(rail);\n        }\n      }\n    }\n    return rails;\n  }, \"collectExternalRails\");\n  const railsInteract = /* @__PURE__ */ __name((a, b) => a.edge !== b.edge && a.axis === b.axis && a.side === b.side && overlapLength(a.min, a.max, b.min, b.max) >= MIN_SHARED, \"railsInteract\");\n  const connectedComponents = /* @__PURE__ */ __name((rails) => {\n    const result = [];\n    const seen = /* @__PURE__ */ new Set();\n    for (const rail of rails) {\n      if (seen.has(rail)) {\n        continue;\n      }\n      const queue = [rail];\n      const component = [];\n      seen.add(rail);\n      while (queue.length > 0) {\n        const current = queue.pop();\n        component.push(current);\n        for (const next of rails) {\n          if (!seen.has(next) && railsInteract(current, next)) {\n            seen.add(next);\n            queue.push(next);\n          }\n        }\n      }\n      if (component.length > 1) {\n        result.push(component);\n      }\n    }\n    return result;\n  }, \"connectedComponents\");\n  const uniqueCoordsFor = /* @__PURE__ */ __name((component) => {\n    const coords = [];\n    for (const rail of component) {\n      if (!coords.some((coord) => Math.abs(coord - rail.coord) < EPS_LOCAL)) {\n        coords.push(rail.coord);\n      }\n    }\n    while (coords.length < component.length) {\n      const min = Math.min(...coords);\n      const max = Math.max(...coords);\n      const side = component[0].side;\n      coords.push(\n        side === \"left\" || side === \"top\" ? min - RAIL_CHANNEL_GAP * (component.length - coords.length) : max + RAIL_CHANNEL_GAP * (component.length - coords.length)\n      );\n    }\n    return coords;\n  }, \"uniqueCoordsFor\");\n  const coordinateAssignmentsFor = /* @__PURE__ */ __name((component) => {\n    const current = component.map((rail) => rail.coord);\n    const coords = uniqueCoordsFor(component);\n    const assignments = [];\n    if (component.length <= MAX_EXHAUSTIVE_COMPONENT) {\n      const used = new Array(coords.length).fill(false);\n      const next = [];\n      const visit = /* @__PURE__ */ __name(() => {\n        if (next.length === component.length) {\n          if (next.some((coord, index) => Math.abs(coord - current[index]) >= EPS_LOCAL)) {\n            assignments.push([...next]);\n          }\n          return;\n        }\n        for (const [i, coord] of coords.entries()) {\n          if (used[i]) {\n            continue;\n          }\n          used[i] = true;\n          next.push(coord);\n          visit();\n          next.pop();\n          used[i] = false;\n        }\n      }, \"visit\");\n      visit();\n      return assignments;\n    }\n    for (let i = 0; i < current.length; i++) {\n      for (let j = i + 1; j < current.length; j++) {\n        const assignment = [...current];\n        [assignment[i], assignment[j]] = [assignment[j], assignment[i]];\n        assignments.push(assignment);\n      }\n    }\n    return assignments;\n  }, \"coordinateAssignmentsFor\");\n  const replacementsForAssignment = /* @__PURE__ */ __name((component, assignment) => {\n    const draftByEdge = /* @__PURE__ */ new Map();\n    for (const [i, rail] of component.entries()) {\n      const coord = assignment[i];\n      const points = draftByEdge.get(rail.edge) ?? rail.points.map((point) => ({ x: point.x, y: point.y }));\n      if (rail.axis === \"vertical\") {\n        points[rail.segmentIndex].x = coord;\n        points[rail.segmentIndex + 1].x = coord;\n      } else {\n        points[rail.segmentIndex].y = coord;\n        points[rail.segmentIndex + 1].y = coord;\n      }\n      draftByEdge.set(rail.edge, points);\n    }\n    const replacements = /* @__PURE__ */ new Map();\n    for (const [edge, points] of draftByEdge) {\n      const simplified = simplifyPolyline(dedupeConsecutivePoints(points));\n      if (segmentsFor(simplified).length !== simplified.length - 1) {\n        return void 0;\n      }\n      replacements.set(edge, simplified);\n    }\n    return replacements;\n  }, \"replacementsForAssignment\");\n  const candidateIsSafe = /* @__PURE__ */ __name((replacements) => {\n    for (const [edge, points] of replacements) {\n      const endpointIds = [\n        edge.start,\n        edge.end\n      ].filter((id) => Boolean(id));\n      for (const segment of segmentsFor(points)) {\n        if (segmentHitsAnyRect(segment.a, segment.b, realNodeRects, endpointIds, -BUFFER)) {\n          return false;\n        }\n        if (segmentHitsAnyRect(segment.a, segment.b, labelRects, [], -BUFFER)) {\n          return false;\n        }\n      }\n    }\n    for (let i = 0; i < visibleEdges.length; i++) {\n      const first = visibleEdges[i];\n      const firstChanged = replacements.has(first);\n      const firstSegments = segmentsFor(replacementPointsFor(first, replacements));\n      for (let j = i + 1; j < visibleEdges.length; j++) {\n        const second = visibleEdges[j];\n        if (!firstChanged && !replacements.has(second)) {\n          continue;\n        }\n        const secondSegments = segmentsFor(replacementPointsFor(second, replacements));\n        for (const firstSegment of firstSegments) {\n          for (const secondSegment of secondSegments) {\n            if (sameAxisSegmentOverlapLength(firstSegment, secondSegment, 0.5) >= MIN_SHARED) {\n              return false;\n            }\n          }\n        }\n      }\n    }\n    return true;\n  }, \"candidateIsSafe\");\n  for (let iteration = 0; iteration < MAX_ITERATIONS; iteration++) {\n    const currentCrossings = strictCrossingCount();\n    if (currentCrossings === 0) {\n      return;\n    }\n    let bestReplacements;\n    let bestCrossings = currentCrossings;\n    let bestBends = totalBends();\n    let bestDisplacement = Number.POSITIVE_INFINITY;\n    for (const component of connectedComponents(collectExternalRails())) {\n      for (const assignment of coordinateAssignmentsFor(component)) {\n        const replacements = replacementsForAssignment(component, assignment);\n        if (!replacements || !candidateIsSafe(replacements)) {\n          continue;\n        }\n        const candidateCrossings = strictCrossingCount(replacements);\n        if (candidateCrossings >= currentCrossings) {\n          continue;\n        }\n        const candidateBends = totalBends(replacements);\n        const candidateDisplacement = component.reduce(\n          (sum, rail, index) => sum + Math.abs(assignment[index] - rail.coord),\n          0\n        );\n        if (candidateCrossings > bestCrossings || candidateCrossings === bestCrossings && (candidateBends > bestBends || candidateBends === bestBends && candidateDisplacement >= bestDisplacement)) {\n          continue;\n        }\n        bestReplacements = replacements;\n        bestCrossings = candidateCrossings;\n        bestBends = candidateBends;\n        bestDisplacement = candidateDisplacement;\n      }\n    }\n    if (!bestReplacements) {\n      return;\n    }\n    for (const [edge, points] of bestReplacements) {\n      edge.points = points;\n    }\n  }\n}\n__name(reassignCrossingExternalRailChannels, \"reassignCrossingExternalRailChannels\");\nfunction shortcutRedundantOrthogonalJogs(edges, nodeByIdMap) {\n  const BUFFER = 2;\n  const MAX_ITERATIONS = 8;\n  const { realNodeRects, labelNodeRects: labelRects } = collectNodeRectEntries(\n    nodeByIdMap.values()\n  );\n  const visibleEdges = edges.filter((edge) => !edge.isLayoutOnly);\n  const pointsFor = /* @__PURE__ */ __name((edge, replacementEdge, replacement) => dedupeConsecutivePoints(\n    edge === replacementEdge ? replacement ?? [] : edge.points ?? []\n  ), \"pointsFor\");\n  const pathLength = /* @__PURE__ */ __name((points) => segmentsFor(points).reduce((sum, segment) => {\n    const dx = segment.a.x - segment.b.x;\n    const dy = segment.a.y - segment.b.y;\n    return sum + Math.hypot(dx, dy);\n  }, 0), \"pathLength\");\n  const strictCrossingCount = /* @__PURE__ */ __name((replacementEdge, replacement) => {\n    let count = 0;\n    for (let i = 0; i < visibleEdges.length; i++) {\n      const firstSegments = segmentsFor(pointsFor(visibleEdges[i], replacementEdge, replacement));\n      for (let j = i + 1; j < visibleEdges.length; j++) {\n        const secondSegments = segmentsFor(\n          pointsFor(visibleEdges[j], replacementEdge, replacement)\n        );\n        for (const firstSegment of firstSegments) {\n          for (const secondSegment of secondSegments) {\n            if (orthogonalSegmentsStrictlyCross(\n              firstSegment.a,\n              firstSegment.b,\n              secondSegment.a,\n              secondSegment.b,\n              EPS_LOCAL\n            )) {\n              count++;\n            }\n          }\n        }\n      }\n    }\n    return count;\n  }, \"strictCrossingCount\");\n  const segmentRunsAlongRectBorder = /* @__PURE__ */ __name((segment, rect) => {\n    if (segment.horizontal) {\n      const y = segment.a.y;\n      const onBorder = Math.abs(y - rect.top) < 1 || Math.abs(y - rect.bottom) < 1;\n      return onBorder && overlapLength(segment.a.x, segment.b.x, rect.left, rect.right) >= MIN_SHARED;\n    }\n    if (segment.vertical) {\n      const x = segment.a.x;\n      const onBorder = Math.abs(x - rect.left) < 1 || Math.abs(x - rect.right) < 1;\n      return onBorder && overlapLength(segment.a.y, segment.b.y, rect.top, rect.bottom) >= MIN_SHARED;\n    }\n    return false;\n  }, \"segmentRunsAlongRectBorder\");\n  const endpointRectsFor = /* @__PURE__ */ __name((edge) => {\n    const endpointIds = [edge.start, edge.end].filter(\n      (id) => Boolean(id)\n    );\n    const rects = [];\n    for (const id of endpointIds) {\n      const node = nodeByIdMap.get(id);\n      const rect = node ? rectOfNodeBounds(node) : void 0;\n      if (rect) {\n        rects.push(rect);\n      }\n    }\n    return rects;\n  }, \"endpointRectsFor\");\n  const shortcutCandidatesAt = /* @__PURE__ */ __name((points, index) => {\n    if (index + 3 >= points.length) {\n      return [];\n    }\n    const p0 = points[index];\n    const p1 = points[index + 1];\n    const p2 = points[index + 2];\n    const p3 = points[index + 3];\n    const isHVH = isHorizontalSegment(p0, p1, EPS_LOCAL) && isVerticalSegment(p1, p2, EPS_LOCAL) && isHorizontalSegment(p2, p3, EPS_LOCAL);\n    const isVHV = isVerticalSegment(p0, p1, EPS_LOCAL) && isHorizontalSegment(p1, p2, EPS_LOCAL) && isVerticalSegment(p2, p3, EPS_LOCAL);\n    if (!isHVH && !isVHV) {\n      return [];\n    }\n    const outerSegmentsOppose = isHVH ? Math.sign(p1.x - p0.x) !== Math.sign(p3.x - p2.x) : Math.sign(p1.y - p0.y) !== Math.sign(p3.y - p2.y);\n    if (!outerSegmentsOppose) {\n      return [];\n    }\n    const corners = sameX(p0, p3, EPS_LOCAL) || sameY(p0, p3, EPS_LOCAL) ? [] : [\n      { x: p0.x, y: p3.y },\n      { x: p3.x, y: p0.y }\n    ];\n    const rawCandidates = corners.length === 0 ? [[...points.slice(0, index + 1), ...points.slice(index + 3)]] : corners.map((corner) => [\n      ...points.slice(0, index + 1),\n      corner,\n      ...points.slice(index + 3)\n    ]);\n    const seen = /* @__PURE__ */ new Set();\n    return rawCandidates.map((candidate) => simplifyPolyline(dedupeConsecutivePoints(candidate))).filter((candidate) => {\n      if (segmentsFor(candidate).length !== candidate.length - 1) {\n        return false;\n      }\n      if (!candidate.some((point) => samePoint(point, p3, EPS_LOCAL))) {\n        return false;\n      }\n      const key = candidate.map((point) => `${point.x.toFixed(3)},${point.y.toFixed(3)}`).join(\"|\");\n      if (seen.has(key)) {\n        return false;\n      }\n      seen.add(key);\n      return true;\n    });\n  }, \"shortcutCandidatesAt\");\n  const candidateIsSafe = /* @__PURE__ */ __name((edge, candidate, currentCrossings) => {\n    const endpointIds = [edge.start, edge.end].filter(\n      (id) => Boolean(id)\n    );\n    const endpointRects = endpointRectsFor(edge);\n    for (const segment of segmentsFor(candidate)) {\n      if (segmentHitsAnyRect(segment.a, segment.b, realNodeRects, endpointIds, -BUFFER)) {\n        return false;\n      }\n      if (segmentHitsAnyRect(segment.a, segment.b, labelRects, [], -BUFFER)) {\n        return false;\n      }\n      if (endpointRects.some((rect) => segmentRunsAlongRectBorder(segment, rect))) {\n        return false;\n      }\n    }\n    for (const other of visibleEdges) {\n      if (other === edge) {\n        continue;\n      }\n      for (const candidateSegment of segmentsFor(candidate)) {\n        for (const otherSegment of segmentsFor(pointsFor(other))) {\n          if (sameAxisSegmentOverlapLength(candidateSegment, otherSegment, 0.5) >= MIN_SHARED) {\n            return false;\n          }\n        }\n      }\n    }\n    return strictCrossingCount(edge, candidate) <= currentCrossings;\n  }, \"candidateIsSafe\");\n  for (let iteration = 0; iteration < MAX_ITERATIONS; iteration++) {\n    const currentCrossings = strictCrossingCount();\n    let bestEdge;\n    let bestPath;\n    let bestCrossings = currentCrossings;\n    let bestBends = Number.POSITIVE_INFINITY;\n    let bestLength = Number.POSITIVE_INFINITY;\n    for (const edge of visibleEdges) {\n      const currentPoints = pointsFor(edge);\n      const currentBends = countOrthogonalBends(currentPoints, EPS_LOCAL);\n      const currentLength = pathLength(currentPoints);\n      for (let index = 0; index <= currentPoints.length - 4; index++) {\n        for (const candidate of shortcutCandidatesAt(currentPoints, index)) {\n          const candidateBends = countOrthogonalBends(candidate, EPS_LOCAL);\n          const candidateLength = pathLength(candidate);\n          const improvesShape = candidateBends < currentBends || candidateBends === currentBends && candidateLength < currentLength - EPS_LOCAL;\n          if (!improvesShape || !candidateIsSafe(edge, candidate, currentCrossings)) {\n            continue;\n          }\n          const candidateCrossings = strictCrossingCount(edge, candidate);\n          if (candidateCrossings > bestCrossings || candidateCrossings === bestCrossings && (candidateBends > bestBends || candidateBends === bestBends && candidateLength >= bestLength)) {\n            continue;\n          }\n          bestEdge = edge;\n          bestPath = candidate;\n          bestCrossings = candidateCrossings;\n          bestBends = candidateBends;\n          bestLength = candidateLength;\n        }\n      }\n    }\n    if (!bestEdge || !bestPath) {\n      return;\n    }\n    bestEdge.points = bestPath;\n  }\n}\n__name(shortcutRedundantOrthogonalJogs, \"shortcutRedundantOrthogonalJogs\");\nfunction resolveRenderedOrthogonalCrossings(edges, nodeByIdMap) {\n  const ANCHOR = 20;\n  const EXTRA_CHANNEL_COUNT = 2;\n  const MAX_ITERATIONS = 4;\n  const MAX_PAIR_CANDIDATES_PER_EDGE = 48;\n  const realNodes = [];\n  for (const node of nodeByIdMap.values()) {\n    if (node.isGroup || node.isEdgeLabel) {\n      continue;\n    }\n    const cx = node.x ?? 0;\n    const cy = node.y ?? 0;\n    const rect = rectOfNodeBounds(node);\n    if (!rect) {\n      continue;\n    }\n    realNodes.push({\n      id: String(node.id ?? \"\"),\n      cx,\n      cy,\n      rect\n    });\n  }\n  if (realNodes.length === 0) {\n    return;\n  }\n  const nodeInfoById = new Map(realNodes.map((node) => [node.id, node]));\n  const realNodeRects = realNodes.map((node) => ({ id: node.id, rect: node.rect }));\n  const sides = [\"top\", \"bottom\", \"left\", \"right\"];\n  const outsideTracks = {\n    top: Math.min(...realNodes.map((node) => node.rect.top)) - ANCHOR,\n    bottom: Math.max(...realNodes.map((node) => node.rect.bottom)) + ANCHOR,\n    left: Math.min(...realNodes.map((node) => node.rect.left)) - ANCHOR,\n    right: Math.max(...realNodes.map((node) => node.rect.right)) + ANCHOR\n  };\n  const visibleEdges = edges.filter((edge) => !edge.isLayoutOnly);\n  const edgeIndex = new Map(visibleEdges.map((edge, index) => [edge, index]));\n  const outwardTracksForSide = /* @__PURE__ */ __name((side) => {\n    const outward = side === \"left\" || side === \"top\" ? -1 : 1;\n    const tracks = [];\n    for (let channel = 0; channel <= EXTRA_CHANNEL_COUNT; channel++) {\n      tracks.push(outsideTracks[side] + outward * ANCHOR * channel);\n    }\n    return tracks;\n  }, \"outwardTracksForSide\");\n  const replacementPointsFor = /* @__PURE__ */ __name((edge, replacements = /* @__PURE__ */ new Map()) => dedupeConsecutivePoints(\n    replacements.get(edge) ?? edge.points ?? []\n  ), \"replacementPointsFor\");\n  const crossingCountBetweenSegments = /* @__PURE__ */ __name((firstSegments, secondSegments) => {\n    let count = 0;\n    for (const firstSegment of firstSegments) {\n      for (const secondSegment of secondSegments) {\n        if (orthogonalSegmentsStrictlyCross(\n          firstSegment.a,\n          firstSegment.b,\n          secondSegment.a,\n          secondSegment.b,\n          EPS_LOCAL\n        )) {\n          count++;\n        }\n      }\n    }\n    return count;\n  }, \"crossingCountBetweenSegments\");\n  const crossingCountBetweenPaths = /* @__PURE__ */ __name((first, second) => crossingCountBetweenSegments(segmentsFor(first), segmentsFor(second)), \"crossingCountBetweenPaths\");\n  const crossingSnapshot = /* @__PURE__ */ __name((replacements = /* @__PURE__ */ new Map()) => {\n    let count = 0;\n    const pairs = [];\n    const edgeSet = /* @__PURE__ */ new Set();\n    const edgeOrder = [];\n    const addEdge = /* @__PURE__ */ __name((edge) => {\n      if (!edgeSet.has(edge)) {\n        edgeSet.add(edge);\n        edgeOrder.push(edge);\n      }\n    }, \"addEdge\");\n    for (let i = 0; i < visibleEdges.length; i++) {\n      const first = visibleEdges[i];\n      const firstPoints = replacementPointsFor(first, replacements);\n      for (let j = i + 1; j < visibleEdges.length; j++) {\n        const second = visibleEdges[j];\n        const pairCount = crossingCountBetweenPaths(\n          firstPoints,\n          replacementPointsFor(second, replacements)\n        );\n        if (pairCount > 0) {\n          count += pairCount;\n          pairs.push({ first, second, count: pairCount });\n          addEdge(first);\n          addEdge(second);\n        }\n      }\n    }\n    edgeOrder.sort((a, b) => (edgeIndex.get(a) ?? 0) - (edgeIndex.get(b) ?? 0));\n    return {\n      count,\n      pairs,\n      edgeSet,\n      edges: edgeOrder\n    };\n  }, \"crossingSnapshot\");\n  const crossingCountWithReplacements = /* @__PURE__ */ __name((current, replacements) => {\n    const changed = new Set(replacements.keys());\n    if (changed.size === 0) {\n      return current.count;\n    }\n    let currentAffected = 0;\n    for (const pair of current.pairs) {\n      if (changed.has(pair.first) || changed.has(pair.second)) {\n        currentAffected += pair.count;\n      }\n    }\n    let replacementAffected = 0;\n    for (let i = 0; i < visibleEdges.length; i++) {\n      const first = visibleEdges[i];\n      const firstChanged = changed.has(first);\n      const firstPoints = replacementPointsFor(first, replacements);\n      for (let j = i + 1; j < visibleEdges.length; j++) {\n        const second = visibleEdges[j];\n        if (!firstChanged && !changed.has(second)) {\n          continue;\n        }\n        replacementAffected += crossingCountBetweenPaths(\n          firstPoints,\n          replacementPointsFor(second, replacements)\n        );\n      }\n    }\n    return current.count - currentAffected + replacementAffected;\n  }, \"crossingCountWithReplacements\");\n  const crossingComponents = /* @__PURE__ */ __name((snapshot) => {\n    const neighbors = /* @__PURE__ */ new Map();\n    for (const pair of snapshot.pairs) {\n      const firstNeighbors = neighbors.get(pair.first) ?? /* @__PURE__ */ new Set();\n      firstNeighbors.add(pair.second);\n      neighbors.set(pair.first, firstNeighbors);\n      const secondNeighbors = neighbors.get(pair.second) ?? /* @__PURE__ */ new Set();\n      secondNeighbors.add(pair.first);\n      neighbors.set(pair.second, secondNeighbors);\n    }\n    const components = [];\n    const seen = /* @__PURE__ */ new Set();\n    for (const edge of snapshot.edges) {\n      if (seen.has(edge)) {\n        continue;\n      }\n      const queue = [edge];\n      const component = [];\n      seen.add(edge);\n      while (queue.length > 0) {\n        const current = queue.pop();\n        component.push(current);\n        for (const next of neighbors.get(current) ?? []) {\n          if (!seen.has(next)) {\n            seen.add(next);\n            queue.push(next);\n          }\n        }\n      }\n      component.sort((a, b) => (edgeIndex.get(a) ?? 0) - (edgeIndex.get(b) ?? 0));\n      if (component.length > 1) {\n        components.push(component);\n      }\n    }\n    return components;\n  }, \"crossingComponents\");\n  const endpointIdsFor = /* @__PURE__ */ __name((edge) => [edge.start, edge.end].filter(\n    (id) => Boolean(id)\n  ), \"endpointIdsFor\");\n  const pairSearchGroups = /* @__PURE__ */ __name((snapshot) => {\n    const groups = [];\n    for (const component of crossingComponents(snapshot)) {\n      const componentSet = new Set(component);\n      const componentEndpointIds = new Set(component.flatMap((edge) => endpointIdsFor(edge)));\n      const group = [...component];\n      for (const edge of visibleEdges) {\n        if (componentSet.has(edge)) {\n          continue;\n        }\n        if (endpointIdsFor(edge).some((id) => componentEndpointIds.has(id))) {\n          group.push(edge);\n        }\n      }\n      group.sort((a, b) => (edgeIndex.get(a) ?? 0) - (edgeIndex.get(b) ?? 0));\n      groups.push(group);\n    }\n    return groups;\n  }, \"pairSearchGroups\");\n  const crossingCountWithSingleReplacement = /* @__PURE__ */ __name((current, edge, replacement) => crossingCountWithReplacements(\n    current,\n    /* @__PURE__ */ new Map([[edge, replacement]])\n  ), \"crossingCountWithSingleReplacement\");\n  const currentCrossingsByEdge = /* @__PURE__ */ __name((current) => {\n    const result = /* @__PURE__ */ new Map();\n    for (const pair of current.pairs) {\n      result.set(pair.first, (result.get(pair.first) ?? 0) + pair.count);\n      result.set(pair.second, (result.get(pair.second) ?? 0) + pair.count);\n    }\n    return result;\n  }, \"currentCrossingsByEdge\");\n  const pathLength = /* @__PURE__ */ __name((points) => points.slice(1).reduce((sum, point, index) => {\n    const previous = points[index];\n    return sum + Math.abs(point.x - previous.x) + Math.abs(point.y - previous.y);\n  }, 0), \"pathLength\");\n  const totalBends = /* @__PURE__ */ __name((replacements = /* @__PURE__ */ new Map()) => visibleEdges.reduce(\n    (sum, edge) => sum + countOrthogonalBends(replacementPointsFor(edge, replacements)),\n    0\n  ), \"totalBends\");\n  const totalLength = /* @__PURE__ */ __name((replacements = /* @__PURE__ */ new Map()) => visibleEdges.reduce(\n    (sum, edge) => sum + pathLength(replacementPointsFor(edge, replacements)),\n    0\n  ), \"totalLength\");\n  const pathHasSegmentConflict = /* @__PURE__ */ __name((edge, path, replacements = /* @__PURE__ */ new Map()) => {\n    const pathSegments = segmentsFor(path);\n    for (const other of visibleEdges) {\n      if (other === edge) {\n        continue;\n      }\n      for (const candidateSegment of pathSegments) {\n        for (const otherSegment of segmentsFor(replacementPointsFor(other, replacements))) {\n          if (sameAxisSegmentOverlapLength(candidateSegment, otherSegment, 0.5) >= MIN_SHARED) {\n            return true;\n          }\n        }\n      }\n    }\n    return false;\n  }, \"pathHasSegmentConflict\");\n  const pathHitsNode = /* @__PURE__ */ __name((edge, path) => {\n    const endpointIds = [edge.start, edge.end].filter(\n      (id) => Boolean(id)\n    );\n    for (const segment of segmentsFor(path)) {\n      if (segmentHitsAnyRect(segment.a, segment.b, realNodeRects, endpointIds, -2)) {\n        return true;\n      }\n    }\n    return false;\n  }, \"pathHitsNode\");\n  const pushOrthogonalCandidate = /* @__PURE__ */ __name((candidates, points) => {\n    const candidate = simplifyPolyline(dedupeConsecutivePoints(points));\n    if (segmentsFor(candidate).length === candidate.length - 1) {\n      candidates.push(candidate);\n    }\n  }, \"pushOrthogonalCandidate\");\n  const sideIsHorizontal = /* @__PURE__ */ __name((side) => side === \"left\" || side === \"right\", \"sideIsHorizontal\");\n  const localTrackForSameSide = /* @__PURE__ */ __name((src, side, dst) => {\n    switch (side) {\n      case \"left\":\n        return Math.min(src.x, dst.x) - ANCHOR;\n      case \"right\":\n        return Math.max(src.x, dst.x) + ANCHOR;\n      case \"top\":\n        return Math.min(src.y, dst.y) - ANCHOR;\n      case \"bottom\":\n        return Math.max(src.y, dst.y) + ANCHOR;\n    }\n  }, \"localTrackForSameSide\");\n  const addSameSideCandidates = /* @__PURE__ */ __name((candidates, src, srcSide, dst) => {\n    const outward = srcSide === \"left\" || srcSide === \"top\" ? -1 : 1;\n    const trackSeeds = [localTrackForSameSide(src, srcSide, dst), outsideTracks[srcSide]];\n    for (const seed of trackSeeds) {\n      for (let channel = 0; channel <= EXTRA_CHANNEL_COUNT; channel++) {\n        pushOrthogonalCandidate(\n          candidates,\n          buildSameSideTrackPath(src, srcSide, dst, seed + outward * ANCHOR * channel)\n        );\n      }\n    }\n  }, \"addSameSideCandidates\");\n  const addHorizontalToVerticalCandidates = /* @__PURE__ */ __name((candidates, src, srcSide, dst, dstSide) => {\n    for (const xTrack of outwardTracksForSide(srcSide)) {\n      for (const yTrack of outwardTracksForSide(dstSide)) {\n        pushOrthogonalCandidate(candidates, [\n          src,\n          { x: xTrack, y: src.y },\n          { x: xTrack, y: yTrack },\n          { x: dst.x, y: yTrack },\n          dst\n        ]);\n      }\n    }\n  }, \"addHorizontalToVerticalCandidates\");\n  const addVerticalToHorizontalCandidates = /* @__PURE__ */ __name((candidates, src, srcSide, dst, dstSide) => {\n    for (const yTrack of outwardTracksForSide(srcSide)) {\n      for (const xTrack of outwardTracksForSide(dstSide)) {\n        pushOrthogonalCandidate(candidates, [\n          src,\n          { x: src.x, y: yTrack },\n          { x: xTrack, y: yTrack },\n          { x: xTrack, y: dst.y },\n          dst\n        ]);\n      }\n    }\n  }, \"addVerticalToHorizontalCandidates\");\n  const addHorizontalPairCandidates = /* @__PURE__ */ __name((candidates, src, srcSide, dst, dstSide) => {\n    const yTracks = [...outwardTracksForSide(\"top\"), ...outwardTracksForSide(\"bottom\")];\n    for (const srcTrack of outwardTracksForSide(srcSide)) {\n      for (const dstTrack of outwardTracksForSide(dstSide)) {\n        for (const yTrack of yTracks) {\n          pushOrthogonalCandidate(candidates, [\n            src,\n            { x: srcTrack, y: src.y },\n            { x: srcTrack, y: yTrack },\n            { x: dstTrack, y: yTrack },\n            { x: dstTrack, y: dst.y },\n            dst\n          ]);\n        }\n      }\n    }\n  }, \"addHorizontalPairCandidates\");\n  const addVerticalPairCandidates = /* @__PURE__ */ __name((candidates, src, srcSide, dst, dstSide) => {\n    const xTracks = [...outwardTracksForSide(\"left\"), ...outwardTracksForSide(\"right\")];\n    for (const srcTrack of outwardTracksForSide(srcSide)) {\n      for (const dstTrack of outwardTracksForSide(dstSide)) {\n        for (const xTrack of xTracks) {\n          pushOrthogonalCandidate(candidates, [\n            src,\n            { x: src.x, y: srcTrack },\n            { x: xTrack, y: srcTrack },\n            { x: xTrack, y: dstTrack },\n            { x: dst.x, y: dstTrack },\n            dst\n          ]);\n        }\n      }\n    }\n  }, \"addVerticalPairCandidates\");\n  const dedupeCandidatePaths = /* @__PURE__ */ __name((candidates) => {\n    const seen = /* @__PURE__ */ new Set();\n    return candidates.map((candidate) => dedupeConsecutivePoints(candidate)).filter((candidate) => {\n      const key = candidate.map((point) => `${point.x.toFixed(3)},${point.y.toFixed(3)}`).join(\"|\");\n      if (seen.has(key) || candidate.length < 2) {\n        return false;\n      }\n      seen.add(key);\n      return true;\n    });\n  }, \"dedupeCandidatePaths\");\n  const buildCandidatesForSides = /* @__PURE__ */ __name((src, srcSide, dst, dstSide) => {\n    const candidates = [];\n    const base = buildOrthogonalPortPath(src, srcSide, dst, dstSide, ANCHOR, EPS_LOCAL);\n    if (base) {\n      pushOrthogonalCandidate(candidates, base);\n    }\n    if (srcSide === dstSide) {\n      addSameSideCandidates(candidates, src, srcSide, dst);\n    }\n    const srcHorizontal = sideIsHorizontal(srcSide);\n    const dstHorizontal = sideIsHorizontal(dstSide);\n    if (srcHorizontal && !dstHorizontal) {\n      addHorizontalToVerticalCandidates(candidates, src, srcSide, dst, dstSide);\n    } else if (!srcHorizontal && dstHorizontal) {\n      addVerticalToHorizontalCandidates(candidates, src, srcSide, dst, dstSide);\n    } else if (srcHorizontal) {\n      addHorizontalPairCandidates(candidates, src, srcSide, dst, dstSide);\n    } else {\n      addVerticalPairCandidates(candidates, src, srcSide, dst, dstSide);\n    }\n    return dedupeCandidatePaths(candidates);\n  }, \"buildCandidatesForSides\");\n  const addVerticalDepartureOuterTrackCandidates = /* @__PURE__ */ __name((candidates, first, departure, dstNode) => {\n    const externalXTracks = [...outwardTracksForSide(\"left\"), ...outwardTracksForSide(\"right\")];\n    const externalYTracks = [...outwardTracksForSide(\"top\"), ...outwardTracksForSide(\"bottom\")];\n    for (const side of sides) {\n      const dst = portForRectSide(dstNode, side);\n      const targetYTracks = side === \"top\" || side === \"bottom\" ? outwardTracksForSide(side) : externalYTracks;\n      for (const track of externalXTracks) {\n        pushOrthogonalCandidate(candidates, [\n          first,\n          departure,\n          { x: track, y: departure.y },\n          { x: track, y: dst.y },\n          dst\n        ]);\n        for (const targetTrack of targetYTracks) {\n          pushOrthogonalCandidate(candidates, [\n            first,\n            departure,\n            { x: track, y: departure.y },\n            { x: track, y: targetTrack },\n            { x: dst.x, y: targetTrack },\n            dst\n          ]);\n        }\n      }\n    }\n  }, \"addVerticalDepartureOuterTrackCandidates\");\n  const addHorizontalDepartureOuterTrackCandidates = /* @__PURE__ */ __name((candidates, first, departure, dstNode) => {\n    const externalXTracks = [...outwardTracksForSide(\"left\"), ...outwardTracksForSide(\"right\")];\n    const externalYTracks = [...outwardTracksForSide(\"top\"), ...outwardTracksForSide(\"bottom\")];\n    for (const side of sides) {\n      const dst = portForRectSide(dstNode, side);\n      const targetXTracks = side === \"left\" || side === \"right\" ? outwardTracksForSide(side) : externalXTracks;\n      for (const track of externalYTracks) {\n        pushOrthogonalCandidate(candidates, [\n          first,\n          departure,\n          { x: departure.x, y: track },\n          { x: dst.x, y: track },\n          dst\n        ]);\n        for (const targetTrack of targetXTracks) {\n          pushOrthogonalCandidate(candidates, [\n            first,\n            departure,\n            { x: departure.x, y: track },\n            { x: targetTrack, y: track },\n            { x: targetTrack, y: dst.y },\n            dst\n          ]);\n        }\n      }\n    }\n  }, \"addHorizontalDepartureOuterTrackCandidates\");\n  const terminalPreservingOuterTrackCandidates = /* @__PURE__ */ __name((edge) => {\n    const srcId = edge.start;\n    const dstId = edge.end;\n    const dstNode = dstId ? nodeInfoById.get(dstId) : void 0;\n    if (!srcId || !dstNode) {\n      return [];\n    }\n    const points = dedupeConsecutivePoints(edge.points ?? []);\n    if (points.length < 4) {\n      return [];\n    }\n    const first = points[0];\n    const departure = points[1];\n    const candidates = [];\n    if (isVerticalSegment(first, departure, EPS_LOCAL)) {\n      addVerticalDepartureOuterTrackCandidates(candidates, first, departure, dstNode);\n    } else if (isHorizontalSegment(first, departure, EPS_LOCAL)) {\n      addHorizontalDepartureOuterTrackCandidates(candidates, first, departure, dstNode);\n    }\n    return candidates;\n  }, \"terminalPreservingOuterTrackCandidates\");\n  const candidatePathsFor = /* @__PURE__ */ __name((edge) => {\n    const srcId = edge.start;\n    const dstId = edge.end;\n    const srcNode = srcId ? nodeInfoById.get(srcId) : void 0;\n    const dstNode = dstId ? nodeInfoById.get(dstId) : void 0;\n    if (!srcNode || !dstNode) {\n      return [];\n    }\n    const candidates = [];\n    for (const srcSide of sides) {\n      const srcPort = portForRectSide(srcNode, srcSide);\n      for (const dstSide of sides) {\n        candidates.push(\n          ...buildCandidatesForSides(srcPort, srcSide, portForRectSide(dstNode, dstSide), dstSide)\n        );\n      }\n    }\n    candidates.push(...terminalPreservingOuterTrackCandidates(edge));\n    return candidates;\n  }, \"candidatePathsFor\");\n  const currentSegmentsByEdge = /* @__PURE__ */ __name(() => new Map(visibleEdges.map((edge) => [edge, segmentsFor(replacementPointsFor(edge))])), \"currentSegmentsByEdge\");\n  const sharedTrackConflictsFor = /* @__PURE__ */ __name((edge, candidateSegments, baseSegments) => {\n    const conflicts = /* @__PURE__ */ new Set();\n    for (const other of visibleEdges) {\n      if (other === edge) {\n        continue;\n      }\n      const otherSegments = baseSegments.get(other) ?? segmentsFor(replacementPointsFor(other));\n      if (candidateSegments.some(\n        (candidateSegment) => otherSegments.some(\n          (otherSegment) => sameAxisSegmentOverlapLength(candidateSegment, otherSegment, 0.5) >= MIN_SHARED\n        )\n      )) {\n        conflicts.add(other);\n      }\n    }\n    return conflicts;\n  }, \"sharedTrackConflictsFor\");\n  const pairCandidatesFor = /* @__PURE__ */ __name((edge, current, baseSegments, crossingCountByEdge) => {\n    const seen = /* @__PURE__ */ new Set();\n    const candidates = candidatePathsFor(edge).map((candidate) => simplifyPolyline(dedupeConsecutivePoints(candidate))).filter((candidate) => {\n      if (pathHitsNode(edge, candidate)) {\n        return false;\n      }\n      const key = candidate.map((point) => `${point.x.toFixed(3)},${point.y.toFixed(3)}`).join(\"|\");\n      if (seen.has(key) || candidate.length < 2) {\n        return false;\n      }\n      seen.add(key);\n      return true;\n    }).map((candidate) => {\n      const candidateSegments = segmentsFor(candidate);\n      let replacementAffected = 0;\n      for (const other of visibleEdges) {\n        if (other === edge) {\n          continue;\n        }\n        replacementAffected += crossingCountBetweenSegments(\n          candidateSegments,\n          baseSegments.get(other) ?? segmentsFor(replacementPointsFor(other))\n        );\n      }\n      return {\n        candidate,\n        candidateSegments,\n        crossings: current.count - (crossingCountByEdge.get(edge) ?? 0) + replacementAffected,\n        bends: countOrthogonalBends(candidate, EPS_LOCAL),\n        totalBends: countOrthogonalBends(candidate),\n        length: pathLength(candidate)\n      };\n    }).filter(({ crossings }) => crossings <= current.count).sort((a, b) => a.crossings - b.crossings || a.bends - b.bends || a.length - b.length);\n    return candidates.slice(0, MAX_PAIR_CANDIDATES_PER_EDGE).map((candidate) => {\n      return {\n        path: candidate.candidate,\n        segments: candidate.candidateSegments,\n        sharedTrackConflicts: sharedTrackConflictsFor(\n          edge,\n          candidate.candidateSegments,\n          baseSegments\n        ),\n        totalBends: candidate.totalBends,\n        length: candidate.length\n      };\n    });\n  }, \"pairCandidatesFor\");\n  const pairCrossingCount = /* @__PURE__ */ __name((current, firstEdge, firstCandidate, secondEdge, secondCandidate, baseSegments) => {\n    let currentAffected = 0;\n    for (const pair of current.pairs) {\n      if (pair.first === firstEdge || pair.second === firstEdge || pair.first === secondEdge || pair.second === secondEdge) {\n        currentAffected += pair.count;\n      }\n    }\n    let replacementAffected = crossingCountBetweenSegments(\n      firstCandidate.segments,\n      secondCandidate.segments\n    );\n    for (const other of visibleEdges) {\n      if (other === firstEdge || other === secondEdge) {\n        continue;\n      }\n      const otherSegments = baseSegments.get(other) ?? segmentsFor(replacementPointsFor(other));\n      replacementAffected += crossingCountBetweenSegments(firstCandidate.segments, otherSegments) + crossingCountBetweenSegments(secondCandidate.segments, otherSegments);\n    }\n    return current.count - currentAffected + replacementAffected;\n  }, \"pairCrossingCount\");\n  const conflictsOnlyWith = /* @__PURE__ */ __name((candidate, edge) => {\n    for (const conflict of candidate.sharedTrackConflicts) {\n      if (conflict !== edge) {\n        return false;\n      }\n    }\n    return true;\n  }, \"conflictsOnlyWith\");\n  const candidatesShareTrack = /* @__PURE__ */ __name((firstCandidate, secondCandidate) => firstCandidate.segments.some(\n    (firstSegment) => secondCandidate.segments.some(\n      (secondSegment) => sameAxisSegmentOverlapLength(firstSegment, secondSegment, 0.5) >= MIN_SHARED\n    )\n  ), \"candidatesShareTrack\");\n  const pairCandidatesAreCompatible = /* @__PURE__ */ __name((first, firstCandidate, second, secondCandidate) => conflictsOnlyWith(firstCandidate, second.edge) && conflictsOnlyWith(secondCandidate, first.edge) && !candidatesShareTrack(firstCandidate, secondCandidate), \"pairCandidatesAreCompatible\");\n  const scorePairReplacement = /* @__PURE__ */ __name((context, first, firstCandidate, second, secondCandidate) => {\n    const crossings = pairCrossingCount(\n      context.current,\n      first.edge,\n      firstCandidate,\n      second.edge,\n      secondCandidate,\n      context.baseSegments\n    );\n    if (crossings >= context.current.count) {\n      return void 0;\n    }\n    return {\n      replacements: /* @__PURE__ */ new Map([\n        [first.edge, firstCandidate.path],\n        [second.edge, secondCandidate.path]\n      ]),\n      crossings,\n      bends: context.currentBends - (context.baseBendsByEdge.get(first.edge) ?? 0) - (context.baseBendsByEdge.get(second.edge) ?? 0) + firstCandidate.totalBends + secondCandidate.totalBends,\n      length: context.currentLength - (context.baseLengthByEdge.get(first.edge) ?? 0) - (context.baseLengthByEdge.get(second.edge) ?? 0) + firstCandidate.length + secondCandidate.length\n    };\n  }, \"scorePairReplacement\");\n  const pairScoreIsBetter = /* @__PURE__ */ __name((candidate, best) => candidate.crossings < best.crossings || candidate.crossings === best.crossings && (candidate.bends < best.bends || candidate.bends === best.bends && candidate.length < best.length), \"pairScoreIsBetter\");\n  const bestScoreForOptionPair = /* @__PURE__ */ __name((context, first, second, best) => {\n    let pairBest = best;\n    for (const firstCandidate of first.candidates) {\n      for (const secondCandidate of second.candidates) {\n        if (!pairCandidatesAreCompatible(first, firstCandidate, second, secondCandidate)) {\n          continue;\n        }\n        const score = scorePairReplacement(context, first, firstCandidate, second, secondCandidate);\n        if (score && pairScoreIsBetter(score, pairBest)) {\n          pairBest = score;\n        }\n      }\n    }\n    return pairBest;\n  }, \"bestScoreForOptionPair\");\n  const bestPairedReplacement = /* @__PURE__ */ __name((current) => {\n    const currentBends = totalBends();\n    const currentLength = totalLength();\n    const baseSegments = currentSegmentsByEdge();\n    const crossingCountByEdge = currentCrossingsByEdge(current);\n    const baseBendsByEdge = new Map(\n      visibleEdges.map((edge) => [edge, countOrthogonalBends(replacementPointsFor(edge))])\n    );\n    const baseLengthByEdge = new Map(\n      visibleEdges.map((edge) => [edge, pathLength(replacementPointsFor(edge))])\n    );\n    const optionsByEdge = /* @__PURE__ */ new Map();\n    const groups = pairSearchGroups(current);\n    for (const group of groups) {\n      for (const edge of group) {\n        if (optionsByEdge.has(edge)) {\n          continue;\n        }\n        const candidates = pairCandidatesFor(edge, current, baseSegments, crossingCountByEdge);\n        if (candidates.length > 0) {\n          optionsByEdge.set(edge, { edge, candidates });\n        }\n      }\n    }\n    let best = {\n      replacements: /* @__PURE__ */ new Map(),\n      crossings: current.count,\n      bends: currentBends,\n      length: currentLength\n    };\n    const scoringContext = {\n      current,\n      currentBends,\n      currentLength,\n      baseBendsByEdge,\n      baseLengthByEdge,\n      baseSegments\n    };\n    for (const group of groups) {\n      const crossingEdgeSet = new Set(group.filter((edge) => current.edgeSet.has(edge)));\n      const options = group.map((edge) => optionsByEdge.get(edge)).filter((option) => Boolean(option));\n      for (let i = 0; i < options.length; i++) {\n        const first = options[i];\n        for (let j = i + 1; j < options.length; j++) {\n          const second = options[j];\n          if (!crossingEdgeSet.has(first.edge) && !crossingEdgeSet.has(second.edge)) {\n            continue;\n          }\n          best = bestScoreForOptionPair(scoringContext, first, second, best);\n        }\n      }\n    }\n    return best.replacements.size > 0 ? best.replacements : void 0;\n  }, \"bestPairedReplacement\");\n  for (let iteration = 0; iteration < MAX_ITERATIONS; iteration++) {\n    const current = crossingSnapshot();\n    const currentCrossings = current.count;\n    if (currentCrossings === 0) {\n      return;\n    }\n    let bestEdge;\n    let bestPath;\n    let bestCrossings = currentCrossings;\n    let bestBends = Number.POSITIVE_INFINITY;\n    for (const edge of current.edges) {\n      const currentEdgeBends = countOrthogonalBends(replacementPointsFor(edge), EPS_LOCAL);\n      for (const candidate of candidatePathsFor(edge)) {\n        const candidateHitsNode = pathHitsNode(edge, candidate);\n        const candidateHasSegmentConflict = !candidateHitsNode && pathHasSegmentConflict(edge, candidate);\n        const candidateCrossings = crossingCountWithSingleReplacement(current, edge, candidate);\n        const candidateBends = countOrthogonalBends(candidate, EPS_LOCAL);\n        if (candidateHitsNode || candidateHasSegmentConflict) {\n          continue;\n        }\n        const improvesCurrentEdge = candidateCrossings < currentCrossings || candidateCrossings === currentCrossings && candidateBends < currentEdgeBends;\n        if (!improvesCurrentEdge) {\n          continue;\n        }\n        if (candidateCrossings > bestCrossings || candidateCrossings === bestCrossings && candidateBends >= bestBends) {\n          continue;\n        }\n        bestEdge = edge;\n        bestPath = candidate;\n        bestCrossings = candidateCrossings;\n        bestBends = candidateBends;\n      }\n    }\n    if (bestEdge && bestPath) {\n      bestEdge.points = bestPath;\n      continue;\n    }\n    const pairedReplacement = bestPairedReplacement(current);\n    if (!pairedReplacement) {\n      return;\n    }\n    for (const [edge, points] of pairedReplacement) {\n      edge.points = points;\n    }\n  }\n}\n__name(resolveRenderedOrthogonalCrossings, \"resolveRenderedOrthogonalCrossings\");\n\n// src/rendering-util/layout-algorithms/swimlanes/direction/detourSimplification.ts\nvar EPS4 = 1e-3;\nvar MIN_SHARED2 = 8;\nfunction simplifyDetouredEdges(edges, nodes) {\n  const { nodeInfoById, realNodeRects } = collectRealNodeBounds(nodes);\n  const sides = [\"top\", \"bottom\", \"left\", \"right\"];\n  const ANCHOR = 20;\n  const outsideTracks = {\n    top: Math.min(...realNodeRects.map((node) => node.rect.top)) - ANCHOR,\n    bottom: Math.max(...realNodeRects.map((node) => node.rect.bottom)) + ANCHOR,\n    left: Math.min(...realNodeRects.map((node) => node.rect.left)) - ANCHOR,\n    right: Math.max(...realNodeRects.map((node) => node.rect.right)) + ANCHOR\n  };\n  const buildOrthogonalPathCandidates = /* @__PURE__ */ __name((src, srcSide, dst, dstSide) => {\n    const paths = [];\n    const base = buildOrthogonalPortPath(src, srcSide, dst, dstSide, ANCHOR, EPS4);\n    if (base) {\n      paths.push(base);\n    }\n    if (srcSide === dstSide) {\n      paths.push(buildSameSideTrackPath(src, srcSide, dst, outsideTracks[srcSide]));\n    }\n    return paths;\n  }, \"buildOrthogonalPathCandidates\");\n  const pathHitsNode = /* @__PURE__ */ __name((pts, excludeIds) => {\n    for (let i = 0; i < pts.length - 1; i++) {\n      const a = pts[i];\n      const b = pts[i + 1];\n      if (segmentHitsAnyRect(a, b, realNodeRects, excludeIds, 1)) {\n        return true;\n      }\n    }\n    return false;\n  }, \"pathHitsNode\");\n  const pathConflictCount = /* @__PURE__ */ __name((path, currentEdge, includeIncidentEdges = false) => {\n    let conflicts = 0;\n    const pathSegments = orthogonalSegmentsForPoints(path, EPS4);\n    const currentStart = currentEdge.start;\n    const currentEnd = currentEdge.end;\n    for (const other of edges) {\n      if (other === currentEdge || other.isLayoutOnly) {\n        continue;\n      }\n      const otherStart = other.start;\n      const otherEnd = other.end;\n      if (!includeIncidentEdges && currentStart && currentEnd && (otherStart === currentStart || otherStart === currentEnd || otherEnd === currentStart || otherEnd === currentEnd)) {\n        continue;\n      }\n      const otherPts = other.points;\n      if (!otherPts || otherPts.length < 2) {\n        continue;\n      }\n      for (const pathSegment of pathSegments) {\n        for (const otherSegment of orthogonalSegmentsForPoints(otherPts, EPS4)) {\n          if (orthogonalSegmentsCross(\n            pathSegment.a,\n            pathSegment.b,\n            otherSegment.a,\n            otherSegment.b,\n            EPS4,\n            EPS4\n          )) {\n            conflicts++;\n            continue;\n          }\n          if (sameAxisSegmentOverlapLength(pathSegment, otherSegment, EPS4) >= MIN_SHARED2) {\n            conflicts++;\n          }\n        }\n      }\n    }\n    return conflicts;\n  }, \"pathConflictCount\");\n  const BEND_THRESHOLD = 4;\n  const nearestSideOfRect = /* @__PURE__ */ __name((pt, info) => {\n    const dTop = Math.abs(pt.y - info.rect.top);\n    const dBottom = Math.abs(pt.y - info.rect.bottom);\n    const dLeft = Math.abs(pt.x - info.rect.left);\n    const dRight = Math.abs(pt.x - info.rect.right);\n    let best = \"top\";\n    let bestDist = dTop;\n    if (dBottom < bestDist) {\n      best = \"bottom\";\n      bestDist = dBottom;\n    }\n    if (dLeft < bestDist) {\n      best = \"left\";\n      bestDist = dLeft;\n    }\n    if (dRight < bestDist) {\n      best = \"right\";\n      bestDist = dRight;\n    }\n    return best;\n  }, \"nearestSideOfRect\");\n  const faceClaims = /* @__PURE__ */ new Map();\n  const addFaceClaim = /* @__PURE__ */ __name((nodeId, side, edgeId) => {\n    const claims = faceClaims.get(nodeId) ?? [];\n    claims.push({ side, edgeId });\n    faceClaims.set(nodeId, claims);\n  }, \"addFaceClaim\");\n  for (const e of edges) {\n    if (e.isLayoutOnly) {\n      continue;\n    }\n    const pts = e.points ?? [];\n    if (pts.length < 1) {\n      continue;\n    }\n    const eId = e.id ?? \"\";\n    const startId = e.start;\n    const endId = e.end;\n    if (startId) {\n      const info = nodeInfoById.get(startId);\n      if (info) {\n        addFaceClaim(startId, nearestSideOfRect(pts[0], info), eId);\n      }\n    }\n    if (endId) {\n      const info = nodeInfoById.get(endId);\n      if (info) {\n        addFaceClaim(endId, nearestSideOfRect(pts[pts.length - 1], info), eId);\n      }\n    }\n  }\n  const faceIsClaimed = /* @__PURE__ */ __name((nodeId, side, ignoreEdgeId) => {\n    return faceClaims.get(nodeId)?.some((c) => c.edgeId !== ignoreEdgeId && c.side === side) ?? false;\n  }, \"faceIsClaimed\");\n  for (const edge of edges) {\n    if (edge.isLayoutOnly) {\n      continue;\n    }\n    const pts = edge.points;\n    if (!pts || pts.length < 2) {\n      continue;\n    }\n    const currentBends = countOrthogonalBends(pts, EPS4);\n    if (currentBends < BEND_THRESHOLD) {\n      continue;\n    }\n    const srcId = edge.start;\n    const dstId = edge.end;\n    if (!srcId || !dstId) {\n      continue;\n    }\n    const srcInfo = nodeInfoById.get(srcId);\n    const dstInfo = nodeInfoById.get(dstId);\n    if (!srcInfo || !dstInfo) {\n      continue;\n    }\n    const edgeId = edge.id ?? \"\";\n    const currentCrossingConflicts = pathConflictCount(pts, edge, true);\n    const currentNonIncidentConflicts = pathConflictCount(pts, edge);\n    let bestPath;\n    let bestCrossingConflicts = currentCrossingConflicts;\n    let bestBends = currentBends;\n    for (const srcSide of sides) {\n      if (faceIsClaimed(srcId, srcSide, edgeId)) {\n        continue;\n      }\n      const srcPort = portForRectSide(srcInfo, srcSide);\n      for (const dstSide of sides) {\n        if (faceIsClaimed(dstId, dstSide, edgeId)) {\n          continue;\n        }\n        const dstPort = portForRectSide(dstInfo, dstSide);\n        for (const path of buildOrthogonalPathCandidates(srcPort, srcSide, dstPort, dstSide)) {\n          if (pathHitsNode(path, [srcId, dstId])) {\n            continue;\n          }\n          const pathBends = countOrthogonalBends(path, EPS4);\n          if (currentCrossingConflicts > 0) {\n            const pathCrossingConflicts = pathConflictCount(path, edge, true);\n            if (pathCrossingConflicts > bestCrossingConflicts || pathCrossingConflicts === bestCrossingConflicts && pathBends >= bestBends) {\n              continue;\n            }\n            bestCrossingConflicts = pathCrossingConflicts;\n            bestBends = pathBends;\n            bestPath = path;\n            continue;\n          }\n          if (pathConflictCount(path, edge) > currentNonIncidentConflicts) {\n            continue;\n          }\n          if (pathBends < bestBends) {\n            bestBends = pathBends;\n            bestPath = path;\n          }\n        }\n      }\n    }\n    if (bestPath) {\n      edge.points = bestPath;\n      const refreshSrc = faceClaims.get(srcId);\n      if (refreshSrc) {\n        faceClaims.set(\n          srcId,\n          refreshSrc.filter((c) => c.edgeId !== edgeId)\n        );\n      }\n      const refreshDst = faceClaims.get(dstId);\n      if (refreshDst) {\n        faceClaims.set(\n          dstId,\n          refreshDst.filter((c) => c.edgeId !== edgeId)\n        );\n      }\n      addFaceClaim(srcId, nearestSideOfRect(bestPath[0], srcInfo), edgeId);\n      addFaceClaim(dstId, nearestSideOfRect(bestPath[bestPath.length - 1], dstInfo), edgeId);\n    }\n  }\n}\n__name(simplifyDetouredEdges, \"simplifyDetouredEdges\");\n\n// src/rendering-util/layout-algorithms/swimlanes/direction/labelAnchoring.ts\nvar EPS5 = 1e-3;\nvar MARKER_CLEARANCE_LENGTH = 10;\nvar MARKER_CLEARANCE_HALF_WIDTH = 7;\nfunction markerClearanceRectFor(pts, atStart) {\n  const terminalIndex = atStart ? 0 : pts.length - 1;\n  const step = atStart ? 1 : -1;\n  const tip = pts[terminalIndex];\n  const inner = pts[terminalIndex + step];\n  if (!tip || !inner) {\n    return void 0;\n  }\n  const dx = inner.x - tip.x;\n  const dy = inner.y - tip.y;\n  const len = Math.abs(dx) + Math.abs(dy);\n  if (len < EPS5) {\n    return void 0;\n  }\n  if (Math.abs(dy) <= EPS5) {\n    const x2 = tip.x + Math.sign(dx) * MARKER_CLEARANCE_LENGTH;\n    return {\n      left: Math.min(tip.x, x2),\n      right: Math.max(tip.x, x2),\n      top: tip.y - MARKER_CLEARANCE_HALF_WIDTH,\n      bottom: tip.y + MARKER_CLEARANCE_HALF_WIDTH\n    };\n  }\n  if (Math.abs(dx) <= EPS5) {\n    const y2 = tip.y + Math.sign(dy) * MARKER_CLEARANCE_LENGTH;\n    return {\n      left: tip.x - MARKER_CLEARANCE_HALF_WIDTH,\n      right: tip.x + MARKER_CLEARANCE_HALF_WIDTH,\n      top: Math.min(tip.y, y2),\n      bottom: Math.max(tip.y, y2)\n    };\n  }\n  return {\n    left: Math.min(tip.x, inner.x),\n    right: Math.max(tip.x, inner.x),\n    top: Math.min(tip.y, inner.y),\n    bottom: Math.max(tip.y, inner.y)\n  };\n}\n__name(markerClearanceRectFor, \"markerClearanceRectFor\");\nfunction normalizeRect(rect) {\n  return {\n    left: Math.min(rect.left, rect.right),\n    right: Math.max(rect.left, rect.right),\n    top: Math.min(rect.top, rect.bottom),\n    bottom: Math.max(rect.top, rect.bottom)\n  };\n}\n__name(normalizeRect, \"normalizeRect\");\nfunction labelOverlapsOwnMarker(rect, pts) {\n  const visiblePts = dedupeConsecutivePoints(pts);\n  const startMarker = markerClearanceRectFor(visiblePts, true);\n  const endMarker = markerClearanceRectFor(visiblePts, false);\n  return [startMarker, endMarker].some(\n    (marker) => marker && rectsOverlap(rect, normalizeRect(marker))\n  );\n}\n__name(labelOverlapsOwnMarker, \"labelOverlapsOwnMarker\");\nfunction anchorLabelsToPolyline(edges, nodeByIdMap) {\n  const allEdgeSegments = [];\n  for (const other of edges) {\n    if (other.isLayoutOnly) {\n      continue;\n    }\n    const pts = other.points;\n    if (!pts || pts.length < 2) {\n      continue;\n    }\n    for (let i = 0; i < pts.length - 1; i++) {\n      allEdgeSegments.push({ edgeId: other.id, p1: pts[i], p2: pts[i + 1] });\n    }\n  }\n  const foreignNodeRects = [];\n  const laneGroups = [];\n  for (const n of nodeByIdMap.values()) {\n    const isGroup = n.isGroup;\n    const parentId = n.parentId;\n    if (isGroup && !parentId) {\n      const rect2 = rectOfNodeBounds(n);\n      if (rect2) {\n        laneGroups.push({\n          id: n.id,\n          rect: rect2\n        });\n      }\n      continue;\n    }\n    if (isGroup) {\n      continue;\n    }\n    if (n.isEdgeLabel) {\n      continue;\n    }\n    const rect = rectOfNodeBounds(n);\n    if (!rect) {\n      continue;\n    }\n    foreignNodeRects.push({\n      nodeId: n.id,\n      rect\n    });\n  }\n  const LABEL_PLACEMENT_BUFFER = 3;\n  const LABEL_LANE_MARGIN = 1;\n  const LABEL_ENDPOINT_CLEARANCE = 12;\n  const labelOverlapsForeignNode = /* @__PURE__ */ __name((labelId, rect) => {\n    const buffered = inflateRect(rect, LABEL_PLACEMENT_BUFFER);\n    for (const { nodeId, rect: nr } of foreignNodeRects) {\n      if (nodeId === labelId) {\n        continue;\n      }\n      if (rectsOverlap(buffered, nr)) {\n        return true;\n      }\n    }\n    return false;\n  }, \"labelOverlapsForeignNode\");\n  const labelOverlapsForeignEdge = /* @__PURE__ */ __name((edgeId, rect) => {\n    const buffered = inflateRect(rect, LABEL_PLACEMENT_BUFFER);\n    for (const s of allEdgeSegments) {\n      if (s.edgeId === edgeId) {\n        continue;\n      }\n      if (segmentBoundsOverlapRect(s.p1, s.p2, buffered)) {\n        return true;\n      }\n    }\n    return false;\n  }, \"labelOverlapsForeignEdge\");\n  const labelOverlapsAnything = /* @__PURE__ */ __name((labelId, edgeId, rect) => labelOverlapsForeignNode(labelId, rect) || labelOverlapsForeignEdge(edgeId, rect), \"labelOverlapsAnything\");\n  const placedLabelRects = [];\n  const findContainingLane = /* @__PURE__ */ __name((rect) => {\n    for (const { id, rect: laneRect } of laneGroups) {\n      if (rectContainsRect(laneRect, rect)) {\n        return id;\n      }\n    }\n    return void 0;\n  }, \"findContainingLane\");\n  const overlapsPlacedLabel = /* @__PURE__ */ __name((labelId, rect) => placedLabelRects.some(\n    (placed) => placed.labelId !== labelId && rectsOverlap(rect, placed.rect)\n  ), \"overlapsPlacedLabel\");\n  for (const edge of edges) {\n    if (edge.isLayoutOnly) {\n      continue;\n    }\n    const labelId = edge.labelNodeId;\n    if (!labelId) {\n      continue;\n    }\n    const labelNode = nodeByIdMap.get(labelId);\n    if (!labelNode) {\n      continue;\n    }\n    const pts = edge.points;\n    if (!pts || pts.length < 2) {\n      continue;\n    }\n    const lw = labelNode.width ?? 0;\n    const lh = labelNode.height ?? 0;\n    if (lw <= 0 || lh <= 0) {\n      continue;\n    }\n    const segments = [];\n    for (let i = 0; i < pts.length - 1; i++) {\n      const a = pts[i];\n      const b = pts[i + 1];\n      const dx = Math.abs(a.x - b.x);\n      const dy = Math.abs(a.y - b.y);\n      if (dx < EPS5 && dy < EPS5) {\n        continue;\n      }\n      if (dx >= EPS5 && dy >= EPS5) {\n        continue;\n      }\n      segments.push({\n        idx: i,\n        length: dx + dy,\n        orientation: dx >= EPS5 ? \"horizontal\" : \"vertical\",\n        midX: (a.x + b.x) / 2,\n        midY: (a.y + b.y) / 2\n      });\n    }\n    if (segments.length === 0) {\n      continue;\n    }\n    const middleSegments = segments.length >= 3 ? segments.filter((s) => s.idx > 0 && s.idx < segments.length - 1) : segments;\n    const poolBase = middleSegments.length > 0 ? middleSegments : segments;\n    const labelLongAxis = lw >= lh ? \"horizontal\" : \"vertical\";\n    const rankSegments = /* @__PURE__ */ __name((pool) => {\n      return [...pool].sort((a, b) => {\n        const aLongAxis = a.orientation === labelLongAxis;\n        const bLongAxis = b.orientation === labelLongAxis;\n        if (aLongAxis !== bLongAxis) {\n          return aLongAxis ? -1 : 1;\n        }\n        const aFits = a.length >= (a.orientation === \"horizontal\" ? lw : lh) + 2;\n        const bFits = b.length >= (b.orientation === \"horizontal\" ? lw : lh) + 2;\n        if (aFits !== bFits) {\n          return aFits ? -1 : 1;\n        }\n        return b.length - a.length;\n      });\n    }, \"rankSegments\");\n    const firstVisibleSegment = segments[0];\n    const lastVisibleSegment = segments[segments.length - 1];\n    const ALONG_SEGMENT_TS = [0.5, 0.25, 0.75, 0.05, 0.95, 0.15, 0.85, 0.1, 0.9];\n    const anchorAtT = /* @__PURE__ */ __name((seg, t) => {\n      const a = pts[seg.idx];\n      const b = pts[seg.idx + 1];\n      return {\n        midX: a.x + (b.x - a.x) * t,\n        midY: a.y + (b.y - a.y) * t\n      };\n    }, \"anchorAtT\");\n    const clamp = /* @__PURE__ */ __name((value, min, max) => Math.min(max, Math.max(min, value)), \"clamp\");\n    const pointInsideRectInclusive = /* @__PURE__ */ __name((point, rect) => point.midX >= rect.left - EPS5 && point.midX <= rect.right + EPS5 && point.midY >= rect.top - EPS5 && point.midY <= rect.bottom + EPS5, \"pointInsideRectInclusive\");\n    const placementForAnchor = /* @__PURE__ */ __name((anchor) => {\n      const centeredRect = rectFromCenterSize(anchor.midX, anchor.midY, lw, lh);\n      const centeredLane = findContainingLane(centeredRect);\n      if (centeredLane) {\n        return { laneId: centeredLane, anchor, rect: centeredRect };\n      }\n      const containingLane = laneGroups.find(({ rect }) => pointInsideRectInclusive(anchor, rect));\n      if (!containingLane) {\n        return void 0;\n      }\n      const minX = containingLane.rect.left + lw / 2 + LABEL_LANE_MARGIN;\n      const maxX = containingLane.rect.right - lw / 2 - LABEL_LANE_MARGIN;\n      const minY = containingLane.rect.top + lh / 2 + LABEL_LANE_MARGIN;\n      const maxY = containingLane.rect.bottom - lh / 2 - LABEL_LANE_MARGIN;\n      if (minX > maxX || minY > maxY) {\n        return void 0;\n      }\n      const clampedAnchor = {\n        midX: clamp(anchor.midX, minX, maxX),\n        midY: clamp(anchor.midY, minY, maxY)\n      };\n      const clampedRect = rectFromCenterSize(clampedAnchor.midX, clampedAnchor.midY, lw, lh);\n      return pointInsideRectInclusive(anchor, clampedRect) ? { laneId: containingLane.id, anchor: clampedAnchor, rect: clampedRect } : void 0;\n    }, \"placementForAnchor\");\n    const distanceAlongSegment = /* @__PURE__ */ __name((seg, anchor, endpoint) => seg.orientation === \"horizontal\" ? Math.abs(anchor.midX - endpoint.x) : Math.abs(anchor.midY - endpoint.y), \"distanceAlongSegment\");\n    const labelClearsTerminalEndpoints = /* @__PURE__ */ __name((seg, anchor) => {\n      const labelHalfExtent = seg.orientation === \"horizontal\" ? lw / 2 : lh / 2;\n      const requiredDistance = labelHalfExtent + LABEL_ENDPOINT_CLEARANCE;\n      if (seg === firstVisibleSegment) {\n        const start = pts[seg.idx];\n        if (distanceAlongSegment(seg, anchor, start) + EPS5 < requiredDistance) {\n          return false;\n        }\n      }\n      if (seg === lastVisibleSegment) {\n        const end = pts[seg.idx + 1];\n        if (distanceAlongSegment(seg, anchor, end) + EPS5 < requiredDistance) {\n          return false;\n        }\n      }\n      return true;\n    }, \"labelClearsTerminalEndpoints\");\n    const tryPool = /* @__PURE__ */ __name((pool) => {\n      const rankedPool = rankSegments(pool);\n      for (const seg of rankedPool) {\n        for (const t of ALONG_SEGMENT_TS) {\n          const anchor = anchorAtT(seg, t);\n          if (!labelClearsTerminalEndpoints(seg, anchor)) {\n            continue;\n          }\n          const placement = placementForAnchor(anchor);\n          if (!placement) {\n            continue;\n          }\n          if (labelOverlapsOwnMarker(placement.rect, pts)) {\n            continue;\n          }\n          if (overlapsPlacedLabel(labelId, placement.rect)) {\n            continue;\n          }\n          if (!labelOverlapsAnything(labelId, edge.id, placement.rect)) {\n            return { laneId: placement.laneId, anchor: placement.anchor };\n          }\n        }\n      }\n      return void 0;\n    }, \"tryPool\");\n    const findLaneContainingFallback = /* @__PURE__ */ __name((pool, requireEndpointClearance, allowForeignEdgeOverlap = false) => {\n      const rankedPool = rankSegments(pool);\n      for (const seg of rankedPool) {\n        const anchor = { midX: seg.midX, midY: seg.midY };\n        if (requireEndpointClearance && !labelClearsTerminalEndpoints(seg, anchor)) {\n          continue;\n        }\n        const placement = placementForAnchor(anchor);\n        if (placement && !labelOverlapsOwnMarker(placement.rect, pts) && !overlapsPlacedLabel(labelId, placement.rect) && !labelOverlapsForeignNode(labelId, placement.rect) && (allowForeignEdgeOverlap || !labelOverlapsForeignEdge(edge.id, placement.rect))) {\n          return { laneId: placement.laneId, anchor: placement.anchor };\n        }\n      }\n      return void 0;\n    }, \"findLaneContainingFallback\");\n    const chosen = tryPool(poolBase) ?? (poolBase.length < segments.length ? tryPool(segments) : void 0) ?? findLaneContainingFallback(segments, true) ?? findLaneContainingFallback(segments, false) ?? findLaneContainingFallback(segments, false, true);\n    if (chosen) {\n      labelNode.x = chosen.anchor.midX;\n      labelNode.y = chosen.anchor.midY;\n      labelNode.parentId = chosen.laneId;\n      const chosenRect = rectFromCenterSize(chosen.anchor.midX, chosen.anchor.midY, lw, lh);\n      const priorIdx = placedLabelRects.findIndex((placed) => placed.labelId === labelId);\n      if (priorIdx >= 0) {\n        placedLabelRects[priorIdx] = { labelId, rect: chosenRect };\n      } else {\n        placedLabelRects.push({ labelId, rect: chosenRect });\n      }\n    }\n  }\n}\n__name(anchorLabelsToPolyline, \"anchorLabelsToPolyline\");\n\n// src/rendering-util/layout-algorithms/swimlanes/direction/siblingSharedFaceRouting.ts\nvar EPS6 = 1e-6;\nvar MIN_PORT_SPACING2 = 8;\nvar PORT_SHIFT2 = MIN_PORT_SPACING2 / 2;\nvar LABEL_CLEARANCE_BUFFER = 3;\nfunction pairKey(a, b) {\n  return a < b ? `${a}::${b}` : `${b}::${a}`;\n}\n__name(pairKey, \"pairKey\");\nfunction straightenCollinearSiblingDetours(edges, nodes) {\n  const { nodeInfoById, realNodeRects } = collectRealNodeBounds(nodes);\n  const labelDimById = /* @__PURE__ */ new Map();\n  for (const n of nodes) {\n    const id = n.id;\n    if (n.isGroup) {\n      continue;\n    }\n    if (n.isEdgeLabel) {\n      labelDimById.set(id, {\n        w: n.width ?? 0,\n        h: n.height ?? 0\n      });\n      continue;\n    }\n  }\n  const labelClearanceFor = /* @__PURE__ */ __name((thisEdge, thisSrcId, thisDstId, axis) => {\n    const targetPair = pairKey(thisSrcId, thisDstId);\n    let maxHalf = 0;\n    const consider = /* @__PURE__ */ __name((labelId) => {\n      if (!labelId) {\n        return;\n      }\n      const dim = labelDimById.get(labelId);\n      if (!dim) {\n        return;\n      }\n      const half = axis === \"x\" ? dim.w / 2 : dim.h / 2;\n      if (half > maxHalf) {\n        maxHalf = half;\n      }\n    }, \"consider\");\n    consider(thisEdge.labelNodeId);\n    for (const other of edges) {\n      if (other === thisEdge) {\n        continue;\n      }\n      if (other.isLayoutOnly) {\n        continue;\n      }\n      const oSrc = other.start;\n      const oDst = other.end;\n      if (!oSrc || !oDst) {\n        continue;\n      }\n      if (pairKey(oSrc, oDst) !== targetPair) {\n        continue;\n      }\n      consider(other.labelNodeId);\n    }\n    return maxHalf > 0 ? maxHalf + LABEL_CLEARANCE_BUFFER : 0;\n  }, \"labelClearanceFor\");\n  for (const edge of edges) {\n    if (edge.isLayoutOnly) {\n      continue;\n    }\n    const pts = edge.points;\n    if (!classifyThreeSegmentRoute(pts, EPS6)) {\n      continue;\n    }\n    const nodePair = getNodePairGeometry(edge, nodeInfoById, EPS6);\n    if (!nodePair) {\n      continue;\n    }\n    const { srcId, dstId, srcInfo, dstInfo, collinearX, collinearY } = nodePair;\n    if (collinearX === collinearY) {\n      continue;\n    }\n    let targetSrc;\n    let targetDst;\n    if (collinearX) {\n      const dstBelow = dstInfo.cy > srcInfo.cy;\n      targetSrc = { x: srcInfo.cx, y: dstBelow ? srcInfo.rect.bottom : srcInfo.rect.top };\n      targetDst = { x: dstInfo.cx, y: dstBelow ? dstInfo.rect.top : dstInfo.rect.bottom };\n    } else {\n      const dstEast = dstInfo.cx > srcInfo.cx;\n      targetSrc = { x: dstEast ? srcInfo.rect.right : srcInfo.rect.left, y: srcInfo.cy };\n      targetDst = { x: dstEast ? dstInfo.rect.left : dstInfo.rect.right, y: dstInfo.cy };\n    }\n    if (segmentHitsAnyRect(targetSrc, targetDst, realNodeRects, [srcId, dstId], 1)) {\n      continue;\n    }\n    const shiftAxis = collinearX ? \"x\" : \"y\";\n    const labelShift = labelClearanceFor(edge, srcId, dstId, shiftAxis);\n    const effectiveShift = labelShift > PORT_SHIFT2 ? labelShift : PORT_SHIFT2;\n    const deltas = [0, effectiveShift, -effectiveShift];\n    for (const delta of deltas) {\n      const shiftedSrc = { ...targetSrc };\n      const shiftedDst = { ...targetDst };\n      if (collinearX) {\n        shiftedSrc.x += delta;\n        shiftedDst.x += delta;\n        if (shiftedSrc.x <= srcInfo.rect.left || shiftedSrc.x >= srcInfo.rect.right) {\n          continue;\n        }\n        if (shiftedDst.x <= dstInfo.rect.left || shiftedDst.x >= dstInfo.rect.right) {\n          continue;\n        }\n      } else {\n        shiftedSrc.y += delta;\n        shiftedDst.y += delta;\n        if (shiftedSrc.y <= srcInfo.rect.top || shiftedSrc.y >= srcInfo.rect.bottom) {\n          continue;\n        }\n        if (shiftedDst.y <= dstInfo.rect.top || shiftedDst.y >= dstInfo.rect.bottom) {\n          continue;\n        }\n      }\n      if (segmentHitsAnyRect(shiftedSrc, shiftedDst, realNodeRects, [srcId, dstId], 1)) {\n        continue;\n      }\n      if (segmentConflictsWithAnyEdge(shiftedSrc, shiftedDst, edges, edge, { epsilon: EPS6 })) {\n        continue;\n      }\n      edge.points = [shiftedSrc, shiftedDst];\n      break;\n    }\n  }\n}\n__name(straightenCollinearSiblingDetours, \"straightenCollinearSiblingDetours\");\n\n// src/rendering-util/layout-algorithms/swimlanes/direction/sharedTrackNudging.ts\nfunction nudgeSharedInteriorSubpaths(edges, nodeByIdMap) {\n  const EPS_LOCAL2 = 1e-3;\n  const MIN_SHARED3 = 8;\n  const TRACK_SHIFT = 7;\n  const MIN_TRACK_GAP = TRACK_SHIFT;\n  const SOURCE_DETOUR_STUB = 20;\n  const BUFFER = 2;\n  const MAX_ITERATIONS = 12;\n  const { realNodeRects, labelNodeRects: labelRects } = collectNodeRectEntries(\n    nodeByIdMap.values()\n  );\n  const segmentsFor2 = /* @__PURE__ */ __name((edge, points) => {\n    return orthogonalSegmentsForPoints(points, EPS_LOCAL2).map((segment) => ({\n      ...segment,\n      edge,\n      interior: segment.index >= 1 && segment.index <= points.length - 3\n    }));\n  }, \"segmentsFor\");\n  const allSegments = /* @__PURE__ */ __name(() => {\n    const result = [];\n    for (const edge of edges) {\n      if (edge.isLayoutOnly) {\n        continue;\n      }\n      const points = edge.points;\n      if (!points || points.length < 2) {\n        continue;\n      }\n      result.push(...segmentsFor2(edge, dedupeConsecutivePoints(points)));\n    }\n    return result;\n  }, \"allSegments\");\n  const hasCrowdedParallelTrack = /* @__PURE__ */ __name((a, b) => {\n    if (a.horizontal && b.horizontal) {\n      return overlapLength(a.a.x, a.b.x, b.a.x, b.b.x) >= MIN_SHARED3 && Math.abs(a.a.y - b.a.y) < MIN_TRACK_GAP;\n    }\n    if (a.vertical && b.vertical) {\n      return overlapLength(a.a.y, a.b.y, b.a.y, b.b.y) >= MIN_SHARED3 && Math.abs(a.a.x - b.a.x) < MIN_TRACK_GAP;\n    }\n    return false;\n  }, \"hasCrowdedParallelTrack\");\n  const candidateIsSafe = /* @__PURE__ */ __name((edge, candidate) => {\n    const sourceId = edge.start;\n    const targetId = edge.end;\n    const candidateSegments = segmentsFor2(edge, candidate);\n    if (candidateSegments.length !== candidate.length - 1) {\n      return false;\n    }\n    const endpointIds = [sourceId, targetId].filter((id) => Boolean(id));\n    const ownLabelIds = edge.labelNodeId ? [edge.labelNodeId] : [];\n    for (const segment of candidateSegments) {\n      if (segmentHitsAnyRect(segment.a, segment.b, realNodeRects, endpointIds, -BUFFER)) {\n        return false;\n      }\n      if (segmentHitsAnyRect(segment.a, segment.b, labelRects, ownLabelIds, -BUFFER)) {\n        return false;\n      }\n    }\n    for (const other of edges) {\n      if (other === edge || other.isLayoutOnly) {\n        continue;\n      }\n      const otherPoints = other.points;\n      if (!otherPoints || otherPoints.length < 2) {\n        continue;\n      }\n      for (const candidateSegment of candidateSegments) {\n        for (const otherSegment of segmentsFor2(other, dedupeConsecutivePoints(otherPoints))) {\n          if (hasCrowdedParallelTrack(candidateSegment, otherSegment)) {\n            return false;\n          }\n          if (orthogonalSegmentsStrictlyCross(\n            candidateSegment.a,\n            candidateSegment.b,\n            otherSegment.a,\n            otherSegment.b,\n            EPS_LOCAL2\n          )) {\n            return false;\n          }\n        }\n      }\n    }\n    return true;\n  }, \"candidateIsSafe\");\n  const shiftedCandidate = /* @__PURE__ */ __name((segment, shift) => {\n    const points = dedupeConsecutivePoints(segment.edge.points ?? []);\n    if (points.length < 4 || segment.index >= points.length - 1) {\n      return void 0;\n    }\n    const candidate = points.map((p) => ({ ...p }));\n    if (segment.horizontal) {\n      candidate[segment.index].y += shift;\n      candidate[segment.index + 1].y += shift;\n    } else if (segment.vertical) {\n      candidate[segment.index].x += shift;\n      candidate[segment.index + 1].x += shift;\n    } else {\n      return void 0;\n    }\n    return segmentsFor2(segment.edge, candidate).length === candidate.length - 1 ? candidate : void 0;\n  }, \"shiftedCandidate\");\n  const nodeCenter = /* @__PURE__ */ __name((node, rect) => ({\n    x: node.x ?? (rect.left + rect.right) / 2,\n    y: node.y ?? (rect.top + rect.bottom) / 2\n  }), \"nodeCenter\");\n  const sourceDetourContextFor = /* @__PURE__ */ __name((segment) => {\n    const edge = segment.edge;\n    const points = dedupeConsecutivePoints(edge.points ?? []);\n    if (points.length !== 4 || segment.index !== 1) {\n      return void 0;\n    }\n    const sourceNode = edge.start ? nodeByIdMap.get(edge.start) : void 0;\n    const targetNode = edge.end ? nodeByIdMap.get(edge.end) : void 0;\n    const sourceRect = sourceNode ? rectOfNodeBounds(sourceNode) : void 0;\n    const targetRect = targetNode ? rectOfNodeBounds(targetNode) : void 0;\n    const tail = points.slice(segment.index + 2);\n    if (!sourceNode || !targetNode || !sourceRect || !targetRect || tail.length === 0) {\n      return void 0;\n    }\n    return {\n      sourceCenter: nodeCenter(sourceNode, sourceRect),\n      targetCenter: nodeCenter(targetNode, targetRect),\n      sourceRect,\n      tail\n    };\n  }, \"sourceDetourContextFor\");\n  const verticalSourceDetour = /* @__PURE__ */ __name((segment, shift, sourceCenter, targetCenter, sourceRect, tail) => {\n    const targetBelow = targetCenter.y >= sourceCenter.y;\n    const sourcePortY = targetBelow ? sourceRect.bottom : sourceRect.top;\n    const stubY = sourcePortY + (targetBelow ? SOURCE_DETOUR_STUB : -SOURCE_DETOUR_STUB);\n    if (targetBelow && segment.b.y <= stubY + EPS_LOCAL2 || !targetBelow && segment.b.y >= stubY - EPS_LOCAL2) {\n      return void 0;\n    }\n    const railX = segment.a.x + shift;\n    return dedupeConsecutivePoints(\n      [\n        { x: sourceCenter.x, y: sourcePortY },\n        { x: sourceCenter.x, y: stubY },\n        { x: railX, y: stubY },\n        { x: railX, y: segment.b.y },\n        ...tail\n      ],\n      EPS_LOCAL2\n    );\n  }, \"verticalSourceDetour\");\n  const horizontalSourceDetour = /* @__PURE__ */ __name((segment, shift, sourceCenter, targetCenter, sourceRect, tail) => {\n    const targetRight = targetCenter.x >= sourceCenter.x;\n    const sourcePortX = targetRight ? sourceRect.right : sourceRect.left;\n    const stubX = sourcePortX + (targetRight ? SOURCE_DETOUR_STUB : -SOURCE_DETOUR_STUB);\n    if (targetRight && segment.b.x <= stubX + EPS_LOCAL2 || !targetRight && segment.b.x >= stubX - EPS_LOCAL2) {\n      return void 0;\n    }\n    const railY = segment.a.y + shift;\n    return dedupeConsecutivePoints(\n      [\n        { x: sourcePortX, y: sourceCenter.y },\n        { x: stubX, y: sourceCenter.y },\n        { x: stubX, y: railY },\n        { x: segment.b.x, y: railY },\n        ...tail\n      ],\n      EPS_LOCAL2\n    );\n  }, \"horizontalSourceDetour\");\n  const sourceDetourCandidate = /* @__PURE__ */ __name((segment, shift) => {\n    const context = sourceDetourContextFor(segment);\n    if (!context) {\n      return void 0;\n    }\n    if (segment.vertical) {\n      return verticalSourceDetour(\n        segment,\n        shift,\n        context.sourceCenter,\n        context.targetCenter,\n        context.sourceRect,\n        context.tail\n      );\n    }\n    if (segment.horizontal) {\n      return horizontalSourceDetour(\n        segment,\n        shift,\n        context.sourceCenter,\n        context.targetCenter,\n        context.sourceRect,\n        context.tail\n      );\n    }\n    return void 0;\n  }, \"sourceDetourCandidate\");\n  const shifts = [\n    -TRACK_SHIFT,\n    TRACK_SHIFT,\n    -2 * TRACK_SHIFT,\n    2 * TRACK_SHIFT,\n    -3 * TRACK_SHIFT,\n    3 * TRACK_SHIFT\n  ];\n  for (let iteration = 0; iteration < MAX_ITERATIONS; iteration++) {\n    const segments = allSegments();\n    let fixed = false;\n    for (let i = 0; i < segments.length && !fixed; i++) {\n      for (let j = i + 1; j < segments.length && !fixed; j++) {\n        const first = segments[i];\n        const second = segments[j];\n        if (first.edge === second.edge || !hasCrowdedParallelTrack(first, second)) {\n          continue;\n        }\n        const candidates = [first, second].filter((segment) => segment.interior);\n        for (const segment of candidates) {\n          for (const shift of shifts) {\n            const direct = shiftedCandidate(segment, shift);\n            if (direct && candidateIsSafe(segment.edge, direct)) {\n              segment.edge.points = direct;\n              fixed = true;\n              break;\n            }\n            const detoured = sourceDetourCandidate(segment, shift);\n            if (detoured && candidateIsSafe(segment.edge, detoured)) {\n              segment.edge.points = detoured;\n              fixed = true;\n              break;\n            }\n          }\n          if (fixed) {\n            break;\n          }\n        }\n      }\n    }\n    if (!fixed) {\n      return;\n    }\n  }\n}\n__name(nudgeSharedInteriorSubpaths, \"nudgeSharedInteriorSubpaths\");\n\n// src/rendering-util/layout-algorithms/swimlanes/direction/validation.ts\nfunction segmentsIntersect(p1, p2, p3, p4) {\n  const d1x = p2.x - p1.x;\n  const d1y = p2.y - p1.y;\n  const d2x = p4.x - p3.x;\n  const d2y = p4.y - p3.y;\n  const cross = d1x * d2y - d1y * d2x;\n  if (Math.abs(cross) < 1e-10) {\n    return false;\n  }\n  const dx = p3.x - p1.x;\n  const dy = p3.y - p1.y;\n  const t = (dx * d2y - dy * d2x) / cross;\n  const u = (dx * d1y - dy * d1x) / cross;\n  const eps = 0.01;\n  return t > eps && t < 1 - eps && u > eps && u < 1 - eps;\n}\n__name(segmentsIntersect, \"segmentsIntersect\");\nfunction validateSwimlanesLayout(layout) {\n  const nodes = layout.nodes ?? [];\n  const edges = layout.edges ?? [];\n  const issues = [];\n  if (!edges.length || !nodes.length) {\n    return issues;\n  }\n  const nodeRects = collectLayoutNodeRects(nodes);\n  const epsilon = 1;\n  const edgeSegments = [];\n  for (const edge of edges) {\n    if (edge.isLayoutOnly) {\n      continue;\n    }\n    const points = edge.points;\n    if (!points || points.length < 2) {\n      continue;\n    }\n    const edgeStart = edge.start;\n    const edgeEnd = edge.end;\n    const ownLabelId = edge.labelNodeId;\n    const edgeId = edge.id ?? `${edgeStart}->${edgeEnd}`;\n    for (const rect of nodeRects) {\n      if (rect.nodeId === edgeStart || rect.nodeId === edgeEnd) {\n        continue;\n      }\n      if (ownLabelId && rect.nodeId === ownLabelId) {\n        continue;\n      }\n      for (let i = 0; i < points.length - 1; i++) {\n        if (segmentBoundsOverlapRect(points[i], points[i + 1], rect, -epsilon)) {\n          issues.push({\n            type: \"edge-node-overlap\",\n            edgeId,\n            targetId: rect.nodeId,\n            detail: `segment ${i} passes through node \"${rect.nodeId}\"`\n          });\n          break;\n        }\n      }\n    }\n    for (let i = 0; i < points.length - 1; i++) {\n      edgeSegments.push({\n        edgeId,\n        start: edgeStart,\n        end: edgeEnd,\n        p1: points[i],\n        p2: points[i + 1]\n      });\n    }\n  }\n  const crossingPairs = /* @__PURE__ */ new Set();\n  for (let i = 0; i < edgeSegments.length; i++) {\n    for (let j = i + 1; j < edgeSegments.length; j++) {\n      const a = edgeSegments[i];\n      const b = edgeSegments[j];\n      if (a.edgeId === b.edgeId) {\n        continue;\n      }\n      if (a.start === b.start || a.start === b.end || a.end === b.start || a.end === b.end) {\n        continue;\n      }\n      if (segmentsIntersect(a.p1, a.p2, b.p1, b.p2)) {\n        const pairKey2 = a.edgeId < b.edgeId ? `${a.edgeId}|${b.edgeId}` : `${b.edgeId}|${a.edgeId}`;\n        if (!crossingPairs.has(pairKey2)) {\n          crossingPairs.add(pairKey2);\n          issues.push({\n            type: \"edge-edge-crossing\",\n            edgeId: a.edgeId,\n            targetId: b.edgeId,\n            detail: `edges \"${a.edgeId}\" and \"${b.edgeId}\" cross`\n          });\n        }\n      }\n    }\n  }\n  if (issues.length > 0) {\n    const overlaps = issues.filter((i) => i.type === \"edge-node-overlap\").length;\n    const crossings = issues.filter((i) => i.type === \"edge-edge-crossing\").length;\n    log.warn(\n      `[SWIMLANE_VALIDATE] ${issues.length} issue(s) detected: ${overlaps} edge-node overlap(s), ${crossings} edge crossing(s)`\n    );\n    for (const issue of issues) {\n      log.warn(`[SWIMLANE_VALIDATE]   ${issue.type}: ${issue.detail}`);\n    }\n  }\n  return issues;\n}\n__name(validateSwimlanesLayout, \"validateSwimlanesLayout\");\n\n// src/rendering-util/layout-algorithms/swimlanes/postProcessing.ts\nfunction postProcessSwimlaneLayout(layout, direction) {\n  const nodes = layout.nodes ?? [];\n  const edges = layout.edges ?? [];\n  const contentNodes = nodes.filter((n) => !n.isGroup);\n  if ((direction === \"LR\" || direction === \"RL\") && contentNodes.length > 0 && !applyLrDirectionTransform(layout, direction)) {\n    return;\n  }\n  if (direction === \"BT\" && contentNodes.length > 0 && !applyBtDirectionTransform(layout)) {\n    return;\n  }\n  for (const edge of edges) {\n    if (edge.isLayoutOnly) {\n      continue;\n    }\n    const pts = edge.points;\n    if (!pts || pts.length < 2) {\n      continue;\n    }\n    edge.points = simplifyPolyline(\n      orthogonalizePolyline(pts)\n    );\n  }\n  simplifyDetouredEdges(edges, nodes);\n  straightenCollinearSiblingDetours(edges, nodes);\n  portSwapToLShape(edges, nodes);\n  const nodeByIdMap = /* @__PURE__ */ new Map();\n  for (const n of nodes) {\n    nodeByIdMap.set(String(n.id), n);\n  }\n  anchorLabelsToPolyline(edges, nodeByIdMap);\n  clipEdgeEndpointsToNodeBoundaries(edges, nodeByIdMap);\n  collapseShortTerminalStub(edges, nodeByIdMap);\n  nudgeSharedInteriorSubpaths(edges, nodeByIdMap);\n  separateSharedRenderedTerminalLanes(edges, nodeByIdMap);\n  collapseRedundantRectangularDoglegs(edges, nodeByIdMap);\n  liftObstacleHuggingSameSideRails(edges, nodeByIdMap);\n  swapDestinationTerminalTailsToReduceCrossings(edges, nodeByIdMap);\n  const finalizeRenderedEdges = /* @__PURE__ */ __name(() => {\n    resolveRenderedOrthogonalCrossings(edges, nodeByIdMap);\n    reassignCrossingExternalRailChannels(edges, nodeByIdMap);\n    shortcutRedundantOrthogonalJogs(edges, nodeByIdMap);\n    anchorLabelsToPolyline(edges, nodeByIdMap);\n    prepareEdgeEndpointsForRenderer(edges, nodeByIdMap);\n    liftObstacleHuggingSameSideRails(edges, nodeByIdMap);\n    anchorLabelsToPolyline(edges, nodeByIdMap);\n    prepareEdgeEndpointsForRenderer(edges, nodeByIdMap);\n  }, \"finalizeRenderedEdges\");\n  finalizeRenderedEdges();\n  nudgeSharedInteriorSubpaths(edges, nodeByIdMap);\n  finalizeRenderedEdges();\n  liftTopLaneTitleBandsAboveRails(edges, nodeByIdMap);\n  shiftLeftLaneTitleBandsLeftOfRails(edges, nodeByIdMap);\n  liftTopLaneTitleBandsAboveRails(edges, nodeByIdMap);\n  shiftLeftLaneTitleBandsLeftOfRails(edges, nodeByIdMap);\n}\n__name(postProcessSwimlaneLayout, \"postProcessSwimlaneLayout\");\n\n// src/rendering-util/layout-algorithms/swimlanes/phase0.helpers.ts\nfunction normalizeGraph(g) {\n  const nodeById = new Map(g.nodeById);\n  const seen = /* @__PURE__ */ new Set();\n  const edges = [];\n  for (const e of g.edges) {\n    if (!nodeById.has(e.src) || !nodeById.has(e.dst)) {\n      continue;\n    }\n    const key = `${e.id}:${e.src}->${e.dst}`;\n    if (seen.has(key)) {\n      continue;\n    }\n    seen.add(key);\n    edges.push(e);\n  }\n  const nodes = [...nodeById.keys()];\n  return { nodes, edges, layout: g.layout, nodeById };\n}\n__name(normalizeGraph, \"normalizeGraph\");\nfunction incoming(g, v) {\n  return g.edges.filter((e) => e.dst === v);\n}\n__name(incoming, \"incoming\");\nfunction buildSuccessorMap(g) {\n  const succs = /* @__PURE__ */ new Map();\n  for (const v of g.nodes) {\n    succs.set(v, []);\n  }\n  for (const e of g.edges) {\n    succs.get(e.src).push(e.dst);\n  }\n  return succs;\n}\n__name(buildSuccessorMap, \"buildSuccessorMap\");\nfunction buildSortedSuccessorMap(g) {\n  const succs = buildSuccessorMap(g);\n  for (const successors of succs.values()) {\n    successors.sort((a, b) => a.localeCompare(b));\n  }\n  return succs;\n}\n__name(buildSortedSuccessorMap, \"buildSortedSuccessorMap\");\nfunction buildInDegreeMap(g) {\n  const indeg = /* @__PURE__ */ new Map();\n  for (const v of g.nodes) {\n    indeg.set(v, 0);\n  }\n  for (const e of g.edges) {\n    indeg.set(e.dst, (indeg.get(e.dst) ?? 0) + 1);\n  }\n  return indeg;\n}\n__name(buildInDegreeMap, \"buildInDegreeMap\");\nfunction sortedZeroInDegreeNodes(indeg) {\n  return [...indeg.entries()].filter(([, degree]) => degree === 0).map(([id]) => id).sort((a, b) => a.localeCompare(b));\n}\n__name(sortedZeroInDegreeNodes, \"sortedZeroInDegreeNodes\");\nfunction buildPredecessorSuccessorMaps(g, includeEdge = () => true) {\n  const preds = /* @__PURE__ */ new Map();\n  const succs = /* @__PURE__ */ new Map();\n  for (const v of g.nodes) {\n    preds.set(v, []);\n    succs.set(v, []);\n  }\n  for (const e of g.edges) {\n    if (!includeEdge(e)) {\n      continue;\n    }\n    succs.get(e.src).push(e.dst);\n    preds.get(e.dst).push(e.src);\n  }\n  return { preds, succs };\n}\n__name(buildPredecessorSuccessorMaps, \"buildPredecessorSuccessorMaps\");\nfunction buildLayersFromRanks(g, order, rankOf, opts) {\n  let maxRank = 0;\n  for (const v of g.nodes) {\n    if (opts?.skipGroups && g.nodeById.get(v)?.isGroup) {\n      continue;\n    }\n    maxRank = Math.max(maxRank, rankOf[v] ?? 0);\n  }\n  const layers = Array.from({ length: maxRank + 1 }, () => []);\n  for (const v of order) {\n    if (opts?.skipGroups && g.nodeById.get(v)?.isGroup) {\n      continue;\n    }\n    layers[Math.max(0, rankOf[v] ?? 0)].push(v);\n  }\n  return layers;\n}\n__name(buildLayersFromRanks, \"buildLayersFromRanks\");\nfunction topoSortIfAcyclic(g) {\n  const indeg = buildInDegreeMap(g);\n  const queue = sortedZeroInDegreeNodes(indeg);\n  const order = [];\n  const adj = buildSortedSuccessorMap(g);\n  while (queue.length) {\n    const u = queue.shift();\n    order.push(u);\n    for (const v of adj.get(u) ?? []) {\n      indeg.set(v, (indeg.get(v) ?? 0) - 1);\n      if ((indeg.get(v) ?? 0) === 0) {\n        let i = 0;\n        while (i < queue.length && queue[i] < v) {\n          i++;\n        }\n        queue.splice(i, 0, v);\n      }\n    }\n  }\n  return order.length === g.nodes.length ? order : null;\n}\n__name(topoSortIfAcyclic, \"topoSortIfAcyclic\");\nfunction buildLayerIndex(layer) {\n  const m = /* @__PURE__ */ new Map();\n  let index = 0;\n  for (const id of layer) {\n    m.set(id, index);\n    index++;\n  }\n  return m;\n}\n__name(buildLayerIndex, \"buildLayerIndex\");\nfunction countInversions(values) {\n  const tmp = new Array(values.length);\n  const count = /* @__PURE__ */ __name((left, right) => {\n    if (right - left <= 1) {\n      return 0;\n    }\n    const mid = left + right >> 1;\n    let inversions = count(left, mid) + count(mid, right);\n    let i = left;\n    let j = mid;\n    let k = left;\n    while (i < mid || j < right) {\n      if (j >= right || i < mid && values[i] <= values[j]) {\n        tmp[k++] = values[i++];\n      } else {\n        tmp[k++] = values[j++];\n        inversions += mid - i;\n      }\n    }\n    for (let t = left; t < right; t++) {\n      values[t] = tmp[t];\n    }\n    return inversions;\n  }, \"count\");\n  return count(0, values.length);\n}\n__name(countInversions, \"countInversions\");\n\n// src/rendering-util/layout-algorithms/swimlanes/phase1.cycles.ts\nfunction removeCycles_DFS(g) {\n  const gn = normalizeGraph(g);\n  const adj = /* @__PURE__ */ new Map();\n  for (const v of gn.nodes) {\n    adj.set(v, []);\n  }\n  for (const e of gn.edges) {\n    adj.get(e.src).push(e);\n  }\n  for (const arr of adj.values()) {\n    arr.sort((a, b) => a.dst === b.dst ? a.id.localeCompare(b.id) : a.dst.localeCompare(b.dst));\n  }\n  const color = /* @__PURE__ */ Object.create(null);\n  for (const v of gn.nodes) {\n    color[v] = 0;\n  }\n  const reversed = [];\n  const dfs = /* @__PURE__ */ __name((u) => {\n    color[u] = 1;\n    for (const e of adj.get(u) ?? []) {\n      const v = e.dst;\n      if (color[v] === 0) {\n        dfs(v);\n      } else if (color[v] === 1) {\n        reversed.push(e);\n      }\n    }\n    color[u] = 2;\n  }, \"dfs\");\n  const nodesSorted = [...gn.nodes].sort((a, b) => a.localeCompare(b));\n  for (const v of nodesSorted) {\n    if (color[v] === 0) {\n      dfs(v);\n    }\n  }\n  const toReverse = new Set(reversed.map((e) => `${e.id}:${e.src}->${e.dst}`));\n  const acycEdges = gn.edges.map(\n    (e) => toReverse.has(`${e.id}:${e.src}->${e.dst}`) ? { id: e.id, src: e.dst, dst: e.src, weight: e.weight, ref: e.ref } : e\n  );\n  const acyclic = {\n    nodes: [...gn.nodes],\n    edges: acycEdges,\n    layout: gn.layout,\n    nodeById: new Map(gn.nodeById)\n  };\n  return { acyclic, reversed };\n}\n__name(removeCycles_DFS, \"removeCycles_DFS\");\n\n// src/rendering-util/layout-algorithms/swimlanes/phase2.options.ts\nfunction buildTopLaneMap(g) {\n  const cache = /* @__PURE__ */ new Map();\n  const resolve = /* @__PURE__ */ __name((id) => {\n    if (cache.has(id)) {\n      return cache.get(id);\n    }\n    const node = g.nodeById.get(id);\n    if (!node) {\n      cache.set(id, null);\n      return null;\n    }\n    const parentId = node.parentId;\n    if (!parentId) {\n      cache.set(id, null);\n      return null;\n    }\n    const parentLane = resolve(parentId);\n    const lane = parentLane ?? parentId;\n    cache.set(id, lane);\n    return lane;\n  }, \"resolve\");\n  for (const id of g.nodes) {\n    resolve(id);\n  }\n  return cache;\n}\n__name(buildTopLaneMap, \"buildTopLaneMap\");\nfunction createTopLaneResolver(g) {\n  const topLaneMap = buildTopLaneMap(g);\n  return (id) => topLaneMap.get(id) ?? null;\n}\n__name(createTopLaneResolver, \"createTopLaneResolver\");\nfunction buildTopLaneOrder(g) {\n  const lanes = [];\n  for (const node of g.layout.nodes ?? []) {\n    if (node.isGroup && !node.parentId) {\n      lanes.push(node.id);\n    }\n  }\n  return [...new Set(lanes)].reverse();\n}\n__name(buildTopLaneOrder, \"buildTopLaneOrder\");\nfunction resolveTopLaneOrder(g, preferredOrder) {\n  const sourceOrder = buildTopLaneOrder(g);\n  if (!preferredOrder || preferredOrder.length === 0) {\n    return sourceOrder;\n  }\n  const sourceLaneIds = new Set(sourceOrder);\n  const seen = /* @__PURE__ */ new Set();\n  const resolved = [];\n  for (const laneId of preferredOrder) {\n    if (!sourceLaneIds.has(laneId) || seen.has(laneId)) {\n      continue;\n    }\n    seen.add(laneId);\n    resolved.push(laneId);\n  }\n  for (const laneId of sourceOrder) {\n    if (seen.has(laneId)) {\n      continue;\n    }\n    resolved.push(laneId);\n  }\n  return resolved;\n}\n__name(resolveTopLaneOrder, \"resolveTopLaneOrder\");\n\n// src/rendering-util/layout-algorithms/swimlanes/config.ts\nvar PRECISION = {\n  /** Epsilon for floating-point comparisons */\n  EPSILON: 1e-6\n};\nvar LAYERING = {\n  /** Default number of iterations for gravity-based layering */\n  GRAVITY_ITERATIONS: 8,\n  /** Maximum number of passes for crossing-based rank optimization */\n  MAX_CROSSING_OPTIMIZATION_PASSES: 4,\n  /** Whether to compact single-input nodes by default */\n  DEFAULT_COMPACT_SINGLE_INPUT: true\n};\nvar COORDINATES = {\n  /** Default vertical gap between layers (px) */\n  DEFAULT_LAYER_GAP: 100,\n  /** Default horizontal gap between nodes (px) */\n  DEFAULT_NODE_GAP: 40\n};\n\n// src/rendering-util/layout-algorithms/swimlanes/driving-tree.ts\nfunction buildDrivingTree(graph, opts) {\n  const g = normalizeGraph(graph);\n  const laneOf = opts?.laneOf ?? (() => null);\n  const rankHint = opts?.rankHint;\n  const { preds } = buildPredecessorSuccessorMaps(g);\n  for (const arr of preds.values()) {\n    arr.sort((a, b) => a.localeCompare(b));\n  }\n  const topoOrder = topoSortIfAcyclic(g) ?? [...g.nodes].sort((a, b) => a.localeCompare(b));\n  const topoIndex = /* @__PURE__ */ new Map();\n  for (const [idx, id] of topoOrder.entries()) {\n    topoIndex.set(id, idx);\n  }\n  const parent = /* @__PURE__ */ new Map();\n  const children = /* @__PURE__ */ new Map();\n  for (const node of g.nodes) {\n    children.set(node, []);\n  }\n  for (const node of topoOrder) {\n    const candidates = (preds.get(node) ?? []).filter((p) => parent.has(p));\n    if (candidates.length > 0) {\n      const chosen = chooseParent(node, candidates, {\n        laneOf,\n        rankHint,\n        topoIndex\n      });\n      parent.set(node, chosen);\n      children.get(chosen).push(node);\n    } else if (!parent.has(node)) {\n      parent.set(node, null);\n    }\n  }\n  for (const node of g.nodes) {\n    if (!parent.has(node)) {\n      parent.set(node, null);\n    }\n  }\n  const rootSet = /* @__PURE__ */ new Set();\n  for (const node of g.nodes) {\n    if ((parent.get(node) ?? null) === null) {\n      rootSet.add(node);\n    }\n  }\n  const roots = [...rootSet].sort((a, b) => {\n    const ta = topoIndex.get(a) ?? 0;\n    const tb = topoIndex.get(b) ?? 0;\n    if (ta === tb) {\n      return a.localeCompare(b);\n    }\n    return ta - tb;\n  });\n  const adjacency = buildAdjacency(g);\n  const adjacencyList = /* @__PURE__ */ new Map();\n  for (const [node, set] of adjacency.entries()) {\n    adjacencyList.set(\n      node,\n      [...set].sort((a, b) => a.localeCompare(b))\n    );\n  }\n  const componentOf = assignComponents(adjacencyList);\n  const blocks = computeBlocks(adjacencyList);\n  const nodeBlocks = /* @__PURE__ */ new Map();\n  for (const node of g.nodes) {\n    nodeBlocks.set(node, []);\n  }\n  for (const block of blocks) {\n    for (const node of block.nodes) {\n      const list = nodeBlocks.get(node);\n      if (list) {\n        list.push(block.id);\n      } else {\n        nodeBlocks.set(node, [block.id]);\n      }\n    }\n  }\n  const preorder = [];\n  const postorder = [];\n  const seen = /* @__PURE__ */ new Set();\n  const walk = /* @__PURE__ */ __name((node) => {\n    if (seen.has(node)) {\n      return;\n    }\n    seen.add(node);\n    preorder.push(node);\n    for (const child of children.get(node) ?? []) {\n      walk(child);\n    }\n    postorder.push(node);\n  }, \"walk\");\n  for (const root of roots) {\n    walk(root);\n  }\n  for (const node of topoOrder) {\n    walk(node);\n  }\n  return {\n    parent,\n    children,\n    roots,\n    componentOf,\n    blocks,\n    nodeBlocks,\n    adjacency: adjacencyList,\n    preorder,\n    postorder,\n    topologicalOrder: topoOrder\n  };\n}\n__name(buildDrivingTree, \"buildDrivingTree\");\nfunction chooseParent(node, candidates, ctx) {\n  const laneNode = ctx.laneOf(node);\n  const sorted = [...candidates].sort((a, b) => {\n    const laneA = ctx.laneOf(a);\n    const laneB = ctx.laneOf(b);\n    const sameLaneA = laneA != null && laneA === laneNode;\n    const sameLaneB = laneB != null && laneB === laneNode;\n    if (sameLaneA !== sameLaneB) {\n      return sameLaneA ? -1 : 1;\n    }\n    const rankA = ctx.rankHint?.[a];\n    const rankB = ctx.rankHint?.[b];\n    if (rankA != null && rankB != null && rankA !== rankB) {\n      return rankB - rankA;\n    }\n    const idxA = ctx.topoIndex.get(a) ?? 0;\n    const idxB = ctx.topoIndex.get(b) ?? 0;\n    if (idxA !== idxB) {\n      return idxA - idxB;\n    }\n    return a.localeCompare(b);\n  });\n  return sorted[0];\n}\n__name(chooseParent, \"chooseParent\");\nfunction buildAdjacency(g) {\n  const adjacency = /* @__PURE__ */ new Map();\n  for (const node of g.nodes) {\n    adjacency.set(node, /* @__PURE__ */ new Set());\n  }\n  for (const e of g.edges) {\n    adjacency.get(e.src).add(e.dst);\n    adjacency.get(e.dst).add(e.src);\n  }\n  return adjacency;\n}\n__name(buildAdjacency, \"buildAdjacency\");\nfunction assignComponents(adjacency) {\n  const componentOf = /* @__PURE__ */ new Map();\n  let componentId = 0;\n  for (const node of adjacency.keys()) {\n    if (componentOf.has(node)) {\n      continue;\n    }\n    const stack = [node];\n    while (stack.length > 0) {\n      const cur = stack.pop();\n      if (componentOf.has(cur)) {\n        continue;\n      }\n      componentOf.set(cur, componentId);\n      for (const next of adjacency.get(cur) ?? []) {\n        if (!componentOf.has(next)) {\n          stack.push(next);\n        }\n      }\n    }\n    componentId++;\n  }\n  return componentOf;\n}\n__name(assignComponents, \"assignComponents\");\nfunction computeBlocks(adjacency) {\n  const discovery = /* @__PURE__ */ new Map();\n  const low = /* @__PURE__ */ new Map();\n  const edgeStack = [];\n  const blocks = [];\n  let time = 0;\n  const visit = /* @__PURE__ */ __name((node, parent) => {\n    discovery.set(node, ++time);\n    low.set(node, time);\n    for (const next of adjacency.get(node) ?? []) {\n      if (next === parent) {\n        continue;\n      }\n      if (!discovery.has(next)) {\n        edgeStack.push([node, next]);\n        visit(next, node);\n        low.set(node, Math.min(low.get(node) ?? time, low.get(next) ?? time));\n        if ((low.get(next) ?? 0) >= (discovery.get(node) ?? 0)) {\n          blocks.push(popBlock(node, next, edgeStack, blocks.length));\n        }\n      } else if ((discovery.get(next) ?? 0) < (discovery.get(node) ?? 0)) {\n        edgeStack.push([node, next]);\n        low.set(node, Math.min(low.get(node) ?? time, discovery.get(next) ?? time));\n      }\n    }\n  }, \"visit\");\n  for (const node of adjacency.keys()) {\n    if (!discovery.has(node)) {\n      visit(node, null);\n    }\n  }\n  return blocks;\n}\n__name(computeBlocks, \"computeBlocks\");\nfunction popBlock(u, v, stack, id) {\n  const edges = [];\n  const nodes = /* @__PURE__ */ new Set();\n  while (stack.length > 0) {\n    const edge = stack.pop();\n    edges.push(edge);\n    nodes.add(edge[0]);\n    nodes.add(edge[1]);\n    if (edge[0] === u && edge[1] === v || edge[0] === v && edge[1] === u) {\n      break;\n    }\n  }\n  return { id, edges, nodes: [...nodes] };\n}\n__name(popBlock, \"popBlock\");\n\n// src/rendering-util/layout-algorithms/swimlanes/phase2.crossCounts.ts\nfunction computeSubtreeCrossCounts(g, rankOf, tree) {\n  const nodes = [...g.nodes];\n  const indexOf = /* @__PURE__ */ new Map();\n  for (const [i, node] of nodes.entries()) {\n    indexOf.set(node, i);\n  }\n  const n = nodes.length;\n  const parentIdx = new Array(n).fill(-1);\n  const depth = new Array(n).fill(0);\n  const queue = [];\n  const seen = /* @__PURE__ */ new Set();\n  for (const node of nodes) {\n    const parentId = tree.parent.get(node) ?? null;\n    const idx = indexOf.get(node);\n    if (idx == null) {\n      continue;\n    }\n    if (parentId == null) {\n      parentIdx[idx] = -1;\n      depth[idx] = 0;\n      if (!seen.has(node)) {\n        seen.add(node);\n        queue.push(node);\n      }\n    }\n  }\n  while (queue.length > 0) {\n    const current = queue.shift();\n    const currentIdx = indexOf.get(current);\n    if (currentIdx == null) {\n      continue;\n    }\n    const childList = tree.children.get(current) ?? [];\n    for (const child of childList) {\n      if (seen.has(child)) {\n        continue;\n      }\n      const childIdx = indexOf.get(child);\n      if (childIdx == null) {\n        continue;\n      }\n      parentIdx[childIdx] = currentIdx;\n      depth[childIdx] = depth[currentIdx] + 1;\n      seen.add(child);\n      queue.push(child);\n    }\n  }\n  for (const node of nodes) {\n    if (seen.has(node)) {\n      continue;\n    }\n    const idx = indexOf.get(node);\n    if (idx == null) {\n      continue;\n    }\n    parentIdx[idx] = -1;\n    depth[idx] = 0;\n    seen.add(node);\n  }\n  const maxLog = Math.max(1, Math.ceil(Math.log2(Math.max(1, n))) + 1);\n  const up = Array.from({ length: maxLog }, () => new Array(n).fill(-1));\n  for (let i = 0; i < n; i++) {\n    up[0][i] = parentIdx[i];\n  }\n  for (let k = 1; k < maxLog; k++) {\n    for (let i = 0; i < n; i++) {\n      const prev = up[k - 1][i];\n      up[k][i] = prev === -1 ? -1 : up[k - 1][prev];\n    }\n  }\n  const lcaIndex = /* @__PURE__ */ __name((aIdx, bIdx) => {\n    if (aIdx === -1 || bIdx === -1) {\n      return -1;\n    }\n    if (depth[aIdx] < depth[bIdx]) {\n      [aIdx, bIdx] = [bIdx, aIdx];\n    }\n    const diff = depth[aIdx] - depth[bIdx];\n    for (let k = 0; k < maxLog; k++) {\n      if (diff >> k & 1) {\n        aIdx = up[k][aIdx];\n        if (aIdx === -1) {\n          return -1;\n        }\n      }\n    }\n    if (aIdx === bIdx) {\n      return aIdx;\n    }\n    for (let k = maxLog - 1; k >= 0; k--) {\n      const upA = up[k][aIdx];\n      const upB = up[k][bIdx];\n      if (upA === -1 || upB === -1) {\n        continue;\n      }\n      if (upA !== upB) {\n        aIdx = upA;\n        bIdx = upB;\n      }\n    }\n    return up[0][aIdx];\n  }, \"lcaIndex\");\n  const ownCounts = Array.from({ length: n }, () => /* @__PURE__ */ new Map());\n  for (const edge of g.edges) {\n    let src = edge.src;\n    let dst = edge.dst;\n    let ru = rankOf[src];\n    let rv = rankOf[dst];\n    if (ru == null || rv == null) {\n      continue;\n    }\n    if (ru > rv) {\n      [src, dst] = [dst, src];\n      [ru, rv] = [rv, ru];\n    }\n    if (ru == null || rv == null || ru === rv) {\n      continue;\n    }\n    const upperIdx = indexOf.get(src);\n    const lowerIdx = indexOf.get(dst);\n    if (upperIdx == null || lowerIdx == null) {\n      continue;\n    }\n    const lca = lcaIndex(upperIdx, lowerIdx);\n    if (lca === -1) {\n      continue;\n    }\n    const bucket = ownCounts[lca];\n    for (let layer = ru; layer < rv; layer++) {\n      bucket.set(layer, (bucket.get(layer) ?? 0) + 1);\n    }\n  }\n  const crossCounts = /* @__PURE__ */ new Map();\n  const mergeInto = /* @__PURE__ */ __name((target, source) => {\n    if (source.size === 0) {\n      return;\n    }\n    for (const [layer, value] of source) {\n      target.set(layer, (target.get(layer) ?? 0) + value);\n    }\n  }, \"mergeInto\");\n  const visited = /* @__PURE__ */ new Set();\n  const dfs = /* @__PURE__ */ __name((node) => {\n    const idx = indexOf.get(node);\n    visited.add(node);\n    const base = idx == null ? void 0 : ownCounts[idx];\n    const accumulator = base ? new Map(base) : /* @__PURE__ */ new Map();\n    const childList = tree.children.get(node) ?? [];\n    for (const child of childList) {\n      const childMap = dfs(child);\n      const parentLayer = rankOf[node];\n      if (parentLayer != null) {\n        let map = crossCounts.get(node);\n        if (!map) {\n          map = /* @__PURE__ */ new Map();\n          crossCounts.set(node, map);\n        }\n        let value = childMap.get(parentLayer) ?? 0;\n        const childLayer = rankOf[child];\n        if (childLayer != null && childLayer > parentLayer) {\n          value += 1;\n        }\n        map.set(child, value);\n      }\n      mergeInto(accumulator, childMap);\n    }\n    return accumulator;\n  }, \"dfs\");\n  for (const root of tree.roots) {\n    if (!visited.has(root)) {\n      dfs(root);\n    }\n  }\n  for (const node of nodes) {\n    if (!visited.has(node)) {\n      dfs(node);\n    }\n  }\n  return crossCounts;\n}\n__name(computeSubtreeCrossCounts, \"computeSubtreeCrossCounts\");\n\n// src/rendering-util/layout-algorithms/swimlanes/phase2.multitree.core.ts\nfunction annotateMinimumLayers(nodes, children, rankOf) {\n  const minLayer = /* @__PURE__ */ new Map();\n  const annotate = /* @__PURE__ */ __name((node) => {\n    let minL = rankOf[node] ?? 0;\n    const childList = [...children.get(node) ?? []];\n    childList.sort(compareByRankThenId(rankOf));\n    for (const child of childList) {\n      annotate(child);\n      const childMin = minLayer.get(child);\n      if (childMin != null) {\n        minL = Math.min(minL, childMin);\n      }\n    }\n    minLayer.set(node, minL);\n  }, \"annotate\");\n  for (const node of nodes) {\n    annotate(node);\n  }\n  return minLayer;\n}\n__name(annotateMinimumLayers, \"annotateMinimumLayers\");\nfunction compareByRankThenId(rankOf) {\n  return (a, b) => {\n    const ra = rankOf[a] ?? 0;\n    const rb = rankOf[b] ?? 0;\n    return ra === rb ? a.localeCompare(b) : ra - rb;\n  };\n}\n__name(compareByRankThenId, \"compareByRankThenId\");\nfunction emitNodesInTreeOrder(roots, allNodes, rankOf, orderChildren) {\n  let maxRank = 0;\n  for (const node of allNodes) {\n    const r = rankOf[node] ?? 0;\n    if (r > maxRank) {\n      maxRank = r;\n    }\n  }\n  const layers = Array.from({ length: maxRank + 1 }, () => []);\n  const emitted = /* @__PURE__ */ new Set();\n  const emit = /* @__PURE__ */ __name((node) => {\n    if (emitted.has(node)) {\n      return;\n    }\n    emitted.add(node);\n    const layer = rankOf[node] ?? 0;\n    if (!layers[layer]) {\n      layers[layer] = [];\n    }\n    layers[layer].push(node);\n    for (const child of orderChildren(node)) {\n      emit(child);\n    }\n  }, \"emit\");\n  for (const root of roots) {\n    emit(root);\n  }\n  for (const node of allNodes) {\n    if (!emitted.has(node)) {\n      const layer = rankOf[node] ?? 0;\n      if (!layers[layer]) {\n        layers[layer] = [];\n      }\n      layers[layer].push(node);\n      emitted.add(node);\n    }\n  }\n  return layers;\n}\n__name(emitNodesInTreeOrder, \"emitNodesInTreeOrder\");\nfunction deduplicateLayers(layers) {\n  const result = [];\n  for (const layer of layers) {\n    const seen = /* @__PURE__ */ new Set();\n    const deduped = [];\n    for (const id of layer) {\n      if (seen.has(id)) {\n        continue;\n      }\n      seen.add(id);\n      deduped.push(id);\n    }\n    result.push(deduped);\n  }\n  return result;\n}\n__name(deduplicateLayers, \"deduplicateLayers\");\n\n// src/rendering-util/layout-algorithms/swimlanes/phase2.multitree.order.ts\nfunction createChildOrderer(children, rankOf, crossCounts, minLayer) {\n  return (node) => {\n    const raw = children.get(node) ?? [];\n    if (raw.length === 0) {\n      return [];\n    }\n    const layer = rankOf[node] ?? 0;\n    const future = [];\n    const present = [];\n    const crossMap = crossCounts.get(node);\n    for (const child of raw) {\n      const minL = minLayer.get(child) ?? layer;\n      if (minL > layer) {\n        future.push({ child, min: minL });\n      } else {\n        present.push(child);\n      }\n    }\n    future.sort((a, b) => {\n      if (a.min === b.min) {\n        return a.child.localeCompare(b.child);\n      }\n      return a.min - b.min;\n    });\n    present.sort((a, b) => {\n      const ca = crossMap?.get(a) ?? 0;\n      const cb = crossMap?.get(b) ?? 0;\n      if (ca !== cb) {\n        return ca - cb;\n      }\n      const ma = minLayer.get(a) ?? layer;\n      const mb = minLayer.get(b) ?? layer;\n      if (ma !== mb) {\n        return ma - mb;\n      }\n      return a.localeCompare(b);\n    });\n    return [...future.map((item) => item.child), ...present];\n  };\n}\n__name(createChildOrderer, \"createChildOrderer\");\nfunction buildMultitreeLayerOrder(g, rankOf, laneOf) {\n  const tree = buildDrivingTree(g, {\n    rankHint: rankOf,\n    laneOf\n  });\n  const { children, roots } = tree;\n  for (const node of g.nodes) {\n    if (!children.has(node)) {\n      children.set(node, []);\n    }\n  }\n  const crossCounts = computeSubtreeCrossCounts(g, rankOf, tree);\n  const rootsSorted = [...roots].sort(compareByRankThenId(rankOf));\n  const minLayer = annotateMinimumLayers(rootsSorted, children, rankOf);\n  const orderChildren = createChildOrderer(children, rankOf, crossCounts, minLayer);\n  let layers = emitNodesInTreeOrder(rootsSorted, g.nodes, rankOf, orderChildren);\n  layers = deduplicateLayers(layers);\n  return layers;\n}\n__name(buildMultitreeLayerOrder, \"buildMultitreeLayerOrder\");\n\n// src/rendering-util/layout-algorithms/swimlanes/phase2.crossOptimization.ts\nfunction countCrossingsBetweenAdjacent(upper, lower, edges) {\n  const upperSet = new Set(upper);\n  const lowerSet = new Set(lower);\n  const li = buildLayerIndex(lower);\n  const vs = [];\n  for (const e of edges) {\n    if (upperSet.has(e.src) && lowerSet.has(e.dst)) {\n      vs.push(li.get(e.dst));\n    }\n  }\n  return countInversions(vs);\n}\n__name(countCrossingsBetweenAdjacent, \"countCrossingsBetweenAdjacent\");\nfunction totalCrossings(layers, edges, rankOf) {\n  const expanded = [];\n  for (const e of edges) {\n    const ru = rankOf[e.src];\n    const rv = rankOf[e.dst];\n    if (ru == null || rv == null || ru === rv) {\n      continue;\n    }\n    let upper = e.src;\n    let lower = e.dst;\n    let rUpper = ru;\n    let rLower = rv;\n    if (ru > rv) {\n      upper = e.dst;\n      lower = e.src;\n      rUpper = rv;\n      rLower = ru;\n    }\n    for (let L = rUpper; L < rLower; L++) {\n      expanded.push({ id: `${e.id}@${L}`, src: upper, dst: lower, ref: e.ref });\n    }\n  }\n  let sum = 0;\n  for (let i = 0; i + 1 < layers.length; i++) {\n    sum += countCrossingsBetweenAdjacent(layers[i], layers[i + 1], expanded);\n  }\n  return sum;\n}\n__name(totalCrossings, \"totalCrossings\");\nfunction optimizeRanksByCrossings(g, initialRank) {\n  const rankOf = { ...initialRank };\n  const { preds } = buildPredecessorSuccessorMaps(g);\n  const laneOf = createTopLaneResolver(g);\n  const layers = buildMultitreeLayerOrder(g, rankOf, laneOf);\n  let best = totalCrossings(layers, g.edges, rankOf);\n  const maxPasses = LAYERING.MAX_CROSSING_OPTIMIZATION_PASSES;\n  for (let pass = 0; pass < maxPasses; pass++) {\n    let changed = false;\n    const nodesByRank = [...g.nodes].sort((a, b) => (rankOf[b] ?? 0) - (rankOf[a] ?? 0));\n    for (const v of nodesByRank) {\n      const r = rankOf[v] ?? 0;\n      if (r === 0) {\n        continue;\n      }\n      let lb = 0;\n      for (const u of preds.get(v) ?? []) {\n        lb = Math.max(lb, (rankOf[u] ?? 0) + 1);\n      }\n      if (lb >= r) {\n        continue;\n      }\n      const old = r;\n      rankOf[v] = lb;\n      const trialLayers = buildMultitreeLayerOrder(g, rankOf, laneOf);\n      const score = totalCrossings(trialLayers, g.edges, rankOf);\n      if (score < best) {\n        best = score;\n        changed = true;\n      } else {\n        rankOf[v] = old;\n      }\n    }\n    if (!changed) {\n      break;\n    }\n  }\n  return rankOf;\n}\n__name(optimizeRanksByCrossings, \"optimizeRanksByCrossings\");\n\n// src/rendering-util/layout-algorithms/swimlanes/phase2.crossLaneAdjust.ts\nfunction adjustCrossLaneSources(g, rankOf) {\n  const topLaneOf = createTopLaneResolver(g);\n  const nodesByRank = [...g.nodes].sort(\n    (a, b) => (rankOf[a] ?? 0) - (rankOf[b] ?? 0) || a.localeCompare(b)\n  );\n  for (const v of nodesByRank) {\n    const laneV = topLaneOf(v);\n    if (!laneV) {\n      continue;\n    }\n    const outEdges = g.edges.filter((e) => e.src === v);\n    if (outEdges.length === 0) {\n      continue;\n    }\n    let hasSameLaneSucc = false;\n    let crossLaneCount = 0;\n    for (const e of outEdges) {\n      const laneDst = topLaneOf(e.dst);\n      if (laneDst == null || laneDst === laneV) {\n        hasSameLaneSucc = true;\n      } else {\n        crossLaneCount++;\n      }\n    }\n    if (crossLaneCount === 0 || hasSameLaneSucc) {\n      continue;\n    }\n    let crossLaneIncoming = 0;\n    let hasSameLanePred = false;\n    for (const e of g.edges) {\n      if (e.dst !== v) {\n        continue;\n      }\n      const laneSrc = topLaneOf(e.src);\n      if (!laneSrc) {\n        continue;\n      }\n      if (laneSrc === laneV) {\n        hasSameLanePred = true;\n      } else {\n        crossLaneIncoming++;\n      }\n    }\n    if (crossLaneIncoming > 0 || !hasSameLanePred) {\n      continue;\n    }\n    const current = rankOf[v] ?? 0;\n    const target = current + crossLaneCount;\n    let lb = 0;\n    for (const e of g.edges) {\n      if (e.dst === v) {\n        lb = Math.max(lb, (rankOf[e.src] ?? 0) + 1);\n      }\n    }\n    const newRank = Math.max(current, lb, target);\n    if (newRank !== current) {\n      rankOf[v] = newRank;\n    }\n  }\n}\n__name(adjustCrossLaneSources, \"adjustCrossLaneSources\");\n\n// src/rendering-util/layout-algorithms/swimlanes/phase2.longestPath.ts\nfunction assignLayers_LongestPath(gAcyclic, opts) {\n  const g = normalizeGraph(gAcyclic);\n  const order = topoSortIfAcyclic(g) ?? [...g.nodes].sort();\n  const compact = opts?.compactSingleInput ?? false;\n  const topLaneOf = createTopLaneResolver(g);\n  let rankOf = /* @__PURE__ */ Object.create(null);\n  for (const v of order) {\n    const incAll = incoming(g, v);\n    const inc = opts?.ignoreCrossLaneEdges ? incAll.filter((e) => {\n      const laneSrc = topLaneOf(e.src);\n      const laneDst = topLaneOf(v);\n      if (!laneSrc || !laneDst) {\n        return true;\n      }\n      return laneSrc === laneDst;\n    }) : incAll;\n    if (inc.length === 0) {\n      rankOf[v] = 0;\n    } else if (compact && inc.length === 1) {\n      const u = inc[0].src;\n      const laneU = topLaneOf(u);\n      const laneV = topLaneOf(v);\n      if (laneU !== laneV) {\n        rankOf[v] = rankOf[u] ?? 0;\n      } else {\n        rankOf[v] = (rankOf[u] ?? 0) + 1;\n      }\n    } else {\n      let mx = -Infinity;\n      for (const e of inc) {\n        mx = Math.max(mx, (rankOf[e.src] ?? 0) + 1);\n      }\n      rankOf[v] = mx === -Infinity ? 0 : mx;\n    }\n  }\n  if (opts?.optimizeRanksByCrossings ?? false) {\n    rankOf = optimizeRanksByCrossings(g, rankOf);\n  }\n  if (opts?.ignoreCrossLaneEdges) {\n    adjustCrossLaneSources(g, rankOf);\n  }\n  const layers = buildMultitreeLayerOrder(g, rankOf, topLaneOf);\n  return { layers, rankOf, dummy: /* @__PURE__ */ new Set() };\n}\n__name(assignLayers_LongestPath, \"assignLayers_LongestPath\");\n\n// src/rendering-util/layout-algorithms/swimlanes/phase2.gravity.ts\nfunction assignLayers_Gravity(gAcyclic, opts) {\n  const g = normalizeGraph(gAcyclic);\n  const base = assignLayers_LongestPath(g, {\n    compactSingleInput: opts?.compactSingleInput,\n    ignoreCrossLaneEdges: opts?.ignoreCrossLaneEdges,\n    optimizeRanksByCrossings: opts?.optimizeRanksByCrossings\n  });\n  const rankOf = { ...base.rankOf };\n  const topLaneOf = createTopLaneResolver(g);\n  const { preds, succs } = buildPredecessorSuccessorMaps(g, (e) => {\n    if (opts?.ignoreCrossLaneEdges) {\n      const laneSrc = topLaneOf(e.src);\n      const laneDst = topLaneOf(e.dst);\n      if (laneSrc && laneDst && laneSrc !== laneDst) {\n        return false;\n      }\n    }\n    return true;\n  });\n  const order = topoSortIfAcyclic(g) ?? [...g.nodes];\n  const revOrder = [...order].reverse();\n  const clampFeasible = /* @__PURE__ */ __name((v, desired) => {\n    let lb = 0;\n    for (const u of preds.get(v) ?? []) {\n      lb = Math.max(lb, (rankOf[u] ?? 0) + 1);\n    }\n    let ub = Number.POSITIVE_INFINITY;\n    const s = succs.get(v) ?? [];\n    if (s.length > 0) {\n      ub = Math.min(...s.map((w) => (rankOf[w] ?? 0) - 1));\n    }\n    if (!Number.isFinite(ub)) {\n      ub = Math.max(lb, desired);\n    }\n    return Math.min(Math.max(desired, lb), ub);\n  }, \"clampFeasible\");\n  const iters = LAYERING.GRAVITY_ITERATIONS;\n  const relaxOrder = /* @__PURE__ */ __name((nodeOrder) => {\n    let changed = false;\n    for (const v of nodeOrder) {\n      const ps = preds.get(v) ?? [];\n      const ss = succs.get(v) ?? [];\n      if (ps.length === 0 && ss.length === 0) {\n        continue;\n      }\n      const predAvg = ps.length > 0 ? ps.reduce((a, u) => a + (rankOf[u] ?? 0) + 1, 0) / ps.length : rankOf[v] ?? 0;\n      const succAvg = ss.length > 0 ? ss.reduce((a, w) => a + (rankOf[w] ?? 0) - 1, 0) / ss.length : rankOf[v] ?? 0;\n      const desired = Math.round((predAvg + succAvg) / 2);\n      const clamped = clampFeasible(v, desired);\n      if (clamped !== rankOf[v]) {\n        rankOf[v] = clamped;\n        changed = true;\n      }\n    }\n    return changed;\n  }, \"relaxOrder\");\n  for (let it = 0; it < iters; it++) {\n    const forwardChanged = relaxOrder(order);\n    const backwardChanged = relaxOrder(revOrder);\n    if (!forwardChanged && !backwardChanged) {\n      break;\n    }\n  }\n  for (const v of order) {\n    let lb = 0;\n    for (const u of preds.get(v) ?? []) {\n      lb = Math.max(lb, (rankOf[u] ?? 0) + 1);\n    }\n    if ((rankOf[v] ?? 0) < lb) {\n      rankOf[v] = lb;\n    }\n  }\n  for (const v of revOrder) {\n    const s = succs.get(v) ?? [];\n    if (s.length > 0) {\n      const ub = Math.min(...s.map((w) => (rankOf[w] ?? 0) - 1));\n      if ((rankOf[v] ?? 0) > ub) {\n        rankOf[v] = ub;\n      }\n    }\n  }\n  const layers = buildLayersFromRanks(g, order, rankOf);\n  return { layers, rankOf, dummy: /* @__PURE__ */ new Set() };\n}\n__name(assignLayers_Gravity, \"assignLayers_Gravity\");\n\n// src/rendering-util/layout-algorithms/swimlanes/phase2.laneAwareCompact.ts\nfunction topoSortByGenerationIfAcyclic(g) {\n  const indeg = buildInDegreeMap(g);\n  const adj = buildSortedSuccessorMap(g);\n  let frontier = sortedZeroInDegreeNodes(indeg);\n  const order = [];\n  while (frontier.length > 0) {\n    const nextFrontier = [];\n    for (const u of frontier) {\n      order.push(u);\n      for (const v of adj.get(u) ?? []) {\n        indeg.set(v, (indeg.get(v) ?? 0) - 1);\n        if ((indeg.get(v) ?? 0) === 0) {\n          nextFrontier.push(v);\n        }\n      }\n    }\n    frontier = nextFrontier.sort((a, b) => a.localeCompare(b));\n  }\n  return order.length === g.nodes.length ? order : null;\n}\n__name(topoSortByGenerationIfAcyclic, \"topoSortByGenerationIfAcyclic\");\nfunction assignLayers_LaneAwareCompact(gAcyclic, opts) {\n  const g = normalizeGraph(gAcyclic);\n  const order = opts?.direction === \"LR\" ? topoSortByGenerationIfAcyclic(g) ?? [...g.nodes].sort() : topoSortIfAcyclic(g) ?? [...g.nodes].sort();\n  const topLaneOf = createTopLaneResolver(g);\n  const laneOf = /* @__PURE__ */ __name((id) => topLaneOf(id) ?? id, \"laneOf\");\n  const rankOf = /* @__PURE__ */ Object.create(null);\n  const nextFree = /* @__PURE__ */ new Map();\n  const edgeWeight = /* @__PURE__ */ __name((u, v) => {\n    const ignoreCrossLane = opts?.ignoreCrossLaneEdges ?? true;\n    if (ignoreCrossLane) {\n      return laneOf(u) === laneOf(v) ? 1 : 0;\n    }\n    return 1;\n  }, \"edgeWeight\");\n  for (const v of order) {\n    const node = g.nodeById.get(v);\n    if (node?.isGroup) {\n      continue;\n    }\n    const preds = incoming(g, v);\n    let base = 0;\n    if (preds.length > 0) {\n      for (const e of preds) {\n        const u = e.src;\n        const ru = rankOf[u] ?? 0;\n        base = Math.max(base, ru + edgeWeight(u, v));\n      }\n    }\n    const lane = laneOf(v);\n    const nf = nextFree.get(lane) ?? 0;\n    const L = Math.max(base, nf);\n    rankOf[v] = L;\n    nextFree.set(lane, L + 1);\n  }\n  const layers = buildLayersFromRanks(g, order, rankOf, { skipGroups: true });\n  return { layers, rankOf, dummy: /* @__PURE__ */ new Set() };\n}\n__name(assignLayers_LaneAwareCompact, \"assignLayers_LaneAwareCompact\");\n\n// src/rendering-util/layout-algorithms/swimlanes/phase2.dummies.ts\nfunction makeProperLayering(layering, gAcyclic) {\n  const g = normalizeGraph(gAcyclic);\n  const { rankOf } = layering;\n  const layers = layering.layers.map((l) => [...l]);\n  const dummy = new Set(layering.dummy ? [...layering.dummy] : []);\n  let dummySeq = 0;\n  const nodeById = new Map(g.nodeById);\n  const addDummyAt = /* @__PURE__ */ __name((L) => {\n    const id = `placeholder-${dummySeq++}`;\n    const dn = { id, isGroup: false, isDummy: true, width: 0, height: 0 };\n    nodeById.set(id, dn);\n    dummy.add(id);\n    while (layers.length <= L) {\n      layers.push([]);\n    }\n    layers[L].push(id);\n    rankOf[id] = L;\n    return id;\n  }, \"addDummyAt\");\n  const edgesSorted = [...g.edges].sort(\n    (a, b) => a.id === b.id ? a.src === b.src ? a.dst.localeCompare(b.dst) : a.src.localeCompare(b.src) : a.id.localeCompare(b.id)\n  );\n  const newEdges = [];\n  for (const e of edgesSorted) {\n    const rU = rankOf[e.src] ?? 0;\n    const rV = rankOf[e.dst] ?? 0;\n    if (rV - rU <= 1) {\n      newEdges.push(e);\n      continue;\n    }\n    let prev = e.src;\n    for (let L = rU + 1, k = 0; L < rV; L++, k++) {\n      const d = addDummyAt(L);\n      newEdges.push({ id: `${e.id}#${k}`, src: prev, dst: d, weight: e.weight, ref: e.ref });\n      prev = d;\n    }\n    const lastIndex = rV - rU - 2;\n    newEdges.push({\n      id: `${e.id}#${Math.max(lastIndex + 1, 0)}`,\n      src: prev,\n      dst: e.dst,\n      weight: e.weight,\n      ref: e.ref\n    });\n  }\n  const nodes = [...g.nodes, ...[...dummy].filter((id) => !g.nodes.includes(id))];\n  const graphWithDummies = { nodes, edges: newEdges, layout: g.layout, nodeById };\n  return { layering: { layers, rankOf, dummy }, graphWithDummies };\n}\n__name(makeProperLayering, \"makeProperLayering\");\n\n// src/rendering-util/layout-algorithms/swimlanes/phase3.ordering.ts\nfunction median(values) {\n  const n = values.length;\n  if (n === 0) {\n    return Number.POSITIVE_INFINITY;\n  }\n  const a = [...values].sort((x, y) => x - y);\n  if (n % 2 === 1) {\n    return a[(n - 1) / 2];\n  }\n  return 0.5 * (a[n / 2 - 1] + a[n / 2]);\n}\n__name(median, \"median\");\nfunction barycenter(values) {\n  if (values.length === 0) {\n    return Number.POSITIVE_INFINITY;\n  }\n  const s = values.reduce((acc, v) => acc + v, 0);\n  return s / values.length;\n}\n__name(barycenter, \"barycenter\");\nfunction neighborPositionsFor(targetNodes, fixedIndex, edges, direction) {\n  const neighborPositions = /* @__PURE__ */ new Map();\n  for (const v of targetNodes) {\n    neighborPositions.set(v, []);\n  }\n  for (const e of edges) {\n    if (direction === \"down\") {\n      if (fixedIndex.has(e.src) && neighborPositions.has(e.dst)) {\n        neighborPositions.get(e.dst).push(fixedIndex.get(e.src));\n      }\n    } else if (fixedIndex.has(e.dst) && neighborPositions.has(e.src)) {\n      neighborPositions.get(e.src).push(fixedIndex.get(e.dst));\n    }\n  }\n  return neighborPositions;\n}\n__name(neighborPositionsFor, \"neighborPositionsFor\");\nfunction currentOrderTieBreak(a, b, currentLayerIndex) {\n  const ia = currentLayerIndex.get(a) ?? 0;\n  const ib = currentLayerIndex.get(b) ?? 0;\n  return ia !== ib ? ia - ib : a.localeCompare(b);\n}\n__name(currentOrderTieBreak, \"currentOrderTieBreak\");\nfunction countCrossingsBetweenAdjacent2(upper, lower, edges) {\n  const upperSet = new Set(upper);\n  const lowerSet = new Set(lower);\n  const upperIndex = buildLayerIndex(upper);\n  const lowerIndex = buildLayerIndex(lower);\n  const pairs = [];\n  for (const e of edges) {\n    if (upperSet.has(e.src) && lowerSet.has(e.dst)) {\n      pairs.push({ u: upperIndex.get(e.src), v: lowerIndex.get(e.dst) });\n    }\n  }\n  pairs.sort((a, b) => a.u === b.u ? a.v - b.v : a.u - b.u);\n  const vs = pairs.map((p) => p.v);\n  return countInversions(vs);\n}\n__name(countCrossingsBetweenAdjacent2, \"countCrossingsBetweenAdjacent\");\nfunction sortByHeuristic(nodes, neighborPositions, currentLayerIndex) {\n  return [...nodes].sort((a, b) => {\n    const sa = median(neighborPositions.get(a) ?? []);\n    const sb = median(neighborPositions.get(b) ?? []);\n    if (sa === sb) {\n      return currentOrderTieBreak(a, b, currentLayerIndex);\n    }\n    if (!isFinite(sa)) {\n      return 1;\n    }\n    if (!isFinite(sb)) {\n      return -1;\n    }\n    return sa - sb;\n  });\n}\n__name(sortByHeuristic, \"sortByHeuristic\");\nfunction reorderLayer(fixedLayer, targetLayer, edges, direction, topLaneOf, laneOrder) {\n  const fixedIndex = buildLayerIndex(fixedLayer);\n  const currIndex = buildLayerIndex(targetLayer);\n  const neighborPositions = neighborPositionsFor(targetLayer, fixedIndex, edges, direction);\n  if (!topLaneOf || !laneOrder || laneOrder.length === 0) {\n    return sortByHeuristic(targetLayer, neighborPositions, currIndex);\n  }\n  const byLane = /* @__PURE__ */ new Map();\n  for (const id of targetLayer) {\n    const lane = topLaneOf(id);\n    const arr = byLane.get(lane) ?? [];\n    arr.push(id);\n    byLane.set(lane, arr);\n  }\n  const result = [];\n  for (const lane of laneOrder) {\n    const nodesInLane = byLane.get(lane);\n    if (!nodesInLane || nodesInLane.length === 0) {\n      continue;\n    }\n    const sorted = sortByHeuristic(nodesInLane, neighborPositions, currIndex);\n    result.push(...sorted);\n  }\n  const nullNodes = byLane.get(null);\n  if (nullNodes && nullNodes.length > 0) {\n    const sorted = sortByHeuristic(nullNodes, neighborPositions, currIndex);\n    for (const nid of sorted) {\n      const bc = barycenter(neighborPositions.get(nid) ?? []);\n      let bestIdx = result.length;\n      if (isFinite(bc)) {\n        for (const [i, rid] of result.entries()) {\n          const rBc = barycenter(neighborPositions.get(rid) ?? []);\n          if (bc < rBc) {\n            bestIdx = i;\n            break;\n          }\n        }\n      }\n      result.splice(bestIdx, 0, nid);\n    }\n  }\n  return result;\n}\n__name(reorderLayer, \"reorderLayer\");\nfunction transposeImprove(upper, current, edges, next, topLaneOf) {\n  const best = [...current];\n  const upperSet = new Set(upper);\n  const layerSet = new Set(current);\n  const nextSet = next ? new Set(next) : null;\n  const edgesIn = edges.filter((e) => upperSet.has(e.src) && layerSet.has(e.dst));\n  const edgesOut = nextSet ? edges.filter((e) => layerSet.has(e.src) && nextSet.has(e.dst)) : void 0;\n  const crossingScore = /* @__PURE__ */ __name((order) => {\n    let score = countCrossingsBetweenAdjacent2(upper, order, edgesIn);\n    if (edgesOut && next) {\n      score += countCrossingsBetweenAdjacent2(order, next, edgesOut);\n    }\n    return score;\n  }, \"crossingScore\");\n  const laneOf = topLaneOf ? /* @__PURE__ */ new Map() : null;\n  if (topLaneOf && laneOf) {\n    for (const id of current) {\n      laneOf.set(id, topLaneOf(id));\n    }\n  }\n  let improved = true;\n  let bestScore = crossingScore(best);\n  while (improved) {\n    improved = false;\n    for (let i = 0; i + 1 < best.length; i++) {\n      if (laneOf) {\n        const laneA = laneOf.get(best[i]);\n        const laneB = laneOf.get(best[i + 1]);\n        if (laneA !== laneB) {\n          continue;\n        }\n      }\n      const prev = bestScore;\n      [best[i], best[i + 1]] = [best[i + 1], best[i]];\n      const nextScore = crossingScore(best);\n      if (nextScore < prev) {\n        bestScore = nextScore;\n        improved = true;\n      } else {\n        [best[i], best[i + 1]] = [best[i + 1], best[i]];\n      }\n    }\n  }\n  return best;\n}\n__name(transposeImprove, \"transposeImprove\");\nfunction orderLayers(layering, gWithDummies, opts) {\n  const layers = layering.layers.map((l) => [...l]);\n  const edges = gWithDummies.edges;\n  const topLaneOf = createTopLaneResolver(gWithDummies);\n  const laneOrder = resolveTopLaneOrder(gWithDummies, opts?.laneOrder);\n  for (let s = 0; s < 3; s++) {\n    for (let i = 1; i < layers.length; i++) {\n      layers[i] = reorderLayer(layers[i - 1], layers[i], edges, \"down\", topLaneOf, laneOrder);\n      layers[i] = transposeImprove(layers[i - 1], layers[i], edges, layers[i + 1], topLaneOf);\n    }\n    for (let i = layers.length - 2; i >= 0; i--) {\n      layers[i] = reorderLayer(layers[i + 1], layers[i], edges, \"up\", topLaneOf, laneOrder);\n      layers[i] = transposeImprove(layers[i + 1], layers[i], edges, layers[i - 1], topLaneOf);\n    }\n  }\n  return { layers };\n}\n__name(orderLayers, \"orderLayers\");\n\n// src/rendering-util/layout-algorithms/swimlanes/phase4.coordinates.ts\nfunction assignCoordinates(ordered, gWithDummies, opts) {\n  const layerGap = opts?.layerGap ?? COORDINATES.DEFAULT_LAYER_GAP;\n  const nodeGap = opts?.nodeGap ?? COORDINATES.DEFAULT_NODE_GAP;\n  const laneGap = opts?.laneGap ?? nodeGap * 2;\n  const direction = opts?.direction ?? \"TB\";\n  const isHorizontal = direction === \"LR\" || direction === \"RL\";\n  const layers = ordered.layers;\n  const x = /* @__PURE__ */ Object.create(null);\n  const y = /* @__PURE__ */ Object.create(null);\n  const getNode = /* @__PURE__ */ __name((id) => gWithDummies.nodeById.get(id), \"getNode\");\n  const getWidth = /* @__PURE__ */ __name((id) => getNode(id)?.width ?? 0, \"getWidth\");\n  const getHeight = /* @__PURE__ */ __name((id) => getNode(id)?.height ?? 0, \"getHeight\");\n  const topLaneOf = createTopLaneResolver(gWithDummies);\n  const laneOrderGlobal = resolveTopLaneOrder(gWithDummies, opts?.laneOrder);\n  const layerHeights = layers.map(\n    (layer) => layer.reduce((m, v) => Math.max(m, getHeight(v)), 0)\n  );\n  const extraLayerGaps = [];\n  if (isHorizontal) {\n    for (let i = 0; i + 1 < layers.length; i++) {\n      const thisLayerMaxWidth = layers[i].reduce((m, v) => Math.max(m, getWidth(v)), 0);\n      const nextLayerMaxWidth = layers[i + 1].reduce((m, v) => Math.max(m, getWidth(v)), 0);\n      const thisLayerMaxHeight = layerHeights[i];\n      const nextLayerMaxHeight = layerHeights[i + 1];\n      const normalSpacing = thisLayerMaxHeight / 2 + nextLayerMaxHeight / 2;\n      const requiredSpacing = (thisLayerMaxWidth + nextLayerMaxWidth) / 2;\n      const extraNeeded = Math.max(0, requiredSpacing - normalSpacing - layerGap);\n      extraLayerGaps.push(extraNeeded);\n    }\n  }\n  const lanesUsedSet = /* @__PURE__ */ new Set();\n  for (const layer of layers) {\n    for (const id of layer) {\n      lanesUsedSet.add(topLaneOf(id));\n    }\n  }\n  const hasNullLane = lanesUsedSet.has(null);\n  const lanesUsed = laneOrderGlobal.filter((L) => lanesUsedSet.has(L));\n  const laneOrderColumns = [...hasNullLane ? [null] : [], ...lanesUsed];\n  const laneWidth = /* @__PURE__ */ Object.create(null);\n  for (const L of lanesUsed) {\n    laneWidth[L] = 0;\n  }\n  if (hasNullLane) {\n    laneWidth.null = 0;\n  }\n  for (const layer of layers) {\n    const perLane = /* @__PURE__ */ Object.create(null);\n    const nullIds = [];\n    for (const id of layer) {\n      const L = topLaneOf(id);\n      if (L === null) {\n        nullIds.push(id);\n      } else {\n        (perLane[L] ||= []).push(id);\n      }\n    }\n    for (const [L, ids] of Object.entries(perLane)) {\n      const total = ids.reduce((s, id) => s + getWidth(id), 0) + nodeGap * Math.max(0, ids.length - 1);\n      laneWidth[L] = Math.max(laneWidth[L] ?? 0, total);\n    }\n    if (hasNullLane && nullIds.length) {\n      const totalNull = nullIds.reduce((s, id) => s + getWidth(id), 0) + nodeGap * Math.max(0, nullIds.length - 1);\n      laneWidth.null = Math.max(laneWidth.null ?? 0, totalNull);\n    }\n  }\n  const centerX = /* @__PURE__ */ new Map();\n  {\n    const widths = laneOrderColumns.map(\n      (L) => (L === null ? laneWidth.null : laneWidth[L]) ?? 0\n    );\n    const totalW = widths.reduce((a, b) => a + b, 0) + laneGap * Math.max(0, laneOrderColumns.length - 1);\n    let cursor = -totalW / 2;\n    for (let i = 0; i < laneOrderColumns.length; i++) {\n      const L = laneOrderColumns[i];\n      const w = widths[i] ?? 0;\n      const cx = cursor + w / 2;\n      centerX.set(L, cx);\n      cursor += w;\n      if (i < laneOrderColumns.length - 1) {\n        cursor += laneGap;\n      }\n    }\n  }\n  let yOffset = 0;\n  for (const [li, layer] of layers.entries()) {\n    const layerH = layerHeights[li] ?? 0;\n    const byLane = /* @__PURE__ */ new Map();\n    for (const id of layer) {\n      const laneId = topLaneOf(id);\n      const arr = byLane.get(laneId) ?? [];\n      arr.push(id);\n      byLane.set(laneId, arr);\n    }\n    for (const L of laneOrderColumns) {\n      const nodesInLane = byLane.get(L) ?? [];\n      if (nodesInLane.length === 0) {\n        continue;\n      }\n      const cx = centerX.get(L);\n      if (nodesInLane.length === 1) {\n        const id = nodesInLane[0];\n        x[id] = cx;\n        y[id] = yOffset + layerH / 2;\n      } else {\n        const widths = nodesInLane.map((id) => getWidth(id));\n        const total = widths.reduce((a, b) => a + b, 0) + nodeGap * (nodesInLane.length - 1);\n        let start = cx - total / 2;\n        for (const [i, id] of nodesInLane.entries()) {\n          const w = widths[i];\n          x[id] = start + w / 2;\n          y[id] = yOffset + layerH / 2;\n          start += w + nodeGap;\n        }\n      }\n    }\n    const extraGap = extraLayerGaps[li] ?? 0;\n    yOffset += layerH + layerGap + extraGap;\n  }\n  const byRef = /* @__PURE__ */ new Map();\n  for (const e of gWithDummies.edges) {\n    const rid = e.ref.id;\n    if (!byRef.has(rid)) {\n      byRef.set(rid, []);\n    }\n    byRef.get(rid).push(e);\n  }\n  for (const [, chainEdges] of byRef) {\n    if (chainEdges.length === 0) {\n      continue;\n    }\n    const ref = chainEdges[0].ref;\n    const src = ref.start;\n    const dst = ref.end;\n    if (src == null || dst == null) {\n      continue;\n    }\n    const midX = Math.round(((x[src] ?? 0) + (x[dst] ?? 0)) / 2);\n    const involved = /* @__PURE__ */ new Set();\n    for (const e of chainEdges) {\n      involved.add(e.src);\n      involved.add(e.dst);\n    }\n    for (const vid of involved) {\n      if (vid === src || vid === dst) {\n        continue;\n      }\n      const node = gWithDummies.nodeById.get(vid);\n      if (node?.isDummy) {\n        x[vid] = midX;\n      }\n    }\n  }\n  return { x, y };\n}\n__name(assignCoordinates, \"assignCoordinates\");\n\n// src/rendering-util/layout-algorithms/swimlanes/laneOrdering.ts\nvar AUTOMATIC_LANE_ORDERING_RESTARTS = 8;\nfunction hashString(input) {\n  let hash = 2166136261;\n  for (let i = 0; i < input.length; i++) {\n    hash ^= input.charCodeAt(i);\n    hash = Math.imul(hash, 16777619);\n  }\n  return hash >>> 0;\n}\n__name(hashString, \"hashString\");\nfunction mulberry32(seed) {\n  let state = seed >>> 0;\n  return () => {\n    state += 1831565813;\n    let t = state;\n    t = Math.imul(t ^ t >>> 15, t | 1);\n    t ^= t + Math.imul(t ^ t >>> 7, t | 61);\n    return ((t ^ t >>> 14) >>> 0) / 4294967296;\n  };\n}\n__name(mulberry32, \"mulberry32\");\nfunction deterministicShuffle(order, seed) {\n  const shuffled = [...order];\n  const random = mulberry32(seed);\n  for (let i = shuffled.length - 1; i > 0; i--) {\n    const j = Math.floor(random() * (i + 1));\n    [shuffled[i], shuffled[j]] = [shuffled[j], shuffled[i]];\n  }\n  return shuffled;\n}\n__name(deterministicShuffle, \"deterministicShuffle\");\nfunction sourceDistance(order, sourceIndex) {\n  let distance = 0;\n  for (const [index, laneId] of order.entries()) {\n    distance += Math.abs(index - (sourceIndex.get(laneId) ?? index));\n  }\n  return distance;\n}\n__name(sourceDistance, \"sourceDistance\");\nfunction laneArrangementCost(order, weights) {\n  const position = /* @__PURE__ */ new Map();\n  for (const [index, laneId] of order.entries()) {\n    position.set(laneId, index);\n  }\n  let cost = 0;\n  for (const { a, b, weight } of weights) {\n    const ai = position.get(a);\n    const bi = position.get(b);\n    if (ai == null || bi == null) {\n      continue;\n    }\n    cost += weight * Math.abs(ai - bi);\n  }\n  return cost;\n}\n__name(laneArrangementCost, \"laneArrangementCost\");\nfunction buildWeightedLaneEdges(g) {\n  const sourceOrder = buildTopLaneOrder(g);\n  if (sourceOrder.length < 2) {\n    return [];\n  }\n  const sourceIndex = new Map(sourceOrder.map((laneId, index) => [laneId, index]));\n  const topLaneOf = createTopLaneResolver(g);\n  const weights = /* @__PURE__ */ new Map();\n  for (const edge of g.layout.edges ?? []) {\n    if (edge.isLayoutOnly) {\n      continue;\n    }\n    const src = typeof edge.start === \"string\" ? edge.start : void 0;\n    const dst = typeof edge.end === \"string\" ? edge.end : void 0;\n    if (!src || !dst || !g.nodeById.has(src) || !g.nodeById.has(dst)) {\n      continue;\n    }\n    const laneA = topLaneOf(src);\n    const laneB = topLaneOf(dst);\n    if (!laneA || !laneB || laneA === laneB) {\n      continue;\n    }\n    const ia = sourceIndex.get(laneA);\n    const ib = sourceIndex.get(laneB);\n    if (ia == null || ib == null) {\n      continue;\n    }\n    const [a, b] = ia <= ib ? [laneA, laneB] : [laneB, laneA];\n    const key = `${a}\\0${b}`;\n    const existing = weights.get(key);\n    if (existing) {\n      existing.weight++;\n    } else {\n      weights.set(key, { a, b, weight: 1 });\n    }\n  }\n  return [...weights.values()];\n}\n__name(buildWeightedLaneEdges, \"buildWeightedLaneEdges\");\nfunction greedySwitch(startOrder, weights, sourceIndex) {\n  const order = [...startOrder];\n  let cost = laneArrangementCost(order, weights);\n  let changed = true;\n  let sweeps = 0;\n  const maxSweeps = Math.max(1, order.length);\n  while (changed && sweeps < maxSweeps) {\n    changed = false;\n    sweeps++;\n    for (let i = 0; i + 1 < order.length; i++) {\n      [order[i], order[i + 1]] = [order[i + 1], order[i]];\n      const nextCost = laneArrangementCost(order, weights);\n      if (nextCost < cost) {\n        cost = nextCost;\n        changed = true;\n      } else {\n        [order[i], order[i + 1]] = [order[i + 1], order[i]];\n      }\n    }\n  }\n  return {\n    order,\n    cost,\n    sourceDistance: sourceDistance(order, sourceIndex)\n  };\n}\n__name(greedySwitch, \"greedySwitch\");\nfunction isBetterCandidate(candidate, best) {\n  if (candidate.cost !== best.cost) {\n    return candidate.cost < best.cost;\n  }\n  return candidate.sourceDistance < best.sourceDistance;\n}\n__name(isBetterCandidate, \"isBetterCandidate\");\nfunction seedForRestart(sourceOrder, weights, restartIndex) {\n  const weightSignature = [...weights].sort((a, b) => a.a === b.a ? a.b.localeCompare(b.b) : a.a.localeCompare(b.a)).map(({ a, b, weight }) => `${a}:${b}:${weight}`).join(\"|\");\n  return hashString(`${sourceOrder.join(\"|\")}#${weightSignature}#${restartIndex}`);\n}\n__name(seedForRestart, \"seedForRestart\");\nfunction optimizeTopLaneOrder(g, opts = {}) {\n  const sourceOrder = buildTopLaneOrder(g);\n  if (sourceOrder.length < 2) {\n    return sourceOrder;\n  }\n  const weights = buildWeightedLaneEdges(g);\n  if (weights.length === 0) {\n    return sourceOrder;\n  }\n  const sourceIndex = new Map(sourceOrder.map((laneId, index) => [laneId, index]));\n  let best = greedySwitch(sourceOrder, weights, sourceIndex);\n  const restarts = Math.max(0, opts.restarts ?? AUTOMATIC_LANE_ORDERING_RESTARTS);\n  for (let i = 0; i < restarts; i++) {\n    const seed = seedForRestart(sourceOrder, weights, i);\n    const start = deterministicShuffle(sourceOrder, seed);\n    const candidate = greedySwitch(start, weights, sourceIndex);\n    if (isBetterCandidate(candidate, best)) {\n      best = candidate;\n    }\n  }\n  return best.order;\n}\n__name(optimizeTopLaneOrder, \"optimizeTopLaneOrder\");\n\n// src/rendering-util/layout-algorithms/swimlanes/pipeline.ts\nfunction sugiyamaLayout(g, opts) {\n  const ignoreCrossLaneEdges = opts?.ignoreCrossLaneEdges ?? true;\n  const optimizeRanksByCrossings2 = opts?.optimizeRanksByCrossings ?? true;\n  const g0 = normalizeGraph(g);\n  const laneOrder = opts?.automaticLaneOrdering ? optimizeTopLaneOrder(g0, { restarts: AUTOMATIC_LANE_ORDERING_RESTARTS }) : void 0;\n  const cycleRes = removeCycles_DFS(g0);\n  const gAcyclic = cycleRes.acyclic;\n  const layering = ignoreCrossLaneEdges ? assignLayers_LaneAwareCompact(gAcyclic, {\n    compactSingleInput: opts?.compactSingleInput ?? LAYERING.DEFAULT_COMPACT_SINGLE_INPUT,\n    ignoreCrossLaneEdges: true,\n    direction: opts?.direction\n  }) : assignLayers_Gravity(gAcyclic, {\n    compactSingleInput: opts?.compactSingleInput ?? LAYERING.DEFAULT_COMPACT_SINGLE_INPUT,\n    ignoreCrossLaneEdges: false,\n    optimizeRanksByCrossings: optimizeRanksByCrossings2\n  });\n  const { layering: properLayering, graphWithDummies } = makeProperLayering(layering, gAcyclic);\n  const ordered = orderLayers(properLayering, graphWithDummies, { laneOrder });\n  const coordinates = assignCoordinates(ordered, graphWithDummies, {\n    layerGap: opts?.layerGap,\n    nodeGap: opts?.nodeGap,\n    direction: opts?.direction,\n    laneOrder\n  });\n  return {\n    acyclic: gAcyclic,\n    reversed: cycleRes.reversed,\n    layering: properLayering,\n    ordered,\n    coordinates\n  };\n}\n__name(sugiyamaLayout, \"sugiyamaLayout\");\n\n// src/rendering-util/layout-algorithms/swimlanes/orthogonalRouter/router.ts\nvar EPS7 = PRECISION.EPSILON;\nvar NODE_PADDING = 8;\nvar HORIZONTAL_PIPE_MARGIN = 15;\nvar VERTICAL_PIPE_MARGIN = 15;\nvar ROUTING_MARGIN = 25;\nvar ANCHOR_OFFSET = 20;\nvar TRACK_SPACING = 10;\nfunction chooseOrthogonalSide(node, target, fallback) {\n  const cx = node.x ?? 0;\n  const cy = node.y ?? 0;\n  const dx = target.x - cx;\n  const dy = target.y - cy;\n  const absDx = Math.abs(dx);\n  const absDy = Math.abs(dy);\n  if (absDx < EPS7 && absDy < EPS7) {\n    return fallback;\n  }\n  const verticalBias = 3;\n  if (absDy > EPS7 && absDy * verticalBias >= absDx) {\n    return dy > 0 ? \"bottom\" : \"top\";\n  }\n  if (absDx > EPS7) {\n    return dx > 0 ? \"right\" : \"left\";\n  }\n  return fallback;\n}\n__name(chooseOrthogonalSide, \"chooseOrthogonalSide\");\nfunction sharedLineEndpointCoord(line, nextLine) {\n  return Math.abs(line.to - nextLine.from) < EPS7 || Math.abs(line.to - nextLine.to) < EPS7 ? line.to : line.from;\n}\n__name(sharedLineEndpointCoord, \"sharedLineEndpointCoord\");\nfunction pointOnLine(line, along) {\n  return line.orient === \"vertical\" ? { x: line.coord, y: along } : { x: along, y: line.coord };\n}\n__name(pointOnLine, \"pointOnLine\");\nfunction routeEdgesOrthogonal(data, direction) {\n  const nodes = data.nodes ?? [];\n  const originalEdges = data.edges ?? [];\n  const edges = [];\n  for (const oe of originalEdges) {\n    if (oe.isLayoutOnly) {\n      continue;\n    }\n    edges.push({\n      ...oe,\n      __originalEdge: oe\n    });\n  }\n  const nodeById = /* @__PURE__ */ new Map();\n  const laneByNodeId = /* @__PURE__ */ new Map();\n  const pipes = [];\n  const isLR = direction === \"LR\";\n  for (const n of nodes) {\n    nodeById.set(n.id, n);\n  }\n  const topLevelGroups = nodes.filter((n) => n.isGroup && !n.parentId);\n  for (const group of topLevelGroups) {\n    const lane = { id: group.id };\n    const assignLane = /* @__PURE__ */ __name((n) => {\n      laneByNodeId.set(n.id, lane);\n      nodes.filter((child) => child.parentId === n.id).forEach(assignLane);\n    }, \"assignLane\");\n    assignLane(group);\n  }\n  const obstacles = nodes.filter((n) => !n.isGroup && !n.isEdgeLabel).map((n) => {\n    const w = n.width ?? 10;\n    const h = n.height ?? 10;\n    const x = n.x ?? 0;\n    const y = n.y ?? 0;\n    const padding = NODE_PADDING;\n    return {\n      nodeId: n.id,\n      minX: x - w / 2 - padding,\n      maxX: x + w / 2 + padding,\n      minY: y - h / 2 - padding,\n      maxY: y + h / 2 + padding,\n      // For LR: TB x becomes LR y, so visual Y extent should be based on height\n      visualXHalfExtent: isLR ? h / 2 + padding : w / 2 + padding\n    };\n  });\n  const getOrAddPipe = /* @__PURE__ */ __name((orientation, coord, spanMin, spanMax) => {\n    let pipe = pipes.find((p) => p.orientation === orientation && Math.abs(p.coord - coord) < 1);\n    if (!pipe) {\n      pipe = {\n        id: `pipe-${orientation}-${coord.toFixed(0)}`,\n        orientation,\n        coord,\n        spanMin,\n        spanMax,\n        tracks: []\n      };\n      pipes.push(pipe);\n    }\n    pipe.spanMin = Math.min(pipe.spanMin, spanMin);\n    pipe.spanMax = Math.max(pipe.spanMax, spanMax);\n    return pipe;\n  }, \"getOrAddPipe\");\n  const portForSide = /* @__PURE__ */ __name((node, side) => {\n    const w = node.width ?? 10;\n    const h = node.height ?? 10;\n    const cx = node.x ?? 0;\n    const cy = node.y ?? 0;\n    switch (side) {\n      case \"top\":\n        return { x: cx, y: cy - h / 2 };\n      case \"bottom\":\n        return { x: cx, y: cy + h / 2 };\n      case \"left\":\n        return { x: cx - w / 2, y: cy };\n      case \"right\":\n        return { x: cx + w / 2, y: cy };\n    }\n  }, \"portForSide\");\n  const getOrthogonalPort = /* @__PURE__ */ __name((node, target, isSource) => portForSide(node, chooseOrthogonalSide(node, target, isSource ? \"bottom\" : \"top\")), \"getOrthogonalPort\");\n  const allRoutedSegments = [];\n  const edgeSegmentIndices = [];\n  const straightIntraLaneEdges = /* @__PURE__ */ new Set();\n  const CROSSING_PENALTY = 1e3;\n  const crossingPenalty = /* @__PURE__ */ __name((edgeIdx, from, to) => {\n    if (allRoutedSegments.length === 0) {\n      return 0;\n    }\n    const isHorizontal = Math.abs(from.y - to.y) < EPS7;\n    const isVertical = Math.abs(from.x - to.x) < EPS7;\n    if (!isHorizontal && !isVertical) {\n      return 0;\n    }\n    let penalties = 0;\n    if (isHorizontal) {\n      const y = from.y;\n      const minX = Math.min(from.x, to.x) - EPS7;\n      const maxX = Math.max(from.x, to.x) + EPS7;\n      if (maxX <= minX) {\n        return 0;\n      }\n      for (const seg of allRoutedSegments) {\n        if (seg.edgeIndex === edgeIdx || seg.orientation !== \"vertical\") {\n          continue;\n        }\n        if (seg.pipe.coord < minX || seg.pipe.coord > maxX) {\n          continue;\n        }\n        if (seg.from - EPS7 <= y && seg.to + EPS7 >= y) {\n          penalties += CROSSING_PENALTY;\n        }\n      }\n    } else if (isVertical) {\n      const x = from.x;\n      const minY = Math.min(from.y, to.y) - EPS7;\n      const maxY = Math.max(from.y, to.y) + EPS7;\n      if (maxY <= minY) {\n        return 0;\n      }\n      for (const seg of allRoutedSegments) {\n        if (seg.edgeIndex === edgeIdx || seg.orientation !== \"horizontal\") {\n          continue;\n        }\n        if (seg.pipe.coord < minY || seg.pipe.coord > maxY) {\n          continue;\n        }\n        if (seg.from - EPS7 <= x && seg.to + EPS7 >= x) {\n          penalties += CROSSING_PENALTY;\n        }\n      }\n    }\n    return penalties;\n  }, \"crossingPenalty\");\n  const routingOrder = edges.map((edge, idx) => {\n    if (!edge.start || !edge.end) {\n      return { idx, crossLane: 0, dx: 0, dy: 0 };\n    }\n    const srcNode = nodeById.get(edge.start);\n    const dstNode = nodeById.get(edge.end);\n    const srcLane = laneByNodeId.get(edge.start);\n    const dstLane = laneByNodeId.get(edge.end);\n    const crossLane = srcLane && dstLane && srcLane.id !== dstLane.id ? 1 : 0;\n    const dx = srcNode && dstNode ? Math.abs((dstNode.x ?? 0) - (srcNode.x ?? 0)) : 0;\n    const dy = srcNode && dstNode ? Math.abs((dstNode.y ?? 0) - (srcNode.y ?? 0)) : 0;\n    return { idx, crossLane, dx, dy };\n  }).sort((a, b) => {\n    if (a.crossLane !== b.crossLane) {\n      return b.crossLane - a.crossLane;\n    }\n    const aDist = a.dx + a.dy;\n    const bDist = b.dx + b.dy;\n    if (Math.abs(aDist - bDist) > 1) {\n      return aDist - bDist;\n    }\n    return a.idx - b.idx;\n  }).map((entry) => entry.idx);\n  const isSegmentBlocked = /* @__PURE__ */ __name((p1, p2, excludeStart, excludeEnd) => {\n    const segMinX = Math.min(p1.x, p2.x);\n    const segMaxX = Math.max(p1.x, p2.x);\n    const segMinY = Math.min(p1.y, p2.y);\n    const segMaxY = Math.max(p1.y, p2.y);\n    const blockingObs = obstacles.find((obs) => {\n      if (excludeStart && obs.nodeId === excludeStart) {\n        return false;\n      }\n      if (excludeEnd && obs.nodeId === excludeEnd) {\n        return false;\n      }\n      if (Math.abs(p1.x - p2.x) > EPS7) {\n        return obs.minY < p1.y && obs.maxY > p1.y && obs.maxX > segMinX && obs.minX < segMaxX;\n      } else {\n        return obs.minX < p1.x && obs.maxX > p1.x && obs.maxY > segMinY && obs.minY < segMaxY;\n      }\n    });\n    return !!blockingObs;\n  }, \"isSegmentBlocked\");\n  const portGroups = /* @__PURE__ */ new Map();\n  const incidentEdgeTotals = /* @__PURE__ */ new Map();\n  for (const edge of edges) {\n    if (!edge.start || !edge.end || edge.start === edge.end) {\n      continue;\n    }\n    incidentEdgeTotals.set(edge.start, (incidentEdgeTotals.get(edge.start) ?? 0) + 1);\n    incidentEdgeTotals.set(edge.end, (incidentEdgeTotals.get(edge.end) ?? 0) + 1);\n  }\n  const determineSide = /* @__PURE__ */ __name((node, target) => chooseOrthogonalSide(node, target, \"bottom\"), \"determineSide\");\n  const sideInfoByIdx = /* @__PURE__ */ new Map();\n  for (const [i, e] of edges.entries()) {\n    if (!e.start || !e.end || e.start === e.end) {\n      continue;\n    }\n    if (e.points && e.points.length > 0) {\n      continue;\n    }\n    const src = nodeById.get(e.start);\n    const dst = nodeById.get(e.end);\n    if (!src || !dst) {\n      continue;\n    }\n    const dx = (dst.x ?? 0) - (src.x ?? 0);\n    const dy = (dst.y ?? 0) - (src.y ?? 0);\n    sideInfoByIdx.set(i, {\n      edgeIdx: i,\n      srcId: e.start,\n      dstId: e.end,\n      srcSide: determineSide(src, { x: dst.x ?? 0, y: dst.y ?? 0 }),\n      dstSide: determineSide(dst, { x: src.x ?? 0, y: src.y ?? 0 }),\n      absDx: Math.abs(dx),\n      absDy: Math.abs(dy),\n      dxSign: Math.sign(dx),\n      dySign: Math.sign(dy)\n    });\n  }\n  const preferenceStrength = /* @__PURE__ */ __name((info) => {\n    if (info.srcSide === \"top\" || info.srcSide === \"bottom\") {\n      return info.absDx === 0 ? Infinity : info.absDy / info.absDx;\n    }\n    return info.absDy === 0 ? Infinity : info.absDx / info.absDy;\n  }, \"preferenceStrength\");\n  const secondarySide = /* @__PURE__ */ __name((info) => {\n    if (info.srcSide === \"top\" || info.srcSide === \"bottom\") {\n      return info.dxSign >= 0 ? \"right\" : \"left\";\n    }\n    return info.dySign >= 0 ? \"bottom\" : \"top\";\n  }, \"secondarySide\");\n  const sourceSideGroups = /* @__PURE__ */ new Map();\n  for (const info of sideInfoByIdx.values()) {\n    const key = `${info.srcId}:${info.srcSide}`;\n    if (!sourceSideGroups.has(key)) {\n      sourceSideGroups.set(key, []);\n    }\n    sourceSideGroups.get(key).push(info);\n  }\n  const sideLoad = /* @__PURE__ */ new Map();\n  const loadKey = /* @__PURE__ */ __name((nodeId, side) => `${nodeId}:${side}`, \"loadKey\");\n  for (const info of sideInfoByIdx.values()) {\n    sideLoad.set(\n      loadKey(info.srcId, info.srcSide),\n      (sideLoad.get(loadKey(info.srcId, info.srcSide)) ?? 0) + 1\n    );\n    sideLoad.set(\n      loadKey(info.dstId, info.dstSide),\n      (sideLoad.get(loadKey(info.dstId, info.dstSide)) ?? 0) + 1\n    );\n  }\n  for (const group of sourceSideGroups.values()) {\n    if (group.length < 2) {\n      continue;\n    }\n    group.sort((a, b) => {\n      const sa = preferenceStrength(a);\n      const sb = preferenceStrength(b);\n      if (Math.abs(sa - sb) > 1e-9) {\n        return sb - sa;\n      }\n      return a.edgeIdx - b.edgeIdx;\n    });\n    for (let g = 1; g < group.length; g++) {\n      const info = group[g];\n      const secondary = secondarySide(info);\n      const primaryLoad = sideLoad.get(loadKey(info.srcId, info.srcSide)) ?? 0;\n      const secondaryLoad = sideLoad.get(loadKey(info.srcId, secondary)) ?? 0;\n      if (secondaryLoad >= primaryLoad) {\n        continue;\n      }\n      sideLoad.set(loadKey(info.srcId, info.srcSide), primaryLoad - 1);\n      sideLoad.set(loadKey(info.srcId, secondary), secondaryLoad + 1);\n      info.srcSide = secondary;\n    }\n  }\n  const isDiamondNode = /* @__PURE__ */ __name((node) => {\n    const shape = node?.shape;\n    return shape === \"question\" || shape === \"diamond\";\n  }, \"isDiamondNode\");\n  const inSidesByNode = /* @__PURE__ */ new Map();\n  for (const info of sideInfoByIdx.values()) {\n    if (!inSidesByNode.has(info.dstId)) {\n      inSidesByNode.set(info.dstId, /* @__PURE__ */ new Set());\n    }\n    inSidesByNode.get(info.dstId).add(info.dstSide);\n  }\n  for (const info of sideInfoByIdx.values()) {\n    if (!isDiamondNode(nodeById.get(info.srcId))) {\n      continue;\n    }\n    const inSides = inSidesByNode.get(info.srcId);\n    if (!inSides?.has(info.srcSide)) {\n      continue;\n    }\n    const secondary = secondarySide(info);\n    if (inSides.has(secondary) || (sideLoad.get(loadKey(info.srcId, secondary)) ?? 0) > 0) {\n      continue;\n    }\n    const primaryLoad = sideLoad.get(loadKey(info.srcId, info.srcSide)) ?? 0;\n    sideLoad.set(loadKey(info.srcId, info.srcSide), Math.max(0, primaryLoad - 1));\n    sideLoad.set(loadKey(info.srcId, secondary), 1);\n    info.srcSide = secondary;\n  }\n  for (const info of sideInfoByIdx.values()) {\n    const { edgeIdx: i, srcId, dstId, srcSide, dstSide } = info;\n    const src = nodeById.get(srcId);\n    const dst = nodeById.get(dstId);\n    const srcKey = `${srcId}:${srcSide}:src`;\n    const dstCoord = srcSide === \"top\" || srcSide === \"bottom\" ? dst.x ?? 0 : dst.y ?? 0;\n    if (!portGroups.has(srcKey)) {\n      portGroups.set(srcKey, []);\n    }\n    portGroups.get(srcKey).push({ edgeIdx: i, oppositeCoord: dstCoord });\n    const dstKey = `${dstId}:${dstSide}:dst`;\n    const srcCoord = dstSide === \"top\" || dstSide === \"bottom\" ? src.x ?? 0 : src.y ?? 0;\n    if (!portGroups.has(dstKey)) {\n      portGroups.set(dstKey, []);\n    }\n    portGroups.get(dstKey).push({ edgeIdx: i, oppositeCoord: srcCoord });\n  }\n  const portOffsets = /* @__PURE__ */ new Map();\n  const MIN_PORT_SPACING3 = 8;\n  for (const [key, group] of portGroups) {\n    if (group.length < 2) {\n      continue;\n    }\n    group.sort((a, b) => a.oppositeCoord - b.oppositeCoord);\n    const parts = key.split(\":\");\n    const nodeId = parts.slice(0, -2).join(\":\");\n    const side = parts[parts.length - 2];\n    const role = parts[parts.length - 1];\n    const node = nodeById.get(nodeId);\n    if (!node) {\n      continue;\n    }\n    const isVerticalSide = side === \"left\" || side === \"right\";\n    const sideLength = isVerticalSide ? node.height ?? 10 : node.width ?? 10;\n    const shape = node.shape;\n    const isDiamond = shape === \"question\" || shape === \"diamond\";\n    const effectiveLength = isDiamond ? sideLength * 0.3 : sideLength;\n    const MAX_PORT_SPACING = 20;\n    const spacing = Math.min(\n      MAX_PORT_SPACING,\n      Math.max(MIN_PORT_SPACING3, effectiveLength / (group.length + 1))\n    );\n    const totalSpan = spacing * (group.length - 1);\n    const startOffset = -totalSpan / 2;\n    for (const [j, element] of group.entries()) {\n      const offset = startOffset + j * spacing;\n      const offsetKey = `${element.edgeIdx}:${role}`;\n      portOffsets.set(offsetKey, offset);\n    }\n  }\n  const edgeHasLabelNode = /* @__PURE__ */ __name((edgeIdx) => Boolean(edges[edgeIdx]?.labelNodeId), \"edgeHasLabelNode\");\n  const faceHasLabelNode = /* @__PURE__ */ __name((nodeId, side) => {\n    if (!nodeId) {\n      return false;\n    }\n    return (portGroups.get(`${nodeId}:${side}:src`) ?? []).some(\n      ({ edgeIdx }) => edgeHasLabelNode(edgeIdx)\n    ) || (portGroups.get(`${nodeId}:${side}:dst`) ?? []).some(\n      ({ edgeIdx }) => edgeHasLabelNode(edgeIdx)\n    );\n  }, \"faceHasLabelNode\");\n  const applyPortOffset = /* @__PURE__ */ __name((basePort, side, offset) => {\n    if (side === \"top\" || side === \"bottom\") {\n      return { x: basePort.x + offset, y: basePort.y };\n    } else {\n      return { x: basePort.x, y: basePort.y + offset };\n    }\n  }, \"applyPortOffset\");\n  const portsForEdge = /* @__PURE__ */ __name((edgeIndex, src, dst) => {\n    const sideInfo = sideInfoByIdx.get(edgeIndex);\n    const srcTarget = { x: dst.x ?? 0, y: dst.y ?? 0 };\n    const dstTarget = { x: src.x ?? 0, y: src.y ?? 0 };\n    const srcSide = sideInfo?.srcSide ?? determineSide(src, srcTarget);\n    const dstSide = sideInfo?.dstSide ?? determineSide(dst, dstTarget);\n    let pSrcPort = sideInfo ? portForSide(src, sideInfo.srcSide) : getOrthogonalPort(src, srcTarget, true);\n    let pDstPort = sideInfo ? portForSide(dst, sideInfo.dstSide) : getOrthogonalPort(dst, dstTarget, false);\n    const srcOffset = portOffsets.get(`${edgeIndex}:src`);\n    const dstOffset = portOffsets.get(`${edgeIndex}:dst`);\n    if (srcOffset !== void 0) {\n      pSrcPort = applyPortOffset(pSrcPort, srcSide, srcOffset);\n    }\n    if (dstOffset !== void 0) {\n      pDstPort = applyPortOffset(pDstPort, dstSide, dstOffset);\n    }\n    return { pSrcPort, pDstPort, srcSide, dstSide };\n  }, \"portsForEdge\");\n  for (const i of routingOrder) {\n    const e = edges[i];\n    edgeSegmentIndices[i] = [];\n    if (!e.start || !e.end) {\n      continue;\n    }\n    if (e.points && e.points.length > 0) {\n      continue;\n    }\n    if (e.start === e.end) {\n      continue;\n    }\n    const src = nodeById.get(e.start);\n    const dst = nodeById.get(e.end);\n    if (!src || !dst) {\n      continue;\n    }\n    const {\n      pSrcPort,\n      pDstPort,\n      srcSide: srcPortSide,\n      dstSide: dstPortSide\n    } = portsForEdge(i, src, dst);\n    const pSrcAnchor = { ...pSrcPort };\n    const pDstAnchor = { ...pDstPort };\n    const srcPortIsVertical = srcPortSide === \"top\" || srcPortSide === \"bottom\";\n    const dstPortIsVertical = dstPortSide === \"top\" || dstPortSide === \"bottom\";\n    if (srcPortIsVertical) {\n      const isBottom = pSrcPort.y > (src.y ?? 0);\n      pSrcAnchor.y = isBottom ? pSrcPort.y + ANCHOR_OFFSET : pSrcPort.y - ANCHOR_OFFSET;\n    } else {\n      const isRight = pSrcPort.x > (src.x ?? 0);\n      pSrcAnchor.x = isRight ? pSrcPort.x + ANCHOR_OFFSET : pSrcPort.x - ANCHOR_OFFSET;\n    }\n    if (dstPortIsVertical) {\n      const isBottom = pDstPort.y > (dst.y ?? 0);\n      pDstAnchor.y = isBottom ? pDstPort.y + ANCHOR_OFFSET : pDstPort.y - ANCHOR_OFFSET;\n    } else {\n      const isRight = pDstPort.x > (dst.x ?? 0);\n      pDstAnchor.x = isRight ? pDstPort.x + ANCHOR_OFFSET : pDstPort.x - ANCHOR_OFFSET;\n    }\n    const isPointInObstacle = /* @__PURE__ */ __name((pt, excludeNodeIds) => {\n      for (const obs of obstacles) {\n        if (excludeNodeIds.includes(obs.nodeId)) {\n          continue;\n        }\n        if (pt.x > obs.minX && pt.x < obs.maxX && pt.y > obs.minY && pt.y < obs.maxY) {\n          return { inside: true, obstacle: obs };\n        }\n      }\n      return { inside: false };\n    }, \"isPointInObstacle\");\n    const obstacleDetour = /* @__PURE__ */ __name((port, node, opposite, obs, portIsVertical) => {\n      if (portIsVertical) {\n        const leavesPositiveSide2 = port.y > (node.y ?? 0);\n        const goRight = (opposite.x ?? 0) >= port.x;\n        return {\n          x: goRight ? obs.maxX + HORIZONTAL_PIPE_MARGIN : obs.minX - HORIZONTAL_PIPE_MARGIN,\n          y: leavesPositiveSide2 ? obs.maxY + VERTICAL_PIPE_MARGIN : obs.minY - VERTICAL_PIPE_MARGIN,\n          leavesPositiveSide: leavesPositiveSide2\n        };\n      }\n      const leavesPositiveSide = port.x > (node.x ?? 0);\n      const goDown = (opposite.y ?? 0) >= port.y;\n      return {\n        x: leavesPositiveSide ? obs.maxX + HORIZONTAL_PIPE_MARGIN : obs.minX - HORIZONTAL_PIPE_MARGIN,\n        y: goDown ? obs.maxY + VERTICAL_PIPE_MARGIN : obs.minY - VERTICAL_PIPE_MARGIN,\n        leavesPositiveSide\n      };\n    }, \"obstacleDetour\");\n    let srcHandleWaypoints = [];\n    const endpointIds = [e.start, e.end];\n    const srcCheck = isPointInObstacle(pSrcAnchor, endpointIds);\n    if (srcCheck.inside && srcCheck.obstacle) {\n      const obs = srcCheck.obstacle;\n      if (srcPortIsVertical) {\n        const detour = obstacleDetour(pSrcPort, src, dst, obs, true);\n        pSrcAnchor.x = detour.x;\n        pSrcAnchor.y = detour.y;\n        const gapY = detour.leavesPositiveSide ? Math.min(obs.minY - 2, pSrcPort.y + ANCHOR_OFFSET) : Math.max(obs.maxY + 2, pSrcPort.y - ANCHOR_OFFSET);\n        srcHandleWaypoints = [\n          { x: pSrcPort.x, y: gapY },\n          // Orthogonal step in the gap\n          { x: detour.x, y: gapY },\n          // Horizontal detour\n          { x: detour.x, y: detour.y }\n          // Down past obstacle\n        ];\n      } else {\n        const detour = obstacleDetour(pSrcPort, src, dst, obs, false);\n        const gapX = detour.leavesPositiveSide ? Math.min(obs.minX - 2, pSrcPort.x + ANCHOR_OFFSET) : Math.max(obs.maxX + 2, pSrcPort.x - ANCHOR_OFFSET);\n        pSrcAnchor.x = detour.x;\n        pSrcAnchor.y = detour.y;\n        srcHandleWaypoints = [\n          { x: gapX, y: pSrcPort.y },\n          // Orthogonal step in the gap\n          { x: gapX, y: detour.y },\n          // Vertical detour\n          { x: detour.x, y: detour.y }\n          // Horizontal past obstacle\n        ];\n      }\n    }\n    let dstHandleWaypoints = [];\n    const dstCheck = isPointInObstacle(pDstAnchor, endpointIds);\n    if (dstCheck.inside && dstCheck.obstacle) {\n      const obs = dstCheck.obstacle;\n      if (dstPortIsVertical) {\n        const detour = obstacleDetour(pDstPort, dst, src, obs, true);\n        pDstAnchor.x = detour.x;\n        pDstAnchor.y = detour.y;\n        dstHandleWaypoints = [\n          { x: detour.x, y: detour.y },\n          // From anchor position\n          { x: pDstPort.x, y: detour.y }\n          // Go sideways to port's X\n          // Then orthogonally to port\n        ];\n      } else {\n        const detour = obstacleDetour(pDstPort, dst, src, obs, false);\n        pDstAnchor.x = detour.x;\n        pDstAnchor.y = detour.y;\n        dstHandleWaypoints = [\n          { x: detour.x, y: detour.y },\n          // From anchor position\n          { x: detour.x, y: pDstPort.y }\n          // Go vertically to port's Y\n        ];\n      }\n    }\n    if (srcHandleWaypoints.length === 0 && dstHandleWaypoints.length === 0) {\n      const hpMargin = HORIZONTAL_PIPE_MARGIN;\n      const anchorsSameX = Math.abs(pSrcAnchor.x - pDstAnchor.x) < hpMargin;\n      const anchorsSameY = Math.abs(pSrcAnchor.y - pDstAnchor.y) < hpMargin;\n      const hasPortOffset = portOffsets.get(`${i}:src`) !== void 0 || portOffsets.get(`${i}:dst`) !== void 0;\n      const srcFaceTotal = (portGroups.get(`${e.start ?? \"\"}:${srcPortSide}:src`)?.length ?? 0) + (portGroups.get(`${e.start ?? \"\"}:${srcPortSide}:dst`)?.length ?? 0);\n      const dstFaceTotal = (portGroups.get(`${e.end ?? \"\"}:${dstPortSide}:src`)?.length ?? 0) + (portGroups.get(`${e.end ?? \"\"}:${dstPortSide}:dst`)?.length ?? 0);\n      const faceContested = srcFaceTotal > 1 || dstFaceTotal > 1;\n      const srcIncidentTotal = incidentEdgeTotals.get(e.start ?? \"\") ?? 0;\n      const dstIncidentTotal = incidentEdgeTotals.get(e.end ?? \"\") ?? 0;\n      const contestedFaceHasLabel = srcFaceTotal > 1 && faceHasLabelNode(e.start, srcPortSide) || dstFaceTotal > 1 && faceHasLabelNode(e.end, dstPortSide);\n      const srcContestAllowsCenteredStraight = srcFaceTotal <= 1 || srcIncidentTotal <= 2;\n      const dstContestAllowsCenteredStraight = dstFaceTotal <= 1 || dstIncidentTotal <= 2;\n      const canPreserveSimpleContestedStraight = faceContested && !contestedFaceHasLabel && srcContestAllowsCenteredStraight && dstContestAllowsCenteredStraight;\n      if ((anchorsSameX || anchorsSameY) && !hasPortOffset && (!faceContested || canPreserveSimpleContestedStraight)) {\n        const directBlocked = isSegmentBlocked(pSrcPort, pDstPort, e.start, e.end);\n        if (!directBlocked) {\n          e.points = [{ ...pSrcPort }, { ...pSrcAnchor }, { ...pDstAnchor }, { ...pDstPort }];\n          straightIntraLaneEdges.add(i);\n          const fastPathOrientation = anchorsSameY ? \"horizontal\" : \"vertical\";\n          const fastPathCoord = anchorsSameY ? pSrcPort.y : pSrcPort.x;\n          const fastPathFrom = anchorsSameY ? Math.min(pSrcPort.x, pDstPort.x) : Math.min(pSrcPort.y, pDstPort.y);\n          const fastPathTo = anchorsSameY ? Math.max(pSrcPort.x, pDstPort.x) : Math.max(pSrcPort.y, pDstPort.y);\n          const fastPathPipe = {\n            id: `fast-path-${fastPathOrientation}-${fastPathCoord.toFixed(0)}-${i}`,\n            orientation: fastPathOrientation,\n            coord: fastPathCoord,\n            spanMin: fastPathFrom,\n            spanMax: fastPathTo,\n            tracks: []\n          };\n          allRoutedSegments.push({\n            edgeIndex: i,\n            segmentIndex: 0,\n            orientation: fastPathOrientation,\n            pipe: fastPathPipe,\n            trackIndex: 0,\n            from: fastPathFrom,\n            to: fastPathTo\n          });\n          continue;\n        }\n      }\n    }\n    const srcPipe = getOrAddPipe(\"vertical\", pSrcAnchor.x, pSrcAnchor.y, pSrcAnchor.y);\n    pSrcAnchor.x = srcPipe.coord;\n    const dstPipe = getOrAddPipe(\"vertical\", pDstAnchor.x, pDstAnchor.y, pDstAnchor.y);\n    pDstAnchor.x = dstPipe.coord;\n    let bbMinX = Math.min(pSrcAnchor.x, pDstAnchor.x) - 50;\n    let bbMaxX = Math.max(pSrcAnchor.x, pDstAnchor.x) + 50;\n    let bbMinY = Math.min(pSrcAnchor.y, pDstAnchor.y) - 50;\n    let bbMaxY = Math.max(pSrcAnchor.y, pDstAnchor.y) + 50;\n    for (const obs of obstacles) {\n      const pathMinX = Math.min(pSrcAnchor.x, pDstAnchor.x);\n      const pathMaxX = Math.max(pSrcAnchor.x, pDstAnchor.x);\n      const pathMinY = Math.min(pSrcAnchor.y, pDstAnchor.y);\n      const pathMaxY = Math.max(pSrcAnchor.y, pDstAnchor.y);\n      const obsBlocksPath = obs.minX < pathMaxX && obs.maxX > pathMinX && obs.minY < pathMaxY && obs.maxY > pathMinY;\n      if (obsBlocksPath) {\n        bbMinX = Math.min(bbMinX, obs.minX - ROUTING_MARGIN);\n        bbMaxX = Math.max(bbMaxX, obs.maxX + ROUTING_MARGIN);\n        bbMinY = Math.min(bbMinY, obs.minY - ROUTING_MARGIN);\n        bbMaxY = Math.max(bbMaxY, obs.maxY + ROUTING_MARGIN);\n      }\n    }\n    for (const obs of obstacles) {\n      if (obs.maxX < bbMinX || obs.minX > bbMaxX || obs.maxY < bbMinY || obs.minY > bbMaxY) {\n        continue;\n      }\n      const hMargin = HORIZONTAL_PIPE_MARGIN;\n      getOrAddPipe(\"horizontal\", obs.minY - hMargin, bbMinX, bbMaxX);\n      getOrAddPipe(\"horizontal\", obs.maxY + hMargin, bbMinX, bbMaxX);\n      const vMargin = VERTICAL_PIPE_MARGIN;\n      getOrAddPipe(\"vertical\", obs.minX - vMargin, bbMinY, bbMaxY);\n      getOrAddPipe(\"vertical\", obs.maxX + vMargin, bbMinY, bbMaxY);\n    }\n    getOrAddPipe(\"horizontal\", pSrcAnchor.y, bbMinX, bbMaxX);\n    getOrAddPipe(\"horizontal\", pDstAnchor.y, bbMinX, bbMaxX);\n    const hPipes = pipes.filter(\n      (p) => p.orientation === \"horizontal\" && p.coord >= bbMinY && p.coord <= bbMaxY\n    );\n    const vPipes = pipes.filter(\n      (p) => p.orientation === \"vertical\" && p.coord >= bbMinX && p.coord <= bbMaxX\n    );\n    const getKey = /* @__PURE__ */ __name((x, y) => `${x.toFixed(1)},${y.toFixed(1)}`, \"getKey\");\n    const startKey = getKey(pSrcAnchor.x, pSrcAnchor.y);\n    const endKey = getKey(pDstAnchor.x, pDstAnchor.y);\n    const gScore = /* @__PURE__ */ new Map();\n    const cameFrom = /* @__PURE__ */ new Map();\n    const arrivalDir = /* @__PURE__ */ new Map();\n    const openSet = /* @__PURE__ */ new Set();\n    const openList = [];\n    gScore.set(startKey, 0);\n    arrivalDir.set(startKey, \"n\");\n    openList.push({\n      key: startKey,\n      f: Math.hypot(pDstAnchor.x - pSrcAnchor.x, pDstAnchor.y - pSrcAnchor.y),\n      pt: pSrcAnchor\n    });\n    openSet.add(startKey);\n    let foundPath = [];\n    const checkSegmentBlocked = /* @__PURE__ */ __name((p1, p2) => {\n      return isSegmentBlocked(p1, p2, e.start, e.end);\n    }, \"checkSegmentBlocked\");\n    const cornerHV = { x: pDstAnchor.x, y: pSrcAnchor.y };\n    const seg1HV_blocked = checkSegmentBlocked(pSrcAnchor, cornerHV);\n    const seg2HV_blocked = checkSegmentBlocked(cornerHV, pDstAnchor);\n    const pathHV_blocked = seg1HV_blocked || seg2HV_blocked;\n    const cornerVH = { x: pSrcAnchor.x, y: pDstAnchor.y };\n    const seg1VH_blocked = checkSegmentBlocked(pSrcAnchor, cornerVH);\n    const seg2VH_blocked = checkSegmentBlocked(cornerVH, pDstAnchor);\n    const pathVH_blocked = seg1VH_blocked || seg2VH_blocked;\n    if (!pathHV_blocked) {\n      if (Math.abs(pSrcAnchor.y - pDstAnchor.y) < EPS7 || Math.abs(pSrcAnchor.x - pDstAnchor.x) < EPS7) {\n        foundPath = [pSrcAnchor, pDstAnchor];\n      } else {\n        foundPath = [pSrcAnchor, cornerHV, pDstAnchor];\n      }\n    } else if (!pathVH_blocked) {\n      if (Math.abs(pSrcAnchor.x - pDstAnchor.x) < EPS7) {\n        foundPath = [pSrcAnchor, pDstAnchor];\n      } else {\n        foundPath = [pSrcAnchor, cornerVH, pDstAnchor];\n      }\n    }\n    if (foundPath.length === 0) {\n      while (openList.length > 0) {\n        openList.sort((a, b) => a.f - b.f);\n        const current = openList.shift();\n        openSet.delete(current.key);\n        if (current.key === endKey) {\n          let currKey = endKey;\n          let currPt = pDstAnchor;\n          foundPath = [currPt];\n          while (cameFrom.has(currKey)) {\n            const prev = cameFrom.get(currKey);\n            foundPath.unshift(prev);\n            currPt = prev;\n            currKey = getKey(prev.x, prev.y);\n          }\n          break;\n        }\n        const cx = current.pt.x;\n        const cy = current.pt.y;\n        const sortedVPipes = vPipes.sort((a, b) => a.coord - b.coord);\n        const vIdx = sortedVPipes.findIndex((p) => Math.abs(p.coord - cx) < 1);\n        const hPipesSorted = hPipes.sort((a, b) => a.coord - b.coord);\n        const hIdx = hPipesSorted.findIndex((p) => Math.abs(p.coord - cy) < 1);\n        const neighbors = [];\n        if (vIdx > 0) {\n          neighbors.push({ x: sortedVPipes[vIdx - 1].coord, y: cy });\n        }\n        if (vIdx >= 0 && vIdx < sortedVPipes.length - 1) {\n          neighbors.push({ x: sortedVPipes[vIdx + 1].coord, y: cy });\n        }\n        if (hIdx > 0) {\n          neighbors.push({ x: cx, y: hPipesSorted[hIdx - 1].coord });\n        }\n        if (hIdx >= 0 && hIdx < hPipesSorted.length - 1) {\n          neighbors.push({ x: cx, y: hPipesSorted[hIdx + 1].coord });\n        }\n        for (const neighbor of neighbors) {\n          const minX = Math.min(cx, neighbor.x);\n          const maxX = Math.max(cx, neighbor.x);\n          const minY = Math.min(cy, neighbor.y);\n          const maxY = Math.max(cy, neighbor.y);\n          const blocked = obstacles.some((obs) => {\n            if (obs.nodeId === e.start || obs.nodeId === e.end) {\n              return false;\n            }\n            if (minX !== maxX) {\n              return obs.minY < cy && obs.maxY > cy && obs.maxX > minX && obs.minX < maxX;\n            } else {\n              return obs.minX < cx && obs.maxX > cx && obs.maxY > minY && obs.minY < maxY;\n            }\n          });\n          if (blocked) {\n            continue;\n          }\n          const nKey = getKey(neighbor.x, neighbor.y);\n          const dist = Math.abs(neighbor.x - cx) + Math.abs(neighbor.y - cy);\n          const penalty = crossingPenalty(i, current.pt, neighbor);\n          let dirPenalty = 0;\n          const destDx = pDstAnchor.x - pSrcAnchor.x;\n          const destDy = pDstAnchor.y - pSrcAnchor.y;\n          const moveDx = neighbor.x - cx;\n          const moveDy = neighbor.y - cy;\n          if (destDy > 10 && moveDy < -5 || destDy < -10 && moveDy > 5) {\n            dirPenalty = Math.abs(moveDy) * 100;\n          }\n          if (destDx > 10 && moveDx < -5 || destDx < -10 && moveDx > 5) {\n            dirPenalty += Math.abs(moveDx) * 50;\n          }\n          let bendPenalty = 0;\n          const currentDir = arrivalDir.get(current.key) ?? \"n\";\n          const moveDir = Math.abs(moveDx) > EPS7 ? \"h\" : \"v\";\n          if (currentDir !== \"n\" && currentDir !== moveDir) {\n            bendPenalty = 50;\n          }\n          const stepCost = dist + penalty + dirPenalty + bendPenalty;\n          const tentativeG = (gScore.get(current.key) ?? Infinity) + stepCost;\n          const h = Math.abs(pDstAnchor.x - neighbor.x) + Math.abs(pDstAnchor.y - neighbor.y);\n          if (tentativeG < (gScore.get(nKey) ?? Infinity)) {\n            cameFrom.set(nKey, current.pt);\n            gScore.set(nKey, tentativeG);\n            arrivalDir.set(nKey, moveDir);\n            if (!openSet.has(nKey)) {\n              openList.push({ key: nKey, f: tentativeG + h, pt: neighbor });\n              openSet.add(nKey);\n            } else {\n              const idx = openList.findIndex((x) => x.key === nKey);\n              if (idx !== -1) {\n                openList[idx].f = tentativeG + h;\n              }\n            }\n          }\n        }\n      }\n    }\n    if (foundPath.length === 0) {\n      foundPath = [pSrcAnchor, { x: pSrcAnchor.x, y: pDstAnchor.y }, pDstAnchor];\n    }\n    if (foundPath.length > 4) {\n      const start = foundPath[0];\n      const end = foundPath[foundPath.length - 1];\n      let minX = Math.min(start.x, end.x);\n      let maxX = Math.max(start.x, end.x);\n      let minY = Math.min(start.y, end.y);\n      let maxY = Math.max(start.y, end.y);\n      for (const pt of foundPath) {\n        minX = Math.min(minX, pt.x);\n        maxX = Math.max(maxX, pt.x);\n        minY = Math.min(minY, pt.y);\n        maxY = Math.max(maxY, pt.y);\n      }\n      const wentRight = maxX > Math.max(start.x, end.x);\n      const wentLeft = minX < Math.min(start.x, end.x);\n      if (isLR) {\n        const margin = VERTICAL_PIPE_MARGIN;\n        if (wentRight) {\n          const pathX = Math.max(start.x, end.x);\n          const pathMinY = Math.min(start.y, end.y);\n          const pathMaxY = Math.max(start.y, end.y);\n          const detourObstacles = obstacles.filter(\n            (obs) => obs.minX < pathX && obs.maxX > pathX && // obstacle's x-range contains the path x\n            obs.minY < pathMaxY && obs.maxY > pathMinY\n            // obstacle's y-range overlaps with path y-range\n          );\n          if (detourObstacles.length > 0) {\n            let visualMaxX = Math.max(start.x, end.x);\n            for (const obs of detourObstacles) {\n              const obsCenterX = (obs.minX + obs.maxX) / 2;\n              if (obs.visualXHalfExtent === void 0 || isNaN(obs.visualXHalfExtent)) {\n                continue;\n              }\n              const visualRight = obsCenterX + obs.visualXHalfExtent + margin;\n              visualMaxX = Math.max(visualMaxX, visualRight);\n            }\n            if (!isNaN(visualMaxX)) {\n              maxX = visualMaxX;\n            }\n          }\n        }\n        if (wentLeft) {\n          const detourObstacles = obstacles.filter(\n            (obs) => obs.minX < Math.min(start.x, end.x) + margin && // obstacle extends past the direct path\n            obs.minY < Math.max(start.y, end.y) && obs.maxY > Math.min(start.y, end.y)\n            // obstacle is in Y range\n          );\n          if (detourObstacles.length > 0) {\n            let visualMinX = Math.min(start.x, end.x);\n            for (const obs of detourObstacles) {\n              const obsCenterX = (obs.minX + obs.maxX) / 2;\n              const visualLeft = obsCenterX - obs.visualXHalfExtent - margin;\n              visualMinX = Math.min(visualMinX, visualLeft);\n            }\n            minX = visualMinX;\n          }\n        }\n      }\n      const findBestReturnY = /* @__PURE__ */ __name((detourX) => {\n        const goingDown = end.y > start.y;\n        const relevantObs = obstacles.filter((obs) => {\n          const obsInXRange = Math.min(start.x, end.x) < obs.maxX && Math.max(start.x, end.x) > obs.minX;\n          const obsInYRange = Math.min(start.y, end.y) < obs.maxY && Math.max(start.y, end.y) > obs.minY;\n          return obsInXRange && obsInYRange;\n        });\n        let filteredObs = relevantObs;\n        if (isLR && relevantObs.length > 0) {\n          const obsAtDetourX = relevantObs.filter(\n            (obs) => obs.minX < detourX && obs.maxX > detourX\n          );\n          if (obsAtDetourX.length > 0) {\n            filteredObs = obsAtDetourX;\n          }\n        }\n        if (filteredObs.length === 0) {\n          return end.y;\n        }\n        const margin = HORIZONTAL_PIPE_MARGIN;\n        if (goingDown) {\n          const lowestObsBottom = Math.max(...filteredObs.map((obs) => obs.maxY));\n          const bestY = lowestObsBottom + margin;\n          if (bestY < end.y - EPS7) {\n            return bestY;\n          }\n        } else {\n          const highestObsTop = Math.min(...filteredObs.map((obs) => obs.minY));\n          const bestY = highestObsTop - margin;\n          if (bestY > end.y + EPS7) {\n            return bestY;\n          }\n        }\n        return end.y;\n      }, \"findBestReturnY\");\n      const trySimplifyWithDetourX = /* @__PURE__ */ __name((detourX) => {\n        const bestY = findBestReturnY(detourX);\n        const corner1 = { x: detourX, y: start.y };\n        const corner2 = { x: detourX, y: bestY };\n        const corner3 = { x: end.x, y: bestY };\n        const seg1Blocked = checkSegmentBlocked(start, corner1);\n        const seg2Blocked = checkSegmentBlocked(corner1, corner2);\n        const seg3Blocked = checkSegmentBlocked(corner2, corner3);\n        const seg4Blocked = bestY !== end.y ? checkSegmentBlocked(corner3, end) : false;\n        if (!seg1Blocked && !seg2Blocked && !seg3Blocked && !seg4Blocked) {\n          if (Math.abs(bestY - end.y) < EPS7) {\n            return [start, corner1, corner2, end];\n          }\n          return [start, corner1, corner2, corner3, end];\n        }\n        return null;\n      }, \"trySimplifyWithDetourX\");\n      const simplified2 = wentRight && !wentLeft ? trySimplifyWithDetourX(maxX) : wentLeft && !wentRight ? trySimplifyWithDetourX(minX) : null;\n      if (simplified2) {\n        foundPath = simplified2;\n      }\n    }\n    const fullPoints = [\n      pSrcPort,\n      ...srcHandleWaypoints,\n      ...foundPath,\n      ...dstHandleWaypoints.reverse(),\n      // Reverse because they're stored anchor->waypoint->port\n      pDstPort\n    ];\n    if (fullPoints.length >= 3) {\n      const C = fullPoints[fullPoints.length - 1];\n      const B = fullPoints[fullPoints.length - 2];\n      const A = fullPoints[fullPoints.length - 3];\n      const isHoriz = Math.abs(A.y - B.y) < EPS7 && Math.abs(B.y - C.y) < EPS7;\n      const isVert = Math.abs(A.x - B.x) < EPS7 && Math.abs(B.x - C.x) < EPS7;\n      if (isHoriz) {\n        const signAB = Math.sign(B.x - A.x);\n        const signAC = Math.sign(C.x - A.x);\n        if (signAB !== 0 && signAB === signAC && Math.abs(B.x - A.x) > Math.abs(C.x - A.x)) {\n          fullPoints.splice(-2, 1);\n        }\n      } else if (isVert) {\n        const signAB = Math.sign(B.y - A.y);\n        const signAC = Math.sign(C.y - A.y);\n        if (signAB !== 0 && signAB === signAC && Math.abs(B.y - A.y) > Math.abs(C.y - A.y)) {\n          fullPoints.splice(-2, 1);\n        }\n      }\n    }\n    const simplified = [fullPoints[0]];\n    for (let k = 1; k < fullPoints.length - 1; k++) {\n      if (k === 1) {\n        simplified.push(fullPoints[k]);\n        continue;\n      }\n      const prev = simplified[simplified.length - 1];\n      const curr = fullPoints[k];\n      const next = fullPoints[k + 1];\n      if (Math.abs(prev.y - curr.y) < EPS7 && Math.abs(curr.y - next.y) < EPS7) {\n        const dir1 = curr.x > prev.x;\n        const dir2 = next.x > curr.x;\n        if (dir1 !== dir2) {\n          simplified.push(curr);\n          continue;\n        }\n        continue;\n      }\n      if (Math.abs(prev.x - curr.x) < EPS7 && Math.abs(curr.x - next.x) < EPS7) {\n        const dir1 = curr.y > prev.y;\n        const dir2 = next.y > curr.y;\n        if (dir1 !== dir2) {\n          simplified.push(curr);\n          continue;\n        }\n        continue;\n      }\n      simplified.push(curr);\n    }\n    simplified.push(fullPoints[fullPoints.length - 1]);\n    for (let k = 0; k < simplified.length - 1; k++) {\n      const p1 = simplified[k];\n      const p2 = simplified[k + 1];\n      const orientation = Math.abs(p1.x - p2.x) < EPS7 ? \"vertical\" : \"horizontal\";\n      const coord = orientation === \"vertical\" ? p1.x : p1.y;\n      const from = orientation === \"vertical\" ? Math.min(p1.y, p2.y) : Math.min(p1.x, p2.x);\n      const to = orientation === \"vertical\" ? Math.max(p1.y, p2.y) : Math.max(p1.x, p2.x);\n      const pipe = getOrAddPipe(orientation, coord, from, to);\n      const rSeg = {\n        edgeIndex: i,\n        segmentIndex: k,\n        orientation,\n        pipe,\n        trackIndex: 0,\n        // Initial track\n        from,\n        to\n      };\n      allRoutedSegments.push(rSeg);\n      edgeSegmentIndices[i].push(allRoutedSegments.length - 1);\n      if (!pipe.tracks[0]) {\n        pipe.tracks[0] = { index: 0, coord: pipe.coord, segments: [] };\n      }\n      pipe.tracks[0].segments.push({\n        edgeIndex: i,\n        segmentIndex: k,\n        from,\n        to\n      });\n    }\n  }\n  const segmentsOverlap = /* @__PURE__ */ __name((s1, s2) => {\n    return s1.from < s2.to && s2.from < s1.to;\n  }, \"segmentsOverlap\");\n  const trySwapSegmentsAcrossTracks = /* @__PURE__ */ __name((s1, s2, t1, t2) => {\n    const canS1GoT2 = !t2.segments.some(\n      (r) => (r.edgeIndex !== s2.edgeIndex || r.segmentIndex !== s2.segmentIndex) && segmentsOverlap(r, s1)\n    );\n    const canS2GoT1 = !t1.segments.some(\n      (r) => (r.edgeIndex !== s1.edgeIndex || r.segmentIndex !== s1.segmentIndex) && segmentsOverlap(r, s2)\n    );\n    if (canS1GoT2 && canS2GoT1) {\n      s1.trackIndex = t2.index;\n      s2.trackIndex = t1.index;\n      t1.segments = [\n        ...t1.segments.filter(\n          (r) => r.edgeIndex !== s1.edgeIndex || r.segmentIndex !== s1.segmentIndex\n        ),\n        {\n          edgeIndex: s2.edgeIndex,\n          segmentIndex: s2.segmentIndex,\n          from: s2.from,\n          to: s2.to\n        }\n      ];\n      t2.segments = [\n        ...t2.segments.filter(\n          (r) => r.edgeIndex !== s2.edgeIndex || r.segmentIndex !== s2.segmentIndex\n        ),\n        {\n          edgeIndex: s1.edgeIndex,\n          segmentIndex: s1.segmentIndex,\n          from: s1.from,\n          to: s1.to\n        }\n      ];\n      return true;\n    }\n    return false;\n  }, \"trySwapSegmentsAcrossTracks\");\n  const createNewTrack = /* @__PURE__ */ __name((pipe) => {\n    const idx = pipe.tracks.length;\n    pipe.tracks[idx] = { index: idx, coord: pipe.coord, segments: [] };\n    return idx;\n  }, \"createNewTrack\");\n  const moveSegmentToTrack = /* @__PURE__ */ __name((seg, trackIdx) => {\n    const oldTrack = seg.pipe.tracks[seg.trackIndex];\n    oldTrack.segments = oldTrack.segments.filter(\n      (r) => r.edgeIndex !== seg.edgeIndex || r.segmentIndex !== seg.segmentIndex\n    );\n    seg.trackIndex = trackIdx;\n    const newTrack = seg.pipe.tracks[trackIdx];\n    newTrack.segments.push({\n      edgeIndex: seg.edgeIndex,\n      segmentIndex: seg.segmentIndex,\n      from: seg.from,\n      to: seg.to\n    });\n  }, \"moveSegmentToTrack\");\n  const moveSegmentChainToTrack = /* @__PURE__ */ __name((seg, trackIdx) => {\n    const indices = edgeSegmentIndices[seg.edgeIndex];\n    for (const idx of indices) {\n      const s = allRoutedSegments[idx];\n      if (s.pipe === seg.pipe) {\n        moveSegmentToTrack(s, trackIdx);\n      }\n    }\n  }, \"moveSegmentChainToTrack\");\n  const getAdjacentSegmentsAlongEdge = /* @__PURE__ */ __name((seg) => {\n    const indices = edgeSegmentIndices[seg.edgeIndex];\n    const idxInList = indices.indexOf(allRoutedSegments.indexOf(seg));\n    const adj = [];\n    if (idxInList > 0) {\n      adj.push(allRoutedSegments[indices[idxInList - 1]]);\n    }\n    if (idxInList < indices.length - 1) {\n      adj.push(allRoutedSegments[indices[idxInList + 1]]);\n    }\n    return adj;\n  }, \"getAdjacentSegmentsAlongEdge\");\n  const haveAnyCrossing = /* @__PURE__ */ __name((segA, segB) => {\n    if (segA.orientation === segB.orientation) {\n      return false;\n    }\n    const h = segA.orientation === \"horizontal\" ? segA : segB;\n    const v = segA.orientation === \"horizontal\" ? segB : segA;\n    return v.pipe.coord > h.from && v.pipe.coord < h.to && h.pipe.coord > v.from && h.pipe.coord < v.to;\n  }, \"haveAnyCrossing\");\n  const findAvailableTrack = /* @__PURE__ */ __name((pipe, seg) => {\n    for (const track of pipe.tracks) {\n      const overlap = track.segments.some(\n        (r) => (r.edgeIndex !== seg.edgeIndex || r.segmentIndex !== seg.segmentIndex) && segmentsOverlap(r, seg)\n      );\n      if (!overlap) {\n        return track.index;\n      }\n    }\n    return -1;\n  }, \"findAvailableTrack\");\n  const segmentsConflict = /* @__PURE__ */ __name((s1, s2) => {\n    if (s1.trackIndex === s2.trackIndex) {\n      return segmentsOverlap(s1, s2);\n    }\n    const adj1 = getAdjacentSegmentsAlongEdge(s1);\n    const adj2 = getAdjacentSegmentsAlongEdge(s2);\n    return adj1.some((a1) => adj2.some((a2) => haveAnyCrossing(a1, a2)));\n  }, \"segmentsConflict\");\n  const resolveTrackConflict = /* @__PURE__ */ __name((s1, s2, move) => {\n    if (trySwapSegmentsAcrossTracks(\n      s1,\n      s2,\n      s1.pipe.tracks[s1.trackIndex],\n      s2.pipe.tracks[s2.trackIndex]\n    )) {\n      return;\n    }\n    const avail = findAvailableTrack(s1.pipe, s2);\n    move(s2, avail !== -1 ? avail : createNewTrack(s1.pipe));\n  }, \"resolveTrackConflict\");\n  const resolveHandleConflicts = /* @__PURE__ */ __name((handles) => {\n    let crossings = 0;\n    for (let i = 0; i < handles.length; i++) {\n      for (let j = i + 1; j < handles.length; j++) {\n        const h1 = handles[i];\n        const h2 = handles[j];\n        if (h1.pipe !== h2.pipe) {\n          continue;\n        }\n        if (segmentsConflict(h1, h2)) {\n          crossings++;\n          resolveTrackConflict(h1, h2, moveSegmentChainToTrack);\n        }\n      }\n    }\n    return crossings;\n  }, \"resolveHandleConflicts\");\n  const destInfoCache = /* @__PURE__ */ new Map();\n  const getDestInfo = /* @__PURE__ */ __name((edgeIdx) => {\n    if (destInfoCache.has(edgeIdx)) {\n      return destInfoCache.get(edgeIdx);\n    }\n    const indices = edgeSegmentIndices[edgeIdx];\n    if (indices.length === 0) {\n      const info2 = { dest: 0, deviation: 0, base: 0, delta: 0 };\n      destInfoCache.set(edgeIdx, info2);\n      return info2;\n    }\n    const firstSeg = allRoutedSegments[indices[0]];\n    const base = firstSeg.pipe.coord;\n    let dest = base;\n    for (let idx = 1; idx < indices.length; idx++) {\n      const seg = allRoutedSegments[indices[idx]];\n      if (seg.orientation === \"horizontal\") {\n        const candidateA = seg.from;\n        const candidateB = seg.to;\n        dest = Math.abs(candidateA - base) > Math.abs(candidateB - base) ? candidateA : candidateB;\n        break;\n      }\n    }\n    const deviation = Math.abs(dest - base);\n    const info = { dest, deviation, base, delta: dest - base };\n    destInfoCache.set(edgeIdx, info);\n    return info;\n  }, \"getDestInfo\");\n  const fixSourceHandleCrossings = /* @__PURE__ */ __name(() => {\n    let crossings = 0;\n    const edgesBySource = /* @__PURE__ */ new Map();\n    for (const [i, e] of edges.entries()) {\n      if (edgeSegmentIndices[i].length === 0) {\n        continue;\n      }\n      if (!e.start) {\n        continue;\n      }\n      if (!edgesBySource.has(e.start)) {\n        edgesBySource.set(e.start, []);\n      }\n      edgesBySource.get(e.start).push(i);\n    }\n    const getEdgeDistance = /* @__PURE__ */ __name((edgeIdx) => {\n      const edge = edges[edgeIdx];\n      if (!edge.start || !edge.end) {\n        return 0;\n      }\n      const srcNode = nodeById.get(edge.start);\n      const dstNode = nodeById.get(edge.end);\n      if (!srcNode || !dstNode) {\n        return 0;\n      }\n      const dx = (dstNode.x ?? 0) - (srcNode.x ?? 0);\n      const dy = (dstNode.y ?? 0) - (srcNode.y ?? 0);\n      return Math.abs(dx) + Math.abs(dy);\n    }, \"getEdgeDistance\");\n    for (const grp of edgesBySource.values()) {\n      grp.sort((a, b) => {\n        const infoA = getDestInfo(a);\n        const infoB = getDestInfo(b);\n        if (Math.abs(infoA.deviation - infoB.deviation) > 1) {\n          return infoA.deviation - infoB.deviation;\n        }\n        if (Math.abs(infoA.dest - infoB.dest) > 1) {\n          return infoA.dest - infoB.dest;\n        }\n        const distA = getEdgeDistance(a);\n        const distB = getEdgeDistance(b);\n        if (Math.abs(distA - distB) > 1) {\n          return distB - distA;\n        }\n        const lenA = edgeSegmentIndices[a].length;\n        const lenB = edgeSegmentIndices[b].length;\n        if (lenA !== lenB) {\n          return lenA - lenB;\n        }\n        if (lenA === 1) {\n          const idxA = edgeSegmentIndices[a][0];\n          const idxB = edgeSegmentIndices[b][0];\n          if (allRoutedSegments[idxA] && allRoutedSegments[idxB]) {\n            const segA = allRoutedSegments[idxA];\n            const segB = allRoutedSegments[idxB];\n            const distA2 = Math.abs(segA.to - segA.from);\n            const distB2 = Math.abs(segB.to - segB.from);\n            if (Math.abs(distA2 - distB2) > 1) {\n              return distA2 - distB2;\n            }\n          }\n        }\n        return 0;\n      });\n      const handles = grp.map((ei) => allRoutedSegments[edgeSegmentIndices[ei][0]]);\n      crossings += resolveHandleConflicts(handles);\n    }\n    return crossings;\n  }, \"fixSourceHandleCrossings\");\n  const fixTargetHandleCrossings = /* @__PURE__ */ __name(() => {\n    let crossings = 0;\n    const edgesByTarget = /* @__PURE__ */ new Map();\n    for (const [i, e] of edges.entries()) {\n      const indices = edgeSegmentIndices[i];\n      if (indices.length === 0) {\n        continue;\n      }\n      if (!e.end) {\n        continue;\n      }\n      if (!edgesByTarget.has(e.end)) {\n        edgesByTarget.set(e.end, []);\n      }\n      edgesByTarget.get(e.end).push(i);\n    }\n    for (const grp of edgesByTarget.values()) {\n      grp.sort((a, b) => {\n        const getDist = /* @__PURE__ */ __name((edgeIdx) => {\n          const indices = edgeSegmentIndices[edgeIdx];\n          if (indices.length < 2) {\n            return 0;\n          }\n          const prev = allRoutedSegments[indices[indices.length - 2]];\n          return Math.abs(prev.to - prev.from);\n        }, \"getDist\");\n        const scoreA = getDist(a);\n        const scoreB = getDist(b);\n        if (Math.abs(scoreA - scoreB) > 0.1) {\n          return scoreA - scoreB;\n        }\n        return a - b;\n      });\n      const handles = grp.map(\n        (ei) => allRoutedSegments[edgeSegmentIndices[ei][edgeSegmentIndices[ei].length - 1]]\n      );\n      crossings += resolveHandleConflicts(handles);\n    }\n    return crossings;\n  }, \"fixTargetHandleCrossings\");\n  const fixPipeCrossings = /* @__PURE__ */ __name(() => {\n    let crossings = 0;\n    for (const pipe of pipes) {\n      const pipeSegments = [];\n      for (const t of pipe.tracks) {\n        for (const ref of t.segments) {\n          const idx = edgeSegmentIndices[ref.edgeIndex].find(\n            (ix) => allRoutedSegments[ix].segmentIndex === ref.segmentIndex\n          );\n          if (idx !== void 0) {\n            pipeSegments.push(allRoutedSegments[idx]);\n          }\n        }\n      }\n      pipeSegments.sort((a, b) => a.edgeIndex - b.edgeIndex || a.segmentIndex - b.segmentIndex);\n      for (let i = 0; i < pipeSegments.length; i++) {\n        for (let j = i + 1; j < pipeSegments.length; j++) {\n          const s1 = pipeSegments[i];\n          const s2 = pipeSegments[j];\n          if (segmentsConflict(s1, s2)) {\n            crossings++;\n            resolveTrackConflict(s1, s2, moveSegmentToTrack);\n          }\n        }\n      }\n    }\n    return crossings;\n  }, \"fixPipeCrossings\");\n  let iterations = 0;\n  const MAX_ITER = 10;\n  while (iterations < MAX_ITER) {\n    let changed = 0;\n    changed += fixSourceHandleCrossings();\n    changed += fixTargetHandleCrossings();\n    changed += fixPipeCrossings();\n    if (changed === 0) {\n      break;\n    }\n    iterations++;\n  }\n  const segmentCoords = /* @__PURE__ */ new Map();\n  for (const pipe of pipes) {\n    const segments = [];\n    pipe.tracks.forEach((t) => {\n      t.segments.forEach((s) => {\n        segments.push({\n          edgeIndex: s.edgeIndex,\n          segmentIndex: s.segmentIndex,\n          trackIndex: t.index,\n          from: s.from,\n          to: s.to\n        });\n      });\n    });\n    segments.sort((a, b) => a.from - b.from);\n    const clusters = [];\n    if (segments.length > 0) {\n      let currentCluster = [segments[0]];\n      let clusterEnd = segments[0].to;\n      for (let k = 1; k < segments.length; k++) {\n        const s = segments[k];\n        if (s.from < clusterEnd) {\n          currentCluster.push(s);\n          clusterEnd = Math.max(clusterEnd, s.to);\n        } else {\n          clusters.push(currentCluster);\n          currentCluster = [s];\n          clusterEnd = s.to;\n        }\n      }\n      clusters.push(currentCluster);\n    }\n    for (const cluster of clusters) {\n      const usedTracks = /* @__PURE__ */ new Set();\n      cluster.forEach((s) => usedTracks.add(s.trackIndex));\n      const trackScores = /* @__PURE__ */ new Map();\n      cluster.forEach((s) => {\n        const info = getDestInfo(s.edgeIndex);\n        trackScores.set(s.trackIndex, (trackScores.get(s.trackIndex) ?? 0) + info.delta);\n      });\n      const leftTracks = [...usedTracks].filter((t) => (trackScores.get(t) ?? 0) < -1);\n      const rightTracks = [...usedTracks].filter((t) => (trackScores.get(t) ?? 0) > 1);\n      const neutralTracks = [...usedTracks].filter((t) => Math.abs(trackScores.get(t) ?? 0) <= 1);\n      leftTracks.sort((a, b) => (trackScores.get(b) ?? 0) - (trackScores.get(a) ?? 0));\n      rightTracks.sort((a, b) => (trackScores.get(a) ?? 0) - (trackScores.get(b) ?? 0));\n      const assignCoord = /* @__PURE__ */ __name((trackIndex, coord) => {\n        cluster.filter((s) => s.trackIndex === trackIndex).forEach((s) => {\n          const effectiveCoord = straightIntraLaneEdges.has(s.edgeIndex) ? pipe.coord : coord;\n          segmentCoords.set(`${s.edgeIndex}-${s.segmentIndex}`, effectiveCoord);\n        });\n      }, \"assignCoord\");\n      let leftCount = 0;\n      for (const trackIndex of leftTracks) {\n        leftCount++;\n        assignCoord(trackIndex, pipe.coord - leftCount * TRACK_SPACING);\n      }\n      if (neutralTracks.length === 0 && usedTracks.size > 0) {\n        const bestTrack = [...usedTracks].sort(\n          (a, b) => Math.abs(trackScores.get(a) ?? 0) - Math.abs(trackScores.get(b) ?? 0)\n        )[0];\n        const leftIdx = leftTracks.indexOf(bestTrack);\n        if (leftIdx !== -1) {\n          leftTracks.splice(leftIdx, 1);\n        }\n        const rightIdx = rightTracks.indexOf(bestTrack);\n        if (rightIdx !== -1) {\n          rightTracks.splice(rightIdx, 1);\n        }\n        neutralTracks.push(bestTrack);\n      }\n      let neutralAssigned = 0;\n      for (const trackIndex of neutralTracks) {\n        if (neutralAssigned === 0) {\n          assignCoord(trackIndex, pipe.coord);\n        } else {\n          const dir = neutralAssigned % 2 === 1 ? 1 : -1;\n          const magnitude = Math.ceil(neutralAssigned / 2);\n          assignCoord(trackIndex, pipe.coord + dir * magnitude * TRACK_SPACING * 0.5);\n        }\n        neutralAssigned++;\n      }\n      let rightCount = 0;\n      for (const trackIndex of rightTracks) {\n        rightCount++;\n        assignCoord(trackIndex, pipe.coord + rightCount * TRACK_SPACING);\n      }\n    }\n  }\n  for (const [i, e] of edges.entries()) {\n    const indices = edgeSegmentIndices[i] ?? [];\n    if (indices.length === 0) {\n      continue;\n    }\n    const newPoints = [];\n    const src = nodeById.get(e.start);\n    const dst = nodeById.get(e.end);\n    const { pSrcPort, pDstPort } = portsForEdge(i, src, dst);\n    const lines = indices.map((idx) => {\n      const s = allRoutedSegments[idx];\n      const coord = segmentCoords.get(`${s.edgeIndex}-${s.segmentIndex}`) ?? s.pipe.coord;\n      return {\n        orient: s.orientation,\n        coord,\n        from: s.from,\n        to: s.to\n      };\n    });\n    newPoints.push(pSrcPort);\n    for (let k = 0; k < lines.length; k++) {\n      const line = lines[k];\n      const prevPt = newPoints[newPoints.length - 1];\n      const prevAlong = line.orient === \"vertical\" ? prevPt.y : prevPt.x;\n      const prevTrackCoord = line.orient === \"vertical\" ? prevPt.x : prevPt.y;\n      const nextLine = lines[k + 1];\n      const hasNextLine = k < lines.length - 1;\n      if (Math.abs(prevTrackCoord - line.coord) > EPS7) {\n        newPoints.push(pointOnLine(line, prevAlong));\n      }\n      if (hasNextLine && nextLine.orient === line.orient) {\n        if (Math.abs(line.coord - nextLine.coord) > EPS7) {\n          const junction = line.orient === \"vertical\" ? (prevAlong + nextLine.from) / 2 : sharedLineEndpointCoord(line, nextLine);\n          newPoints.push(pointOnLine(line, junction), pointOnLine(nextLine, junction));\n        } else if (k === 0 || k === lines.length - 2) {\n          newPoints.push(pointOnLine(line, sharedLineEndpointCoord(line, nextLine)));\n        }\n      } else if (hasNextLine) {\n        newPoints.push(pointOnLine(line, nextLine.coord));\n      } else {\n        const endAlong = Math.abs(line.from - prevAlong) < Math.abs(line.to - prevAlong) ? line.to : line.from;\n        newPoints.push(pointOnLine(line, endAlong));\n      }\n    }\n    const last = newPoints[newPoints.length - 1];\n    if (Math.abs(last.x - pDstPort.x) > EPS7 || Math.abs(last.y - pDstPort.y) > EPS7) {\n      newPoints.push(pDstPort);\n    }\n    const filtered = [];\n    if (newPoints.length > 0) {\n      filtered.push(newPoints[0]);\n    }\n    for (let k = 1; k < newPoints.length; k++) {\n      const p = newPoints[k];\n      const prev = filtered[filtered.length - 1];\n      if (Math.abs(p.x - prev.x) > EPS7 || Math.abs(p.y - prev.y) > EPS7) {\n        filtered.push(p);\n      }\n    }\n    e.points = filtered;\n  }\n  for (const re of edges) {\n    const orig = re.__originalEdge;\n    if (orig && re.points) {\n      orig.points = re.points;\n    }\n  }\n  data.edges = (data.edges ?? []).filter((e) => !e.isLayoutOnly);\n  const nodeBoundaryClamp = /* @__PURE__ */ __name((p, node) => {\n    const cx = node.x ?? 0;\n    const cy = node.y ?? 0;\n    const w = node.width ?? 0;\n    const h = node.height ?? 0;\n    if (w <= 0 || h <= 0) {\n      return p;\n    }\n    const left = cx - w / 2;\n    const right = cx + w / 2;\n    const top = cy - h / 2;\n    const bottom = cy + h / 2;\n    if (p.x < left || p.x > right || p.y < top || p.y > bottom) {\n      return p;\n    }\n    const dLeft = p.x - left;\n    const dRight = right - p.x;\n    const dTop = p.y - top;\n    const dBottom = bottom - p.y;\n    const minD = Math.min(dLeft, dRight, dTop, dBottom);\n    if (minD === dLeft) {\n      return { x: left, y: p.y };\n    }\n    if (minD === dRight) {\n      return { x: right, y: p.y };\n    }\n    if (minD === dTop) {\n      return { x: p.x, y: top };\n    }\n    return { x: p.x, y: bottom };\n  }, \"nodeBoundaryClamp\");\n  for (const edge of data.edges) {\n    const pts = edge.points;\n    if (!pts || pts.length < 2) {\n      continue;\n    }\n    const srcId = edge.start;\n    const dstId = edge.end;\n    const src = srcId ? nodeById.get(srcId) : void 0;\n    const dst = dstId ? nodeById.get(dstId) : void 0;\n    if (src) {\n      pts[0] = nodeBoundaryClamp(pts[0], src);\n    }\n    if (dst) {\n      pts[pts.length - 1] = nodeBoundaryClamp(pts[pts.length - 1], dst);\n    }\n  }\n  return data;\n}\n__name(routeEdgesOrthogonal, \"routeEdgesOrthogonal\");\n\n// src/rendering-util/layout-algorithms/swimlanes/layoutCore.ts\nfunction getSwimlaneDirection(data4Layout) {\n  return data4Layout.direction ?? \"TB\";\n}\n__name(getSwimlaneDirection, \"getSwimlaneDirection\");\nfunction runSwimlaneLayoutCore(data4Layout) {\n  const g = toGraphView(data4Layout);\n  const nodeGap = data4Layout.config.flowchart?.nodeSpacing ?? 40;\n  const layerGap = data4Layout.config.flowchart?.rankSpacing ?? 100;\n  const ignoreCrossLaneEdges = data4Layout.config.swimlane?.ignoreCrossLaneEdges ?? true;\n  const optimizeRanksByCrossings2 = data4Layout.config.swimlane?.optimizeRanksByCrossings ?? true;\n  const automaticLaneOrdering = data4Layout.config.swimlane?.automaticLaneOrdering ?? false;\n  const direction = getSwimlaneDirection(data4Layout);\n  const { ordered, coordinates } = sugiyamaLayout(g, {\n    nodeGap,\n    layerGap,\n    ignoreCrossLaneEdges,\n    optimizeRanksByCrossings: optimizeRanksByCrossings2,\n    automaticLaneOrdering,\n    direction\n  });\n  writeBackToLayoutData(g, ordered, coordinates, { nodeGap, layerGap });\n  for (const edge of data4Layout.edges ?? []) {\n    delete edge.points;\n  }\n  routeEdgesOrthogonal(data4Layout, direction);\n  for (const edge of data4Layout.edges ?? []) {\n    if (!edge.curve || edge.curve === \"basis\") {\n      edge.curve = \"rounded\";\n    }\n  }\n  postProcessSwimlaneLayout(data4Layout, direction);\n  validateSwimlanesLayout(data4Layout);\n  return direction;\n}\n__name(runSwimlaneLayoutCore, \"runSwimlaneLayoutCore\");\n\n// src/rendering-util/layout-algorithms/swimlanes/index.ts\nfunction prepareSwimlaneLayout(data4Layout) {\n  prepareLayoutForSwimlanes(data4Layout);\n  const transformedData = createEdgeLabelNodes(data4Layout);\n  data4Layout.nodes = transformedData.nodes;\n  data4Layout.edges = transformedData.edges;\n}\n__name(prepareSwimlaneLayout, \"prepareSwimlaneLayout\");\nvar render = createCommonLayoutRenderer({\n  prepareLayout: prepareSwimlaneLayout,\n  runLayoutCore: runSwimlaneLayoutCore,\n  afterPaint: applySwimlaneLineJumps\n});\nexport {\n  render\n};\n"],"names":["ROUNDED_CORNER_RADIUS","CORNER_EPSILON","ENDPOINT_EPSILON","buildSegmentList","points","segments","i","__name","segmentIntersection","a1","a2","b1","b2","dxA","dyA","dxB","dyB","denom","dx","dy","tA","tB","isHorizontalSeg","seg","findEdgeIntersections","edges","crossings","edgeA","segmentsA","j","edgeB","segmentsB","si","segA","sj","segB","hit","aHoriz","bHoriz","fmt","n","rounded","pointToString","p","getArcSweepFlag","MIN_JUMP_RADIUS","applyMarkerOffsets","edge","out","startOff","markerOffsets","a","b","ang","endOff","emitJump","jump","ux","uy","sweep","style","cx","cy","pre","post","computeRoundedCorner","prev","curr","next","radius","dx1","dy1","dx2","dy2","len1","len2","nx1","ny1","nx2","ny2","dot","clamped","angle","cutLen","rewriteEdgePath","jumps","config","rawPoints","bySeg","segLen","list","parts","segStartConsumed","corner","segEndStop","upcomingCorner","segJumps","k","gap","half","isStraightPath","d","curveSupportsLineHops","curve","decodeDataPoints","raw","json","parsed","pts","applyLineJumpsToSvg","edgePathsGroup","groupNode","edgeMeta","e","renderedEdges","pathById","escapedId","pathEl","jumpsByEdge","c","renderedEdge","curveHint","currentD","originalStyle","dasharrayMatch","preservedOValueS","preservedOValueE","newD","newLen","onLen","newDasharray","cleaned","applySwimlaneLineJumps","data4Layout","measure","lineHopsConfig","jumpStyle","edgeGeometries","DEFAULT_SWIMLANE_ID","TOP_LANE_TITLE_BAND_HEIGHT","MIN_TOP_LANE_HORIZONTAL_PADDING","topLaneHorizontalPadding","lane","assignTopLaneTitleRect","x","y","width","height","contentTop","top","headerBottom","titleHeight","bottom","prepareLayoutForSwimlanes","layout","direction","nodes","node","looseNodes","defaultLane","toGraphView","nodeById","src","dst","allNodes","groupNodes","nonGroupNodes","writeBackToLayoutData","g","ordered","coords","opts","nodeMap","layerGap","nodeGap","layerIndex","layer","orderIndex","id","groupBounds","topLevelGroups","group","children","minX","maxX","minY","maxY","child","cw","ch","pad","horizontalPad","verticalPad","w","h","globalMinY","globalMaxY","maxPad","contentHeight","verticalMargin","laneHeight","centerY","sortedLanes","ax","bx","laneIds","centers","baseWidths","contentWidth","count","laneWidths","u","lowerBound","upperBound","baseW","finalWidth","EDGE_LABEL_LOG_PREFIX","createEdgeLabelNodes","data","nodesToAdd","layoutOnlyEdges","sourceNode","targetNode","log","labelNodeId","labelLane","labelNode","toLabelVirtual","fromLabelVirtual","newNodes","newEdges","EPS","measuredNodeRect","rectFromCenterSize","nodeBoundsInfoFor","measured","samePoint","epsilon","sameX","sameY","isHorizontalSegment","isVerticalSegment","overlapLength","sameAxisSegmentOverlapLength","orthogonalSegmentsForPoints","result","horizontal","vertical","countOrthogonalBends","bends","dedupeConsecutivePoints","point","last","classifyThreeSegmentRoute","p0","p1","p2","p3","segmentBoundsOverlapRect","rect","buffer","segMinX","segMaxX","segMinY","segMaxY","pointInsideRect","rectContainsRect","outer","inner","rectsOverlap","inflateRect","margin","rectOfNodeBounds","portForRectSide","side","buildOrthogonalPortPath","srcSide","dstSide","anchor","srcH","dstH","midX","intX","intY","midY","sameDirSrc2","sameDirDst2","sameDirSrc","sameDirDst","buildSameSideTrackPath","track","collectRealNodeBounds","nodeInfoById","realNodeRects","info","collectNodeRectEntries","labelNodeRects","entry","collectLayoutNodeRects","includeEdgeLabels","getNodePairGeometry","srcId","dstId","srcInfo","dstInfo","segmentHitsAnyRect","rects","excludeIds","shrink","orthogonalSegmentsCross","endpointTolerance","s1H","s1V","s2H","s2V","horiz","vert","hY","hX1","hX2","vX","vY1","vY2","matchesHorizEndpoint","matchesVertEndpoint","sameAxisSegmentsOverlap","segmentConflictsWithAnyEdge","excludeEdge","skipDegenerateOther","other","oa","ob","orthogonalSegmentsStrictlyCross","aVert","bVert","hXmin","hXmax","vYmin","vYmax","strictlyBetween","value","lo","hi","isCollinearIntermediate","cur","simplifyPolylineOnce","changed","orthogonalizePolyline","prevPrev","deduped","simplifyPolyline","work","guard","EPS2","INSIDE_EPS","CORNER_CLEARANCE","endpointContextFor","nodeByIdMap","minPoints","candidate","segmentEnterPoint","outside","inside","r","clipEndpoint","atStart","step","outsideIndex","insideIndex","clipEdgeEndpointsToNodeBoundaries","context","clearStraightEndpointCornerConnections","snapEndpointToBoundary","endpoint","useApproachSide","toTop","firstDistinctAdjacent","endpointIndex","index","cornerClearanceRange","min","max","clampToCornerClearance","intersectRanges","ranges","range","clearanceRangeForSide","terminalSideForSegment","adjacent","yWithin","xWithin","isHorizontalSide","straightClearanceRange","start","end","srcRect","dstRect","clearStraightEndpointCornerAxis","current","cornerClearedEndpoint","moveCollinearEndpointRun","adjusted","horizontalTerminal","clearEndpointCornerConnection","borderSideForSegment","leavesOutward","from","to","collapseOwnBorderStub","side2","snapAndCollapseEndpoints","snapped","straightCleared","prepareEdgeEndpointsForRenderer","input","newPts","duplicated","buildNodeMap","resolveTopLevelGroupId","parentId","topLevelGroupId","parent","groupDepth","depth","boundsForChildren","applyGroupBounds","bounds","recomputeNestedGroupBounds","groupsByDepth","mirrorAxis","axis","contentNodes","mirror","titleRect","applyBtDirectionTransform","applyLrDirectionTransform","x0","y0","titleBandSize","totalWidth","totalHeight","avgWidth","avgHeight","horizontalScaleFactor","newX","newY","laneNodes","childrenByLane","laneId","bucket","laneBounds","globalMinXChild","globalMaxXChild","fullContentWidth","horizontalMargin","bodyWidth","laneWidth","laneLeft","centerX","laneTop","laneBottom","EPS3","MIN_PORT_SPACING","PORT_SHIFT","TRY_DELTAS","portSwapToLShape","route","isHVH","nodePair","collinearX","collinearY","delta","np0","np1","np2","newSrcY","newSrcX","firstSegDegenerate","secondSegDegenerate","firstSegConflicts","secondSegConflicts","collapseShortTerminalStub","labelRects","rawPts","nLast","endPt","penultPt","prevPt","lastDx","lastDy","lastLen","penultDx","penultDy","lastIsHoriz","lastIsVert","penultIsHoriz","penultIsVert","dstCx","dstCy","newPrev","newEnd","approachFromBelow","approachFromLeft","ownSegmentKey","selfSegments","segmentCrossesOtherEdge","oPts","beforePrev","endpointIds","labelId","lw","lh","bestMidX","bestMidY","bestLen","isHoriz","isVert","EPS_LOCAL","MIN_SHARED","segmentsFor","orthogonallyAligned","separateSharedRenderedTerminalLanes","rectIntersect","terminalLaneFor","nodeId","boundary","railEnd","projectedOverlapLength","sameTerminalFace","exactTerminalLaneConflict","nearTerminalLaneConflict","shared","faceSpan","shiftedCandidate","shift","shiftedBoundary","shiftedRailEnd","railEndIsAdjacent2","rest","railEndIsAdjacent","before","previous","laneIsStraightCollinearConnector","startId","endId","startX","startY","endX","endY","shifts","iteration","lanes","fixed","first","second","fixingNearConflict","candidates","aPreservesStraight","bPreservesStraight","nextLane","collapseRedundantRectangularDoglegs","candidateIsSafe","sourceId","targetId","candidateSegments","segment","otherPoints","candidateSegment","otherSegment","withoutDogleg","p4","terminalVerticalDogleg","terminalHorizontalDogleg","p5","verticalDogleg","horizontalDogleg","liftObstacleHuggingSameSideRails","visibleEdges","pointsFor","replacementEdge","replacement","strictCrossingCount","firstSegments","secondSegments","firstSegment","secondSegment","middleRail","middle","blockingRectsFor","rail","candidateByMovingRail","coord","simplified","currentCrossings","blockers","liftTopLaneTitleBandsAboveRails","validTitleRect","topLaneTitleFor","rawDirection","titleWidth","horizontalSegmentIntersectsTitle","topDelta","shiftLeftLaneTitleBandsLeftOfRails","leftLaneTitleFor","verticalSegmentIntersectsTitle","leftDelta","segmentLeft","swapDestinationTerminalTailsToReduceCrossings","replacementPointsFor","replacements","crossingCount","totalBends","sum","terminalTailFor","tailStart","terminal","candidateWithDestinationTail","tail","firstTurn","connector","pathHasNodeHit","path","pathHasSharedTrack","edgesByDestination","currentBends","bestReplacements","bestCrossings","bestBends","destinationEdges","firstTail","secondTail","firstCandidate","secondCandidate","candidateCrossings","candidateBends","reassignCrossingExternalRailChannels","endpointRectsFor","srcNode","dstNode","externalRailForSegment","endpointRects","leftBound","rightBound","topBound","bottomBound","collectExternalRails","rails","railsInteract","connectedComponents","seen","queue","component","uniqueCoordsFor","coordinateAssignmentsFor","assignments","used","visit","assignment","replacementsForAssignment","draftByEdge","firstChanged","bestDisplacement","candidateDisplacement","shortcutRedundantOrthogonalJogs","pathLength","segmentRunsAlongRectBorder","shortcutCandidatesAt","isVHV","corners","rawCandidates","key","bestEdge","bestPath","bestLength","currentPoints","currentLength","candidateLength","resolveRenderedOrthogonalCrossings","realNodes","sides","outsideTracks","edgeIndex","outwardTracksForSide","outward","tracks","channel","crossingCountBetweenSegments","crossingCountBetweenPaths","crossingSnapshot","pairs","edgeSet","edgeOrder","addEdge","firstPoints","pairCount","crossingCountWithReplacements","currentAffected","pair","replacementAffected","crossingComponents","snapshot","neighbors","firstNeighbors","secondNeighbors","components","endpointIdsFor","pairSearchGroups","groups","componentSet","componentEndpointIds","crossingCountWithSingleReplacement","currentCrossingsByEdge","totalLength","pathHasSegmentConflict","pathSegments","pathHitsNode","pushOrthogonalCandidate","sideIsHorizontal","localTrackForSameSide","addSameSideCandidates","trackSeeds","seed","addHorizontalToVerticalCandidates","xTrack","yTrack","addVerticalToHorizontalCandidates","addHorizontalPairCandidates","yTracks","srcTrack","dstTrack","addVerticalPairCandidates","xTracks","dedupeCandidatePaths","buildCandidatesForSides","base","srcHorizontal","dstHorizontal","addVerticalDepartureOuterTrackCandidates","departure","externalXTracks","externalYTracks","targetYTracks","targetTrack","addHorizontalDepartureOuterTrackCandidates","targetXTracks","terminalPreservingOuterTrackCandidates","candidatePathsFor","srcPort","currentSegmentsByEdge","sharedTrackConflictsFor","baseSegments","conflicts","otherSegments","pairCandidatesFor","crossingCountByEdge","pairCrossingCount","firstEdge","secondEdge","conflictsOnlyWith","conflict","candidatesShareTrack","pairCandidatesAreCompatible","scorePairReplacement","pairScoreIsBetter","best","bestScoreForOptionPair","pairBest","score","bestPairedReplacement","baseBendsByEdge","baseLengthByEdge","optionsByEdge","scoringContext","crossingEdgeSet","options","option","currentEdgeBends","candidateHitsNode","candidateHasSegmentConflict","pairedReplacement","EPS4","MIN_SHARED2","simplifyDetouredEdges","ANCHOR","buildOrthogonalPathCandidates","paths","pathConflictCount","currentEdge","includeIncidentEdges","currentStart","currentEnd","otherStart","otherEnd","otherPts","pathSegment","BEND_THRESHOLD","nearestSideOfRect","pt","dTop","dBottom","dLeft","dRight","bestDist","faceClaims","addFaceClaim","edgeId","claims","eId","faceIsClaimed","ignoreEdgeId","currentCrossingConflicts","currentNonIncidentConflicts","bestCrossingConflicts","dstPort","pathBends","pathCrossingConflicts","refreshSrc","refreshDst","EPS5","MARKER_CLEARANCE_LENGTH","MARKER_CLEARANCE_HALF_WIDTH","markerClearanceRectFor","terminalIndex","tip","x2","y2","normalizeRect","labelOverlapsOwnMarker","visiblePts","startMarker","endMarker","marker","anchorLabelsToPolyline","allEdgeSegments","foreignNodeRects","laneGroups","isGroup","rect2","LABEL_PLACEMENT_BUFFER","LABEL_LANE_MARGIN","LABEL_ENDPOINT_CLEARANCE","labelOverlapsForeignNode","buffered","nr","labelOverlapsForeignEdge","s","labelOverlapsAnything","placedLabelRects","findContainingLane","laneRect","overlapsPlacedLabel","placed","middleSegments","poolBase","labelLongAxis","rankSegments","pool","aLongAxis","bLongAxis","aFits","bFits","firstVisibleSegment","lastVisibleSegment","ALONG_SEGMENT_TS","anchorAtT","t","clamp","pointInsideRectInclusive","placementForAnchor","centeredRect","centeredLane","containingLane","clampedAnchor","clampedRect","distanceAlongSegment","labelClearsTerminalEndpoints","requiredDistance","tryPool","rankedPool","placement","findLaneContainingFallback","requireEndpointClearance","allowForeignEdgeOverlap","chosen","chosenRect","priorIdx","EPS6","MIN_PORT_SPACING2","PORT_SHIFT2","LABEL_CLEARANCE_BUFFER","pairKey","straightenCollinearSiblingDetours","labelDimById","labelClearanceFor","thisEdge","thisSrcId","thisDstId","targetPair","maxHalf","consider","dim","oSrc","oDst","targetSrc","targetDst","dstBelow","dstEast","labelShift","effectiveShift","deltas","shiftedSrc","shiftedDst","nudgeSharedInteriorSubpaths","segmentsFor2","allSegments","hasCrowdedParallelTrack","ownLabelIds","nodeCenter","sourceDetourContextFor","sourceRect","targetRect","verticalSourceDetour","sourceCenter","targetCenter","targetBelow","sourcePortY","stubY","railX","horizontalSourceDetour","targetRight","sourcePortX","stubX","railY","sourceDetourCandidate","direct","detoured","segmentsIntersect","d1x","d1y","d2x","d2y","cross","eps","validateSwimlanesLayout","issues","nodeRects","edgeSegments","edgeStart","edgeEnd","ownLabelId","crossingPairs","pairKey2","overlaps","issue","postProcessSwimlaneLayout","finalizeRenderedEdges","normalizeGraph","incoming","v","buildSuccessorMap","succs","buildSortedSuccessorMap","successors","buildInDegreeMap","indeg","sortedZeroInDegreeNodes","degree","buildPredecessorSuccessorMaps","includeEdge","preds","buildLayersFromRanks","order","rankOf","maxRank","layers","topoSortIfAcyclic","adj","buildLayerIndex","m","countInversions","values","tmp","left","right","mid","inversions","removeCycles_DFS","gn","arr","color","reversed","dfs","nodesSorted","toReverse","acycEdges","buildTopLaneMap","cache","resolve","createTopLaneResolver","topLaneMap","buildTopLaneOrder","resolveTopLaneOrder","preferredOrder","sourceOrder","sourceLaneIds","resolved","PRECISION","LAYERING","COORDINATES","buildDrivingTree","graph","laneOf","rankHint","topoOrder","topoIndex","idx","chooseParent","rootSet","roots","ta","tb","adjacency","buildAdjacency","adjacencyList","set","componentOf","assignComponents","blocks","computeBlocks","nodeBlocks","block","preorder","postorder","walk","root","ctx","laneNode","laneA","laneB","sameLaneA","sameLaneB","rankA","rankB","idxA","idxB","componentId","stack","discovery","low","edgeStack","time","popBlock","computeSubtreeCrossCounts","tree","indexOf","parentIdx","currentIdx","childList","childIdx","maxLog","up","lcaIndex","aIdx","bIdx","diff","upA","upB","ownCounts","ru","rv","upperIdx","lowerIdx","lca","crossCounts","mergeInto","target","source","visited","accumulator","childMap","parentLayer","map","childLayer","annotateMinimumLayers","minLayer","annotate","minL","compareByRankThenId","childMin","ra","rb","emitNodesInTreeOrder","orderChildren","emitted","emit","deduplicateLayers","createChildOrderer","future","present","crossMap","ca","cb","ma","mb","item","buildMultitreeLayerOrder","rootsSorted","countCrossingsBetweenAdjacent","upper","lower","upperSet","lowerSet","li","vs","totalCrossings","expanded","rUpper","rLower","L","optimizeRanksByCrossings","initialRank","maxPasses","pass","nodesByRank","lb","old","trialLayers","adjustCrossLaneSources","topLaneOf","laneV","outEdges","hasSameLaneSucc","crossLaneCount","laneDst","crossLaneIncoming","hasSameLanePred","laneSrc","newRank","assignLayers_LongestPath","gAcyclic","compact","incAll","inc","laneU","mx","assignLayers_Gravity","revOrder","clampFeasible","desired","ub","iters","relaxOrder","nodeOrder","ps","ss","predAvg","succAvg","it","forwardChanged","backwardChanged","topoSortByGenerationIfAcyclic","frontier","nextFrontier","assignLayers_LaneAwareCompact","nextFree","edgeWeight","nf","makeProperLayering","layering","l","dummy","dummySeq","addDummyAt","dn","edgesSorted","rU","rV","lastIndex","graphWithDummies","median","barycenter","acc","neighborPositionsFor","targetNodes","fixedIndex","neighborPositions","currentOrderTieBreak","currentLayerIndex","ia","ib","countCrossingsBetweenAdjacent2","upperIndex","lowerIndex","sortByHeuristic","sa","sb","reorderLayer","fixedLayer","targetLayer","laneOrder","currIndex","byLane","nodesInLane","sorted","nullNodes","nid","bc","bestIdx","rid","rBc","transposeImprove","layerSet","nextSet","edgesIn","edgesOut","crossingScore","improved","bestScore","nextScore","orderLayers","gWithDummies","assignCoordinates","laneGap","isHorizontal","getNode","getWidth","getHeight","laneOrderGlobal","layerHeights","extraLayerGaps","thisLayerMaxWidth","nextLayerMaxWidth","thisLayerMaxHeight","nextLayerMaxHeight","normalSpacing","requiredSpacing","extraNeeded","lanesUsedSet","hasNullLane","lanesUsed","laneOrderColumns","perLane","nullIds","ids","total","totalNull","widths","cursor","yOffset","layerH","extraGap","byRef","chainEdges","ref","involved","vid","AUTOMATIC_LANE_ORDERING_RESTARTS","hashString","hash","mulberry32","state","deterministicShuffle","shuffled","random","sourceDistance","sourceIndex","distance","laneArrangementCost","weights","position","cost","weight","ai","bi","buildWeightedLaneEdges","existing","greedySwitch","startOrder","sweeps","maxSweeps","nextCost","isBetterCandidate","seedForRestart","restartIndex","weightSignature","optimizeTopLaneOrder","restarts","sugiyamaLayout","ignoreCrossLaneEdges","optimizeRanksByCrossings2","g0","cycleRes","properLayering","coordinates","EPS7","NODE_PADDING","HORIZONTAL_PIPE_MARGIN","VERTICAL_PIPE_MARGIN","ROUTING_MARGIN","ANCHOR_OFFSET","TRACK_SPACING","chooseOrthogonalSide","fallback","absDx","absDy","sharedLineEndpointCoord","line","nextLine","pointOnLine","along","routeEdgesOrthogonal","originalEdges","oe","laneByNodeId","pipes","isLR","assignLane","obstacles","padding","getOrAddPipe","orientation","spanMin","spanMax","pipe","portForSide","getOrthogonalPort","isSource","allRoutedSegments","edgeSegmentIndices","straightIntraLaneEdges","CROSSING_PENALTY","crossingPenalty","edgeIdx","isVertical","penalties","routingOrder","srcLane","dstLane","crossLane","aDist","bDist","isSegmentBlocked","excludeStart","excludeEnd","obs","portGroups","incidentEdgeTotals","determineSide","sideInfoByIdx","preferenceStrength","secondarySide","sourceSideGroups","sideLoad","loadKey","secondary","primaryLoad","secondaryLoad","isDiamondNode","shape","inSidesByNode","inSides","srcKey","dstCoord","dstKey","srcCoord","portOffsets","MIN_PORT_SPACING3","role","sideLength","effectiveLength","spacing","startOffset","element","offset","offsetKey","edgeHasLabelNode","faceHasLabelNode","applyPortOffset","basePort","portsForEdge","sideInfo","srcTarget","dstTarget","pSrcPort","pDstPort","srcOffset","dstOffset","srcPortSide","dstPortSide","pSrcAnchor","pDstAnchor","srcPortIsVertical","dstPortIsVertical","isBottom","isRight","isPointInObstacle","excludeNodeIds","obstacleDetour","port","opposite","portIsVertical","leavesPositiveSide2","leavesPositiveSide","goDown","srcHandleWaypoints","srcCheck","detour","gapY","gapX","dstHandleWaypoints","dstCheck","hpMargin","anchorsSameX","anchorsSameY","hasPortOffset","srcFaceTotal","dstFaceTotal","faceContested","srcIncidentTotal","dstIncidentTotal","contestedFaceHasLabel","srcContestAllowsCenteredStraight","dstContestAllowsCenteredStraight","fastPathOrientation","fastPathCoord","fastPathFrom","fastPathTo","fastPathPipe","srcPipe","dstPipe","bbMinX","bbMaxX","bbMinY","bbMaxY","pathMinX","pathMaxX","pathMinY","pathMaxY","hMargin","vMargin","hPipes","vPipes","getKey","startKey","endKey","gScore","cameFrom","arrivalDir","openSet","openList","foundPath","checkSegmentBlocked","cornerHV","seg1HV_blocked","seg2HV_blocked","pathHV_blocked","cornerVH","seg1VH_blocked","seg2VH_blocked","currKey","currPt","sortedVPipes","vIdx","hPipesSorted","hIdx","neighbor","nKey","dist","penalty","dirPenalty","destDx","destDy","moveDx","moveDy","bendPenalty","currentDir","moveDir","stepCost","tentativeG","wentRight","wentLeft","pathX","detourObstacles","visualMaxX","obsCenterX","visualRight","visualMinX","visualLeft","findBestReturnY","detourX","goingDown","relevantObs","obsInXRange","obsInYRange","filteredObs","obsAtDetourX","bestY","trySimplifyWithDetourX","corner1","corner2","corner3","seg1Blocked","seg2Blocked","seg3Blocked","seg4Blocked","simplified2","fullPoints","C","B","A","signAB","signAC","dir1","dir2","rSeg","segmentsOverlap","s1","s2","trySwapSegmentsAcrossTracks","t1","t2","canS1GoT2","canS2GoT1","createNewTrack","moveSegmentToTrack","trackIdx","oldTrack","moveSegmentChainToTrack","indices","getAdjacentSegmentsAlongEdge","idxInList","haveAnyCrossing","findAvailableTrack","segmentsConflict","adj1","adj2","resolveTrackConflict","move","avail","resolveHandleConflicts","handles","h1","h2","destInfoCache","getDestInfo","info2","dest","candidateA","candidateB","deviation","fixSourceHandleCrossings","edgesBySource","getEdgeDistance","grp","infoA","infoB","distA","distB","lenA","lenB","distA2","distB2","ei","fixTargetHandleCrossings","edgesByTarget","getDist","scoreA","scoreB","fixPipeCrossings","pipeSegments","ix","iterations","MAX_ITER","segmentCoords","clusters","currentCluster","clusterEnd","cluster","usedTracks","trackScores","leftTracks","rightTracks","neutralTracks","assignCoord","trackIndex","effectiveCoord","leftCount","bestTrack","leftIdx","rightIdx","neutralAssigned","dir","magnitude","rightCount","newPoints","lines","prevAlong","prevTrackCoord","hasNextLine","junction","endAlong","filtered","re","orig","nodeBoundaryClamp","minD","getSwimlaneDirection","runSwimlaneLayoutCore","automaticLaneOrdering","prepareSwimlaneLayout","transformedData","render","createCommonLayoutRenderer"],"mappings":"qGAsBA,IAAIA,GAAwB,EACxBC,GAAiB,KACjBC,GAAmB,KACvB,SAASC,GAAiBC,EAAQ,CAChC,MAAMC,EAAW,CAAA,EACjB,QAASC,EAAI,EAAGA,EAAIF,EAAO,OAAS,EAAGE,IACrCD,EAAS,KAAK,CAAE,EAAGD,EAAOE,CAAC,EAAG,EAAGF,EAAOE,EAAI,CAAC,CAAC,CAAE,EAElD,OAAOD,CACT,CACAE,EAAOJ,GAAkB,kBAAkB,EAC3C,SAASK,GAAoBC,EAAIC,EAAIC,EAAIC,EAAI,CAC3C,MAAMC,EAAMH,EAAG,EAAID,EAAG,EAChBK,EAAMJ,EAAG,EAAID,EAAG,EAChBM,EAAMH,EAAG,EAAID,EAAG,EAChBK,EAAMJ,EAAG,EAAID,EAAG,EAChBM,EAAQJ,EAAMG,EAAMF,EAAMC,EAChC,GAAIE,IAAU,EACZ,OAAO,KAET,MAAMC,EAAKP,EAAG,EAAIF,EAAG,EACfU,EAAKR,EAAG,EAAIF,EAAG,EACfW,GAAMF,EAAKF,EAAMG,EAAKJ,GAAOE,EAC7BI,GAAMH,EAAKJ,EAAMK,EAAKN,GAAOI,EACnC,OAAIG,GAAMlB,IAAoBkB,GAAM,EAAIlB,IAAoBmB,GAAMnB,IAAoBmB,GAAM,EAAInB,GACvF,KAEF,CACL,MAAO,CAAE,EAAGO,EAAG,EAAIW,EAAKP,EAAK,EAAGJ,EAAG,EAAIW,EAAKN,CAAG,EAC/C,GAAAM,EACA,GAAAC,CACJ,CACA,CACAd,EAAOC,GAAqB,qBAAqB,EACjD,SAASc,GAAgBC,EAAK,CAC5B,OAAO,KAAK,IAAIA,EAAI,EAAE,EAAIA,EAAI,EAAE,CAAC,GAAK,KAAK,IAAIA,EAAI,EAAE,EAAIA,EAAI,EAAE,CAAC,CAClE,CACAhB,EAAOe,GAAiB,iBAAiB,EACzC,SAASE,GAAsBC,EAAO,CACpC,MAAMC,EAAY,CAAA,EAClB,QAASpB,EAAI,EAAGA,EAAImB,EAAM,OAAQnB,IAAK,CACrC,MAAMqB,EAAQF,EAAMnB,CAAC,EACfsB,EAAYzB,GAAiBwB,EAAM,MAAM,EAC/C,QAASE,EAAIvB,EAAI,EAAGuB,EAAIJ,EAAM,OAAQI,IAAK,CACzC,MAAMC,EAAQL,EAAMI,CAAC,EACfE,EAAY5B,GAAiB2B,EAAM,MAAM,EAC/C,SAAW,CAACE,EAAIC,CAAI,IAAKL,EAAU,QAAO,EACxC,SAAW,CAACM,EAAIC,CAAI,IAAKJ,EAAU,QAAO,EAAI,CAC5C,MAAMK,EAAM5B,GAAoByB,EAAK,EAAGA,EAAK,EAAGE,EAAK,EAAGA,EAAK,CAAC,EAC9D,GAAI,CAACC,EACH,SAEF,MAAMC,EAASf,GAAgBW,CAAI,EAC7BK,EAAShB,GAAgBa,CAAI,GACZE,IAAWC,EACDD,EAAS,IAExCX,EAAU,KAAK,CACb,WAAYC,EAAM,GAClB,YAAaG,EAAM,GACnB,SAAUE,EACV,EAAGI,EAAI,GACP,MAAOA,EAAI,KACzB,CAAa,EAEDV,EAAU,KAAK,CACb,WAAYI,EAAM,GAClB,YAAaH,EAAM,GACnB,SAAUO,EACV,EAAGE,EAAI,GACP,MAAOA,EAAI,KACzB,CAAa,CAEL,CAEJ,CACF,CACA,OAAOV,CACT,CACAnB,EAAOiB,GAAuB,uBAAuB,EACrD,SAASe,GAAIC,EAAG,CACd,MAAMC,EAAU,KAAK,MAAMD,EAAI,GAAG,EAAI,IACtC,OAAO,OAAO,UAAUC,CAAO,EAAI,GAAGA,CAAO,GAAK,GAAGA,CAAO,EAC9D,CACAlC,EAAOgC,GAAK,KAAK,EACjB,SAASG,GAAcC,EAAG,CACxB,MAAO,GAAGJ,GAAII,EAAE,CAAC,CAAC,IAAIJ,GAAII,EAAE,CAAC,CAAC,EAChC,CACApC,EAAOmC,GAAe,eAAe,EACrC,SAASE,GAAgBrB,EAAK,CAC5B,MAAML,EAAKK,EAAI,EAAE,EAAIA,EAAI,EAAE,EACrBJ,EAAKI,EAAI,EAAE,EAAIA,EAAI,EAAE,EAC3B,OAAI,KAAK,IAAIL,CAAE,GAAK,KAAK,IAAIC,CAAE,EACtBD,GAAM,EAAI,EAAI,EAEhBC,GAAM,EAAI,EAAI,CACvB,CACAZ,EAAOqC,GAAiB,iBAAiB,EACzC,IAAIC,GAAkB,KACtB,SAASC,GAAmB1C,EAAQ2C,EAAM,CACxC,GAAI3C,EAAO,OAAS,EAClB,OAAOA,EAAO,IAAKuC,IAAO,CAAE,GAAGA,CAAC,EAAG,EAErC,MAAMK,EAAM5C,EAAO,IAAKuC,IAAO,CAAE,GAAGA,CAAC,EAAG,EAClCM,EAAWF,EAAK,gBAAkBG,GAAcH,EAAK,cAAc,EACzE,GAAIE,EAAU,CACZ,MAAME,EAAI/C,EAAO,CAAC,EACZgD,EAAIhD,EAAO,CAAC,EACZiD,EAAM,KAAK,MAAMD,EAAE,EAAID,EAAE,EAAGC,EAAE,EAAID,EAAE,CAAC,EAC3CH,EAAI,CAAC,EAAE,EAAIG,EAAE,EAAIF,EAAW,KAAK,IAAII,CAAG,EACxCL,EAAI,CAAC,EAAE,EAAIG,EAAE,EAAIF,EAAW,KAAK,IAAII,CAAG,CAC1C,CACA,MAAMC,EAASP,EAAK,cAAgBG,GAAcH,EAAK,YAAY,EACnE,GAAIO,EAAQ,CACV,MAAMd,EAAIpC,EAAO,OACX,EAAIA,EAAOoC,EAAI,CAAC,EAChBY,EAAIhD,EAAOoC,EAAI,CAAC,EAChBa,EAAM,KAAK,MAAMD,EAAE,EAAI,EAAE,EAAGA,EAAE,EAAI,EAAE,CAAC,EAC3CJ,EAAIR,EAAI,CAAC,EAAE,EAAIY,EAAE,EAAIE,EAAS,KAAK,IAAID,CAAG,EAC1CL,EAAIR,EAAI,CAAC,EAAE,EAAIY,EAAE,EAAIE,EAAS,KAAK,IAAID,CAAG,CAC5C,CACA,OAAOL,CACT,CACAzC,EAAOuC,GAAoB,oBAAoB,EAC/C,SAASS,GAASC,EAAMC,EAAIC,EAAIC,EAAOC,EAAO,CAC5C,MAAMC,EAAKL,EAAK,MAAM,EAChBM,EAAKN,EAAK,MAAM,EAChBO,EAAM,CAAE,EAAGF,EAAKJ,EAAKD,EAAK,EAAG,EAAGM,EAAKJ,EAAKF,EAAK,CAAC,EAChDQ,EAAO,CAAE,EAAGH,EAAKJ,EAAKD,EAAK,EAAG,EAAGM,EAAKJ,EAAKF,EAAK,CAAC,EACjDR,EAAM,CAAC,IAAIN,GAAcqB,CAAG,CAAC,EAAE,EACrC,OAAIH,IAAU,MACZZ,EAAI,KAAK,IAAIT,GAAIiB,EAAK,CAAC,CAAC,IAAIjB,GAAIiB,EAAK,CAAC,CAAC,QAAQG,CAAK,IAAIjB,GAAcsB,CAAI,CAAC,EAAE,EAE7EhB,EAAI,KAAK,IAAIN,GAAcsB,CAAI,CAAC,EAAE,EAE7BhB,CACT,CACAzC,EAAOgD,GAAU,UAAU,EAC3B,SAASU,GAAqBC,EAAMC,EAAMC,EAAMC,EAAQ,CACtD,MAAMC,EAAMH,EAAK,EAAID,EAAK,EACpBK,EAAMJ,EAAK,EAAID,EAAK,EACpBM,EAAMJ,EAAK,EAAID,EAAK,EACpBM,EAAML,EAAK,EAAID,EAAK,EACpBO,EAAO,KAAK,MAAMJ,EAAKC,CAAG,EAC1BI,EAAO,KAAK,MAAMH,EAAKC,CAAG,EAChC,GAAIC,EAAOzE,IAAkB0E,EAAO1E,GAClC,OAAO,KAET,MAAM2E,EAAMN,EAAMI,EACZG,EAAMN,EAAMG,EACZI,EAAMN,EAAMG,EACZI,EAAMN,EAAME,EACZK,EAAMJ,EAAME,EAAMD,EAAME,EACxBE,EAAU,KAAK,IAAI,GAAI,KAAK,IAAI,EAAGD,CAAG,CAAC,EACvCE,EAAQ,KAAK,KAAKD,CAAO,EAC/B,GAAIC,EAAQjF,IAAkB,KAAK,IAAI,KAAK,GAAKiF,CAAK,EAAIjF,GACxD,OAAO,KAET,MAAMkF,EAAS,KAAK,IAAId,EAAS,KAAK,IAAIa,EAAQ,CAAC,EAAGR,EAAO,EAAGC,EAAO,CAAC,EACxE,MAAO,CACL,OAAQR,EAAK,EAAIS,EAAMO,EACvB,OAAQhB,EAAK,EAAIU,EAAMM,EACvB,KAAMhB,EAAK,EAAIW,EAAMK,EACrB,KAAMhB,EAAK,EAAIY,EAAMI,EACrB,MAAOhB,EAAK,EACZ,MAAOA,EAAK,EACZ,OAAAgB,CACJ,CACA,CACA5E,EAAO0D,GAAsB,sBAAsB,EACnD,SAASmB,GAAgBrC,EAAMsC,EAAOC,EAAQ,CAC5C,MAAMC,EAAYxC,EAAK,OACvB,GAAIwC,EAAU,OAAS,EACrB,MAAO,GAET,MAAMnF,EAAS0C,GAAmByC,EAAWxC,CAAI,EAC3CN,EAAUM,EAAK,QAAU,UACzB1C,EAAWF,GAAiBC,CAAM,EAClCoF,EAAwB,IAAI,IAClC,UAAW3D,KAAKwD,EAAO,CACrB,MAAM9D,EAAMlB,EAASwB,EAAE,QAAQ,EAC/B,GAAI,CAACN,EACH,SAEF,MAAMkE,EAAS,KAAK,MAAMlE,EAAI,EAAE,EAAIA,EAAI,EAAE,EAAGA,EAAI,EAAE,EAAIA,EAAI,EAAE,CAAC,EACxDmE,EAAOF,EAAM,IAAI3D,EAAE,QAAQ,GAAK,CAAA,EACtC6D,EAAK,KAAK,CACR,EAAG7D,EAAE,EACL,MAAOA,EAAE,MACT,EAAGA,EAAE,EAAI4D,EACT,EAAGH,EAAO,UAChB,CAAK,EACDE,EAAM,IAAI3D,EAAE,SAAU6D,CAAI,CAC5B,CACA,MAAMC,EAAQ,CAAC,IAAIjD,GAActC,EAAO,CAAC,CAAC,CAAC,EAAE,EAC7C,QAAS,EAAI,EAAG,EAAIC,EAAS,OAAQ,IAAK,CACxC,MAAMkB,EAAMlB,EAAS,CAAC,EAChBoF,EAAS,KAAK,MAAMlE,EAAI,EAAE,EAAIA,EAAI,EAAE,EAAGA,EAAI,EAAE,EAAIA,EAAI,EAAE,CAAC,EACxDkC,EAAKgC,IAAW,EAAI,GAAKlE,EAAI,EAAE,EAAIA,EAAI,EAAE,GAAKkE,EAC9C/B,EAAK+B,IAAW,EAAI,GAAKlE,EAAI,EAAE,EAAIA,EAAI,EAAE,GAAKkE,EAC9C9B,EAAQf,GAAgBrB,CAAG,EACjC,IAAIqE,EAAmB,EACvB,GAAInD,GAAW,EAAI,EAAG,CACpB,MAAMoD,EAAS5B,GACb7D,EAAO,EAAI,CAAC,EACZA,EAAO,CAAC,EACRA,EAAO,EAAI,CAAC,GAAKA,EAAO,CAAC,EACzBJ,EACR,EACU6F,IACFD,EAAmBC,EAAO,OAE9B,CACA,IAAIC,EAAaL,EACbM,EAAiB,KACjBtD,GAAW,EAAIpC,EAAS,OAAS,IACnC0F,EAAiB9B,GACf7D,EAAO,CAAC,EACRA,EAAO,EAAI,CAAC,EACZA,EAAO,EAAI,CAAC,GAAKA,EAAO,EAAI,CAAC,EAC7BJ,EACR,EACU+F,IACFD,EAAaL,EAASM,EAAe,SAGzC,MAAMC,EAAW,CAAC,GAAGR,EAAM,IAAI,CAAC,GAAK,CAAA,CAAE,EAAE,KAAK,CAACrC,EAAGC,IAAMD,EAAE,EAAIC,EAAE,CAAC,EACjE,UAAWvB,KAAKmE,EACdnE,EAAE,EAAI,KAAK,IAAIA,EAAE,EAAGA,EAAE,EAAI+D,EAAkBE,EAAajE,EAAE,CAAC,EAE9D,QAASoE,EAAI,EAAGA,EAAID,EAAS,OAAS,EAAGC,IAAK,CAC5C,MAAMC,EAAMF,EAASC,EAAI,CAAC,EAAE,EAAID,EAASC,CAAC,EAAE,EAC5C,GAAID,EAASC,CAAC,EAAE,EAAID,EAASC,EAAI,CAAC,EAAE,EAAIC,EAAK,CAC3C,MAAMC,EAAOD,EAAM,EACnBF,EAASC,CAAC,EAAE,EAAI,KAAK,IAAID,EAASC,CAAC,EAAE,EAAGE,CAAI,EAC5CH,EAASC,EAAI,CAAC,EAAE,EAAI,KAAK,IAAID,EAASC,EAAI,CAAC,EAAE,EAAGE,CAAI,CACtD,CACF,CACA,UAAWtE,KAAKmE,EACVnE,EAAE,EAAIgB,IAGV8C,EAAM,KAAK,GAAGpC,GAAS1B,EAAG4B,EAAIC,EAAIC,EAAO2B,EAAO,SAAS,CAAC,EAExD7C,GAAWsD,GACbJ,EAAM,KAAK,IAAIpD,GAAIwD,EAAe,MAAM,CAAC,IAAIxD,GAAIwD,EAAe,MAAM,CAAC,EAAE,EACzEJ,EAAM,KACJ,IAAIpD,GAAIwD,EAAe,KAAK,CAAC,IAAIxD,GAAIwD,EAAe,KAAK,CAAC,IAAIxD,GAAIwD,EAAe,IAAI,CAAC,IAAIxD,GAAIwD,EAAe,IAAI,CAAC,EAC1H,GAEMJ,EAAM,KAAK,IAAIjD,GAAcnB,EAAI,CAAC,CAAC,EAAE,CAEzC,CACA,OAAOoE,EAAM,KAAK,GAAG,CACvB,CACApF,EAAO6E,GAAiB,iBAAiB,EACzC,SAASgB,GAAeC,EAAG,CACzB,MAAO,qBAAqB,KAAKA,CAAC,CACpC,CACA9F,EAAO6F,GAAgB,gBAAgB,EACvC,SAASE,GAAsBC,EAAO,CACpC,OAAKA,EAGEA,IAAU,UAAYA,IAAU,WAAaA,IAAU,QAAUA,IAAU,cAAgBA,IAAU,YAFnG,EAGX,CACAhG,EAAO+F,GAAuB,uBAAuB,EACrD,SAASE,GAAiBC,EAAK,CAC7B,GAAI,CAACA,EACH,OAAO,KAET,GAAI,CACF,MAAMC,EAAO,OAAO,MAAS,WAAa,KAAKD,CAAG,EAAI,OAAO,KAAKA,EAAK,QAAQ,EAAE,SAAQ,EACnFE,EAAS,KAAK,MAAMD,CAAI,EAC9B,GAAI,CAAC,MAAM,QAAQC,CAAM,EACvB,OAAO,KAET,MAAMC,EAAM,CAAA,EACZ,UAAWjE,KAAKgE,EACVhE,GAAK,OAAOA,EAAE,GAAM,UAAY,OAAOA,EAAE,GAAM,UACjDiE,EAAI,KAAK,CAAE,EAAGjE,EAAE,EAAG,EAAGA,EAAE,EAAG,EAG/B,OAAOiE,EAAI,QAAU,EAAIA,EAAM,IACjC,MAAQ,CACN,OAAO,IACT,CACF,CACArG,EAAOiG,GAAkB,kBAAkB,EAC3C,SAASK,GAAoBC,EAAgBrF,EAAO6D,EAAQ,CAC1D,GAAI,CAACA,EAAO,QACV,OAEF,MAAMyB,EAAYD,EAAe,KAAI,EACrC,GAAI,CAACC,EACH,OAEF,MAAMC,EAA2B,IAAI,IACrC,UAAWC,KAAKxF,EACduF,EAAS,IAAIC,EAAE,GAAIA,CAAC,EAEtB,MAAMC,EAAgB,CAAA,EAChBC,EAA2B,IAAI,IACrC,UAAWF,KAAKxF,EAAO,CACrB,MAAM2F,EAAY,OAAO,IAAQ,KAAe,IAAI,OAAS,IAAI,OAAOH,EAAE,EAAE,EAAIA,EAAE,GAC5EI,EAASN,EAAU,cAAc,iBAAiBK,CAAS,IAAI,EACrE,GAAI,CAACC,EACH,SAEFF,EAAS,IAAIF,EAAE,GAAII,CAAM,EAEzB,MAAMjH,EADUoG,GAAiBa,EAAO,aAAa,aAAa,CAAC,GACzCJ,EAAE,OAC5BC,EAAc,KAAK,CAAE,GAAGD,EAAG,OAAA7G,CAAM,CAAE,CACrC,CACA,MAAMsB,EAAYF,GAAsB0F,CAAa,EACrD,GAAIxF,EAAU,SAAW,EACvB,OAEF,MAAM4F,EAA8B,IAAI,IACxC,UAAWC,KAAK7F,EAAW,CACzB,MAAMgE,EAAO4B,EAAY,IAAIC,EAAE,UAAU,GAAK,CAAA,EAC9C7B,EAAK,KAAK6B,CAAC,EACXD,EAAY,IAAIC,EAAE,WAAY7B,CAAI,CACpC,CACA,UAAW8B,KAAgBN,EAAe,CACxC,MAAM7B,EAAQiC,EAAY,IAAIE,EAAa,EAAE,EAC7C,GAAI,CAACnC,GAASA,EAAM,SAAW,EAC7B,SAGF,MAAMoC,EADOT,EAAS,IAAIQ,EAAa,EAAE,GACjB,MACxB,GAAIC,IAAc,QAAU,CAACnB,GAAsBmB,CAAS,EAC1D,SAEF,MAAMJ,EAASF,EAAS,IAAIK,EAAa,EAAE,EAC3C,GAAI,CAACH,EACH,SAEF,GAAII,IAAc,OAAQ,CACxB,MAAMC,EAAWL,EAAO,aAAa,GAAG,GAAK,GAC7C,GAAI,CAACjB,GAAesB,CAAQ,EAC1B,QAEJ,CACA,MAAMC,EAAgBN,EAAO,aAAa,OAAO,GAAK,GAChDO,EAAiB,0DAA0D,KAC/ED,CACN,EACUE,EAAmBD,EAAiB,OAAO,WAAWA,EAAe,CAAC,CAAC,EAAI,KAC3EE,EAAmBF,EAAiB,OAAO,WAAWA,EAAe,CAAC,CAAC,EAAI,KAC3EG,EAAO3C,GAAgBoC,EAAcnC,EAAOC,CAAM,EAExD,GADA+B,EAAO,aAAa,IAAKU,CAAI,EACzBF,IAAqB,MAAQC,IAAqB,MAAQ,OAAOT,EAAO,gBAAmB,WAAY,CACzG,MAAMW,EAASX,EAAO,eAAc,EAC9BY,EAAQ,KAAK,IAAI,EAAGD,EAASH,EAAmBC,CAAgB,EAChEI,EAAe,KAAKL,CAAgB,IAAII,CAAK,IAAIH,CAAgB,GACjEK,EAAUR,EAAc,QAAQ,+BAAgC,qBAAqBO,CAAY,GAAG,EAAE,QAAQ,UAAW,GAAG,EAClIb,EAAO,aAAa,QAASc,CAAO,CACtC,CACF,CACF,CACA5H,EAAOsG,GAAqB,qBAAqB,EAGjD,SAASuB,GAAuBC,EAAa,CAAE,QAAAC,GAAW,CACxD,MAAMC,EAAiBF,EAAY,QAAQ,UAAU,SACrD,GAAIE,IAAmB,GACrB,OAEF,MAAMC,EAAYD,IAAmB,MAAQ,MAAQ,MAC/CE,EAAiBJ,EAAY,MAAM,OAAQtF,GAAS,MAAM,QAAQA,EAAK,MAAM,GAAKA,EAAK,OAAO,QAAU,CAAC,EAAE,IAAKA,IAAU,CAC9H,GAAIA,EAAK,GACT,OAAQA,EAAK,OACb,MAAOA,EAAK,MACZ,eAAgBA,EAAK,eACrB,aAAcA,EAAK,YACvB,EAAI,EACF8D,GAAoByB,EAAQ,OAAO,UAAWG,EAAgB,CAC5D,QAAS,GACT,WAAY,EACZ,UAAAD,CACJ,CAAG,CACH,CACAjI,EAAO6H,GAAwB,wBAAwB,EAGvD,IAAIM,GAAsB,uBACtBC,GAA6B,GAC7BC,GAAkC,GACtC,SAASC,GAAyBC,EAAM,CACtC,OAAO,KAAK,IAAIA,EAAK,SAAWF,GAAiCA,EAA+B,CAClG,CACArI,EAAOsI,GAA0B,0BAA0B,EAC3D,SAASE,GAAuBD,EAAM,CACpC,KAAM,CAAE,EAAAE,EAAG,EAAAC,EAAG,MAAAC,EAAO,OAAAC,CAAM,EAAKL,EAC1BM,EAAaN,EAAK,mBACxB,GAAI,OAAOE,GAAM,UAAY,OAAOC,GAAM,UAAY,OAAOC,GAAU,UAAY,OAAOC,GAAW,UAAY,OAAOC,GAAe,UAAY,CAAC,OAAO,SAASJ,CAAC,GAAK,CAAC,OAAO,SAASC,CAAC,GAAK,CAAC,OAAO,SAASC,CAAK,GAAK,CAAC,OAAO,SAASC,CAAM,GAAK,CAAC,OAAO,SAASC,CAAU,GAAKF,GAAS,GAAKC,GAAU,EAAG,CACjT,OAAOL,EAAK,eACZ,MACF,CACA,MAAMO,EAAMJ,EAAIE,EAAS,EACnBG,EAAe,KAAK,IAAIF,EAAYH,EAAIE,EAAS,CAAC,EAClDI,EAAc,KAAK,IAAIZ,GAA4B,KAAK,IAAI,EAAGW,EAAeD,CAAG,CAAC,EAClFG,EAASH,EAAME,EACrB,GAAIC,GAAUH,EAAK,CACjB,OAAOP,EAAK,eACZ,MACF,CACAA,EAAK,eAAiB,CACpB,KAAME,EAAIE,EAAQ,EAClB,MAAOF,EAAIE,EAAQ,EACnB,IAAAG,EACA,OAAAG,CACJ,CACA,CACAjJ,EAAOwI,GAAwB,wBAAwB,EACvD,SAASU,GAA0BC,EAAQ,CACzC,MAAMC,EAAYD,EAAO,UACnBE,EAAQF,EAAO,QAAU,CAAA,EAC/B,UAAWG,KAAQH,EAAO,OAAS,CAAA,EAC7BG,EAAK,SAAW,CAACA,EAAK,WACxBA,EAAK,MAAQ,WACTF,IACFE,EAAK,UAAYF,IAIvB,MAAMG,EAAaF,EAAM,OAAQC,GAAS,CAACA,EAAK,SAAW,CAACA,EAAK,QAAQ,EACzE,GAAIC,EAAW,SAAW,EACxB,OAEF,IAAIC,EAAcH,EAAM,KAAMC,GAASA,EAAK,KAAOnB,EAAmB,EACjEqB,EAUMA,EAAY,UACrBA,EAAY,MAAQ,WAChBJ,IACFI,EAAY,UAAYJ,KAZ1BI,EAAc,CACZ,GAAIrB,GACJ,MAAO,GACP,QAAS,GACT,MAAO,WACP,QAAS,GACT,GAAGiB,EAAY,CAAE,UAAAA,GAAc,CAAA,CACrC,EACIC,EAAM,KAAKG,CAAW,GAOxB,UAAWF,KAAQC,EACjBD,EAAK,SAAWnB,EAEpB,CACAnI,EAAOkJ,GAA2B,2BAA2B,EAC7D,SAASO,GAAYN,EAAQ,CAC3B,MAAMO,EAA2B,IAAI,IACrC,UAAWzH,KAAKkH,EAAO,OAAS,CAAA,EAC9BO,EAAS,IAAIzH,EAAE,GAAIA,CAAC,EAEtB,MAAMf,EAAQ,CAAA,EACd,UAAWwF,KAAKyC,EAAO,OAAS,CAAA,EAAI,CAClC,MAAMQ,EAAM,OAAOjD,EAAE,OAAU,SAAWA,EAAE,MAAQ,OAC9CkD,EAAM,OAAOlD,EAAE,KAAQ,SAAWA,EAAE,IAAM,OAC5C,CAACiD,GAAO,CAACC,GAGTlD,EAAE,aAGNxF,EAAM,KAAK,CAAE,GAAIwF,EAAE,GAAI,IAAAiD,EAAK,IAAAC,EAAK,IAAKlD,EAAG,CAC3C,CACA,MAAMmD,EAAWV,EAAO,OAAS,CAAA,EAC3BW,EAAaD,EAAS,OAAQ5H,GAAMA,EAAE,OAAO,EAC7C8H,EAAgBF,EAAS,OAAQ5H,GAAM,CAACA,EAAE,OAAO,EAGvD,MAAO,CAAE,MADK,CAAC,GADW,CAAC,GAAG6H,CAAU,EAAE,QAAO,EACZ,GAAGC,CAAa,EAAE,IAAK9H,GAAMA,EAAE,EAAE,EACtD,MAAAf,EAAO,OAAAiI,EAAQ,SAAAO,CAAQ,CACzC,CACA1J,EAAOyJ,GAAa,aAAa,EACjC,SAASO,GAAsBC,EAAGC,EAASC,EAAQC,EAAM,CACvD,KAAM,CAAE,OAAAjB,CAAM,EAAKc,EACbI,EAAUJ,EAAE,SACZK,EAAWF,GAAM,UAAY,IAC7BG,EAAUH,GAAM,SAAW,GACjC,IAAII,EAAa,EACjB,UAAWC,KAASP,EAAQ,OAAQ,CAClC,IAAIQ,EAAa,EACjB,UAAWC,KAAMF,EAAO,CACtB,MAAMnB,EAAOe,EAAQ,IAAIM,CAAE,EAC3B,GAAI,CAACrB,EAAM,CACToB,IACA,QACF,CACApB,EAAK,MAAQkB,EACblB,EAAK,MAAQoB,EACb,MAAMjC,EAAI0B,EAAO,EAAEQ,CAAE,GAAKD,EAAaH,EACjC7B,EAAIyB,EAAO,EAAEQ,CAAE,GAAKH,EAAaF,EACvChB,EAAK,EAAIb,EACTa,EAAK,EAAIZ,EACTgC,GACF,CACAF,GACF,CACA,MAAMX,EAAWV,EAAO,OAAS,CAAA,EAC3ByB,EAA8B,IAAI,IAClCC,EAAiB,CAAA,EACvB,UAAWC,KAASjB,EAAU,CAC5B,GAAI,CAACiB,GAAO,QACV,SAEGA,EAAM,UACTD,EAAe,KAAKC,CAAK,EAE3B,MAAMC,EAAWlB,EAAS,OAAQ5H,GAAMA,EAAE,WAAa6I,EAAM,EAAE,EAC/D,IAAIE,EAAO,IACPC,EAAO,KACPC,EAAO,IACPC,EAAO,KACX,UAAWC,KAASL,EAAU,CAC5B,MAAMzH,EAAK8H,EAAM,GAAKjB,EAAO,EAAEiB,EAAM,EAAE,EACjC7H,EAAK6H,EAAM,GAAKjB,EAAO,EAAEiB,EAAM,EAAE,EACjCC,EAAKD,EAAM,OAAS,EACpBE,EAAKF,EAAM,QAAU,EACvB9H,GAAM,MAAQC,GAAM,OACtByH,EAAO,KAAK,IAAIA,EAAM1H,EAAK+H,EAAK,CAAC,EACjCJ,EAAO,KAAK,IAAIA,EAAM3H,EAAK+H,EAAK,CAAC,EACjCH,EAAO,KAAK,IAAIA,EAAM3H,EAAK+H,EAAK,CAAC,EACjCH,EAAO,KAAK,IAAIA,EAAM5H,EAAK+H,EAAK,CAAC,EAErC,CACA,GAAIN,IAAS,KAAYE,IAAS,IAChCJ,EAAM,EAAIA,EAAM,GAAK,EACrBA,EAAM,EAAIA,EAAM,GAAK,EACrBA,EAAM,MAAQA,EAAM,OAAS,EAC7BA,EAAM,OAASA,EAAM,QAAU,MAC1B,CACL,MAAMS,EAAMT,EAAM,SAAW,GACvBU,EAAgBV,EAAM,SAAWS,EAAM,EAAIjD,GAAyBwC,CAAK,EACzEW,EAAcF,EACdG,EAAI,KAAK,IAAI,EAAGT,EAAOD,CAAI,EAAIQ,EAC/BG,EAAI,KAAK,IAAI,EAAGR,EAAOD,CAAI,EAAIO,EAC/BnI,GAAM0H,EAAOC,GAAQ,EACrB1H,GAAM2H,EAAOC,GAAQ,EAC3BL,EAAM,EAAIxH,EACVwH,EAAM,EAAIvH,EACVuH,EAAM,MAAQY,EACdZ,EAAM,OAASa,EACff,EAAY,IAAIE,EAAM,GAAI,CAAE,KAAAE,EAAM,KAAAC,EAAM,KAAAC,EAAM,KAAAC,EAAM,CACtD,CACF,CACA,GAAIN,EAAe,OAAS,GAAKD,EAAY,KAAO,EAAG,CACrD,IAAIgB,EAAa,IACbC,EAAa,KACbC,EAAS,EACb,UAAWvD,KAAQsC,EAAgB,CACjC,MAAMU,EAAMhD,EAAK,SAAW,GACxBgD,EAAMO,IACRA,EAASP,GAEX,MAAM1I,EAAI+H,EAAY,IAAIrC,EAAK,EAAE,EAC5B1F,IAGL+I,EAAa,KAAK,IAAIA,EAAY/I,EAAE,IAAI,EACxCgJ,EAAa,KAAK,IAAIA,EAAYhJ,EAAE,IAAI,EAC1C,CACA,GAAI+I,IAAe,KAAYC,IAAe,KAAW,CACvD,MAAME,EAAgB,KAAK,IAAI,EAAGF,EAAaD,CAAU,EAEnDI,EAAiB,KAAK,IAAIF,EADR,EAC+B,EACjDG,EAAaF,EAAgB,EAAIC,EACjCE,GAAWN,EAAaC,GAAc,EAC5C,UAAWtD,KAAQsC,EACjBtC,EAAK,EAAI2D,EACT3D,EAAK,OAAS0D,EACd1D,EAAK,mBAAqBqD,EAE5B,MAAMO,EAAc,CAAC,GAAGtB,CAAc,EAAE,KAAK,CAACjI,EAAGC,IAAM,CACrD,MAAMuJ,EAAKxJ,EAAE,GAAK,EACZyJ,EAAKxJ,EAAE,GAAK,EAClB,OAAOuJ,EAAKC,CACd,CAAC,EACKC,EAAU,CAAA,EACVC,EAAU,CAAA,EACVC,EAAa,CAAA,EACnB,UAAWjE,KAAQ4D,EAAa,CAC9B,MAAMtJ,EAAI+H,EAAY,IAAIrC,EAAK,EAAE,EACjC,GAAI,CAAC1F,EACH,SAEF,MAAM4J,EAAe,KAAK,IAAI,EAAG5J,EAAE,KAAOA,EAAE,IAAI,EAAI,EAAIyF,GAAyBC,CAAI,EAC/EjF,GAAMT,EAAE,KAAOA,EAAE,MAAQ,EAC/ByJ,EAAQ,KAAK/D,EAAK,EAAE,EACpBgE,EAAQ,KAAKjJ,CAAE,EACfkJ,EAAW,KAAKC,CAAY,CAC9B,CACA,MAAMC,EAAQJ,EAAQ,OACtB,GAAII,EAAQ,EAAG,CACb,MAAMC,EAA6B,IAAI,IACvC,GAAID,IAAU,EACZC,EAAW,IAAIL,EAAQ,CAAC,EAAGE,EAAW,CAAC,CAAC,MACnC,CACL,MAAM1G,EAAI,CAAA,EACV,QAAS/F,EAAI,EAAGA,EAAI2M,EAAQ,EAAG3M,IAC7B+F,EAAE,KAAKyG,EAAQxM,EAAI,CAAC,EAAIwM,EAAQxM,CAAC,CAAC,EAEpC,MAAM6M,EAAI,IAAI,MAAMF,CAAK,EACzBE,EAAE,CAAC,EAAI,EACP,QAAS7M,EAAI,EAAGA,EAAI2M,EAAQ,EAAG3M,IAC7B6M,EAAE7M,EAAI,CAAC,EAAI,EAAI+F,EAAE/F,CAAC,EAAI6M,EAAE7M,CAAC,EAE3B,IAAI8M,EAAa,EACbC,EAAa,OAAO,kBACxB,QAAS/M,EAAI,EAAGA,EAAI2M,EAAO3M,IAAK,CAC9B,MAAMgN,EAAQP,EAAWzM,CAAC,EACtBA,EAAI,IAAM,EACZ8M,EAAa,KAAK,IAAIA,EAAYE,EAAQH,EAAE7M,CAAC,CAAC,EAE9C+M,EAAa,KAAK,IAAIA,EAAYF,EAAE7M,CAAC,EAAIgN,CAAK,CAElD,CACA,IAAItE,EAAIoE,EACJA,GAAcC,EAChBrE,GAAKoE,EAAaC,GAAc,EAEhCrE,EAAIoE,EAEN,QAAS9M,EAAI,EAAGA,EAAI2M,EAAO3M,IAAK,CAC9B,MAAM2L,EAAIkB,EAAE7M,CAAC,GAAKA,EAAI,IAAM,EAAI0I,EAAI,CAACA,GAC/BuE,GAAa,KAAK,IAAIR,EAAWzM,CAAC,EAAG2L,CAAC,EAC5CiB,EAAW,IAAIL,EAAQvM,CAAC,EAAGiN,EAAU,CACvC,CACF,CACA,UAAWzE,KAAQsC,EAAgB,CACjC,MAAMa,EAAIiB,EAAW,IAAIpE,EAAK,EAAE,EAC5BmD,GAAK,OACPnD,EAAK,MAAQmD,GAEflD,GAAuBD,CAAI,CAC7B,CACF,CACF,CACF,CACF,CACAvI,EAAOgK,GAAuB,uBAAuB,EAGrD,IAAIiD,GAAwB,mBAC5B,SAASC,GAAqBC,EAAM,CAClC,MAAMC,EAAa,CAAA,EACbC,EAAkB,CAAA,EAClB3D,EAA2B,IAAI,IACrC,UAAWJ,KAAQ6D,EAAK,MACtBzD,EAAS,IAAIJ,EAAK,GAAIA,CAAI,EAE5B,UAAW9G,KAAQ2K,EAAK,MAAO,CAO7B,GANI,CAAC3K,EAAK,OAASA,EAAK,MAAM,SAAW,GAGrCA,EAAK,cAGLA,EAAK,YACP,SAEF,MAAM8K,EAAa9K,EAAK,MAAQkH,EAAS,IAAIlH,EAAK,KAAK,EAAI,OACrD+K,EAAa/K,EAAK,IAAMkH,EAAS,IAAIlH,EAAK,GAAG,EAAI,OACvD,GAAI,CAAC8K,GAAc,CAACC,EAAY,CAC9BC,GAAI,KAAKP,GAAuB,QAAQzK,EAAK,EAAE,oCAAoC,EACnF,QACF,CACA,MAAMiL,EAAc,cAAcjL,EAAK,KAAK,IAAIA,EAAK,GAAG,IAAIA,EAAK,EAAE,GAE7DkL,EADcJ,EAAW,WAAaC,EAAW,SACvBA,EAAW,SAAWD,EAAW,SAC3DK,EAAY,CAChB,GAAIF,EACJ,MAAOjL,EAAK,MACZ,UAAWA,EAAK,OAAS,GACzB,QAASA,EAAK,KAAO,GACrB,MAAO,YACP,MAAO,EAEP,OAAQ,EACR,YAAa,GACb,QAAS,GACT,SAAUkL,EACV,QAAS,GACT,WAAY,MAAM,QAAQlL,EAAK,UAAU,EAAIA,EAAK,WAAW,CAAC,EAAIA,EAAK,YAAc,GACrF,GAAG8K,EAAW,IAAM,CAAE,IAAKA,EAAW,GAAG,EAAK,CAAA,CACpD,EACIF,EAAW,KAAKO,CAAS,EACzBnL,EAAK,YAAciL,EACnBjL,EAAK,MAAQ,OACbA,EAAK,KAAO,OACZ,MAAMoL,EAAiB,CACrB,GAAI,GAAGpL,EAAK,EAAE,YACd,MAAOA,EAAK,MACZ,IAAKiL,EACL,KAAM,SACN,aAAc,EACpB,EACUI,EAAmB,CACvB,GAAI,GAAGrL,EAAK,EAAE,cACd,MAAOiL,EACP,IAAKjL,EAAK,IACV,KAAM,SACN,aAAc,EACpB,EACI6K,EAAgB,KAAKO,EAAgBC,CAAgB,CACvD,CACA,MAAMC,EAAW,CAAC,GAAGX,EAAK,MAAO,GAAGC,CAAU,EACxCW,EAAW,CAAC,GAAGZ,EAAK,MAAO,GAAGE,CAAe,EACnD,MAAO,CACL,GAAGF,EACH,MAAOW,EACP,MAAOC,CACX,CACA,CACA/N,EAAOkN,GAAsB,sBAAsB,EAGnD,IAAIc,GAAM,KACV,SAASC,GAAiB3E,EAAM,CAC9B,MAAMhG,EAAKgG,EAAK,GAAK,EACf/F,EAAK+F,EAAK,GAAK,EACfX,EAAQW,EAAK,OAAS,EACtBV,EAASU,EAAK,QAAU,EAC9B,OAAOX,EAAQ,GAAKC,EAAS,EAAI,CAAE,GAAAtF,EAAI,GAAAC,EAAI,KAAM2K,GAAmB5K,EAAIC,EAAIoF,EAAOC,CAAM,CAAC,EAAK,MACjG,CACA5I,EAAOiO,GAAkB,kBAAkB,EAC3C,SAASE,GAAkB7E,EAAM,CAC/B,GAAIA,EAAK,QACP,OAEF,MAAM8E,EAAWH,GAAiB3E,CAAI,EACtC,OAAK8E,EAIE,CACL,GAFS,OAAO9E,EAAK,IAAM,EAAE,EAG7B,GAAI8E,EAAS,GACb,GAAIA,EAAS,GACb,KAAMA,EAAS,IACnB,EARI,MASJ,CACApO,EAAOmO,GAAmB,mBAAmB,EAC7C,SAASE,GAAUzL,EAAGC,EAAGyL,EAAUN,GAAK,CACtC,OAAO,KAAK,IAAIpL,EAAE,EAAIC,EAAE,CAAC,EAAIyL,GAAW,KAAK,IAAI1L,EAAE,EAAIC,EAAE,CAAC,EAAIyL,CAChE,CACAtO,EAAOqO,GAAW,WAAW,EAC7B,SAASE,GAAM3L,EAAGC,EAAGyL,EAAUN,GAAK,CAClC,OAAO,KAAK,IAAIpL,EAAE,EAAIC,EAAE,CAAC,EAAIyL,CAC/B,CACAtO,EAAOuO,GAAO,OAAO,EACrB,SAASC,GAAM5L,EAAGC,EAAGyL,EAAUN,GAAK,CAClC,OAAO,KAAK,IAAIpL,EAAE,EAAIC,EAAE,CAAC,EAAIyL,CAC/B,CACAtO,EAAOwO,GAAO,OAAO,EACrB,SAASC,GAAoB7L,EAAGC,EAAGyL,EAAUN,GAAK,CAChD,OAAOQ,GAAM5L,EAAGC,EAAGyL,CAAO,GAAK,KAAK,IAAI1L,EAAE,EAAIC,EAAE,CAAC,EAAIyL,CACvD,CACAtO,EAAOyO,GAAqB,qBAAqB,EACjD,SAASC,GAAkB9L,EAAGC,EAAGyL,EAAUN,GAAK,CAC9C,OAAOO,GAAM3L,EAAGC,EAAGyL,CAAO,GAAK,KAAK,IAAI1L,EAAE,EAAIC,EAAE,CAAC,EAAIyL,CACvD,CACAtO,EAAO0O,GAAmB,mBAAmB,EAC7C,SAASC,GAAczO,EAAIC,EAAIC,EAAIC,EAAI,CACrC,OAAO,KAAK,IACV,EACA,KAAK,IAAI,KAAK,IAAIH,EAAIC,CAAE,EAAG,KAAK,IAAIC,EAAIC,CAAE,CAAC,EAAI,KAAK,IAAI,KAAK,IAAIH,EAAIC,CAAE,EAAG,KAAK,IAAIC,EAAIC,CAAE,CAAC,CAC9F,CACA,CACAL,EAAO2O,GAAe,eAAe,EACrC,SAASC,GAA6BhM,EAAGC,EAAGyL,EAAUN,GAAK,CACzD,OAAIpL,EAAE,YAAcC,EAAE,YAAc2L,GAAM5L,EAAE,EAAGC,EAAE,EAAGyL,CAAO,EAClDK,GAAc/L,EAAE,EAAE,EAAGA,EAAE,EAAE,EAAGC,EAAE,EAAE,EAAGA,EAAE,EAAE,CAAC,EAE7CD,EAAE,UAAYC,EAAE,UAAY0L,GAAM3L,EAAE,EAAGC,EAAE,EAAGyL,CAAO,EAC9CK,GAAc/L,EAAE,EAAE,EAAGA,EAAE,EAAE,EAAGC,EAAE,EAAE,EAAGA,EAAE,EAAE,CAAC,EAE1C,CACT,CACA7C,EAAO4O,GAA8B,8BAA8B,EACnE,SAASC,GAA4BhP,EAAQyO,EAAUN,GAAK,CAC1D,MAAMc,EAAS,CAAA,EACf,QAAS/O,EAAI,EAAGA,EAAIF,EAAO,OAAS,EAAGE,IAAK,CAC1C,MAAM6C,EAAI/C,EAAOE,CAAC,EACZ8C,EAAIhD,EAAOE,EAAI,CAAC,EAChBgP,EAAaN,GAAoB7L,EAAGC,EAAGyL,CAAO,EAC9CU,EAAWN,GAAkB9L,EAAGC,EAAGyL,CAAO,GAC5CS,GAAcC,IAChBF,EAAO,KAAK,CAAE,MAAO/O,EAAG,EAAA6C,EAAG,EAAAC,EAAG,WAAAkM,EAAY,SAAAC,EAAU,CAExD,CACA,OAAOF,CACT,CACA9O,EAAO6O,GAA6B,6BAA6B,EACjE,SAASI,GAAqBpP,EAAQyO,EAAUN,GAAK,CACnD,MAAMlO,EAAW+O,GAA4BhP,EAAQyO,CAAO,EAC5D,IAAIY,EAAQ,EACZ,QAASnP,EAAI,EAAGA,EAAID,EAAS,OAAQC,IAC/BD,EAASC,EAAI,CAAC,EAAE,aAAeD,EAASC,CAAC,EAAE,YAC7CmP,IAGJ,OAAOA,CACT,CACAlP,EAAOiP,GAAsB,sBAAsB,EACnD,SAASE,GAAwBtP,EAAQyO,EAAUN,GAAK,CACtD,MAAMc,EAAS,CAAA,EACf,UAAWM,KAASvP,EAAQ,CAC1B,MAAMwP,EAAOP,EAAO,OAAS,EAAIA,EAAOA,EAAO,OAAS,CAAC,EAAI,QACzD,CAACO,GAAQ,CAAChB,GAAUgB,EAAMD,EAAOd,CAAO,IAC1CQ,EAAO,KAAK,CAAE,EAAGM,EAAM,EAAG,EAAGA,EAAM,EAAG,CAE1C,CACA,OAAON,CACT,CACA9O,EAAOmP,GAAyB,yBAAyB,EACzD,SAASG,GAA0BzP,EAAQyO,EAAUN,GAAK,CACxD,GAAI,CAACnO,GAAUA,EAAO,SAAW,EAC/B,OAEF,KAAM,CAAC0P,EAAIC,EAAIC,EAAIC,CAAE,EAAI7P,EAEzB,OADc4O,GAAoBc,EAAIC,EAAIlB,CAAO,GAAKI,GAAkBc,EAAIC,EAAInB,CAAO,GAAKG,GAAoBgB,EAAIC,EAAIpB,CAAO,EAEtH,CAAE,KAAM,MAAO,GAAAiB,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAExBhB,GAAkBa,EAAIC,EAAIlB,CAAO,GAAKG,GAAoBe,EAAIC,EAAInB,CAAO,GAAKI,GAAkBe,EAAIC,EAAIpB,CAAO,EAC9G,CAAE,KAAM,MAAO,GAAAiB,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAAK,MACnD,CACA1P,EAAOsP,GAA2B,2BAA2B,EAC7D,SAASK,GAAyB/M,EAAGC,EAAG+M,EAAMC,EAAS,EAAG,CACxD,MAAMC,EAAU,KAAK,IAAIlN,EAAE,EAAGC,EAAE,CAAC,EAC3BkN,EAAU,KAAK,IAAInN,EAAE,EAAGC,EAAE,CAAC,EAC3BmN,EAAU,KAAK,IAAIpN,EAAE,EAAGC,EAAE,CAAC,EAC3BoN,EAAU,KAAK,IAAIrN,EAAE,EAAGC,EAAE,CAAC,EACjC,OAAOkN,EAAUH,EAAK,KAAOC,GAAUC,EAAUF,EAAK,MAAQC,GAAUI,EAAUL,EAAK,IAAMC,GAAUG,EAAUJ,EAAK,OAASC,CACjI,CACA7P,EAAO2P,GAA0B,0BAA0B,EAC3D,SAASO,GAAgBd,EAAOQ,EAAMC,EAAS,EAAG,CAChD,OAAOT,EAAM,EAAIQ,EAAK,KAAOC,GAAUT,EAAM,EAAIQ,EAAK,MAAQC,GAAUT,EAAM,EAAIQ,EAAK,IAAMC,GAAUT,EAAM,EAAIQ,EAAK,OAASC,CACjI,CACA7P,EAAOkQ,GAAiB,iBAAiB,EACzC,SAASC,GAAiBC,EAAOC,EAAO,CACtC,OAAOD,EAAM,MAAQC,EAAM,MAAQD,EAAM,OAASC,EAAM,OAASD,EAAM,KAAOC,EAAM,KAAOD,EAAM,QAAUC,EAAM,MACnH,CACArQ,EAAOmQ,GAAkB,kBAAkB,EAC3C,SAASG,GAAa1N,EAAGC,EAAG,CAC1B,OAAOD,EAAE,KAAOC,EAAE,OAASD,EAAE,MAAQC,EAAE,MAAQD,EAAE,IAAMC,EAAE,QAAUD,EAAE,OAASC,EAAE,GAClF,CACA7C,EAAOsQ,GAAc,cAAc,EACnC,SAASC,GAAYX,EAAMY,EAAQ,CACjC,MAAO,CACL,KAAMZ,EAAK,KAAOY,EAClB,MAAOZ,EAAK,MAAQY,EACpB,IAAKZ,EAAK,IAAMY,EAChB,OAAQZ,EAAK,OAASY,CAC1B,CACA,CACAxQ,EAAOuQ,GAAa,aAAa,EACjC,SAASrC,GAAmB5K,EAAIC,EAAIoF,EAAOC,EAAQ,CACjD,MAAO,CACL,KAAMtF,EAAKqF,EAAQ,EACnB,MAAOrF,EAAKqF,EAAQ,EACpB,IAAKpF,EAAKqF,EAAS,EACnB,OAAQrF,EAAKqF,EAAS,CAC1B,CACA,CACA5I,EAAOkO,GAAoB,oBAAoB,EAC/C,SAASuC,GAAiBnH,EAAM,CAC9B,OAAO2E,GAAiB3E,CAAI,GAAG,IACjC,CACAtJ,EAAOyQ,GAAkB,kBAAkB,EAC3C,SAASC,GAAgBpH,EAAMqH,EAAM,CACnC,OAAQA,EAAI,CACV,IAAK,MACH,MAAO,CAAE,EAAGrH,EAAK,GAAI,EAAGA,EAAK,KAAK,GAAG,EACvC,IAAK,SACH,MAAO,CAAE,EAAGA,EAAK,GAAI,EAAGA,EAAK,KAAK,MAAM,EAC1C,IAAK,OACH,MAAO,CAAE,EAAGA,EAAK,KAAK,KAAM,EAAGA,EAAK,EAAE,EACxC,IAAK,QACH,MAAO,CAAE,EAAGA,EAAK,KAAK,MAAO,EAAGA,EAAK,EAAE,CAC7C,CACA,CACAtJ,EAAO0Q,GAAiB,iBAAiB,EACzC,SAASE,GAAwBjH,EAAKkH,EAASjH,EAAKkH,EAASC,EAAQzC,EAAUN,GAAK,CAClF,MAAMgD,EAAOH,IAAY,QAAUA,IAAY,QACzCI,EAAOH,IAAY,QAAUA,IAAY,QAC/C,GAAIE,GAAQC,EAAM,CAEhB,GADoBJ,IAAY,SAAWC,IAAY,QAAUnH,EAAI,EAAIC,EAAI,GAAKiH,IAAY,QAAUC,IAAY,SAAWnH,EAAI,EAAIC,EAAI,EAC1H,CACf,GAAI4E,GAAM7E,EAAKC,EAAK0E,CAAO,EACzB,MAAO,CAAC3E,EAAKC,CAAG,EAElB,MAAMsH,GAAQvH,EAAI,EAAIC,EAAI,GAAK,EAC/B,MAAO,CAACD,EAAK,CAAEuH,EAAS,EAAGvH,EAAI,CAAC,EAAI,CAAEuH,EAAS,EAAGtH,EAAI,CAAC,EAAIA,CAAG,CAChE,CACA,GAAIiH,IAAYC,EAAS,CACvB,GAAItC,GAAM7E,EAAKC,EAAK0E,CAAO,EACzB,OAEF,MAAM6C,EAAON,IAAY,OAAS,KAAK,IAAIlH,EAAI,EAAGC,EAAI,CAAC,EAAImH,EAAS,KAAK,IAAIpH,EAAI,EAAGC,EAAI,CAAC,EAAImH,EAC7F,MAAO,CAACpH,EAAK,CAAEwH,EAAS,EAAGxH,EAAI,CAAC,EAAI,CAAEwH,EAAS,EAAGvH,EAAI,CAAC,EAAIA,CAAG,CAChE,CACA,MACF,CACA,GAAI,CAACoH,GAAQ,CAACC,EAAM,CAClB,GAAIJ,IAAYC,EAAS,CACvB,GAAIvC,GAAM5E,EAAKC,EAAK0E,CAAO,EACzB,OAEF,MAAM8C,EAAOP,IAAY,MAAQ,KAAK,IAAIlH,EAAI,EAAGC,EAAI,CAAC,EAAImH,EAAS,KAAK,IAAIpH,EAAI,EAAGC,EAAI,CAAC,EAAImH,EAC5F,MAAO,CAACpH,EAAK,CAAE,EAAGA,EAAI,EAAG,EAAGyH,CAAI,EAAI,CAAE,EAAGxH,EAAI,EAAG,EAAGwH,CAAI,EAAIxH,CAAG,CAChE,CAEA,GAAI,EADYiH,IAAY,UAAYC,IAAY,OAASnH,EAAI,EAAIC,EAAI,GAAKiH,IAAY,OAASC,IAAY,UAAYnH,EAAI,EAAIC,EAAI,GAErI,OAEF,GAAI2E,GAAM5E,EAAKC,EAAK0E,CAAO,EACzB,MAAO,CAAC3E,EAAKC,CAAG,EAElB,MAAMyH,GAAQ1H,EAAI,EAAIC,EAAI,GAAK,EAC/B,MAAO,CAACD,EAAK,CAAE,EAAGA,EAAI,EAAG,EAAG0H,CAAI,EAAI,CAAE,EAAGzH,EAAI,EAAG,EAAGyH,CAAI,EAAIzH,CAAG,CAChE,CACA,GAAIoH,GAAQ,CAACC,EAAM,CACjB,MAAMK,EAAcT,IAAY,SAAWjH,EAAI,EAAID,EAAI,GAAKkH,IAAY,QAAUjH,EAAI,EAAID,EAAI,EACxF4H,EAAcT,IAAY,OAASnH,EAAI,EAAIC,EAAI,GAAKkH,IAAY,UAAYnH,EAAI,EAAIC,EAAI,EAC9F,OAAO0H,GAAeC,EAAc,CAAC5H,EAAK,CAAE,EAAGC,EAAI,EAAG,EAAGD,EAAI,CAAC,EAAIC,CAAG,EAAI,MAC3E,CACA,MAAM4H,EAAaX,IAAY,UAAYjH,EAAI,EAAID,EAAI,GAAKkH,IAAY,OAASjH,EAAI,EAAID,EAAI,EACvF8H,EAAaX,IAAY,QAAUnH,EAAI,EAAIC,EAAI,GAAKkH,IAAY,SAAWnH,EAAI,EAAIC,EAAI,EAC7F,OAAO4H,GAAcC,EAAa,CAAC9H,EAAK,CAAE,EAAGA,EAAI,EAAG,EAAGC,EAAI,CAAC,EAAIA,CAAG,EAAI,MACzE,CACA5J,EAAO4Q,GAAyB,yBAAyB,EACzD,SAASc,GAAuB/H,EAAKgH,EAAM/G,EAAK+H,EAAO,CACrD,OAAOhB,IAAS,QAAUA,IAAS,QAAU,CAAChH,EAAK,CAAE,EAAGgI,EAAO,EAAGhI,EAAI,CAAC,EAAI,CAAE,EAAGgI,EAAO,EAAG/H,EAAI,CAAC,EAAIA,CAAG,EAAI,CAACD,EAAK,CAAE,EAAGA,EAAI,EAAG,EAAGgI,CAAK,EAAI,CAAE,EAAG/H,EAAI,EAAG,EAAG+H,CAAK,EAAI/H,CAAG,CACrK,CACA5J,EAAO0R,GAAwB,wBAAwB,EACvD,SAASE,GAAsBvI,EAAO,CACpC,MAAMwI,EAA+B,IAAI,IACnCC,EAAgB,CAAA,EACtB,UAAWxI,KAAQD,EAAO,CACxB,GAAIC,EAAK,YACP,SAEF,MAAMyI,EAAO5D,GAAkB7E,CAAI,EAC9ByI,IAGLF,EAAa,IAAIE,EAAK,GAAIA,CAAI,EAC9BD,EAAc,KAAK,CAAE,GAAIC,EAAK,GAAI,KAAMA,EAAK,KAAM,EACrD,CACA,MAAO,CAAE,aAAAF,EAAc,cAAAC,CAAa,CACtC,CACA9R,EAAO4R,GAAuB,uBAAuB,EACrD,SAASI,GAAuB3I,EAAO,CACrC,MAAMyI,EAAgB,CAAA,EAChBG,EAAiB,CAAA,EACvB,UAAW3I,KAAQD,EAAO,CACxB,MAAM0I,EAAO5D,GAAkB7E,CAAI,EACnC,GAAI,CAACyI,EACH,SAEF,MAAMG,EAAQ,CAAE,GAAIH,EAAK,GAAI,KAAMA,EAAK,IAAI,EACxCzI,EAAK,YACP2I,EAAe,KAAKC,CAAK,EAEzBJ,EAAc,KAAKI,CAAK,CAE5B,CACA,MAAO,CAAE,cAAAJ,EAAe,eAAAG,CAAc,CACxC,CACAjS,EAAOgS,GAAwB,wBAAwB,EACvD,SAASG,GAAuB9I,EAAO,CAAE,kBAAA+I,EAAoB,EAAI,EAAK,CAAA,EAAI,CACxE,MAAMtD,EAAS,CAAA,EACf,UAAWxF,KAAQD,EAAO,CACxB,GAAIC,EAAK,SAAW,CAAC8I,GAAqB9I,EAAK,YAC7C,SAEF,MAAMhG,EAAKgG,EAAK,GAAK,EACf/F,EAAK+F,EAAK,GAAK,EACfX,EAAQW,EAAK,OAAS,EACtBV,EAASU,EAAK,QAAU,EAC9BwF,EAAO,KAAK,CACV,OAAQxF,EAAK,GACb,GAAG4E,GAAmB5K,EAAIC,EAAIoF,EAAOC,CAAM,CACjD,CAAK,CACH,CACA,OAAOkG,CACT,CACA9O,EAAOmS,GAAwB,wBAAwB,EACvD,SAASE,GAAoB7P,EAAMqP,EAAcvD,EAAUN,GAAK,CAC9D,MAAMsE,EAAQ9P,EAAK,MACb+P,EAAQ/P,EAAK,IACnB,GAAI,CAAC8P,GAAS,CAACC,EACb,OAEF,MAAMC,EAAUX,EAAa,IAAIS,CAAK,EAChCG,EAAUZ,EAAa,IAAIU,CAAK,EACtC,GAAI,GAACC,GAAW,CAACC,GAGjB,MAAO,CACL,MAAAH,EACA,MAAAC,EACA,QAAAC,EACA,QAAAC,EACA,WAAY,KAAK,IAAID,EAAQ,GAAKC,EAAQ,EAAE,EAAInE,EAChD,WAAY,KAAK,IAAIkE,EAAQ,GAAKC,EAAQ,EAAE,EAAInE,CACpD,CACA,CACAtO,EAAOqS,GAAqB,qBAAqB,EACjD,SAASK,GAAmB9P,EAAGC,EAAG8P,EAAOC,EAAa,CAAA,EAAIC,EAAS,EAAG,CACpE,UAAWX,KAASS,EAClB,GAAI,CAAAC,EAAW,SAASV,EAAM,EAAE,GAG5BvC,GAAyB/M,EAAGC,EAAGqP,EAAM,KAAM,CAACW,CAAM,EACpD,MAAO,GAGX,MAAO,EACT,CACA7S,EAAO0S,GAAoB,oBAAoB,EAC/C,SAASI,GAAwB5S,EAAIE,EAAID,EAAIE,EAAIiO,EAAUN,GAAK+E,EAAoB,KAAM,CACxF,MAAMC,EAAMxE,GAAMtO,EAAIE,EAAIkO,CAAO,EAC3B2E,EAAM1E,GAAMrO,EAAIE,EAAIkO,CAAO,EAC3B4E,EAAM1E,GAAMrO,EAAIE,EAAIiO,CAAO,EAC3B6E,EAAM5E,GAAMpO,EAAIE,EAAIiO,CAAO,EAIjC,GAHI0E,GAAOE,GAAOD,GAAOE,GAGrB,EAAEH,GAAOC,IAAQ,EAAEC,GAAOC,GAC5B,MAAO,GAET,MAAMC,EAAQJ,EAAM,CAAE,EAAG9S,EAAI,EAAGE,CAAE,EAAK,CAAE,EAAGD,EAAI,EAAGE,CAAE,EAC/CgT,EAAOJ,EAAM,CAAE,EAAG/S,EAAI,EAAGE,CAAE,EAAK,CAAE,EAAGD,EAAI,EAAGE,CAAE,EAC9CiT,EAAKF,EAAM,EAAE,EACbG,EAAM,KAAK,IAAIH,EAAM,EAAE,EAAGA,EAAM,EAAE,CAAC,EACnCI,EAAM,KAAK,IAAIJ,EAAM,EAAE,EAAGA,EAAM,EAAE,CAAC,EACnCK,EAAKJ,EAAK,EAAE,EACZK,EAAM,KAAK,IAAIL,EAAK,EAAE,EAAGA,EAAK,EAAE,CAAC,EACjCM,EAAM,KAAK,IAAIN,EAAK,EAAE,EAAGA,EAAK,EAAE,CAAC,EACvC,GAAII,EAAKF,GAAOE,EAAKD,GAAOF,EAAKI,GAAOJ,EAAKK,EAC3C,MAAO,GAET,MAAMC,EAAuB,KAAK,IAAIH,EAAKL,EAAM,EAAE,CAAC,EAAIL,GAAqB,KAAK,IAAIO,EAAKF,EAAM,EAAE,CAAC,EAAIL,GAAqB,KAAK,IAAIU,EAAKL,EAAM,EAAE,CAAC,EAAIL,GAAqB,KAAK,IAAIO,EAAKF,EAAM,EAAE,CAAC,EAAIL,EAClMc,EAAsB,KAAK,IAAIJ,EAAKJ,EAAK,EAAE,CAAC,EAAIN,GAAqB,KAAK,IAAIO,EAAKD,EAAK,EAAE,CAAC,EAAIN,GAAqB,KAAK,IAAIU,EAAKJ,EAAK,EAAE,CAAC,EAAIN,GAAqB,KAAK,IAAIO,EAAKD,EAAK,EAAE,CAAC,EAAIN,EACnM,MAAO,EAAEa,GAAwBC,EACnC,CACA7T,EAAO8S,GAAyB,yBAAyB,EACzD,SAASgB,GAAwB5T,EAAIE,EAAID,EAAIE,EAAIiO,EAAUN,GAAK,CAC9D,MAAMgF,EAAMxE,GAAMtO,EAAIE,EAAIkO,CAAO,EAC3B2E,EAAM1E,GAAMrO,EAAIE,EAAIkO,CAAO,EAC3B4E,EAAM1E,GAAMrO,EAAIE,EAAIiO,CAAO,EAC3B6E,EAAM5E,GAAMpO,EAAIE,EAAIiO,CAAO,EACjC,OAAI2E,GAAOE,GAAO5E,GAAMrO,EAAIC,EAAImO,CAAO,EAC9BK,GAAczO,EAAG,EAAGE,EAAG,EAAGD,EAAG,EAAGE,EAAG,CAAC,EAAIiO,EAE7C0E,GAAOE,GAAO1E,GAAMtO,EAAIC,EAAImO,CAAO,EAC9BK,GAAczO,EAAG,EAAGE,EAAG,EAAGD,EAAG,EAAGE,EAAG,CAAC,EAAIiO,EAE1C,EACT,CACAtO,EAAO8T,GAAyB,yBAAyB,EACzD,SAASC,GAA4BnR,EAAGC,EAAG3B,EAAO8S,EAAa,CAC7D,QAAA1F,EAAUN,GACV,oBAAAiG,EAAsB,EACxB,EAAI,GAAI,CACN,UAAWC,KAAShT,EAAO,CACzB,GAAIgT,IAAUF,GAAeE,EAAM,aACjC,SAEF,MAAMrU,EAASqU,EAAM,OACrB,GAAI,GAACrU,GAAUA,EAAO,OAAS,GAG/B,QAASE,EAAI,EAAGA,EAAIF,EAAO,OAAS,EAAGE,IAAK,CAC1C,MAAMoU,EAAKtU,EAAOE,CAAC,EACbqU,EAAKvU,EAAOE,EAAI,CAAC,EACvB,GAAI,EAAAkU,GAAuB5F,GAAU8F,EAAIC,EAAI9F,CAAO,KAGhDwE,GAAwBlQ,EAAGC,EAAGsR,EAAIC,EAAI9F,CAAO,GAAKwF,GAAwBlR,EAAGC,EAAGsR,EAAIC,EAAI9F,CAAO,GACjG,MAAO,EAEX,CACF,CACA,MAAO,EACT,CACAtO,EAAO+T,GAA6B,6BAA6B,EACjE,SAASM,GAAgCnU,EAAIE,EAAID,EAAIE,EAAIiO,EAAUN,GAAK,CACtE,MAAMlM,EAAS0M,GAAMtO,EAAIE,EAAIkO,CAAO,EAC9BgG,EAAQ/F,GAAMrO,EAAIE,EAAIkO,CAAO,EAC7BvM,EAASyM,GAAMrO,EAAIE,EAAIiO,CAAO,EAC9BiG,EAAQhG,GAAMpO,EAAIE,EAAIiO,CAAO,EACnC,GAAI,EAAExM,GAAUyS,GAASD,GAASvS,GAChC,MAAO,GAET,MAAMqR,EAAQtR,EAAS,CAAE,EAAG5B,EAAI,EAAGE,CAAE,EAAK,CAAE,EAAGD,EAAI,EAAGE,CAAE,EAClDgT,EAAOvR,EAAS,CAAE,EAAG3B,EAAI,EAAGE,CAAE,EAAK,CAAE,EAAGH,EAAI,EAAGE,CAAE,EACjDkT,EAAKF,EAAM,EAAE,EACboB,EAAQ,KAAK,IAAIpB,EAAM,EAAE,EAAGA,EAAM,EAAE,CAAC,EACrCqB,EAAQ,KAAK,IAAIrB,EAAM,EAAE,EAAGA,EAAM,EAAE,CAAC,EACrCK,EAAKJ,EAAK,EAAE,EACZqB,EAAQ,KAAK,IAAIrB,EAAK,EAAE,EAAGA,EAAK,EAAE,CAAC,EACnCsB,EAAQ,KAAK,IAAItB,EAAK,EAAE,EAAGA,EAAK,EAAE,CAAC,EACzC,OAAOI,EAAKe,EAAQlG,GAAWmF,EAAKgB,EAAQnG,GAAWgF,EAAKoB,EAAQpG,GAAWgF,EAAKqB,EAAQrG,CAC9F,CACAtO,EAAOqU,GAAiC,iCAAiC,EACzE,SAASO,GAAgBC,EAAOjS,EAAGC,EAAG,CACpC,MAAMiS,EAAK,KAAK,IAAIlS,EAAGC,CAAC,EAClBkS,EAAK,KAAK,IAAInS,EAAGC,CAAC,EACxB,OAAOgS,EAAQC,EAAK9G,IAAO6G,EAAQE,EAAK/G,EAC1C,CACAhO,EAAO4U,GAAiB,iBAAiB,EACzC,SAASI,GAAwBrR,EAAMsR,EAAKpR,EAAM,CAChD,OAAI0K,GAAM5K,EAAMsR,CAAG,GAAK1G,GAAM0G,EAAKpR,CAAI,EAC9B+Q,GAAgBK,EAAI,EAAGtR,EAAK,EAAGE,EAAK,CAAC,EAE1C2K,GAAM7K,EAAMsR,CAAG,GAAKzG,GAAMyG,EAAKpR,CAAI,EAC9B+Q,GAAgBK,EAAI,EAAGtR,EAAK,EAAGE,EAAK,CAAC,EAEvC,EACT,CACA7D,EAAOgV,GAAyB,yBAAyB,EACzD,SAASE,GAAqBrV,EAAQ,CACpC,IAAIsV,EAAU,GACd,MAAM1S,EAAM,CAAA,EACZ,QAAS1C,EAAI,EAAGA,EAAIF,EAAO,OAAQE,IAAK,CACtC,MAAM4D,EAAOlB,EAAIA,EAAI,OAAS,CAAC,EACzBwS,EAAMpV,EAAOE,CAAC,EACd8D,EAAO9D,EAAI,EAAIF,EAAO,OAASA,EAAOE,EAAI,CAAC,EAAI,OACrD,GAAI4D,GAAQE,EAAM,CAChB,GAAIwK,GAAU1K,EAAME,CAAI,EAAG,CACzB9D,IACAoV,EAAU,GACV,QACF,CACA,GAAIH,GAAwBrR,EAAMsR,EAAKpR,CAAI,EAAG,CAC5CsR,EAAU,GACV,QACF,CACF,CACA1S,EAAI,KAAKwS,CAAG,CACd,CACA,MAAO,CAAE,OAAQxS,EAAK,QAAA0S,CAAO,CAC/B,CACAnV,EAAOkV,GAAsB,sBAAsB,EACnD,SAASE,GAAsB/O,EAAK,CAClC,MAAMuB,EAAU,CAACvB,EAAI,CAAC,CAAC,EACvB,QAAStG,EAAI,EAAGA,EAAIsG,EAAI,OAAQtG,IAAK,CACnC,MAAM4D,EAAOiE,EAAQA,EAAQ,OAAS,CAAC,EACjChE,EAAOyC,EAAItG,CAAC,EAClB,GAAI,CAACwO,GAAM5K,EAAMC,CAAI,GAAK,CAAC4K,GAAM7K,EAAMC,CAAI,EAAG,CAC5C,MAAMyR,EAAWzN,EAAQ,QAAU,EAAIA,EAAQA,EAAQ,OAAS,CAAC,EAAI,OAE/DtC,GADmB+P,EAAW9G,GAAM8G,EAAU1R,CAAI,EAAI,IAC1B,CAAE,EAAGA,EAAK,EAAG,EAAGC,EAAK,CAAC,EAAK,CAAE,EAAGA,EAAK,EAAG,EAAGD,EAAK,CAAC,EACnFiE,EAAQ,KAAKtC,CAAM,CACrB,CACAsC,EAAQ,KAAKhE,CAAI,CACnB,CACA,MAAM0R,EAAU,CAAA,EAChB,UAAWlT,KAAKwF,EAAS,CACvB,MAAMyH,EAAOiG,EAAQA,EAAQ,OAAS,CAAC,GACnC,CAACjG,GAAQ,CAAChB,GAAUgB,EAAMjN,CAAC,IAC7BkT,EAAQ,KAAKlT,CAAC,CAElB,CACA,OAAOkT,CACT,CACAtV,EAAOoV,GAAuB,uBAAuB,EACrD,SAASG,GAAiBlP,EAAK,CAC7B,GAAIA,EAAI,OAAS,EACf,OAAOA,EAET,IAAImP,EAAO,CAAC,GAAGnP,CAAG,EAClB,QAASoP,EAAQ,EAAGA,EAAQ,GAAIA,IAAS,CACvC,MAAM3G,EAASoG,GAAqBM,CAAI,EAExC,GADAA,EAAO1G,EAAO,OACV,CAACA,EAAO,QACV,KAEJ,CACA,OAAO0G,CACT,CACAxV,EAAOuV,GAAkB,kBAAkB,EAG3C,IAAIG,GAAO,KACPC,GAAa,GACbC,GAAmB,EACvB,SAASC,GAAmBrT,EAAMsT,EAAaC,EAAW,CACxD,MAAMC,EAAYxT,EAClB,GAAIwT,EAAU,cAAgB,CAACA,EAAU,QAAUA,EAAU,OAAO,OAASD,EAC3E,OAEF,MAAMpM,EAAMqM,EAAU,MAAQF,EAAY,IAAIE,EAAU,KAAK,EAAI,OAC3DpM,EAAMoM,EAAU,IAAMF,EAAY,IAAIE,EAAU,GAAG,EAAI,OAC7D,MAAO,CACL,KAAMA,EACN,OAAQA,EAAU,OAClB,QAASrM,EAAM8G,GAAiB9G,CAAG,EAAI,OACvC,QAASC,EAAM6G,GAAiB7G,CAAG,EAAI,MAC3C,CACA,CACA5J,EAAO6V,GAAoB,oBAAoB,EAC/C,SAASI,GAAkBC,EAASC,EAAQC,EAAG,CAC7C,GAAI5H,GAAM0H,EAASC,EAAQT,EAAI,EAE7B,MAAO,CAAE,EADCQ,EAAQ,EAAIE,EAAE,KAAOA,EAAE,KAAOA,EAAE,MAC9B,EAAGF,EAAQ,CAAC,EAE1B,GAAI3H,GAAM2H,EAASC,EAAQT,EAAI,EAAG,CAChC,MAAMhN,EAAIwN,EAAQ,EAAIE,EAAE,IAAMA,EAAE,IAAMA,EAAE,OACxC,MAAO,CAAE,EAAGF,EAAQ,EAAG,EAAAxN,CAAC,CAC1B,CACA,MAAO,CACL,EAAG,KAAK,IAAI0N,EAAE,MAAO,KAAK,IAAIA,EAAE,KAAMF,EAAQ,CAAC,CAAC,EAChD,EAAG,KAAK,IAAIE,EAAE,OAAQ,KAAK,IAAIA,EAAE,IAAKF,EAAQ,CAAC,CAAC,CACpD,CACA,CACAlW,EAAOiW,GAAmB,mBAAmB,EAC7C,SAASI,GAAaxW,EAAQ+P,EAAM0G,EAAS,CAC3C,MAAMC,EAAOD,EAAU,EAAI,GAC3B,IAAIE,EAAeF,EAAU,EAAIzW,EAAO,OAAS,EACjD,KAAO2W,GAAgB,GAAKA,EAAe3W,EAAO,QAAUqQ,GAAgBrQ,EAAO2W,CAAY,EAAG5G,EAAM+F,EAAU,GAChHa,GAAgBD,EAElB,GAAIC,EAAe,GAAKA,GAAgB3W,EAAO,OAC7C,OAAOA,EAET,MAAM4W,EAAcD,EAAeD,EACnC,GAAIE,EAAc,GAAKA,GAAe5W,EAAO,OAC3C,OAAOA,EAET,MAAMqS,EAAQ+D,GAAkBpW,EAAO2W,CAAY,EAAG3W,EAAO4W,CAAW,EAAG7G,CAAI,EAC/E,OAAO0G,EAAU,CAACpE,EAAO,GAAGrS,EAAO,MAAM2W,CAAY,CAAC,EAAI,CAAC,GAAG3W,EAAO,MAAM,EAAG2W,EAAe,CAAC,EAAGtE,CAAK,CACxG,CACAlS,EAAOqW,GAAc,cAAc,EACnC,SAASK,GAAkCxV,EAAO4U,EAAa,CAC7D,UAAWtT,KAAQtB,EAAO,CACxB,MAAMyV,EAAUd,GAAmBrT,EAAMsT,EAAa,CAAC,EACvD,GAAI,CAACa,EACH,SAEF,IAAI9S,EAAO,CAAC,GAAG8S,EAAQ,MAAM,EACzBA,EAAQ,UACV9S,EAAOwS,GAAaxS,EAAM8S,EAAQ,QAAS,EAAI,GAE7CA,EAAQ,UACV9S,EAAOwS,GAAaxS,EAAM8S,EAAQ,QAAS,EAAK,GAElD9S,EAAO0R,GAAiBH,GAAsBvR,CAAI,CAAC,EACnDA,EAAO+S,GAAuC/S,EAAM8S,EAAQ,QAASA,EAAQ,OAAO,EACpFA,EAAQ,KAAK,OAASpB,GAAiBH,GAAsBvR,CAAI,CAAC,CACpE,CACF,CACA7D,EAAO0W,GAAmC,mCAAmC,EAC7E,SAASG,GAAuBxG,EAAOyG,EAAUV,EAAGW,EAAkB,GAAO,CAC3E,GAAIvI,GAAM6B,EAAOyG,EAAUpB,EAAI,EAAG,CAChC,GAAIoB,EAAS,EAAIV,EAAE,IAAMV,IAAQoB,EAAS,EAAIV,EAAE,OAASV,GACvD,OAAOoB,EAET,GAAIC,EAAiB,CACnB,GAAI1G,EAAM,EAAI+F,EAAE,KAAOV,GACrB,MAAO,CAAE,EAAGU,EAAE,KAAM,EAAG/F,EAAM,CAAC,EAEhC,GAAIA,EAAM,EAAI+F,EAAE,MAAQV,GACtB,MAAO,CAAE,EAAGU,EAAE,MAAO,EAAG/F,EAAM,CAAC,CAEnC,CAEA,MAAO,CAAE,EADM,KAAK,IAAIyG,EAAS,EAAIV,EAAE,IAAI,GAAK,KAAK,IAAIU,EAAS,EAAIV,EAAE,KAAK,EACxDA,EAAE,KAAOA,EAAE,MAAO,EAAG/F,EAAM,CAAC,CACnD,CACA,GAAI9B,GAAM8B,EAAOyG,EAAUpB,EAAI,EAAG,CAChC,GAAIoB,EAAS,EAAIV,EAAE,KAAOV,IAAQoB,EAAS,EAAIV,EAAE,MAAQV,GACvD,OAAOoB,EAET,GAAIC,EAAiB,CACnB,GAAI1G,EAAM,EAAI+F,EAAE,IAAMV,GACpB,MAAO,CAAE,EAAGrF,EAAM,EAAG,EAAG+F,EAAE,GAAG,EAE/B,GAAI/F,EAAM,EAAI+F,EAAE,OAASV,GACvB,MAAO,CAAE,EAAGrF,EAAM,EAAG,EAAG+F,EAAE,MAAM,CAEpC,CACA,MAAMY,EAAQ,KAAK,IAAIF,EAAS,EAAIV,EAAE,GAAG,GAAK,KAAK,IAAIU,EAAS,EAAIV,EAAE,MAAM,EAC5E,MAAO,CAAE,EAAG/F,EAAM,EAAG,EAAG2G,EAAQZ,EAAE,IAAMA,EAAE,MAAM,CAClD,CACA,OAAOU,CACT,CACA9W,EAAO6W,GAAwB,wBAAwB,EACvD,SAASI,GAAsBpX,EAAQqX,EAAeX,EAAM,CAC1D,MAAMO,EAAWjX,EAAOqX,CAAa,EACrC,QAASC,EAAQD,EAAgBX,EAAMY,GAAS,GAAKA,EAAQtX,EAAO,OAAQsX,GAASZ,EAAM,CACzF,MAAMP,EAAYnW,EAAOsX,CAAK,EAC9B,GAAI,CAAC9I,GAAU2H,EAAWc,EAAUpB,EAAI,EACtC,OAAOM,CAEX,CACA,OAAOnW,EAAOqX,EAAgBX,CAAI,CACpC,CACAvW,EAAOiX,GAAuB,uBAAuB,EACrD,SAASG,GAAqBC,EAAKC,EAAK,CACtC,MAAMxC,EAAKuC,EAAMzB,GACXb,EAAKuC,EAAM1B,GACjB,OAAOd,GAAMC,EAAK,CAAE,GAAAD,EAAI,GAAAC,CAAE,EAAK,CAAE,IAAKsC,EAAMC,GAAO,EAAG,IAAKD,EAAMC,GAAO,CAAC,CAC3E,CACAtX,EAAOoX,GAAsB,sBAAsB,EACnD,SAASG,GAAuB1C,EAAOwC,EAAKC,EAAK,CAC/C,KAAM,CAAE,GAAAxC,EAAI,GAAAC,CAAE,EAAKqC,GAAqBC,EAAKC,CAAG,EAChD,OAAO,KAAK,IAAIvC,EAAI,KAAK,IAAID,EAAID,CAAK,CAAC,CACzC,CACA7U,EAAOuX,GAAwB,wBAAwB,EACvD,SAASC,GAAgBC,EAAQ,CAC/B,MAAM3C,EAAK,KAAK,IAAI,GAAG2C,EAAO,IAAKC,GAAUA,EAAM,EAAE,CAAC,EAChD3C,EAAK,KAAK,IAAI,GAAG0C,EAAO,IAAKC,GAAUA,EAAM,EAAE,CAAC,EACtD,GAAI,EAAA5C,EAAKC,GAGT,MAAO,CAAE,GAAAD,EAAI,GAAAC,CAAE,CACjB,CACA/U,EAAOwX,GAAiB,iBAAiB,EACzC,SAASG,GAAsBvB,EAAGzF,EAAM,CACtC,OAAOA,IAAS,QAAUA,IAAS,QAAUyG,GAAqBhB,EAAE,IAAKA,EAAE,MAAM,EAAIgB,GAAqBhB,EAAE,KAAMA,EAAE,KAAK,CAC3H,CACApW,EAAO2X,GAAuB,uBAAuB,EACrD,SAASC,GAAuBd,EAAUe,EAAUzB,EAAG,CACrD,MAAM0B,EAAUhB,EAAS,GAAKV,EAAE,IAAMV,IAAQoB,EAAS,GAAKV,EAAE,OAASV,GACjEqC,EAAUjB,EAAS,GAAKV,EAAE,KAAOV,IAAQoB,EAAS,GAAKV,EAAE,MAAQV,GACvE,GAAIlH,GAAMsI,EAAUe,EAAUnC,EAAI,GAAKoC,EAAS,CAC9C,GAAI,KAAK,IAAIhB,EAAS,EAAIV,EAAE,IAAI,EAAIV,GAClC,MAAO,OAET,GAAI,KAAK,IAAIoB,EAAS,EAAIV,EAAE,KAAK,EAAIV,GACnC,MAAO,OAEX,CACA,GAAInH,GAAMuI,EAAUe,EAAUnC,EAAI,GAAKqC,EAAS,CAC9C,GAAI,KAAK,IAAIjB,EAAS,EAAIV,EAAE,GAAG,EAAIV,GACjC,MAAO,MAET,GAAI,KAAK,IAAIoB,EAAS,EAAIV,EAAE,MAAM,EAAIV,GACpC,MAAO,QAEX,CAEF,CACA1V,EAAO4X,GAAwB,wBAAwB,EACvD,SAASI,GAAiBrH,EAAM,CAC9B,OAAOA,IAAS,QAAUA,IAAS,OACrC,CACA3Q,EAAOgY,GAAkB,kBAAkB,EAC3C,SAASC,GAAuBC,EAAOC,EAAKC,EAASC,EAAStJ,EAAY,CACxE,MAAM0I,EAAS,CAAA,EACT5G,EAAUuH,EAAUR,GAAuBM,EAAOC,EAAKC,CAAO,EAAI,OAClEtH,EAAUuH,EAAUT,GAAuBO,EAAKD,EAAOG,CAAO,EAAI,OACxE,OAAID,GAAWvH,GAAWmH,GAAiBnH,CAAO,IAAM9B,GACtD0I,EAAO,KAAKE,GAAsBS,EAASvH,CAAO,CAAC,EAEjDwH,GAAWvH,GAAWkH,GAAiBlH,CAAO,IAAM/B,GACtD0I,EAAO,KAAKE,GAAsBU,EAASvH,CAAO,CAAC,EAE9C2G,EAAO,OAAS,EAAID,GAAgBC,CAAM,EAAI,MACvD,CACAzX,EAAOiY,GAAwB,wBAAwB,EACvD,SAASK,GAAgCJ,EAAOC,EAAKC,EAASC,EAAStJ,EAAY,CACjF,MAAM2I,EAAQO,GAAuBC,EAAOC,EAAKC,EAASC,EAAStJ,CAAU,EAC7E,GAAI,CAAC2I,EACH,OAEF,MAAMa,EAAUxJ,EAAamJ,EAAM,EAAIA,EAAM,EACvCrU,EAAO,KAAK,IAAI6T,EAAM,GAAI,KAAK,IAAIA,EAAM,GAAIa,CAAO,CAAC,EAC3D,GAAI,OAAK,IAAI1U,EAAO0U,CAAO,EAAI7C,IAG/B,OAAO3G,EAAa,CAClB,CAAE,EAAGmJ,EAAM,EAAG,EAAGrU,CAAI,EACrB,CAAE,EAAGsU,EAAI,EAAG,EAAGtU,CAAI,CACvB,EAAM,CACF,CAAE,EAAGA,EAAM,EAAGqU,EAAM,CAAC,EACrB,CAAE,EAAGrU,EAAM,EAAGsU,EAAI,CAAC,CACvB,CACA,CACAnY,EAAOsY,GAAiC,iCAAiC,EACzE,SAAS1B,GAAuC/W,EAAQuY,EAASC,EAAS,CACxE,GAAIxY,EAAO,SAAW,EACpB,OAAOA,EAET,KAAM,CAACqY,EAAOC,CAAG,EAAItY,EACrB,OAAI2O,GAAM0J,EAAOC,EAAKzC,EAAI,EACjB4C,GAAgCJ,EAAOC,EAAKC,EAASC,EAAS,EAAI,GAAKxY,EAE5E0O,GAAM2J,EAAOC,EAAKzC,EAAI,EACjB4C,GAAgCJ,EAAOC,EAAKC,EAASC,EAAS,EAAK,GAAKxY,EAE1EA,CACT,CACAG,EAAO4W,GAAwC,wCAAwC,EACvF,SAAS4B,GAAsB1B,EAAUV,EAAGzF,EAAM,CAChD,OAAOqH,GAAiBrH,CAAI,EAAI,CAAE,EAAGmG,EAAS,EAAG,EAAGS,GAAuBT,EAAS,EAAGV,EAAE,IAAKA,EAAE,MAAM,CAAC,EAAK,CAAE,EAAGmB,GAAuBT,EAAS,EAAGV,EAAE,KAAMA,EAAE,KAAK,EAAG,EAAGU,EAAS,CAAC,CACrL,CACA9W,EAAOwY,GAAuB,uBAAuB,EACrD,SAASC,GAAyB5Y,EAAQqX,EAAeX,EAAMO,EAAU4B,EAAUC,EAAoB,CACrG,MAAM9U,EAAOhE,EAAO,IAAKuP,IAAW,CAAE,GAAGA,CAAK,EAAG,EACjD,QAAS+H,EAAQD,EAAeC,GAAS,GAAKA,EAAQtX,EAAO,OAAQsX,GAASZ,EAAM,CAClF,MAAMnH,EAAQvP,EAAOsX,CAAK,EAI1B,GAHIwB,GAAsB,CAACnK,GAAMY,EAAO0H,EAAUpB,EAAI,GAGlD,CAACiD,GAAsB,CAACpK,GAAMa,EAAO0H,EAAUpB,EAAI,EACrD,MAEEiD,EACF9U,EAAKsT,CAAK,EAAE,EAAIuB,EAAS,EAEzB7U,EAAKsT,CAAK,EAAE,EAAIuB,EAAS,CAE7B,CACA,OAAO7U,CACT,CACA7D,EAAOyY,GAA0B,0BAA0B,EAC3D,SAASG,GAA8B/Y,EAAQuW,EAAGE,EAAS,CACzD,GAAIzW,EAAO,OAAS,EAClB,OAAOA,EAET,MAAMqX,EAAgBZ,EAAU,EAAIzW,EAAO,OAAS,EAC9C0W,EAAOD,EAAU,EAAI,GACrBQ,EAAWjX,EAAOqX,CAAa,EAC/BW,EAAWZ,GAAsBpX,EAAQqX,EAAeX,CAAI,EAClE,GAAI,CAACsB,EACH,OAAOhY,EAET,MAAM8Q,EAAOiH,GAAuBd,EAAUe,EAAUzB,CAAC,EACzD,GAAI,CAACzF,EACH,OAAO9Q,EAET,MAAM8Y,EAAqBX,GAAiBrH,CAAI,EAC1C+H,EAAWF,GAAsB1B,EAAUV,EAAGzF,CAAI,EACxD,OAAItC,GAAUyI,EAAU4B,EAAUhD,EAAI,EAC7B7V,EAEF4Y,GACL5Y,EACAqX,EACAX,EACAO,EACA4B,EACAC,CACJ,CACA,CACA3Y,EAAO4Y,GAA+B,+BAA+B,EACrE,SAASC,GAAqBjW,EAAGC,EAAGuT,EAAG,CACrC,MAAM2B,EAAU,KAAK,IAAInV,EAAE,EAAGC,EAAE,CAAC,GAAKuT,EAAE,KAAOV,IAAQ,KAAK,IAAI9S,EAAE,EAAGC,EAAE,CAAC,GAAKuT,EAAE,MAAQV,GACjFoC,EAAU,KAAK,IAAIlV,EAAE,EAAGC,EAAE,CAAC,GAAKuT,EAAE,IAAMV,IAAQ,KAAK,IAAI9S,EAAE,EAAGC,EAAE,CAAC,GAAKuT,EAAE,OAASV,GACvF,GAAI,KAAK,IAAI9S,EAAE,EAAIwT,EAAE,GAAG,EAAIV,IAAQ,KAAK,IAAI7S,EAAE,EAAIuT,EAAE,GAAG,EAAIV,IAAQqC,EAClE,MAAO,MAET,GAAI,KAAK,IAAInV,EAAE,EAAIwT,EAAE,MAAM,EAAIV,IAAQ,KAAK,IAAI7S,EAAE,EAAIuT,EAAE,MAAM,EAAIV,IAAQqC,EACxE,MAAO,SAET,GAAI,KAAK,IAAInV,EAAE,EAAIwT,EAAE,IAAI,EAAIV,IAAQ,KAAK,IAAI7S,EAAE,EAAIuT,EAAE,IAAI,EAAIV,IAAQoC,EACpE,MAAO,OAET,GAAI,KAAK,IAAIlV,EAAE,EAAIwT,EAAE,KAAK,EAAIV,IAAQ,KAAK,IAAI7S,EAAE,EAAIuT,EAAE,KAAK,EAAIV,IAAQoC,EACtE,MAAO,OAGX,CACA9X,EAAO6Y,GAAsB,sBAAsB,EACnD,SAASC,GAAcnI,EAAMoI,EAAMC,EAAI5C,EAAG,CACxC,OAAQzF,EAAI,CACV,IAAK,MACH,OAAOpC,GAAMwK,EAAMC,EAAItD,EAAI,GAAKsD,EAAG,EAAI5C,EAAE,IAAMV,GACjD,IAAK,SACH,OAAOnH,GAAMwK,EAAMC,EAAItD,EAAI,GAAKsD,EAAG,EAAI5C,EAAE,OAASV,GACpD,IAAK,OACH,OAAOlH,GAAMuK,EAAMC,EAAItD,EAAI,GAAKsD,EAAG,EAAI5C,EAAE,KAAOV,GAClD,IAAK,QACH,OAAOlH,GAAMuK,EAAMC,EAAItD,EAAI,GAAKsD,EAAG,EAAI5C,EAAE,MAAQV,EACvD,CACA,CACA1V,EAAO8Y,GAAe,eAAe,EACrC,SAASG,GAAsBpZ,EAAQuW,EAAGE,EAAS,CACjD,GAAIzW,EAAO,OAAS,EAClB,OAAOA,EAET,GAAIyW,EAAS,CACX,MAAM4C,EAAQL,GAAqBhZ,EAAO,CAAC,EAAGA,EAAO,CAAC,EAAGuW,CAAC,EAC1D,OAAI8C,GAASJ,GAAcI,EAAOrZ,EAAO,CAAC,EAAGA,EAAO,CAAC,EAAGuW,CAAC,EAChDvW,EAAO,MAAM,CAAC,EAEhBA,CACT,CACA,MAAMwP,EAAOxP,EAAO,OAAS,EACvB8Q,EAAOkI,GAAqBhZ,EAAOwP,EAAO,CAAC,EAAGxP,EAAOwP,CAAI,EAAG+G,CAAC,EACnE,OAAIzF,GAAQmI,GAAcnI,EAAM9Q,EAAOwP,EAAO,CAAC,EAAGxP,EAAOwP,EAAO,CAAC,EAAG+G,CAAC,EAC5DvW,EAAO,MAAM,EAAGwP,CAAI,EAEtBxP,CACT,CACAG,EAAOiZ,GAAuB,uBAAuB,EACrD,SAASE,GAAyBtZ,EAAQuY,EAASC,EAAS,CAC1D,IAAIxU,EAAOhE,EACX,GAAIuY,EAAS,CACX,MAAMP,EAAWZ,GAAsBpT,EAAM,EAAG,CAAC,EACjD,GAAIgU,EAAU,CACZ,MAAMuB,EAAUvC,GAAuBgB,EAAUhU,EAAK,CAAC,EAAGuU,CAAO,EAC7DgB,IAAYvV,EAAK,CAAC,IACpBA,EAAO,CAACuV,EAAS,GAAGvV,EAAK,MAAM,CAAC,CAAC,EAErC,CACAA,EAAOoV,GAAsBpV,EAAMuU,EAAS,EAAI,CAClD,CACA,GAAIC,EAAS,CACX,MAAMhJ,EAAOxL,EAAK,OAAS,EACrBgU,EAAWZ,GAAsBpT,EAAMwL,EAAM,EAAE,EACrD,GAAIwI,EAAU,CACZ,MAAMuB,EAAUvC,GAAuBgB,EAAUhU,EAAKwL,CAAI,EAAGgJ,EAAS,EAAI,EACtEe,IAAYvV,EAAKwL,CAAI,IACvBxL,EAAO,CAAC,GAAGA,EAAK,MAAM,EAAGwL,CAAI,EAAG+J,CAAO,EAE3C,CACAvV,EAAOoV,GAAsBpV,EAAMwU,EAAS,EAAK,CACnD,CACA,MAAMgB,EAAkBzC,GAAuC/S,EAAMuU,EAASC,CAAO,EACrF,OAAIgB,IAAoBxV,GAAQA,EAAK,SAAW,EACvCwV,GAELjB,IACFvU,EAAO+U,GAA8B/U,EAAMuU,EAAS,EAAI,GAEtDC,IACFxU,EAAO+U,GAA8B/U,EAAMwU,EAAS,EAAK,GAEpDxU,EACT,CACA7D,EAAOmZ,GAA0B,0BAA0B,EAC3D,SAASG,GAAgCpY,EAAO4U,EAAa,CAC3D,UAAWtT,KAAQtB,EAAO,CACxB,MAAMyV,EAAUd,GAAmBrT,EAAMsT,EAAa,CAAC,EACvD,GAAI,CAACa,EACH,SAEF,MAAM4C,EAAQpK,GAAwBwH,EAAQ,OAAQjB,EAAI,EACpD8D,EAASL,GAAyBI,EAAO5C,EAAQ,QAASA,EAAQ,OAAO,EAC/E,GAAI6C,EAAO,OAAS,EAAG,CACrB7C,EAAQ,KAAK,OAAS6C,EACtB,QACF,CACA,MAAMC,EAAa,CACjBD,EAAO,CAAC,EACR,CAAE,GAAGA,EAAO,CAAC,CAAC,EACd,GAAGA,EAAO,MAAM,EAAG,EAAE,EACrBA,EAAOA,EAAO,OAAS,CAAC,EACxB,CAAE,GAAGA,EAAOA,EAAO,OAAS,CAAC,CAAC,CACpC,EACI7C,EAAQ,KAAK,OAAS8C,CACxB,CACF,CACAzZ,EAAOsZ,GAAiC,iCAAiC,EAGzE,SAASI,GAAarQ,EAAO,CAC3B,OAAO,IAAI,IAAIA,EAAM,IAAKC,GAAS,CAACA,EAAK,GAAIA,CAAI,CAAC,CAAC,CACrD,CACAtJ,EAAO0Z,GAAc,cAAc,EACnC,SAASC,GAAuBrQ,EAAMI,EAAU,CAC9C,IAAIkQ,EAAWtQ,EAAK,SAChBuQ,EAAkB,KACtB,KAAOD,GAAU,CACf,MAAME,EAASpQ,EAAS,IAAIkQ,CAAQ,EACpC,GAAI,CAACE,GAAQ,QACX,MAEFD,EAAkBC,EAAO,GACzBF,EAAWE,EAAO,QACpB,CACA,OAAOD,CACT,CACA7Z,EAAO2Z,GAAwB,wBAAwB,EACvD,SAASI,GAAWjP,EAAOpB,EAAU,CACnC,IAAIsQ,EAAQ,EACRJ,EAAW9O,EAAM,SACrB,KAAO8O,GAAU,CACf,MAAME,EAASpQ,EAAS,IAAIkQ,CAAQ,EACpC,GAAI,CAACE,GAAQ,QACX,MAEFE,IACAJ,EAAWE,EAAO,QACpB,CACA,OAAOE,CACT,CACAha,EAAO+Z,GAAY,YAAY,EAC/B,SAASE,GAAkBlP,EAAU,CACnC,IAAIC,EAAO,IACPC,EAAO,KACPC,EAAO,IACPC,EAAO,KACX,UAAWC,KAASL,EAAU,CAC5B,MAAMzH,EAAK8H,EAAM,EACX7H,EAAK6H,EAAM,EACjB,GAAI,OAAO9H,GAAO,UAAY,OAAOC,GAAO,SAC1C,SAEF,MAAMmI,EAAIN,EAAM,OAAS,EACnBO,EAAIP,EAAM,QAAU,EAC1BJ,EAAO,KAAK,IAAIA,EAAM1H,EAAKoI,EAAI,CAAC,EAChCT,EAAO,KAAK,IAAIA,EAAM3H,EAAKoI,EAAI,CAAC,EAChCR,EAAO,KAAK,IAAIA,EAAM3H,EAAKoI,EAAI,CAAC,EAChCR,EAAO,KAAK,IAAIA,EAAM5H,EAAKoI,EAAI,CAAC,CAClC,CACA,OAAIX,IAAS,KAAYE,IAAS,IACzB,KAEF,CAAE,KAAAF,EAAM,KAAAC,EAAM,KAAAC,EAAM,KAAAC,CAAI,CACjC,CACAnL,EAAOia,GAAmB,mBAAmB,EAC7C,SAASC,GAAiBpP,EAAOqP,EAAQ,CACvC,MAAM5O,EAAMT,EAAM,SAAW,GAC7BA,EAAM,GAAKqP,EAAO,KAAOA,EAAO,MAAQ,EACxCrP,EAAM,GAAKqP,EAAO,KAAOA,EAAO,MAAQ,EACxCrP,EAAM,MAAQ,KAAK,IAAI,EAAGqP,EAAO,KAAOA,EAAO,IAAI,EAAI5O,EACvDT,EAAM,OAAS,KAAK,IAAI,EAAGqP,EAAO,KAAOA,EAAO,IAAI,EAAI5O,CAC1D,CACAvL,EAAOka,GAAkB,kBAAkB,EAC3C,SAASE,GAA2B/Q,EAAO,CACzC,MAAMK,EAAWgQ,GAAarQ,CAAK,EAC7BgR,EAAgBhR,EAAM,OAAQC,GAASA,EAAK,SAAWA,EAAK,QAAQ,EAAE,KAAK,CAAC1G,EAAGC,IAAMkX,GAAWlX,EAAG6G,CAAQ,EAAIqQ,GAAWnX,EAAG8G,CAAQ,CAAC,EAC5I,UAAWoB,KAASuP,EAAe,CACjC,MAAMtP,EAAW1B,EAAM,OAAQC,GAASA,EAAK,WAAawB,EAAM,EAAE,EAC5DqP,EAASF,GAAkBlP,CAAQ,EACrCoP,GACFD,GAAiBpP,EAAOqP,CAAM,CAElC,CACF,CACAna,EAAOoa,GAA4B,4BAA4B,EAC/D,SAASE,GAAWnR,EAAQoR,EAAM,CAChC,MAAMlR,EAAQF,EAAO,OAAS,CAAA,EACxBjI,EAAQiI,EAAO,OAAS,CAAA,EACxBqR,EAAenR,EAAM,OAAQC,GAAS,CAACA,EAAK,OAAO,EACzD,IAAI+N,EAAM,IACNC,EAAM,KACV,UAAWhO,KAAQkR,EAAc,CAC/B,MAAM3F,EAAQvL,EAAKiR,CAAI,EACnB,OAAO1F,GAAU,WAGrBwC,EAAM,KAAK,IAAIA,EAAKxC,CAAK,EACzByC,EAAM,KAAK,IAAIA,EAAKzC,CAAK,EAC3B,CACA,GAAI,CAAC,OAAO,SAASwC,CAAG,GAAK,CAAC,OAAO,SAASC,CAAG,EAC/C,MAAO,GAET,MAAMmD,EAAyBza,EAAQ6U,GAAUwC,EAAMC,EAAMzC,EAAO,QAAQ,EAC5E,UAAWvL,KAAQD,EAAO,CACxB,MAAMwL,EAAQvL,EAAKiR,CAAI,EACnB,OAAO1F,GAAU,WACnBvL,EAAKiR,CAAI,EAAIE,EAAO5F,CAAK,GAE3B,MAAM6F,EAAYpR,EAAK,eACnBoR,IACFpR,EAAK,eAAiBiR,IAAS,IAAM,CACnC,GAAGG,EACH,KAAMD,EAAOC,EAAU,KAAK,EAC5B,MAAOD,EAAOC,EAAU,IAAI,CACpC,EAAU,CACF,GAAGA,EACH,IAAKD,EAAOC,EAAU,MAAM,EAC5B,OAAQD,EAAOC,EAAU,GAAG,CACpC,EAEE,CACA,UAAWlY,KAAQtB,EACjB,UAAWkO,KAAS5M,EAAK,QAAU,CAAA,EACjC4M,EAAMmL,CAAI,EAAIE,EAAOrL,EAAMmL,CAAI,CAAC,EAGpC,MAAO,EACT,CACAva,EAAOsa,GAAY,YAAY,EAC/B,SAASK,GAA0BxR,EAAQ,CAEzC,OADcA,EAAO,OAAS,CAAA,GACnB,KAAMG,GAAS,CAACA,EAAK,OAAO,EAGhCgR,GAAWnR,EAAQ,GAAG,EAFpB,EAGX,CACAnJ,EAAO2a,GAA2B,2BAA2B,EAC7D,SAASC,GAA0BzR,EAAQC,EAAY,KAAM,CAC3D,MAAMC,EAAQF,EAAO,OAAS,CAAA,EACxBjI,EAAQiI,EAAO,OAAS,CAAA,EACxBqR,EAAenR,EAAM,OAAQpH,GAAM,CAACA,EAAE,OAAO,EACnD,IAAI+I,EAAO,IACPE,EAAO,IACX,UAAWjJ,KAAKuY,EAAc,CAC5B,MAAMK,EAAK5Y,EAAE,GAAK,EACZ6Y,EAAK7Y,EAAE,GAAK,EACd4Y,EAAK7P,IACPA,EAAO6P,GAELC,EAAK5P,IACPA,EAAO4P,EAEX,CACA,GAAI,CAAC,OAAO,SAAS9P,CAAI,GAAK,CAAC,OAAO,SAASE,CAAI,EACjD,MAAO,GAET,MAAM6P,EAAgB,GACtB,IAAIC,EAAa,EACbC,EAAc,EAClB,UAAWhZ,KAAKuY,EACdQ,GAAc/Y,EAAE,OAAS,EACzBgZ,GAAehZ,EAAE,QAAU,EAE7B,MAAMiZ,EAAWF,EAAaR,EAAa,OACrCW,EAAYF,EAAcT,EAAa,OACvCY,EAAwBD,EAAY,EAAI,KAAK,IAAI,EAAGD,EAAWC,CAAS,EAAI,EAClF,UAAWlZ,KAAKuY,EAAc,CAC5B,MAAMK,EAAK5Y,EAAE,GAAK,EAEZoZ,IADKpZ,EAAE,GAAK,GACCiJ,GAAQkQ,EAAwBL,EAC7CO,GAAOT,EAAK7P,EAClB/I,EAAE,EAAIoZ,EACNpZ,EAAE,EAAIqZ,EACR,CACA,UAAW5U,KAAKxF,EACd,GAAKwF,EAAE,OAGP,UAAWtE,KAAKsE,EAAE,OAAQ,CACxB,MAAMmU,EAAKzY,EAAE,EAEPiZ,IADKjZ,EAAE,EACM8I,GAAQkQ,EAAwBL,EAC7CO,GAAOT,EAAK7P,EAClB5I,EAAE,EAAIiZ,GACNjZ,EAAE,EAAIkZ,EACR,CAEFlB,GAA2B/Q,CAAK,EAChC,MAAMkS,EAAYlS,EAAM,OAAQpH,GAAMA,EAAE,SAAW,CAACA,EAAE,QAAQ,EAC9D,GAAIsZ,EAAU,SAAW,EACvB,OAAInS,IAAc,MAChBkR,GAAWnR,EAAQ,GAAG,EAEjB,GAET,MAAMO,EAAWgQ,GAAarQ,CAAK,EAC7BmS,EAAiC,IAAI,IAC3C,UAAWvZ,KAAKoH,EAAO,CACrB,GAAIpH,EAAE,QACJ,SAEF,MAAMwZ,EAAS9B,GAAuB1X,EAAGyH,CAAQ,EACjD,GAAI,CAAC+R,EACH,SAEF,MAAMC,EAASF,EAAe,IAAIC,CAAM,GAAK,CAAA,EAC7CC,EAAO,KAAKzZ,CAAC,EACbuZ,EAAe,IAAIC,EAAQC,CAAM,CACnC,CACA,IAAI5P,EAAS,EACb,UAAWvD,KAAQgT,EAAW,CAC5B,MAAMhQ,EAAMhD,EAAK,SAAW,EACxBgD,EAAMO,IACRA,EAASP,EAEb,CACA,MAAMoQ,EAAa,CAAA,EACnB,IAAIC,EAAkB,IAClBC,EAAkB,KACtB,UAAWtT,KAAQgT,EAAW,CAC5B,MAAMxQ,EAAWyQ,EAAe,IAAIjT,EAAK,EAAE,GAAK,CAAA,EAC1C4R,EAASF,GAAkBlP,CAAQ,EACpCoP,IAGLyB,EAAkB,KAAK,IAAIA,EAAiBzB,EAAO,IAAI,EACvD0B,EAAkB,KAAK,IAAIA,EAAiB1B,EAAO,IAAI,EACvDwB,EAAW,KAAK,CACd,KAAApT,EACA,WAAY4R,EAAO,KACnB,cAAeA,EAAO,KACtB,SAAUA,EAAO,KAAOA,EAAO,MAAQ,CAC7C,CAAK,EACH,CACA,GAAIyB,IAAoB,KAAYC,IAAoB,KACtD,MAAO,GAET,MAAMC,EAAmB,KAAK,IAAI,EAAGD,EAAkBD,CAAe,EAChEG,EAAmB,KAAK,IAAIjQ,EAAQ,EAAE,EACtCkQ,EAAYF,EAAmB,EAAIC,EACnCE,EAAYlB,EAAgBiB,EAG5BE,GAFcN,EAAkBC,GAAmB,EAC3BG,EAAY,EACdjB,EACtBoB,EAAUD,EAAWD,EAAY,EACjCjQ,EAAiB,KAAK,IAAIF,EAAQiP,CAAa,EACrDY,EAAW,KAAK,CAAC/Y,EAAGC,IAAMD,EAAE,QAAUC,EAAE,OAAO,EAC/C,QAAS9C,EAAI,EAAGA,EAAI4b,EAAW,OAAQ5b,IAAK,CAC1C,MAAM6D,EAAO+X,EAAW5b,CAAC,EACzB,IAAIqc,EACAC,EAOJ,GANItc,IAAM,EACRqc,EAAUxY,EAAK,WAAaoI,EAG5BoQ,GADaT,EAAW5b,EAAI,CAAC,EACb,cAAgB6D,EAAK,YAAc,EAEjD7D,IAAM4b,EAAW,OAAS,EAC5BU,EAAazY,EAAK,cAAgBoI,MAC7B,CACL,MAAMnI,GAAO8X,EAAW5b,EAAI,CAAC,EAC7Bsc,GAAczY,EAAK,cAAgBC,GAAK,YAAc,CACxD,CACA,MAAMoI,GAAa,KAAK,IAAI,EAAGoQ,EAAaD,CAAO,EAC7ClQ,IAAWkQ,EAAUC,GAAc,EACzCzY,EAAK,KAAK,EAAIuY,EACdvY,EAAK,KAAK,EAAIsI,GACdtI,EAAK,KAAK,MAAQqY,EAClBrY,EAAK,KAAK,OAASqI,GACnBrI,EAAK,KAAK,mBAAqBA,EAAK,WACpCA,EAAK,KAAK,eAAiB,CACzB,KAAMsY,EACN,MAAOA,EAAWnB,EAClB,IAAKqB,EACL,OAAQC,CACd,CACE,CACA,OAAIjT,IAAc,MAChBkR,GAAWnR,EAAQ,GAAG,EAEjB,EACT,CACAnJ,EAAO4a,GAA2B,2BAA2B,EAG7D,IAAI0B,GAAO,KACPC,GAAmB,EACnBC,GAAaD,GACbE,GAAa,CAAC,EAAGD,GAAY,CAACA,GAAY,EAAIA,GAAY,GAAKA,EAAU,EAC7E,SAASE,GAAiBxb,EAAOmI,EAAO,CACtC,KAAM,CAAE,aAAAwI,EAAc,cAAAC,GAAkBF,GAAsBvI,CAAK,EACnE,UAAW7G,KAAQtB,EAAO,CACxB,GAAIsB,EAAK,aACP,SAEF,MAAM6D,EAAM7D,EAAK,OACjB,GAAI,CAAC6D,GAAOA,EAAI,OAAS,EACvB,SAEF,MAAMsW,EAAQrN,GAA0BH,GAAwB9I,EAAKiW,EAAI,EAAGA,EAAI,EAChF,GAAI,CAACK,EACH,SAEF,KAAM,CAAE,GAAAjN,CAAE,EAAKiN,EACTC,EAAQD,EAAM,OAAS,MACvBE,EAAWxK,GAAoB7P,EAAMqP,EAAcyK,EAAI,EAC7D,GAAI,CAACO,EACH,SAEF,KAAM,CAAE,MAAAvK,EAAO,MAAAC,EAAO,QAAAC,EAAS,QAAAC,EAAS,WAAAqK,EAAY,WAAAC,CAAU,EAAKF,EACnE,GAAIC,GAAcC,EAChB,SAEF,IAAIvD,EACJ,MAAMpB,EAAU5F,EAAQ,KACxB,UAAWwK,KAASP,GAAY,CAC9B,IAAIQ,EACAC,EACAC,EACJ,GAAIP,EAAO,CAET,MAAMQ,EADW3K,EAAQ,GAAKD,EAAQ,GACX4F,EAAQ,OAASA,EAAQ,IAC9CiF,EAAU7K,EAAQ,GAAKwK,EAC7B,GAAIK,GAAWjF,EAAQ,KAAOkE,IAAQe,GAAWjF,EAAQ,MAAQkE,GAC/D,SAEFW,EAAM,CAAE,EAAGI,EAAS,EAAGD,CAAO,EAC9BF,EAAM,CAAE,EAAGG,EAAS,EAAG3N,EAAG,CAAC,EAC3ByN,EAAM,CAAE,EAAGzN,EAAG,EAAG,EAAGA,EAAG,CAAC,CAC1B,KAAO,CAEL,MAAM2N,EADU5K,EAAQ,GAAKD,EAAQ,GACX4F,EAAQ,MAAQA,EAAQ,KAC5CgF,EAAU5K,EAAQ,GAAKwK,EAC7B,GAAII,GAAWhF,EAAQ,IAAMkE,IAAQc,GAAWhF,EAAQ,OAASkE,GAC/D,SAEFW,EAAM,CAAE,EAAGI,EAAS,EAAGD,CAAO,EAC9BF,EAAM,CAAE,EAAGxN,EAAG,EAAG,EAAG0N,CAAO,EAC3BD,EAAM,CAAE,EAAGzN,EAAG,EAAG,EAAGA,EAAG,CAAC,CAC1B,CACA,MAAM4N,EAAqBjP,GAAU4O,EAAKC,EAAKZ,EAAI,EAC7CiB,EAAsBlP,GAAU6O,EAAKC,EAAKb,EAAI,EAOpD,GANIgB,GAAsBC,GAGtB,CAACD,GAAsB5K,GAAmBuK,EAAKC,EAAKpL,EAAe,CAACQ,CAAK,EAAG,CAAC,GAG7E,CAACiL,GAAuB7K,GAAmBwK,EAAKC,EAAKrL,EAAe,CAACS,CAAK,EAAG,CAAC,EAChF,SAEF,MAAMiL,EAAoB,CAACF,GAAsBvJ,GAA4BkJ,EAAKC,EAAKhc,EAAOsB,EAAM,CAClG,QAAS8Z,GACT,oBAAqB,EAC7B,CAAO,EACKmB,EAAqB,CAACF,GAAuBxJ,GAA4BmJ,EAAKC,EAAKjc,EAAOsB,EAAM,CACpG,QAAS8Z,GACT,oBAAqB,EAC7B,CAAO,EACD,GAAI,EAAAkB,GAAqBC,GAGzB,CAAIH,EACF9D,EAAS,CAAC0D,EAAKC,CAAG,EACTI,EACT/D,EAAS,CAACyD,EAAKC,CAAG,EAElB1D,EAAS,CAACyD,EAAKC,EAAKC,CAAG,EAEzB,MACF,CACI3D,IACFhX,EAAK,OAASgX,EAElB,CACF,CACAxZ,EAAO0c,GAAkB,kBAAkB,EAG3C,SAASgB,GAA0Bxc,EAAO4U,EAAa,CAIrD,KAAM,CAAE,cAAAhE,EAAe,eAAgB6L,CAAU,EAAK3L,GACpD8D,EAAY,OAAM,CACtB,EACE,UAAWtT,KAAQtB,EAAO,CACxB,GAAIsB,EAAK,aACP,SAEF,MAAMob,EAASpb,EAAK,OACpB,GAAI,CAACob,GAAUA,EAAO,OAAS,EAC7B,SAEF,MAAMvX,EAAM8I,GAAwByO,EAAQ,IAAU,EACtD,GAAIvX,EAAI,OAAS,EACf,SAEF,MAAMwX,EAAQxX,EAAI,OAAS,EACrByX,EAAQzX,EAAIwX,CAAK,EACjBE,EAAW1X,EAAIwX,EAAQ,CAAC,EACxBG,EAAS3X,EAAIwX,EAAQ,CAAC,EACtBI,EAASH,EAAM,EAAIC,EAAS,EAC5BG,EAASJ,EAAM,EAAIC,EAAS,EAC5BI,EAAU,KAAK,MAAMF,EAAQC,CAAM,EACzC,GAAIC,GAAW,IAAYA,EAAU,KACnC,SAEF,MAAMC,EAAWL,EAAS,EAAIC,EAAO,EAC/BK,EAAWN,EAAS,EAAIC,EAAO,EAErC,GADkB,KAAK,MAAMI,EAAUC,CAAQ,EAC/B,KACd,SAEF,MAAMC,EAAc7P,GAAoBsP,EAAUD,EAAO,IAAU,EAC7DS,EAAa7P,GAAkBqP,EAAUD,EAAO,IAAU,EAC1DU,EAAgB/P,GAAoBuP,EAAQD,EAAU,IAAU,EAChEU,EAAe/P,GAAkBsP,EAAQD,EAAU,IAAU,EACnE,GAAI,EAAEO,GAAeG,GAAgBF,GAAcC,GACjD,SAEF,MAAMjM,EAAQ/P,EAAK,IACb8P,EAAQ9P,EAAK,MACboH,EAAM2I,EAAQuD,EAAY,IAAIvD,CAAK,EAAI,OAC7C,GAAI,CAAC3I,EACH,SAEF,MAAM8U,EAAQ9U,EAAI,GAAK,EACjB+U,EAAQ/U,EAAI,GAAK,EACjByO,EAAU5H,GAAiB7G,CAAG,EACpC,GAAI,CAACyO,EACH,SAEF,IAAIuG,EACAC,EACJ,GAAIJ,EAAc,CAChB,MAAMK,EAAoBT,EAAW,EACrCO,EAAU,CAAE,EAAGF,EAAO,EAAGV,EAAO,CAAC,EACjCa,EAAS,CAAE,EAAGH,EAAO,EAAGI,EAAoBzG,EAAQ,OAASA,EAAQ,GAAG,CAC1E,KAAO,CACL,MAAM0G,EAAmBX,EAAW,EACpCQ,EAAU,CAAE,EAAGZ,EAAO,EAAG,EAAGW,CAAK,EACjCE,EAAS,CAAE,EAAGE,EAAmB1G,EAAQ,MAAQA,EAAQ,KAAM,EAAGsG,CAAK,CACzE,CAIA,GAHIjM,GAAmBkM,EAASC,EAAQ/M,EAAeS,EAAQ,CAACA,CAAK,EAAI,CAAA,EAAI,EAAO,GAGhFG,GAAmBkM,EAASC,EAAQlB,EAAY,CAAA,EAAI,EAAO,EAC7D,SAEF,GAAIrL,EAAO,CACT,MAAM3I,EAAMmM,EAAY,IAAIxD,CAAK,EAC3B8F,GAAUzO,EAAM8G,GAAiB9G,CAAG,EAAI,OAC9C,GAAIyO,IAAWlI,GAAgB0O,EAASxG,GAAS,CAAM,EACrD,QAEJ,CACA,MAAM4G,EAAgChf,EAAO,CAAC4C,EAAGC,KAAM,GAAGD,EAAE,EAAE,QAAQ,CAAC,CAAC,IAAIA,EAAE,EAAE,QAAQ,CAAC,CAAC,IAAIC,GAAE,EAAE,QAAQ,CAAC,CAAC,IAAIA,GAAE,EAAE,QAAQ,CAAC,CAAC,GAAI,eAAe,EAC3Ioc,GAA+B,IAAI,IACzC,QAASlf,EAAI,EAAGA,EAAIsG,EAAI,OAAS,EAAGtG,IAClCkf,GAAa,IAAID,EAAc3Y,EAAItG,CAAC,EAAGsG,EAAItG,EAAI,CAAC,CAAC,CAAC,EAEpD,MAAMmf,GAA0Clf,EAAO,CAAC+Y,EAAMC,KAAO,CACnE,UAAW9E,MAAShT,EAAO,CAIzB,GAHIgT,KAAU1R,GAGV0R,GAAM,aACR,SAEF,MAAMiL,GAAOjL,GAAM,OACnB,GAAI,GAACiL,IAAQA,GAAK,OAAS,GAG3B,QAASpf,GAAI,EAAGA,GAAIof,GAAK,OAAS,EAAGpf,KAAK,CACxC,MAAM6C,GAAIuc,GAAKpf,EAAC,EACV8C,GAAIsc,GAAKpf,GAAI,CAAC,EACpB,GAAI,CAAAkf,GAAa,IAAID,EAAcpc,GAAGC,EAAC,CAAC,GAGpCwR,GAAgC0E,EAAMC,GAAIpW,GAAGC,GAAG,IAAU,EAC5D,MAAO,EAEX,CACF,CACA,MAAO,EACT,EAAG,yBAAyB,EAC5B,GAAIqc,GAAwBN,EAASC,CAAM,EACzC,SAEF,GAAIhB,EAAQ,GAAK,EAAG,CAClB,MAAMuB,EAAa/Y,EAAIwX,EAAQ,CAAC,EAC1BwB,GAAc,CAAC/M,EAAOC,CAAK,EAAE,OAAQ5H,IAAO,EAAQA,EAAG,EAI7D,GAHI+H,GAAmB0M,EAAYR,EAAS9M,EAAeuN,GAAa,EAAO,GAG3EH,GAAwBE,EAAYR,CAAO,EAC7C,QAEJ,CAEA,MAAMpF,GAAS,CAAC,GADHnT,EAAI,MAAM,EAAGwX,EAAQ,CAAC,EACVe,EAASC,CAAM,EACxCrc,EAAK,OAASgX,GACd,MAAM8F,EAAU9c,EAAK,YACrB,GAAI8c,EAAS,CACX,MAAM3R,EAAYmI,EAAY,IAAIwJ,CAAO,EACzC,GAAI3R,EAAW,CACb,MAAM4R,GAAK5R,EAAU,OAAS,EACxB6R,GAAK7R,EAAU,QAAU,EAC/B,GAAI4R,GAAK,GAAKC,GAAK,EAAG,CACpB,IAAIC,GACAC,GACAC,GAAU,GACd,QAAS5f,GAAI,EAAGA,GAAIyZ,GAAO,OAAS,EAAGzZ,KAAK,CAC1C,MAAM6C,GAAI4W,GAAOzZ,EAAC,EACZ8C,GAAI2W,GAAOzZ,GAAI,CAAC,EAChBmF,GAAS,KAAK,MAAMrC,GAAE,EAAID,GAAE,EAAGC,GAAE,EAAID,GAAE,CAAC,EACxCgd,GAAUpR,GAAM5L,GAAGC,GAAG,IAAU,EAChCgd,GAAStR,GAAM3L,GAAGC,GAAG,IAAU,GACxB+c,IAAW1a,IAAUqa,GAAK,GAAKM,IAAU3a,IAAUsa,GAAK,IAIjEta,GAASya,KACXA,GAAUza,GACVua,IAAY7c,GAAE,EAAIC,GAAE,GAAK,EACzB6c,IAAY9c,GAAE,EAAIC,GAAE,GAAK,EAE7B,CACI4c,KAAa,QAAUC,KAAa,SACtC/R,EAAU,EAAI8R,GACd9R,EAAU,EAAI+R,GAElB,CACF,CACF,CACF,CACF,CACA1f,EAAO0d,GAA2B,2BAA2B,EAG7D,IAAIoC,EAAY,KACZC,GAAa,EACbC,GAAcnR,GACdoR,GAAsCjgB,EAAO,CAAC4C,EAAGC,IAAM0L,GAAM3L,EAAGC,EAAGid,CAAS,GAAKtR,GAAM5L,EAAGC,EAAGid,CAAS,EAAG,qBAAqB,EAClI,SAASI,GAAoChf,EAAO4U,EAAa,CAG/D,MAAMqK,EAAgCngB,EAAO,CAACsJ,EAAM8F,IAAU,CAC5D,MAAM3G,EAAIa,EAAK,GAAK,EACd,EAAIA,EAAK,GAAK,EACd3I,EAAKyO,EAAM,EAAI3G,EACf7H,EAAKwO,EAAM,EAAI,EACrB,IAAI1D,GAAKpC,EAAK,OAAS,GAAK,EACxBqC,GAAKrC,EAAK,QAAU,GAAK,EAC7B,OAAI,KAAK,IAAI1I,CAAE,EAAI8K,EAAI,KAAK,IAAI/K,CAAE,EAAIgL,GAChC/K,EAAK,IACP+K,EAAI,CAACA,GAEA,CAAE,EAAGlD,GAAK7H,IAAO,EAAI,EAAI+K,EAAIhL,EAAKC,GAAK,EAAG,EAAI+K,CAAC,IAEpDhL,EAAK,IACP+K,EAAI,CAACA,GAEA,CAAE,EAAGjD,EAAIiD,EAAG,EAAG,GAAK/K,IAAO,EAAI,EAAI+K,EAAI9K,EAAKD,EAAG,EACxD,EAAG,eAAe,EACZyf,EAAkCpgB,EAAO,CAACwC,EAAM8T,IAAY,CAChE,MAAMzW,EAASsP,GAAwB3M,EAAK,QAAU,CAAA,CAAE,EACxD,GAAI3C,EAAO,OAAS,EAClB,OAEF,MAAMwgB,EAAS/J,EAAU9T,EAAK,MAAQA,EAAK,IACrC8G,EAAO+W,EAASvK,EAAY,IAAIuK,CAAM,EAAI,OAC1CzQ,EAAOtG,EAAOmH,GAAiBnH,CAAI,EAAI,OAC7C,GAAI,CAACA,GAAQ,CAAC+W,GAAU,CAACzQ,EACvB,OAEF,MAAMkH,EAAWR,EAAUzW,EAAO,CAAC,EAAIA,EAAOA,EAAO,OAAS,CAAC,EACzDgY,EAAWvB,EAAUzW,EAAO,CAAC,EAAIA,EAAOA,EAAO,OAAS,CAAC,EACzDygB,EAAWH,EAAc7W,EAAMwN,CAAQ,EAC7C,IAAIyJ,EAAUzJ,EAId,GAHImJ,GAAoBpI,EAAUyI,CAAQ,IACxCC,EAAU1I,GAERtJ,GAAM+R,EAAUC,EAAST,CAAS,EACpC,MAAO,CACL,KAAAtd,EACA,OAAQ,OAAOA,EAAK,IAAM,EAAE,EAC5B,OAAA6d,EACA,QAAA/J,EACA,YAAa,IACb,MAAOgK,EAAS,EAChB,IAAK,KAAK,IAAIA,EAAS,EAAGC,EAAQ,CAAC,EACnC,IAAK,KAAK,IAAID,EAAS,EAAGC,EAAQ,CAAC,EACnC,SAAAD,EACA,QAAAC,EACA,KAAA3Q,CACR,EAEI,GAAIpB,GAAM8R,EAAUC,EAAST,CAAS,EACpC,MAAO,CACL,KAAAtd,EACA,OAAQ,OAAOA,EAAK,IAAM,EAAE,EAC5B,OAAA6d,EACA,QAAA/J,EACA,YAAa,IACb,MAAOgK,EAAS,EAChB,IAAK,KAAK,IAAIA,EAAS,EAAGC,EAAQ,CAAC,EACnC,IAAK,KAAK,IAAID,EAAS,EAAGC,EAAQ,CAAC,EACnC,SAAAD,EACA,QAAAC,EACA,KAAA3Q,CACR,CAGE,EAAG,iBAAiB,EACd4Q,EAAyCxgB,EAAO,CAAC4C,EAAGC,IAAM,KAAK,IAAI,EAAG,KAAK,IAAID,EAAE,IAAKC,EAAE,GAAG,EAAI,KAAK,IAAID,EAAE,IAAKC,EAAE,GAAG,CAAC,EAAG,wBAAwB,EAChJ4d,EAAmCzgB,EAAO,CAAC4C,EAAGC,IAC9CD,EAAE,SAAWC,EAAE,QAAUD,EAAE,cAAgBC,EAAE,YACxC,GAELD,EAAE,cAAgB,KACM,KAAK,IAAIA,EAAE,SAAS,EAAIA,EAAE,KAAK,IAAI,EAAI,GAAK,KAAK,IAAIA,EAAE,SAAS,EAAIA,EAAE,KAAK,KAAK,EAAI,IAClF2L,GAAM3L,EAAE,SAAUC,EAAE,SAAU,CAAC,GAErC,KAAK,IAAID,EAAE,SAAS,EAAIA,EAAE,KAAK,GAAG,EAAI,GAAK,KAAK,IAAIA,EAAE,SAAS,EAAIA,EAAE,KAAK,MAAM,EAAI,IAClF4L,GAAM5L,EAAE,SAAUC,EAAE,SAAU,CAAC,EACxD,kBAAkB,EACf6d,EAA4C1gB,EAAO,CAAC4C,EAAGC,IACvDD,EAAE,SAAWC,EAAE,QAAUD,EAAE,cAAgBC,EAAE,YACxC,GAEM2d,EAAuB5d,EAAGC,CAAC,GACzBkd,IAAc,KAAK,IAAInd,EAAE,MAAQC,EAAE,KAAK,EAAI,GAC5D,2BAA2B,EACxB8d,EAA2C3gB,EAAO,CAAC4C,EAAGC,IAAM,CAChE,GAAID,EAAE,SAAWC,EAAE,QAAUD,EAAE,cAAgBC,EAAE,aAAeD,EAAE,cAAgB,KAAOA,EAAE,UAAYC,EAAE,QACvG,MAAO,GAET,MAAM+d,EAASJ,EAAuB5d,EAAGC,CAAC,EAC1C,GAAI+d,EAASb,GACX,MAAO,GAET,MAAMc,EAAWje,EAAE,KAAK,OAASA,EAAE,KAAK,IACxC,OAAIge,EAASC,GAAYD,EAAS,EAAIC,EAC7B,GAEFJ,EAAiB7d,EAAGC,CAAC,GAAK,KAAK,IAAID,EAAE,MAAQC,EAAE,KAAK,EAAI,EACjE,EAAG,0BAA0B,EACvBie,EAAmC9gB,EAAO,CAACuI,EAAMwY,IAAU,CAC/D,MAAMlhB,EAASsP,GAAwB5G,EAAK,KAAK,QAAU,CAAA,CAAE,EAC7D,GAAI1I,EAAO,OAAS,EAClB,OAEF,MAAMmhB,EAAkBzY,EAAK,cAAgB,IAAM,CAAE,EAAGA,EAAK,SAAS,EAAIwY,EAAO,EAAGxY,EAAK,SAAS,CAAC,EAAK,CAAE,EAAGA,EAAK,SAAS,EAAG,EAAGA,EAAK,SAAS,EAAIwY,CAAK,EAClJE,EAAiB1Y,EAAK,cAAgB,IAAM,CAAE,EAAGA,EAAK,QAAQ,EAAIwY,EAAO,EAAGxY,EAAK,QAAQ,CAAC,EAAK,CAAE,EAAGA,EAAK,QAAQ,EAAG,EAAGA,EAAK,QAAQ,EAAIwY,CAAK,EAUnJ,GAAI,CAT4C/gB,EAAO,IACjD,KAAK,IAAIuI,EAAK,SAAS,EAAIA,EAAK,KAAK,GAAG,EAAI,GAAK,KAAK,IAAIA,EAAK,SAAS,EAAIA,EAAK,KAAK,MAAM,EAAI,EAC3FiG,GAAMwS,EAAiBzY,EAAK,SAAUuX,CAAS,GAAKkB,EAAgB,GAAKzY,EAAK,KAAK,KAAO,GAAKyY,EAAgB,GAAKzY,EAAK,KAAK,MAAQ,EAE3I,KAAK,IAAIA,EAAK,SAAS,EAAIA,EAAK,KAAK,IAAI,EAAI,GAAK,KAAK,IAAIA,EAAK,SAAS,EAAIA,EAAK,KAAK,KAAK,EAAI,EAC3FgG,GAAMyS,EAAiBzY,EAAK,SAAUuX,CAAS,GAAKkB,EAAgB,GAAKzY,EAAK,KAAK,IAAM,GAAKyY,EAAgB,GAAKzY,EAAK,KAAK,OAAS,EAExI,GACN,yBAAyB,EACA,EAC1B,OAEF,GAAIA,EAAK,QAAS,CAChB,MAAM2Y,EAAqBrhB,EAAO,OAAS,GAAKwO,GAAUxO,EAAO,CAAC,EAAG0I,EAAK,QAASuX,CAAS,EACtFqB,EAAOthB,EAAO,MAAMqhB,EAAqB,EAAI,CAAC,EAC9Crd,EAAOsd,EAAK,CAAC,EACnB,OAAItd,GAAQ,CAACoc,GAAoBpc,EAAMod,CAAc,EACnD,OAEK,CAACD,EAAiBC,EAAgB,GAAGE,CAAI,CAClD,CACA,MAAMC,EAAoBvhB,EAAO,OAAS,GAAKwO,GAAUxO,EAAOA,EAAO,OAAS,CAAC,EAAG0I,EAAK,QAASuX,CAAS,EACrGuB,EAASxhB,EAAO,MAAM,EAAGuhB,EAAoB,GAAK,EAAE,EACpDE,EAAWD,EAAOA,EAAO,OAAS,CAAC,EACzC,GAAI,EAAAC,GAAY,CAACrB,GAAoBqB,EAAUL,CAAc,GAG7D,MAAO,CAAC,GAAGI,EAAQJ,EAAgBD,CAAe,CACpD,EAAG,kBAAkB,EACfO,EAAmDvhB,EAAQuI,GAAS,CACxE,MAAM/F,EAAO+F,EAAK,KACZ1I,EAASsP,GAAwB3M,EAAK,QAAU,CAAA,CAAE,EACxD,GAAI3C,EAAO,SAAW,EACpB,MAAO,GAET,MAAM2hB,EAAUhf,EAAK,MACfif,EAAQjf,EAAK,IACb0V,EAAQsJ,EAAU1L,EAAY,IAAI0L,CAAO,EAAI,OAC7CrJ,EAAMsJ,EAAQ3L,EAAY,IAAI2L,CAAK,EAAI,OAC7C,GAAI,CAACvJ,GAAS,CAACC,EACb,MAAO,GAET,MAAMuJ,EAASxJ,EAAM,GAAK,EACpByJ,EAASzJ,EAAM,GAAK,EACpB0J,EAAOzJ,EAAI,GAAK,EAChB0J,EAAO1J,EAAI,GAAK,EAChB,CAACvV,EAAGC,CAAC,EAAIhD,EACf,OAAO2O,GAAM5L,EAAGC,EAAGid,CAAS,GAAK,KAAK,IAAI6B,EAASE,CAAI,EAAI,GAAK,KAAK,IAAIH,EAASE,CAAI,EAAI,GAAKrT,GAAM3L,EAAGC,EAAGid,CAAS,GAAK,KAAK,IAAI4B,EAASE,CAAI,EAAI,GAAK,KAAK,IAAID,EAASE,CAAI,EAAI,CACpL,EAAG,kCAAkC,EAC/BC,EAAS,CACb,GACA,EACA,IACA,GACA,IACA,EACJ,EACE,QAASC,EAAY,EAAGA,EAAY,EAAGA,IAAa,CAClD,MAAMC,EAAQ9gB,EAAM,OAAQsB,GAAS,CAACA,EAAK,YAAY,EAAE,QAASA,GAAS,CAAC4d,EAAgB5d,EAAM,EAAI,EAAG4d,EAAgB5d,EAAM,EAAK,CAAC,CAAC,EAAE,OAAQ+F,GAAS,EAAQA,CAAK,EACtK,IAAI0Z,EAAQ,GACZ,QAASliB,EAAI,EAAGA,EAAIiiB,EAAM,QAAU,CAACC,EAAOliB,IAC1C,QAASuB,EAAIvB,EAAI,EAAGuB,EAAI0gB,EAAM,QAAU,CAACC,EAAO3gB,IAAK,CACnD,MAAM4gB,EAAQF,EAAMjiB,CAAC,EACfoiB,EAASH,EAAM1gB,CAAC,EACtB,GAAI4gB,EAAM,OAASC,EAAO,MAAQ,EAAEzB,EAA0BwB,EAAOC,CAAM,GAAKxB,EAAyBuB,EAAOC,CAAM,GACpH,SAEF,MAAMC,EAAqB,CAAC1B,EAA0BwB,EAAOC,CAAM,EAC7DE,EAAa,CAACH,EAAOC,CAAM,EAAE,KAAK,CAACvf,EAAGC,IAAM,CAChD,MAAMyf,EAAqBf,EAAiC3e,CAAC,EACvD2f,EAAqBhB,EAAiC1e,CAAC,EAC7D,OAAIyf,IAAuBC,EAClB,OAAOD,CAAkB,EAAI,OAAOC,CAAkB,EAExD,CAAO,CAAC1f,EAAE,QAAW,CAAO,CAACD,EAAE,OACxC,CAAC,EACD,UAAW2F,KAAQ8Z,EAAY,CAC7B,UAAWtB,KAASe,EAAQ,CAC1B,MAAM9L,EAAY8K,EAAiBvY,EAAMwY,CAAK,EAC9C,GAAI,CAAC/K,EACH,SAEF,MAAMwM,EAAWpC,EAAgB,CAAE,GAAG7X,EAAK,KAAM,OAAQyN,CAAS,EAAIzN,EAAK,OAAO,EAClF,GAAI,GAACia,GAAYR,EAAM,KACpB9N,GAAUA,EAAM,OAAS3L,EAAK,OAASmY,EAA0B8B,EAAUtO,CAAK,GAAKkO,GAAsBzB,EAAyB6B,EAAUtO,CAAK,EAClK,GAGY,CAAA3L,EAAK,KAAK,OAASyN,EACnBiM,EAAQ,GACR,MACF,CACA,GAAIA,EACF,KAEJ,CACF,CAEF,GAAI,CAACA,EACH,MAEJ,CACF,CACAjiB,EAAOkgB,GAAqC,qCAAqC,EACjF,SAASuC,GAAoCvhB,EAAO4U,EAAa,CAG/D,KAAM,CAAE,cAAAhE,EAAe,eAAgB6L,CAAU,EAAK3L,GACpD8D,EAAY,OAAM,CACtB,EACQ4M,EAAkC1iB,EAAO,CAACwC,EAAMwT,IAAc,CAClE,MAAM2M,EAAWngB,EAAK,MAChBogB,EAAWpgB,EAAK,IAChBqgB,EAAoB7C,GAAYhK,CAAS,EAC/C,GAAI6M,EAAkB,SAAW7M,EAAU,OAAS,EAClD,MAAO,GAET,MAAMqJ,EAAc,CAACsD,EAAUC,CAAQ,EAAE,OAAQjY,GAAO,EAAQA,CAAG,EACnE,UAAWmY,KAAWD,EAIpB,GAHInQ,GAAmBoQ,EAAQ,EAAGA,EAAQ,EAAGhR,EAAeuN,EAAa,EAAO,GAG5E3M,GAAmBoQ,EAAQ,EAAGA,EAAQ,EAAGnF,EAAY,GAAI,EAAO,EAClE,MAAO,GAGX,UAAWzJ,KAAShT,EAAO,CACzB,GAAIgT,IAAU1R,GAAQ0R,EAAM,aAC1B,SAEF,MAAM6O,EAAc7O,EAAM,OAC1B,GAAI,GAAC6O,GAAeA,EAAY,OAAS,IAGzC,UAAWC,KAAoBH,EAC7B,UAAWI,KAAgBjD,GAAY7Q,GAAwB4T,CAAW,CAAC,EAIzE,GAHInU,GAA6BoU,EAAkBC,EAAc,EAAG,GAAKlD,IAGrE1L,GACF2O,EAAiB,EACjBA,EAAiB,EACjBC,EAAa,EACbA,EAAa,EACbnD,CACZ,EACY,MAAO,GAIf,CACA,MAAO,EACT,EAAG,iBAAiB,EACdoD,EAAgCljB,EAAO,CAACH,EAAQE,IAAM,CAC1D,GAAIA,EAAI,GAAKF,EAAO,OAClB,OAEF,MAAM0P,EAAK1P,EAAOE,CAAC,EACbyP,EAAK3P,EAAOE,EAAI,CAAC,EACjB0P,EAAK5P,EAAOE,EAAI,CAAC,EACjB2P,EAAK7P,EAAOE,EAAI,CAAC,EACjBojB,EAAKtjB,EAAOE,EAAI,CAAC,EACjBqjB,EAAyB3U,GAAoBc,EAAIC,CAAE,GAAKd,GAAkBc,EAAIC,CAAE,GAAKhB,GAAoBgB,EAAIC,CAAE,GAAKhB,GAAkBgB,EAAIyT,CAAE,GAAK5U,GAAMgB,EAAIG,EAAIoQ,CAAS,GAAKvR,GAAMgB,EAAI4T,EAAIrD,CAAS,GAAKvR,GAAMiB,EAAIC,EAAIqQ,CAAS,IAAMtQ,EAAG,EAAID,EAAG,IAAMG,EAAG,EAAID,EAAG,GAAK,EACrQ4T,EAA2B3U,GAAkBa,EAAIC,CAAE,GAAKf,GAAoBe,EAAIC,CAAE,GAAKf,GAAkBe,EAAIC,CAAE,GAAKjB,GAAoBiB,EAAIyT,CAAE,GAAK3U,GAAMe,EAAIG,EAAIoQ,CAAS,GAAKtR,GAAMe,EAAI4T,EAAIrD,CAAS,GAAKtR,GAAMgB,EAAIC,EAAIqQ,CAAS,IAAMtQ,EAAG,EAAID,EAAG,IAAMG,EAAG,EAAID,EAAG,GAAK,EAC7Q,GAAI2T,GAA0BC,EAC5B,OAAOlU,GAAwB,CAAC,GAAGtP,EAAO,MAAM,EAAGE,EAAI,CAAC,EAAGojB,EAAI,GAAGtjB,EAAO,MAAME,EAAI,CAAC,CAAC,CAAC,EAExF,GAAIA,EAAI,GAAKF,EAAO,OAClB,OAEF,MAAMyjB,EAAKzjB,EAAOE,EAAI,CAAC,EACjBwjB,EAAiB7U,GAAkBa,EAAIC,CAAE,GAAKf,GAAoBe,EAAIC,CAAE,GAAKf,GAAkBe,EAAIC,CAAE,GAAKjB,GAAoBiB,EAAIyT,CAAE,GAAKzU,GAAkByU,EAAIG,CAAE,GAAK/U,GAAMgB,EAAI4T,EAAIrD,CAAS,GAAKvR,GAAMgB,EAAI+T,EAAIxD,CAAS,GAAKvR,GAAMkB,EAAIC,EAAIoQ,CAAS,IAAMrQ,EAAG,EAAID,EAAG,IAAM2T,EAAG,EAAIzT,EAAG,GAAK,EAC1R8T,EAAmB/U,GAAoBc,EAAIC,CAAE,GAAKd,GAAkBc,EAAIC,CAAE,GAAKhB,GAAoBgB,EAAIC,CAAE,GAAKhB,GAAkBgB,EAAIyT,CAAE,GAAK1U,GAAoB0U,EAAIG,CAAE,GAAK9U,GAAMe,EAAI4T,EAAIrD,CAAS,GAAKtR,GAAMe,EAAI+T,EAAIxD,CAAS,GAAKtR,GAAMiB,EAAIC,EAAIoQ,CAAS,IAAMrQ,EAAG,EAAID,EAAG,IAAM2T,EAAG,EAAIzT,EAAG,GAAK,EACpS,GAAI,GAAC6T,GAAkB,CAACC,GAGxB,OAAOrU,GAAwB,CAAC,GAAGtP,EAAO,MAAM,EAAGE,EAAI,CAAC,EAAGujB,EAAI,GAAGzjB,EAAO,MAAME,EAAI,CAAC,CAAC,CAAC,CACxF,EAAG,eAAe,EAClB,QAASgiB,EAAY,EAAGA,EAAY,EAAgBA,IAAa,CAC/D,IAAIE,EAAQ,GACZ,UAAWzf,KAAQtB,EAAO,CACxB,GAAIsB,EAAK,aACP,SAEF,MAAM3C,EAASsP,GAAwB3M,EAAK,QAAU,CAAA,CAAE,EACxD,QAASzC,EAAI,EAAGA,GAAKF,EAAO,OAAS,EAAGE,IAAK,CAC3C,MAAMiW,EAAYkN,EAAcrjB,EAAQE,CAAC,EACzC,GAAI,GAACiW,GAAa,CAAC0M,EAAgBlgB,EAAMwT,CAAS,GAGlD,CAAAxT,EAAK,OAASwT,EACdiM,EAAQ,GACR,MACF,CACA,GAAIA,EACF,KAEJ,CACA,GAAI,CAACA,EACH,MAEJ,CACF,CACAjiB,EAAOyiB,GAAqC,qCAAqC,EACjF,SAASgB,GAAiCviB,EAAO4U,EAAa,CAI5D,KAAM,CAAE,cAAAhE,EAAe,eAAgB6L,CAAU,EAAK3L,GACpD8D,EAAY,OAAM,CACtB,EACQ4N,EAAexiB,EAAM,OAAQsB,GAAS,CAACA,EAAK,YAAY,EACxDmhB,EAA4B3jB,EAAO,CAACwC,EAAMohB,EAAiBC,IAAgB1U,GAC/E3M,IAASohB,EAAkBC,GAAe,CAAA,EAAKrhB,EAAK,QAAU,CAAA,CAClE,EAAK,WAAW,EACRshB,EAAsC9jB,EAAO,CAAC4jB,EAAiBC,IAAgB,CACnF,IAAInX,EAAQ,EACZ,QAAS3M,EAAI,EAAGA,EAAI2jB,EAAa,OAAQ3jB,IAAK,CAC5C,MAAMgkB,EAAgB/D,GAAY2D,EAAUD,EAAa3jB,CAAC,EAAG6jB,EAAiBC,CAAW,CAAC,EAC1F,QAASviB,EAAIvB,EAAI,EAAGuB,EAAIoiB,EAAa,OAAQpiB,IAAK,CAChD,MAAM0iB,EAAiBhE,GACrB2D,EAAUD,EAAapiB,CAAC,EAAGsiB,EAAiBC,CAAW,CACjE,EACQ,UAAWI,KAAgBF,EACzB,UAAWG,KAAiBF,EACtB3P,GACF4P,EAAa,EACbA,EAAa,EACbC,EAAc,EACdA,EAAc,EACdpE,CACd,GACcpT,GAIR,CACF,CACA,OAAOA,CACT,EAAG,qBAAqB,EAClByX,EAA6BnkB,EAAQH,GAAW,CACpD,MAAMC,EAAWkgB,GAAYngB,CAAM,EACnC,GAAIC,EAAS,SAAW,EACtB,OAEF,MAAMskB,EAAStkB,EAAS,CAAC,EACzB,GAAI,EAAAA,EAAS,CAAC,EAAE,aAAeskB,EAAO,YAActkB,EAAS,CAAC,EAAE,aAAeskB,EAAO,YAGtF,MAAO,CACL,MAAOA,EAAO,MACd,WAAYA,EAAO,WACnB,SAAUA,EAAO,SACjB,QAASA,CACf,CACE,EAAG,YAAY,EACTC,EAAmCrkB,EAAO,CAACwC,EAAM8hB,IAAS,CAC9D,MAAMjF,EAAc,CAAC7c,EAAK,MAAOA,EAAK,GAAG,EAAE,OACxCmI,GAAO,EAAQA,CACtB,EACI,OAAOmH,EAAc,OAAQI,GAAU,CACrC,GAAImN,EAAY,SAASnN,EAAM,EAAE,EAC/B,MAAO,GAET,MAAMtC,EAAOsC,EAAM,KACnB,OAAIoS,EAAK,WACU3V,GAAc2V,EAAK,EAAE,EAAGA,EAAK,EAAE,EAAG1U,EAAK,KAAMA,EAAK,KAAK,GACrDmQ,IAAcuE,EAAK,EAAE,GAAK1U,EAAK,IAAM,GAAU0U,EAAK,EAAE,GAAK1U,EAAK,OAAS,EAE7EjB,GAAc2V,EAAK,EAAE,EAAGA,EAAK,EAAE,EAAG1U,EAAK,IAAKA,EAAK,MAAM,GACrDmQ,IAAcuE,EAAK,EAAE,GAAK1U,EAAK,KAAO,GAAU0U,EAAK,EAAE,GAAK1U,EAAK,MAAQ,CAC9F,CAAC,CACH,EAAG,kBAAkB,EACf2U,EAAwCvkB,EAAO,CAACH,EAAQykB,EAAME,IAAU,CAC5E,MAAMxO,EAAYnW,EAAO,IAAKuP,IAAW,CAAE,GAAGA,CAAK,EAAG,EACtD,GAAIkV,EAAK,WACPtO,EAAUsO,EAAK,KAAK,EAAE,EAAIE,EAC1BxO,EAAUsO,EAAK,MAAQ,CAAC,EAAE,EAAIE,UACrBF,EAAK,SACdtO,EAAUsO,EAAK,KAAK,EAAE,EAAIE,EAC1BxO,EAAUsO,EAAK,MAAQ,CAAC,EAAE,EAAIE,MAE9B,QAEF,MAAMC,EAAalP,GAAiBpG,GAAwB6G,CAAS,CAAC,EACtE,OAAOgK,GAAYyE,CAAU,EAAE,SAAWA,EAAW,OAAS,EAAIA,EAAa,MACjF,EAAG,uBAAuB,EACpB/B,EAAkC1iB,EAAO,CAACwC,EAAMwT,EAAW0O,IAAqB,CACpF,MAAMrF,EAAc,CAAC7c,EAAK,MAAOA,EAAK,GAAG,EAAE,OACxCmI,GAAO,EAAQA,CACtB,EACUkY,EAAoB7C,GAAYhK,CAAS,EAC/C,GAAI6M,EAAkB,SAAW7M,EAAU,OAAS,EAClD,MAAO,GAET,UAAW8M,KAAWD,EAIpB,GAHInQ,GAAmBoQ,EAAQ,EAAGA,EAAQ,EAAGhR,EAAeuN,EAAa,EAAO,GAG5E3M,GAAmBoQ,EAAQ,EAAGA,EAAQ,EAAGnF,EAAY,CAAA,EAAI,EAAO,EAClE,MAAO,GAGX,UAAWzJ,KAASwP,EAClB,GAAIxP,IAAU1R,GAGd,UAAWwgB,KAAoBH,EAC7B,UAAWI,KAAgBjD,GAAY2D,EAAUzP,CAAK,CAAC,EACrD,GAAItF,GAA6BoU,EAAkBC,EAAc,EAAG,GAAKlD,GACvE,MAAO,GAKf,OAAO+D,EAAoBthB,EAAMwT,CAAS,GAAK0O,CACjD,EAAG,iBAAiB,EACpB,QAAS3C,EAAY,EAAGA,EAAY,EAAgBA,IAAa,CAC/D,MAAM2C,EAAmBZ,EAAmB,EAC5C,IAAI7B,EAAQ,GACZ,UAAWzf,KAAQkhB,EAAc,CAC/B,MAAM7jB,EAAS8jB,EAAUnhB,CAAI,EACvB8hB,EAAOH,EAAWtkB,CAAM,EAC9B,GAAI,CAACykB,EACH,SAEF,MAAMK,EAAWN,EAAiB7hB,EAAM8hB,EAAK,OAAO,EACpD,GAAIK,EAAS,SAAW,EACtB,SAEF,MAAMxa,EAASma,EAAK,WAAa,CAC/B,KAAK,IAAI,GAAGK,EAAS,IAAKzS,GAAUA,EAAM,KAAK,GAAG,CAAC,EAAI,GACvD,KAAK,IAAI,GAAGyS,EAAS,IAAKzS,GAAUA,EAAM,KAAK,MAAM,CAAC,EAAI,EAClE,EAAU,CACF,KAAK,IAAI,GAAGyS,EAAS,IAAKzS,GAAUA,EAAM,KAAK,IAAI,CAAC,EAAI,GACxD,KAAK,IAAI,GAAGyS,EAAS,IAAKzS,GAAUA,EAAM,KAAK,KAAK,CAAC,EAAI,EACjE,EACM,UAAWsS,KAASra,EAAQ,CAC1B,MAAM6L,EAAYuO,EAAsB1kB,EAAQykB,EAAK,QAASE,CAAK,EACnE,GAAI,GAACxO,GAAa,CAAC0M,EAAgBlgB,EAAMwT,EAAW0O,CAAgB,GAGpE,CAAAliB,EAAK,OAASwT,EACdiM,EAAQ,GACR,MACF,CACA,GAAIA,EACF,KAEJ,CACA,GAAI,CAACA,EACH,MAEJ,CACF,CACAjiB,EAAOyjB,GAAkC,kCAAkC,EAC3E,SAASmB,GAAgC1jB,EAAO4U,EAAa,CAE3D,MAAM+O,EAAiC7kB,EAAQsJ,GAAS,CACtD,MAAMsG,EAAOtG,EAAK,eAClB,GAAI,GAACsG,GAAQ,OAAOA,EAAK,MAAS,UAAY,OAAOA,EAAK,OAAU,UAAY,OAAOA,EAAK,KAAQ,UAAY,OAAOA,EAAK,QAAW,UAAY,CAAC,OAAO,SAASA,EAAK,IAAI,GAAK,CAAC,OAAO,SAASA,EAAK,KAAK,GAAK,CAAC,OAAO,SAASA,EAAK,GAAG,GAAK,CAAC,OAAO,SAASA,EAAK,MAAM,GAAKA,EAAK,OAASA,EAAK,MAAQA,EAAK,QAAUA,EAAK,KAGhU,MAAO,CAAE,KAAMA,EAAK,KAAM,MAAOA,EAAK,MAAO,IAAKA,EAAK,IAAK,OAAQA,EAAK,MAAM,CACjF,EAAG,gBAAgB,EACbkV,EAAkC9kB,EAAQsJ,GAAS,CACvD,GAAI,CAACA,EAAK,SAAWA,EAAK,SACxB,OAEF,MAAMyb,EAAezb,EAAK,UACpBF,EAAY,OAAO2b,GAAiB,SAAWA,EAAa,YAAW,EAAK,GAClF,GAAI3b,IAAc,MAAQA,IAAc,MAAQA,IAAc,KAC5D,OAEF,MAAMwG,EAAOiV,EAAevb,CAAI,EAC1BZ,EAAIY,EAAK,EACTV,EAASU,EAAK,OACpB,GAAI,CAACsG,GAAQ,OAAOlH,GAAM,UAAY,OAAOE,GAAW,UAAY,CAAC,OAAO,SAASF,CAAC,GAAK,CAAC,OAAO,SAASE,CAAM,GAAKA,GAAU,EAC/H,OAEF,MAAMoc,EAAapV,EAAK,MAAQA,EAAK,KAC/B5G,EAAc4G,EAAK,OAASA,EAAK,IACvC,GAAI,EAAA5G,GAAe,GAAKgc,EAAahc,GAGrC,MAAO,CAAE,KAAAM,EAAM,KAAAsG,CAAI,CACrB,EAAG,iBAAiB,EACdqV,EAAmDjlB,EAAO,CAAC8iB,EAASlT,IAAS,CACjF,GAAI,CAACkT,EAAQ,WACX,MAAO,GAET,MAAMpa,EAAIoa,EAAQ,EAAE,EACpB,OAAIpa,GAAKkH,EAAK,IAAMkQ,GAAapX,GAAKkH,EAAK,OAASkQ,EAC3C,GAEFnR,GAAcmU,EAAQ,EAAE,EAAGA,EAAQ,EAAE,EAAGlT,EAAK,KAAMA,EAAK,KAAK,GAAKmQ,EAC3E,EAAG,kCAAkC,EAC/BiC,EAAQ,CAAC,GAAGlM,EAAY,OAAM,CAAE,EAAE,IAAIgP,CAAe,EAAE,OAAQvc,GAAS,EAAQA,CAAK,EAC3F,GAAIyZ,EAAM,SAAW,EACnB,OAEF,IAAIkD,EAAW,EACf,UAAW1iB,KAAQtB,EAAO,CACxB,GAAIsB,EAAK,aACP,SAEF,MAAM3C,EAASsP,GAAwB3M,EAAK,QAAU,CAAA,CAAE,EACxD,UAAWsgB,KAAW9C,GAAYngB,CAAM,EACtC,UAAW0I,KAAQyZ,EACZiD,EAAiCnC,EAASva,EAAK,IAAI,IAGxD2c,EAAW,KAAK,IAAIA,EAAU3c,EAAK,KAAK,OAASua,EAAQ,EAAE,EAAI,CAAS,EAG9E,CACA,GAAI,EAAAoC,GAAYpF,GAGhB,UAAWvX,KAAQyZ,EAAO,CACxB,MAAMtZ,EAAIH,EAAK,KAAK,EACdK,EAASL,EAAK,KAAK,OACrB,OAAOG,GAAM,UAAY,OAAOE,GAAW,UAAY,CAAC,OAAO,SAASF,CAAC,GAAK,CAAC,OAAO,SAASE,CAAM,GAAKA,GAAU,IAGxHL,EAAK,KAAK,EAAIG,EAAIwc,EAAW,EAC7B3c,EAAK,KAAK,OAASK,EAASsc,EAC5B3c,EAAK,KAAK,eAAiB,CACzB,GAAGA,EAAK,KACR,IAAKA,EAAK,KAAK,IAAM2c,EACrB,OAAQ3c,EAAK,KAAK,OAAS2c,CACjC,EACE,CACF,CACAllB,EAAO4kB,GAAiC,iCAAiC,EACzE,SAASO,GAAmCjkB,EAAO4U,EAAa,CAE9D,MAAM+O,EAAiC7kB,EAAQsJ,GAAS,CACtD,MAAMsG,EAAOtG,EAAK,eAClB,GAAI,GAACsG,GAAQ,OAAOA,EAAK,MAAS,UAAY,OAAOA,EAAK,OAAU,UAAY,OAAOA,EAAK,KAAQ,UAAY,OAAOA,EAAK,QAAW,UAAY,CAAC,OAAO,SAASA,EAAK,IAAI,GAAK,CAAC,OAAO,SAASA,EAAK,KAAK,GAAK,CAAC,OAAO,SAASA,EAAK,GAAG,GAAK,CAAC,OAAO,SAASA,EAAK,MAAM,GAAKA,EAAK,OAASA,EAAK,MAAQA,EAAK,QAAUA,EAAK,KAGhU,MAAO,CAAE,KAAMA,EAAK,KAAM,MAAOA,EAAK,MAAO,IAAKA,EAAK,IAAK,OAAQA,EAAK,MAAM,CACjF,EAAG,gBAAgB,EACbwV,EAAmCplB,EAAQsJ,GAAS,CAKxD,GAJI,CAACA,EAAK,SAAWA,EAAK,UAGLA,EAAK,YACL,KACnB,OAEF,MAAMsG,EAAOiV,EAAevb,CAAI,EAC1Bb,EAAIa,EAAK,EACTX,EAAQW,EAAK,MACnB,GAAI,CAACsG,GAAQ,OAAOnH,GAAM,UAAY,OAAOE,GAAU,UAAY,CAAC,OAAO,SAASF,CAAC,GAAK,CAAC,OAAO,SAASE,CAAK,GAAKA,GAAS,EAC5H,OAEF,MAAMqc,EAAapV,EAAK,MAAQA,EAAK,KAC/B5G,EAAc4G,EAAK,OAASA,EAAK,IACvC,GAAI,EAAAoV,GAAc,GAAKhc,EAAcgc,GAGrC,MAAO,CAAE,KAAA1b,EAAM,KAAAsG,CAAI,CACrB,EAAG,kBAAkB,EACfyV,EAAiDrlB,EAAO,CAAC8iB,EAASlT,IAAS,CAC/E,GAAI,CAACkT,EAAQ,SACX,MAAO,GAET,MAAM,EAAIA,EAAQ,EAAE,EACpB,OAAI,GAAKlT,EAAK,KAAOkQ,GAAa,GAAKlQ,EAAK,MAAQkQ,EAC3C,GAEFnR,GAAcmU,EAAQ,EAAE,EAAGA,EAAQ,EAAE,EAAGlT,EAAK,IAAKA,EAAK,MAAM,GAAKmQ,EAC3E,EAAG,gCAAgC,EAC7BkF,EAAmDjlB,EAAO,CAAC8iB,EAASlT,IAAS,CACjF,GAAI,CAACkT,EAAQ,WACX,MAAO,GAET,MAAMpa,EAAIoa,EAAQ,EAAE,EACpB,OAAIpa,GAAKkH,EAAK,IAAMkQ,GAAapX,GAAKkH,EAAK,OAASkQ,EAC3C,GAEFnR,GAAcmU,EAAQ,EAAE,EAAGA,EAAQ,EAAE,EAAGlT,EAAK,KAAMA,EAAK,KAAK,GAAKmQ,EAC3E,EAAG,kCAAkC,EAC/BiC,EAAQ,CAAC,GAAGlM,EAAY,OAAM,CAAE,EAAE,IAAIsP,CAAgB,EAAE,OAAQ7c,GAAS,EAAQA,CAAK,EAC5F,GAAIyZ,EAAM,SAAW,EACnB,OAEF,IAAIsD,EAAY,EAChB,UAAW9iB,KAAQtB,EAAO,CACxB,GAAIsB,EAAK,aACP,SAEF,MAAM3C,EAASsP,GAAwB3M,EAAK,QAAU,CAAA,CAAE,EACxD,UAAWsgB,KAAW9C,GAAYngB,CAAM,EACtC,UAAW0I,KAAQyZ,EACjB,GAAIqD,EAA+BvC,EAASva,EAAK,IAAI,EACnD+c,EAAY,KAAK,IAAIA,EAAW/c,EAAK,KAAK,MAAQua,EAAQ,EAAE,EAAI,CAAS,UAChEmC,EAAiCnC,EAASva,EAAK,IAAI,EAAG,CAC/D,MAAMgd,EAAc,KAAK,IAAIzC,EAAQ,EAAE,EAAGA,EAAQ,EAAE,CAAC,EACrDwC,EAAY,KAAK,IAAIA,EAAW/c,EAAK,KAAK,MAAQgd,EAAc,CAAS,CAC3E,CAGN,CACA,GAAI,EAAAD,GAAaxF,GAGjB,UAAWvX,KAAQyZ,EAAO,CACxB,MAAMvZ,EAAIF,EAAK,KAAK,EACdI,EAAQJ,EAAK,KAAK,MACpB,OAAOE,GAAM,UAAY,OAAOE,GAAU,UAAY,CAAC,OAAO,SAASF,CAAC,GAAK,CAAC,OAAO,SAASE,CAAK,GAAKA,GAAS,IAGrHJ,EAAK,KAAK,EAAIE,EAAI6c,EAAY,EAC9B/c,EAAK,KAAK,MAAQI,EAAQ2c,EAC1B/c,EAAK,KAAK,eAAiB,CACzB,GAAGA,EAAK,KACR,KAAMA,EAAK,KAAK,KAAO+c,EACvB,MAAO/c,EAAK,KAAK,MAAQ+c,CAC/B,EACE,CACF,CACAtlB,EAAOmlB,GAAoC,oCAAoC,EAC/E,SAASK,GAA8CtkB,EAAO4U,EAAa,CAGzE,KAAM,CAAE,cAAAhE,CAAa,EAAKE,GAAuB8D,EAAY,OAAM,CAAE,EAC/D4N,EAAexiB,EAAM,OAAQsB,GAAS,CAACA,EAAK,YAAY,EACxDijB,EAAuCzlB,EAAO,CAACwC,EAAMkjB,EAA+B,IAAI,MAAUvW,GACtGuW,EAAa,IAAIljB,CAAI,GAAKA,EAAK,QAAU,CAAA,CAC7C,EAAK,sBAAsB,EACnBmjB,EAAgC3lB,EAAO,CAAC0lB,EAA+B,IAAI,MAAU,CACzF,IAAIhZ,EAAQ,EACZ,QAAS3M,EAAI,EAAGA,EAAI2jB,EAAa,OAAQ3jB,IAAK,CAC5C,MAAMgkB,EAAgB/D,GAAYyF,EAAqB/B,EAAa3jB,CAAC,EAAG2lB,CAAY,CAAC,EACrF,QAASpkB,EAAIvB,EAAI,EAAGuB,EAAIoiB,EAAa,OAAQpiB,IAAK,CAChD,MAAM0iB,EAAiBhE,GAAYyF,EAAqB/B,EAAapiB,CAAC,EAAGokB,CAAY,CAAC,EACtF,UAAWzB,KAAgBF,EACzB,UAAWG,KAAiBF,EACtB3P,GACF4P,EAAa,EACbA,EAAa,EACbC,EAAc,EACdA,EAAc,EACdpE,CACd,GACcpT,GAIR,CACF,CACA,OAAOA,CACT,EAAG,eAAe,EACZkZ,EAA6B5lB,EAAO,CAAC0lB,EAA+B,IAAI,MAAUhC,EAAa,OACnG,CAACmC,EAAKrjB,IAASqjB,EAAM5W,GAAqBwW,EAAqBjjB,EAAMkjB,CAAY,CAAC,EAClF,CACJ,EAAK,YAAY,EACTI,EAAkC9lB,EAAQwC,GAAS,CACvD,MAAM3C,EAAS4lB,EAAqBjjB,CAAI,EACxC,GAAI3C,EAAO,OAAS,EAClB,OAEF,MAAMkmB,EAAYlmB,EAAOA,EAAO,OAAS,CAAC,EACpCmmB,EAAWnmB,EAAOA,EAAO,OAAS,CAAC,EACzC,GAAI,GAAC4O,GAAoBsX,EAAWC,EAAUlG,CAAS,GAAK,CAACpR,GAAkBqX,EAAWC,EAAUlG,CAAS,GAG7G,MAAO,CAAE,UAAAiG,EAAW,SAAAC,CAAQ,CAC9B,EAAG,iBAAiB,EACdC,EAA+CjmB,EAAO,CAACwC,EAAM0jB,IAAS,CAC1E,MAAMrmB,EAAS4lB,EAAqBjjB,CAAI,EACxC,GAAI3C,EAAO,OAAS,EAClB,OAEF,MAAMqY,EAAQrY,EAAO,CAAC,EAChBsmB,EAAYtmB,EAAO,CAAC,EAC1B,IAAIumB,EACJ,GAAI3X,GAAoByJ,EAAOiO,EAAWrG,CAAS,EACjDsG,EAAY,CAAE,EAAGD,EAAU,EAAG,EAAGD,EAAK,UAAU,CAAC,UACxCxX,GAAkBwJ,EAAOiO,EAAWrG,CAAS,EACtDsG,EAAY,CAAE,EAAGF,EAAK,UAAU,EAAG,EAAGC,EAAU,CAAC,MAEjD,QAEF,MAAMnQ,EAAYT,GAChBpG,GAAwB,CAAC+I,EAAOiO,EAAWC,EAAWF,EAAK,UAAWA,EAAK,QAAQ,CAAC,CAC1F,EACI,OAAOlG,GAAYhK,CAAS,EAAE,SAAWA,EAAU,OAAS,EAAIA,EAAY,MAC9E,EAAG,8BAA8B,EAC3BqQ,EAAiCrmB,EAAO,CAACwC,EAAM8jB,IAAS,CAC5D,MAAMjH,EAAc,CAAC7c,EAAK,MAAOA,EAAK,GAAG,EAAE,OACxCmI,GAAO,EAAQA,CACtB,EACI,UAAWmY,KAAW9C,GAAYsG,CAAI,EACpC,GAAI5T,GAAmBoQ,EAAQ,EAAGA,EAAQ,EAAGhR,EAAeuN,EAAa,EAAO,EAC9E,MAAO,GAGX,MAAO,EACT,EAAG,gBAAgB,EACbkH,EAAqCvmB,EAAO,CAACwC,EAAM8jB,EAAMZ,IAAiB,CAC9E,UAAWxR,KAASwP,EAClB,GAAIxP,IAAU1R,GAGd,UAAWwgB,KAAoBhD,GAAYsG,CAAI,EAC7C,UAAWrD,KAAgBjD,GAAYyF,EAAqBvR,EAAOwR,CAAY,CAAC,EAC9E,GAAI9W,GAA6BoU,EAAkBC,EAAc,EAAG,GAAKlD,GACvE,MAAO,GAKf,MAAO,EACT,EAAG,oBAAoB,EACjB2C,EAAkC1iB,EAAO,CAACwC,EAAM8jB,EAAMZ,IAAiB,CAACW,EAAe7jB,EAAM8jB,CAAI,GAAK,CAACC,EAAmB/jB,EAAM8jB,EAAMZ,CAAY,EAAG,iBAAiB,EACtKc,EAAqCxmB,EAAO,IAAM,CACtD,MAAM8O,EAAyB,IAAI,IACnC,UAAWtM,KAAQkhB,EAAc,CAC/B,MAAMnR,EAAQ/P,EAAK,IAKnB,GAJI,CAAC+P,GAAS,CAACuD,EAAY,IAAIvD,CAAK,GAGrBkT,EAAqBjjB,CAAI,EAC7B,OAAS,EAClB,SAEF,MAAMkZ,EAAS5M,EAAO,IAAIyD,CAAK,GAAK,CAAA,EACpCmJ,EAAO,KAAKlZ,CAAI,EAChBsM,EAAO,IAAIyD,EAAOmJ,CAAM,CAC1B,CACA,OAAO5M,CACT,EAAG,oBAAoB,EACvB,QAASiT,EAAY,EAAGA,EAAY,EAAgBA,IAAa,CAC/D,MAAM2C,EAAmBiB,EAAa,EACtC,GAAIjB,IAAqB,EACvB,OAEF,MAAM+B,EAAeb,EAAU,EAC/B,IAAIc,EACAC,EAAgBjC,EAChBkC,EAAYH,EAChB,UAAWI,KAAoBL,EAAkB,EAAG,OAAM,EACxD,QAASzmB,EAAI,EAAGA,EAAI8mB,EAAiB,OAAQ9mB,IAC3C,QAASuB,EAAIvB,EAAI,EAAGuB,EAAIulB,EAAiB,OAAQvlB,IAAK,CACpD,MAAM4gB,EAAQ2E,EAAiB9mB,CAAC,EAC1BoiB,EAAS0E,EAAiBvlB,CAAC,EAC3BwlB,EAAYhB,EAAgB5D,CAAK,EACjC6E,EAAajB,EAAgB3D,CAAM,EACzC,GAAI,CAAC2E,GAAa,CAACC,EACjB,SAEF,MAAMC,EAAiBf,EAA6B/D,EAAO6E,CAAU,EAC/DE,EAAkBhB,EAA6B9D,EAAQ2E,CAAS,EACtE,GAAI,CAACE,GAAkB,CAACC,EACtB,SAEF,MAAMvB,EAA+B,IAAI,IAAI,CAC3C,CAACxD,EAAO8E,CAAc,EACtB,CAAC7E,EAAQ8E,CAAe,CACpC,CAAW,EACD,GAAI,CAACvE,EAAgBR,EAAO8E,EAAgBtB,CAAY,GAAK,CAAChD,EAAgBP,EAAQ8E,EAAiBvB,CAAY,EACjH,SAEF,MAAMwB,EAAqBvB,EAAcD,CAAY,EAC/CyB,EAAiBvB,EAAWF,CAAY,EAC1CwB,GAAsBxC,GAGtBwC,EAAqBP,GAAiBO,IAAuBP,GAAiBQ,GAAkBP,IAGpGF,EAAmBhB,EACnBiB,EAAgBO,EAChBN,EAAYO,EACd,CAGJ,GAAI,CAACT,EACH,OAEF,SAAW,CAAClkB,EAAM3C,CAAM,IAAK6mB,EAC3BlkB,EAAK,OAAS3C,CAElB,CACF,CACAG,EAAOwlB,GAA+C,+CAA+C,EACrG,SAAS4B,GAAqClmB,EAAO4U,EAAa,CAKhE,KAAM,CAAE,cAAAhE,EAAe,eAAgB6L,CAAU,EAAK3L,GACpD8D,EAAY,OAAM,CACtB,EACQ4N,EAAexiB,EAAM,OAAQsB,GAAS,CAACA,EAAK,YAAY,EACxDijB,EAAuCzlB,EAAO,CAACwC,EAAMkjB,EAA+B,IAAI,MAAUvW,GACtGuW,EAAa,IAAIljB,CAAI,GAAKA,EAAK,QAAU,CAAA,CAC7C,EAAK,sBAAsB,EACnBshB,EAAsC9jB,EAAO,CAAC0lB,EAA+B,IAAI,MAAU,CAC/F,IAAIhZ,EAAQ,EACZ,QAAS3M,EAAI,EAAGA,EAAI2jB,EAAa,OAAQ3jB,IAAK,CAC5C,MAAMgkB,EAAgB/D,GAAYyF,EAAqB/B,EAAa3jB,CAAC,EAAG2lB,CAAY,CAAC,EACrF,QAASpkB,EAAIvB,EAAI,EAAGuB,EAAIoiB,EAAa,OAAQpiB,IAAK,CAChD,MAAM0iB,EAAiBhE,GAAYyF,EAAqB/B,EAAapiB,CAAC,EAAGokB,CAAY,CAAC,EACtF,UAAWzB,KAAgBF,EACzB,UAAWG,KAAiBF,EACtB3P,GACF4P,EAAa,EACbA,EAAa,EACbC,EAAc,EACdA,EAAc,EACdpE,CACd,GACcpT,GAIR,CACF,CACA,OAAOA,CACT,EAAG,qBAAqB,EAClBkZ,EAA6B5lB,EAAO,CAAC0lB,EAA+B,IAAI,MAAUhC,EAAa,OACnG,CAACmC,EAAKrjB,IAASqjB,EAAM5W,GAAqBwW,EAAqBjjB,EAAMkjB,CAAY,CAAC,EAClF,CACJ,EAAK,YAAY,EACT2B,EAAmCrnB,EAAQwC,GAAS,CACxD,MAAM8P,EAAQ9P,EAAK,MACb+P,EAAQ/P,EAAK,IACb8kB,EAAUhV,EAAQwD,EAAY,IAAIxD,CAAK,EAAI,OAC3CiV,EAAUhV,EAAQuD,EAAY,IAAIvD,CAAK,EAAI,OAC3C5I,EAAM2d,EAAU7W,GAAiB6W,CAAO,EAAI,OAC5C1d,EAAM2d,EAAU9W,GAAiB8W,CAAO,EAAI,OAClD,OAAO5d,GAAOC,EAAM,CAAE,IAAAD,EAAK,IAAAC,CAAG,EAAK,MACrC,EAAG,kBAAkB,EACf4d,EAAyCxnB,EAAO,CAACwC,EAAM3C,EAAQijB,IAAY,CAC/E,GAAIA,EAAQ,OAAS,GAAKA,EAAQ,MAAQ,GAAKjjB,EAAO,OAAS,EAC7D,OAEF,MAAM4nB,EAAgBJ,EAAiB7kB,CAAI,EAC3C,GAAKilB,EAGL,IAAI3E,EAAQ,SAAU,CACpB,MAAM0B,EAAQ1B,EAAQ,EAAE,EAClB4E,EAAY,KAAK,IAAID,EAAc,IAAI,KAAMA,EAAc,IAAI,IAAI,EACnEE,EAAa,KAAK,IAAIF,EAAc,IAAI,MAAOA,EAAc,IAAI,KAAK,EACtE9W,EAAO6T,EAAQkD,EAAY5H,EAAY,OAAS0E,EAAQmD,EAAa7H,EAAY,QAAU,OACjG,OAAKnP,EAGE,CACL,KAAAnO,EACA,OAAA3C,EACA,aAAcijB,EAAQ,MACtB,KAAM,WACN,KAAAnS,EACA,MAAA6T,EACA,IAAK,KAAK,IAAI1B,EAAQ,EAAE,EAAGA,EAAQ,EAAE,CAAC,EACtC,IAAK,KAAK,IAAIA,EAAQ,EAAE,EAAGA,EAAQ,EAAE,CAAC,CAC9C,EAXQ,MAYJ,CACA,GAAIA,EAAQ,WAAY,CACtB,MAAM0B,EAAQ1B,EAAQ,EAAE,EAClB8E,EAAW,KAAK,IAAIH,EAAc,IAAI,IAAKA,EAAc,IAAI,GAAG,EAChEI,EAAc,KAAK,IAAIJ,EAAc,IAAI,OAAQA,EAAc,IAAI,MAAM,EACzE9W,EAAO6T,EAAQoD,EAAW9H,EAAY,MAAQ0E,EAAQqD,EAAc/H,EAAY,SAAW,OACjG,OAAKnP,EAGE,CACL,KAAAnO,EACA,OAAA3C,EACA,aAAcijB,EAAQ,MACtB,KAAM,aACN,KAAAnS,EACA,MAAA6T,EACA,IAAK,KAAK,IAAI1B,EAAQ,EAAE,EAAGA,EAAQ,EAAE,CAAC,EACtC,IAAK,KAAK,IAAIA,EAAQ,EAAE,EAAGA,EAAQ,EAAE,CAAC,CAC9C,EAXQ,MAYJ,EAEF,EAAG,wBAAwB,EACrBgF,EAAuC9nB,EAAO,IAAM,CACxD,MAAM+nB,EAAQ,CAAA,EACd,UAAWvlB,KAAQkhB,EAAc,CAC/B,MAAM7jB,EAAS4lB,EAAqBjjB,CAAI,EACxC,UAAWsgB,KAAW9C,GAAYngB,CAAM,EAAG,CACzC,MAAMykB,EAAOkD,EAAuBhlB,EAAM3C,EAAQijB,CAAO,EACrDwB,GACFyD,EAAM,KAAKzD,CAAI,CAEnB,CACF,CACA,OAAOyD,CACT,EAAG,sBAAsB,EACnBC,EAAgChoB,EAAO,CAAC4C,EAAGC,IAAMD,EAAE,OAASC,EAAE,MAAQD,EAAE,OAASC,EAAE,MAAQD,EAAE,OAASC,EAAE,MAAQ8L,GAAc/L,EAAE,IAAKA,EAAE,IAAKC,EAAE,IAAKA,EAAE,GAAG,GAAKkd,GAAY,eAAe,EACxLkI,EAAsCjoB,EAAQ+nB,GAAU,CAC5D,MAAMjZ,EAAS,CAAA,EACToZ,EAAuB,IAAI,IACjC,UAAW5D,KAAQyD,EAAO,CACxB,GAAIG,EAAK,IAAI5D,CAAI,EACf,SAEF,MAAM6D,EAAQ,CAAC7D,CAAI,EACb8D,EAAY,CAAA,EAElB,IADAF,EAAK,IAAI5D,CAAI,EACN6D,EAAM,OAAS,GAAG,CACvB,MAAM5P,EAAU4P,EAAM,IAAG,EACzBC,EAAU,KAAK7P,CAAO,EACtB,UAAW1U,KAAQkkB,EACb,CAACG,EAAK,IAAIrkB,CAAI,GAAKmkB,EAAczP,EAAS1U,CAAI,IAChDqkB,EAAK,IAAIrkB,CAAI,EACbskB,EAAM,KAAKtkB,CAAI,EAGrB,CACIukB,EAAU,OAAS,GACrBtZ,EAAO,KAAKsZ,CAAS,CAEzB,CACA,OAAOtZ,CACT,EAAG,qBAAqB,EAClBuZ,EAAkCroB,EAAQooB,GAAc,CAC5D,MAAMje,EAAS,CAAA,EACf,UAAWma,KAAQ8D,EACZje,EAAO,KAAMqa,GAAU,KAAK,IAAIA,EAAQF,EAAK,KAAK,EAAIxE,CAAS,GAClE3V,EAAO,KAAKma,EAAK,KAAK,EAG1B,KAAOna,EAAO,OAASie,EAAU,QAAQ,CACvC,MAAM/Q,EAAM,KAAK,IAAI,GAAGlN,CAAM,EACxBmN,EAAM,KAAK,IAAI,GAAGnN,CAAM,EACxBwG,EAAOyX,EAAU,CAAC,EAAE,KAC1Bje,EAAO,KACLwG,IAAS,QAAUA,IAAS,MAAQ0G,EAAM,IAAoB+Q,EAAU,OAASje,EAAO,QAAUmN,EAAM,IAAoB8Q,EAAU,OAASje,EAAO,OAC9J,CACI,CACA,OAAOA,CACT,EAAG,iBAAiB,EACdme,EAA2CtoB,EAAQooB,GAAc,CACrE,MAAM7P,EAAU6P,EAAU,IAAK9D,GAASA,EAAK,KAAK,EAC5Cna,EAASke,EAAgBD,CAAS,EAClCG,EAAc,CAAA,EACpB,GAAIH,EAAU,QAAU,EAA0B,CAChD,MAAMI,EAAO,IAAI,MAAMre,EAAO,MAAM,EAAE,KAAK,EAAK,EAC1CtG,EAAO,CAAA,EACP4kB,EAAwBzoB,EAAO,IAAM,CACzC,GAAI6D,EAAK,SAAWukB,EAAU,OAAQ,CAChCvkB,EAAK,KAAK,CAAC2gB,EAAOrN,IAAU,KAAK,IAAIqN,EAAQjM,EAAQpB,CAAK,CAAC,GAAK2I,CAAS,GAC3EyI,EAAY,KAAK,CAAC,GAAG1kB,CAAI,CAAC,EAE5B,MACF,CACA,SAAW,CAAC9D,EAAGykB,CAAK,IAAKra,EAAO,QAAO,EACjCqe,EAAKzoB,CAAC,IAGVyoB,EAAKzoB,CAAC,EAAI,GACV8D,EAAK,KAAK2gB,CAAK,EACfiE,EAAK,EACL5kB,EAAK,IAAG,EACR2kB,EAAKzoB,CAAC,EAAI,GAEd,EAAG,OAAO,EACV,OAAA0oB,EAAK,EACEF,CACT,CACA,QAASxoB,EAAI,EAAGA,EAAIwY,EAAQ,OAAQxY,IAClC,QAASuB,EAAIvB,EAAI,EAAGuB,EAAIiX,EAAQ,OAAQjX,IAAK,CAC3C,MAAMonB,EAAa,CAAC,GAAGnQ,CAAO,EAC9B,CAACmQ,EAAW3oB,CAAC,EAAG2oB,EAAWpnB,CAAC,CAAC,EAAI,CAAConB,EAAWpnB,CAAC,EAAGonB,EAAW3oB,CAAC,CAAC,EAC9DwoB,EAAY,KAAKG,CAAU,CAC7B,CAEF,OAAOH,CACT,EAAG,0BAA0B,EACvBI,EAA4C3oB,EAAO,CAACooB,EAAWM,IAAe,CAClF,MAAME,EAA8B,IAAI,IACxC,SAAW,CAAC7oB,EAAGukB,CAAI,IAAK8D,EAAU,QAAO,EAAI,CAC3C,MAAM5D,EAAQkE,EAAW3oB,CAAC,EACpBF,EAAS+oB,EAAY,IAAItE,EAAK,IAAI,GAAKA,EAAK,OAAO,IAAKlV,IAAW,CAAE,EAAGA,EAAM,EAAG,EAAGA,EAAM,CAAC,EAAG,EAChGkV,EAAK,OAAS,YAChBzkB,EAAOykB,EAAK,YAAY,EAAE,EAAIE,EAC9B3kB,EAAOykB,EAAK,aAAe,CAAC,EAAE,EAAIE,IAElC3kB,EAAOykB,EAAK,YAAY,EAAE,EAAIE,EAC9B3kB,EAAOykB,EAAK,aAAe,CAAC,EAAE,EAAIE,GAEpCoE,EAAY,IAAItE,EAAK,KAAMzkB,CAAM,CACnC,CACA,MAAM6lB,EAA+B,IAAI,IACzC,SAAW,CAACljB,EAAM3C,CAAM,IAAK+oB,EAAa,CACxC,MAAMnE,EAAalP,GAAiBpG,GAAwBtP,CAAM,CAAC,EACnE,GAAImgB,GAAYyE,CAAU,EAAE,SAAWA,EAAW,OAAS,EACzD,OAEFiB,EAAa,IAAIljB,EAAMiiB,CAAU,CACnC,CACA,OAAOiB,CACT,EAAG,2BAA2B,EACxBhD,EAAkC1iB,EAAQ0lB,GAAiB,CAC/D,SAAW,CAACljB,EAAM3C,CAAM,IAAK6lB,EAAc,CACzC,MAAMrG,EAAc,CAClB7c,EAAK,MACLA,EAAK,GACb,EAAQ,OAAQmI,GAAO,EAAQA,CAAG,EAC5B,UAAWmY,KAAW9C,GAAYngB,CAAM,EAItC,GAHI6S,GAAmBoQ,EAAQ,EAAGA,EAAQ,EAAGhR,EAAeuN,EAAa,EAAO,GAG5E3M,GAAmBoQ,EAAQ,EAAGA,EAAQ,EAAGnF,EAAY,GAAI,EAAO,EAClE,MAAO,EAGb,CACA,QAAS5d,EAAI,EAAGA,EAAI2jB,EAAa,OAAQ3jB,IAAK,CAC5C,MAAMmiB,EAAQwB,EAAa3jB,CAAC,EACtB8oB,EAAenD,EAAa,IAAIxD,CAAK,EACrC6B,EAAgB/D,GAAYyF,EAAqBvD,EAAOwD,CAAY,CAAC,EAC3E,QAASpkB,EAAIvB,EAAI,EAAGuB,EAAIoiB,EAAa,OAAQpiB,IAAK,CAChD,MAAM6gB,EAASuB,EAAapiB,CAAC,EAC7B,GAAI,CAACunB,GAAgB,CAACnD,EAAa,IAAIvD,CAAM,EAC3C,SAEF,MAAM6B,EAAiBhE,GAAYyF,EAAqBtD,EAAQuD,CAAY,CAAC,EAC7E,UAAWzB,KAAgBF,EACzB,UAAWG,KAAiBF,EAC1B,GAAIpV,GAA6BqV,EAAcC,EAAe,EAAG,GAAKnE,GACpE,MAAO,EAIf,CACF,CACA,MAAO,EACT,EAAG,iBAAiB,EACpB,QAASgC,EAAY,EAAGA,EAAY,EAAgBA,IAAa,CAC/D,MAAM2C,EAAmBZ,EAAmB,EAC5C,GAAIY,IAAqB,EACvB,OAEF,IAAIgC,EACAC,EAAgBjC,EAChBkC,EAAYhB,EAAU,EACtBkD,EAAmB,OAAO,kBAC9B,UAAWV,KAAaH,EAAoBH,EAAoB,CAAE,EAChE,UAAWY,KAAcJ,EAAyBF,CAAS,EAAG,CAC5D,MAAM1C,EAAeiD,EAA0BP,EAAWM,CAAU,EACpE,GAAI,CAAChD,GAAgB,CAAChD,EAAgBgD,CAAY,EAChD,SAEF,MAAMwB,EAAqBpD,EAAoB4B,CAAY,EAC3D,GAAIwB,GAAsBxC,EACxB,SAEF,MAAMyC,EAAiBvB,EAAWF,CAAY,EACxCqD,EAAwBX,EAAU,OACtC,CAACvC,EAAKvB,GAAMnN,KAAU0O,EAAM,KAAK,IAAI6C,EAAWvR,EAAK,EAAImN,GAAK,KAAK,EACnE,CACV,EACY4C,EAAqBP,GAAiBO,IAAuBP,IAAkBQ,EAAiBP,GAAaO,IAAmBP,GAAamC,GAAyBD,KAG1KpC,EAAmBhB,EACnBiB,EAAgBO,EAChBN,EAAYO,EACZ2B,EAAmBC,EACrB,CAEF,GAAI,CAACrC,EACH,OAEF,SAAW,CAAClkB,EAAM3C,CAAM,IAAK6mB,EAC3BlkB,EAAK,OAAS3C,CAElB,CACF,CACAG,EAAOonB,GAAsC,sCAAsC,EACnF,SAAS4B,GAAgC9nB,EAAO4U,EAAa,CAG3D,KAAM,CAAE,cAAAhE,EAAe,eAAgB6L,CAAU,EAAK3L,GACpD8D,EAAY,OAAM,CACtB,EACQ4N,EAAexiB,EAAM,OAAQsB,GAAS,CAACA,EAAK,YAAY,EACxDmhB,EAA4B3jB,EAAO,CAACwC,EAAMohB,EAAiBC,IAAgB1U,GAC/E3M,IAASohB,EAAkBC,GAAe,CAAA,EAAKrhB,EAAK,QAAU,CAAA,CAClE,EAAK,WAAW,EACRymB,EAA6BjpB,EAAQH,GAAWmgB,GAAYngB,CAAM,EAAE,OAAO,CAACgmB,EAAK/C,IAAY,CACjG,MAAMniB,EAAKmiB,EAAQ,EAAE,EAAIA,EAAQ,EAAE,EAC7BliB,EAAKkiB,EAAQ,EAAE,EAAIA,EAAQ,EAAE,EACnC,OAAO+C,EAAM,KAAK,MAAMllB,EAAIC,CAAE,CAChC,EAAG,CAAC,EAAG,YAAY,EACbkjB,EAAsC9jB,EAAO,CAAC4jB,EAAiBC,IAAgB,CACnF,IAAInX,EAAQ,EACZ,QAAS3M,EAAI,EAAGA,EAAI2jB,EAAa,OAAQ3jB,IAAK,CAC5C,MAAMgkB,EAAgB/D,GAAY2D,EAAUD,EAAa3jB,CAAC,EAAG6jB,EAAiBC,CAAW,CAAC,EAC1F,QAASviB,EAAIvB,EAAI,EAAGuB,EAAIoiB,EAAa,OAAQpiB,IAAK,CAChD,MAAM0iB,EAAiBhE,GACrB2D,EAAUD,EAAapiB,CAAC,EAAGsiB,EAAiBC,CAAW,CACjE,EACQ,UAAWI,KAAgBF,EACzB,UAAWG,KAAiBF,EACtB3P,GACF4P,EAAa,EACbA,EAAa,EACbC,EAAc,EACdA,EAAc,EACdpE,CACd,GACcpT,GAIR,CACF,CACA,OAAOA,CACT,EAAG,qBAAqB,EAClBwc,EAA6ClpB,EAAO,CAAC8iB,EAASlT,IAAS,CAC3E,GAAIkT,EAAQ,WAAY,CACtB,MAAMpa,EAAIoa,EAAQ,EAAE,EAEpB,OADiB,KAAK,IAAIpa,EAAIkH,EAAK,GAAG,EAAI,GAAK,KAAK,IAAIlH,EAAIkH,EAAK,MAAM,EAAI,IACxDjB,GAAcmU,EAAQ,EAAE,EAAGA,EAAQ,EAAE,EAAGlT,EAAK,KAAMA,EAAK,KAAK,GAAKmQ,EACvF,CACA,GAAI+C,EAAQ,SAAU,CACpB,MAAMra,EAAIqa,EAAQ,EAAE,EAEpB,OADiB,KAAK,IAAIra,EAAImH,EAAK,IAAI,EAAI,GAAK,KAAK,IAAInH,EAAImH,EAAK,KAAK,EAAI,IACxDjB,GAAcmU,EAAQ,EAAE,EAAGA,EAAQ,EAAE,EAAGlT,EAAK,IAAKA,EAAK,MAAM,GAAKmQ,EACvF,CACA,MAAO,EACT,EAAG,4BAA4B,EACzBsH,EAAmCrnB,EAAQwC,GAAS,CACxD,MAAM6c,EAAc,CAAC7c,EAAK,MAAOA,EAAK,GAAG,EAAE,OACxCmI,GAAO,EAAQA,CACtB,EACUgI,EAAQ,CAAA,EACd,UAAWhI,KAAM0U,EAAa,CAC5B,MAAM/V,EAAOwM,EAAY,IAAInL,CAAE,EACzBiF,EAAOtG,EAAOmH,GAAiBnH,CAAI,EAAI,OACzCsG,GACF+C,EAAM,KAAK/C,CAAI,CAEnB,CACA,OAAO+C,CACT,EAAG,kBAAkB,EACfwW,EAAuCnpB,EAAO,CAACH,EAAQsX,IAAU,CACrE,GAAIA,EAAQ,GAAKtX,EAAO,OACtB,MAAO,CAAA,EAET,MAAM0P,EAAK1P,EAAOsX,CAAK,EACjB3H,EAAK3P,EAAOsX,EAAQ,CAAC,EACrB1H,EAAK5P,EAAOsX,EAAQ,CAAC,EACrBzH,EAAK7P,EAAOsX,EAAQ,CAAC,EACrByF,EAAQnO,GAAoBc,EAAIC,EAAIsQ,CAAS,GAAKpR,GAAkBc,EAAIC,EAAIqQ,CAAS,GAAKrR,GAAoBgB,EAAIC,EAAIoQ,CAAS,EAC/HsJ,EAAQ1a,GAAkBa,EAAIC,EAAIsQ,CAAS,GAAKrR,GAAoBe,EAAIC,EAAIqQ,CAAS,GAAKpR,GAAkBe,EAAIC,EAAIoQ,CAAS,EACnI,GAAI,CAAClD,GAAS,CAACwM,EACb,MAAO,CAAA,EAGT,GAAI,EADwBxM,EAAQ,KAAK,KAAKpN,EAAG,EAAID,EAAG,CAAC,IAAM,KAAK,KAAKG,EAAG,EAAID,EAAG,CAAC,EAAI,KAAK,KAAKD,EAAG,EAAID,EAAG,CAAC,IAAM,KAAK,KAAKG,EAAG,EAAID,EAAG,CAAC,GAEtI,MAAO,CAAA,EAET,MAAM4Z,EAAU9a,GAAMgB,EAAIG,EAAIoQ,CAAS,GAAKtR,GAAMe,EAAIG,EAAIoQ,CAAS,EAAI,CAAA,EAAK,CAC1E,CAAE,EAAGvQ,EAAG,EAAG,EAAGG,EAAG,CAAC,EAClB,CAAE,EAAGA,EAAG,EAAG,EAAGH,EAAG,CAAC,CACxB,EACU+Z,EAAgBD,EAAQ,SAAW,EAAI,CAAC,CAAC,GAAGxpB,EAAO,MAAM,EAAGsX,EAAQ,CAAC,EAAG,GAAGtX,EAAO,MAAMsX,EAAQ,CAAC,CAAC,CAAC,EAAIkS,EAAQ,IAAK/jB,GAAW,CACnI,GAAGzF,EAAO,MAAM,EAAGsX,EAAQ,CAAC,EAC5B7R,EACA,GAAGzF,EAAO,MAAMsX,EAAQ,CAAC,CAC/B,CAAK,EACK+Q,EAAuB,IAAI,IACjC,OAAOoB,EAAc,IAAKtT,GAAcT,GAAiBpG,GAAwB6G,CAAS,CAAC,CAAC,EAAE,OAAQA,GAAc,CAIlH,GAHIgK,GAAYhK,CAAS,EAAE,SAAWA,EAAU,OAAS,GAGrD,CAACA,EAAU,KAAM5G,GAAUf,GAAUe,EAAOM,EAAIoQ,CAAS,CAAC,EAC5D,MAAO,GAET,MAAMyJ,EAAMvT,EAAU,IAAK5G,GAAU,GAAGA,EAAM,EAAE,QAAQ,CAAC,CAAC,IAAIA,EAAM,EAAE,QAAQ,CAAC,CAAC,EAAE,EAAE,KAAK,GAAG,EAC5F,OAAI8Y,EAAK,IAAIqB,CAAG,EACP,IAETrB,EAAK,IAAIqB,CAAG,EACL,GACT,CAAC,CACH,EAAG,sBAAsB,EACnB7G,EAAkC1iB,EAAO,CAACwC,EAAMwT,EAAW0O,IAAqB,CACpF,MAAMrF,EAAc,CAAC7c,EAAK,MAAOA,EAAK,GAAG,EAAE,OACxCmI,GAAO,EAAQA,CACtB,EACU8c,EAAgBJ,EAAiB7kB,CAAI,EAC3C,UAAWsgB,KAAW9C,GAAYhK,CAAS,EAOzC,GANItD,GAAmBoQ,EAAQ,EAAGA,EAAQ,EAAGhR,EAAeuN,EAAa,EAAO,GAG5E3M,GAAmBoQ,EAAQ,EAAGA,EAAQ,EAAGnF,EAAY,GAAI,EAAO,GAGhE8J,EAAc,KAAM7X,GAASsZ,EAA2BpG,EAASlT,CAAI,CAAC,EACxE,MAAO,GAGX,UAAWsE,KAASwP,EAClB,GAAIxP,IAAU1R,GAGd,UAAWwgB,KAAoBhD,GAAYhK,CAAS,EAClD,UAAWiN,KAAgBjD,GAAY2D,EAAUzP,CAAK,CAAC,EACrD,GAAItF,GAA6BoU,EAAkBC,EAAc,EAAG,GAAKlD,GACvE,MAAO,GAKf,OAAO+D,EAAoBthB,EAAMwT,CAAS,GAAK0O,CACjD,EAAG,iBAAiB,EACpB,QAAS3C,EAAY,EAAGA,EAAY,EAAgBA,IAAa,CAC/D,MAAM2C,EAAmBZ,EAAmB,EAC5C,IAAI0F,EACAC,EACA9C,EAAgBjC,EAChBkC,EAAY,OAAO,kBACnB8C,EAAa,OAAO,kBACxB,UAAWlnB,KAAQkhB,EAAc,CAC/B,MAAMiG,EAAgBhG,EAAUnhB,CAAI,EAC9BikB,EAAexX,GAAqB0a,EAAe7J,CAAS,EAC5D8J,EAAgBX,EAAWU,CAAa,EAC9C,QAASxS,EAAQ,EAAGA,GAASwS,EAAc,OAAS,EAAGxS,IACrD,UAAWnB,KAAamT,EAAqBQ,EAAexS,CAAK,EAAG,CAClE,MAAMgQ,EAAiBlY,GAAqB+G,EAAW8J,CAAS,EAC1D+J,EAAkBZ,EAAWjT,CAAS,EAE5C,GAAI,EADkBmR,EAAiBV,GAAgBU,IAAmBV,GAAgBoD,EAAkBD,EAAgB9J,IACtG,CAAC4C,EAAgBlgB,EAAMwT,EAAW0O,CAAgB,EACtE,SAEF,MAAMwC,EAAqBpD,EAAoBthB,EAAMwT,CAAS,EAC1DkR,EAAqBP,GAAiBO,IAAuBP,IAAkBQ,EAAiBP,GAAaO,IAAmBP,GAAaiD,GAAmBH,KAGpKF,EAAWhnB,EACXinB,EAAWzT,EACX2Q,EAAgBO,EAChBN,EAAYO,EACZuC,EAAaG,EACf,CAEJ,CACA,GAAI,CAACL,GAAY,CAACC,EAChB,OAEFD,EAAS,OAASC,CACpB,CACF,CACAzpB,EAAOgpB,GAAiC,iCAAiC,EACzE,SAASc,GAAmC5oB,EAAO4U,EAAa,CAK9D,MAAMiU,EAAY,CAAA,EAClB,UAAWzgB,KAAQwM,EAAY,SAAU,CACvC,GAAIxM,EAAK,SAAWA,EAAK,YACvB,SAEF,MAAMhG,EAAKgG,EAAK,GAAK,EACf/F,EAAK+F,EAAK,GAAK,EACfsG,EAAOa,GAAiBnH,CAAI,EAC7BsG,GAGLma,EAAU,KAAK,CACb,GAAI,OAAOzgB,EAAK,IAAM,EAAE,EACxB,GAAAhG,EACA,GAAAC,EACA,KAAAqM,CACN,CAAK,CACH,CACA,GAAIma,EAAU,SAAW,EACvB,OAEF,MAAMlY,EAAe,IAAI,IAAIkY,EAAU,IAAKzgB,GAAS,CAACA,EAAK,GAAIA,CAAI,CAAC,CAAC,EAC/DwI,EAAgBiY,EAAU,IAAKzgB,IAAU,CAAE,GAAIA,EAAK,GAAI,KAAMA,EAAK,IAAI,EAAG,EAC1E0gB,EAAQ,CAAC,MAAO,SAAU,OAAQ,OAAO,EACzCC,EAAgB,CACpB,IAAK,KAAK,IAAI,GAAGF,EAAU,IAAKzgB,GAASA,EAAK,KAAK,GAAG,CAAC,EAAI,GAC3D,OAAQ,KAAK,IAAI,GAAGygB,EAAU,IAAKzgB,GAASA,EAAK,KAAK,MAAM,CAAC,EAAI,GACjE,KAAM,KAAK,IAAI,GAAGygB,EAAU,IAAKzgB,GAASA,EAAK,KAAK,IAAI,CAAC,EAAI,GAC7D,MAAO,KAAK,IAAI,GAAGygB,EAAU,IAAKzgB,GAASA,EAAK,KAAK,KAAK,CAAC,EAAI,EACnE,EACQoa,EAAexiB,EAAM,OAAQsB,GAAS,CAACA,EAAK,YAAY,EACxD0nB,EAAY,IAAI,IAAIxG,EAAa,IAAI,CAAClhB,EAAM2U,IAAU,CAAC3U,EAAM2U,CAAK,CAAC,CAAC,EACpEgT,EAAuCnqB,EAAQ2Q,GAAS,CAC5D,MAAMyZ,EAAUzZ,IAAS,QAAUA,IAAS,MAAQ,GAAK,EACnD0Z,EAAS,CAAA,EACf,QAASC,EAAU,EAAGA,GAAW,EAAqBA,IACpDD,EAAO,KAAKJ,EAActZ,CAAI,EAAIyZ,EAAU,GAASE,CAAO,EAE9D,OAAOD,CACT,EAAG,sBAAsB,EACnB5E,EAAuCzlB,EAAO,CAACwC,EAAMkjB,EAA+B,IAAI,MAAUvW,GACtGuW,EAAa,IAAIljB,CAAI,GAAKA,EAAK,QAAU,CAAA,CAC7C,EAAK,sBAAsB,EACnB+nB,EAA+CvqB,EAAO,CAAC+jB,EAAeC,IAAmB,CAC7F,IAAItX,EAAQ,EACZ,UAAWuX,KAAgBF,EACzB,UAAWG,KAAiBF,EACtB3P,GACF4P,EAAa,EACbA,EAAa,EACbC,EAAc,EACdA,EAAc,EACdpE,CACV,GACUpT,IAIN,OAAOA,CACT,EAAG,8BAA8B,EAC3B8d,EAA4CxqB,EAAO,CAACkiB,EAAOC,IAAWoI,EAA6BvK,GAAYkC,CAAK,EAAGlC,GAAYmC,CAAM,CAAC,EAAG,2BAA2B,EACxKsI,EAAmCzqB,EAAO,CAAC0lB,EAA+B,IAAI,MAAU,CAC5F,IAAIhZ,EAAQ,EACZ,MAAMge,EAAQ,CAAA,EACRC,EAA0B,IAAI,IAC9BC,EAAY,CAAA,EACZC,EAA0B7qB,EAAQwC,GAAS,CAC1CmoB,EAAQ,IAAInoB,CAAI,IACnBmoB,EAAQ,IAAInoB,CAAI,EAChBooB,EAAU,KAAKpoB,CAAI,EAEvB,EAAG,SAAS,EACZ,QAASzC,EAAI,EAAGA,EAAI2jB,EAAa,OAAQ3jB,IAAK,CAC5C,MAAMmiB,EAAQwB,EAAa3jB,CAAC,EACtB+qB,EAAcrF,EAAqBvD,EAAOwD,CAAY,EAC5D,QAASpkB,EAAIvB,EAAI,EAAGuB,EAAIoiB,EAAa,OAAQpiB,IAAK,CAChD,MAAM6gB,EAASuB,EAAapiB,CAAC,EACvBypB,EAAYP,EAChBM,EACArF,EAAqBtD,EAAQuD,CAAY,CACnD,EACYqF,EAAY,IACdre,GAASqe,EACTL,EAAM,KAAK,CAAE,MAAAxI,EAAO,OAAAC,EAAQ,MAAO4I,EAAW,EAC9CF,EAAQ3I,CAAK,EACb2I,EAAQ1I,CAAM,EAElB,CACF,CACA,OAAAyI,EAAU,KAAK,CAAChoB,EAAGC,KAAOqnB,EAAU,IAAItnB,CAAC,GAAK,IAAMsnB,EAAU,IAAIrnB,CAAC,GAAK,EAAE,EACnE,CACL,MAAA6J,EACA,MAAAge,EACA,QAAAC,EACA,MAAOC,CACb,CACE,EAAG,kBAAkB,EACfI,EAAgDhrB,EAAO,CAACuY,EAASmN,IAAiB,CACtF,MAAMvQ,EAAU,IAAI,IAAIuQ,EAAa,KAAI,CAAE,EAC3C,GAAIvQ,EAAQ,OAAS,EACnB,OAAOoD,EAAQ,MAEjB,IAAI0S,EAAkB,EACtB,UAAWC,KAAQ3S,EAAQ,OACrBpD,EAAQ,IAAI+V,EAAK,KAAK,GAAK/V,EAAQ,IAAI+V,EAAK,MAAM,KACpDD,GAAmBC,EAAK,OAG5B,IAAIC,EAAsB,EAC1B,QAASprB,EAAI,EAAGA,EAAI2jB,EAAa,OAAQ3jB,IAAK,CAC5C,MAAMmiB,EAAQwB,EAAa3jB,CAAC,EACtB8oB,EAAe1T,EAAQ,IAAI+M,CAAK,EAChC4I,EAAcrF,EAAqBvD,EAAOwD,CAAY,EAC5D,QAASpkB,EAAIvB,EAAI,EAAGuB,EAAIoiB,EAAa,OAAQpiB,IAAK,CAChD,MAAM6gB,EAASuB,EAAapiB,CAAC,EACzB,CAACunB,GAAgB,CAAC1T,EAAQ,IAAIgN,CAAM,IAGxCgJ,GAAuBX,EACrBM,EACArF,EAAqBtD,EAAQuD,CAAY,CACnD,EACM,CACF,CACA,OAAOnN,EAAQ,MAAQ0S,EAAkBE,CAC3C,EAAG,+BAA+B,EAC5BC,EAAqCprB,EAAQqrB,GAAa,CAC9D,MAAMC,EAA4B,IAAI,IACtC,UAAWJ,KAAQG,EAAS,MAAO,CACjC,MAAME,EAAiBD,EAAU,IAAIJ,EAAK,KAAK,GAAqB,IAAI,IACxEK,EAAe,IAAIL,EAAK,MAAM,EAC9BI,EAAU,IAAIJ,EAAK,MAAOK,CAAc,EACxC,MAAMC,EAAkBF,EAAU,IAAIJ,EAAK,MAAM,GAAqB,IAAI,IAC1EM,EAAgB,IAAIN,EAAK,KAAK,EAC9BI,EAAU,IAAIJ,EAAK,OAAQM,CAAe,CAC5C,CACA,MAAMC,EAAa,CAAA,EACbvD,EAAuB,IAAI,IACjC,UAAW1lB,KAAQ6oB,EAAS,MAAO,CACjC,GAAInD,EAAK,IAAI1lB,CAAI,EACf,SAEF,MAAM2lB,EAAQ,CAAC3lB,CAAI,EACb4lB,EAAY,CAAA,EAElB,IADAF,EAAK,IAAI1lB,CAAI,EACN2lB,EAAM,OAAS,GAAG,CACvB,MAAM5P,EAAU4P,EAAM,IAAG,EACzBC,EAAU,KAAK7P,CAAO,EACtB,UAAW1U,KAAQynB,EAAU,IAAI/S,CAAO,GAAK,CAAA,EACtC2P,EAAK,IAAIrkB,CAAI,IAChBqkB,EAAK,IAAIrkB,CAAI,EACbskB,EAAM,KAAKtkB,CAAI,EAGrB,CACAukB,EAAU,KAAK,CAACxlB,EAAGC,KAAOqnB,EAAU,IAAItnB,CAAC,GAAK,IAAMsnB,EAAU,IAAIrnB,CAAC,GAAK,EAAE,EACtEulB,EAAU,OAAS,GACrBqD,EAAW,KAAKrD,CAAS,CAE7B,CACA,OAAOqD,CACT,EAAG,oBAAoB,EACjBC,EAAiC1rB,EAAQwC,GAAS,CAACA,EAAK,MAAOA,EAAK,GAAG,EAAE,OAC5EmI,GAAO,EAAQA,CACpB,EAAK,gBAAgB,EACbghB,EAAmC3rB,EAAQqrB,GAAa,CAC5D,MAAMO,EAAS,CAAA,EACf,UAAWxD,KAAagD,EAAmBC,CAAQ,EAAG,CACpD,MAAMQ,EAAe,IAAI,IAAIzD,CAAS,EAChC0D,EAAuB,IAAI,IAAI1D,EAAU,QAAS5lB,GAASkpB,EAAelpB,CAAI,CAAC,CAAC,EAChFsI,EAAQ,CAAC,GAAGsd,CAAS,EAC3B,UAAW5lB,KAAQkhB,EACbmI,EAAa,IAAIrpB,CAAI,GAGrBkpB,EAAelpB,CAAI,EAAE,KAAMmI,GAAOmhB,EAAqB,IAAInhB,CAAE,CAAC,GAChEG,EAAM,KAAKtI,CAAI,EAGnBsI,EAAM,KAAK,CAAClI,EAAGC,KAAOqnB,EAAU,IAAItnB,CAAC,GAAK,IAAMsnB,EAAU,IAAIrnB,CAAC,GAAK,EAAE,EACtE+oB,EAAO,KAAK9gB,CAAK,CACnB,CACA,OAAO8gB,CACT,EAAG,kBAAkB,EACfG,EAAqD/rB,EAAO,CAACuY,EAAS/V,EAAMqhB,IAAgBmH,EAChGzS,EACgB,IAAI,IAAI,CAAC,CAAC/V,EAAMqhB,CAAW,CAAC,CAAC,CACjD,EAAK,oCAAoC,EACjCmI,EAAyChsB,EAAQuY,GAAY,CACjE,MAAMzJ,EAAyB,IAAI,IACnC,UAAWoc,KAAQ3S,EAAQ,MACzBzJ,EAAO,IAAIoc,EAAK,OAAQpc,EAAO,IAAIoc,EAAK,KAAK,GAAK,GAAKA,EAAK,KAAK,EACjEpc,EAAO,IAAIoc,EAAK,QAASpc,EAAO,IAAIoc,EAAK,MAAM,GAAK,GAAKA,EAAK,KAAK,EAErE,OAAOpc,CACT,EAAG,wBAAwB,EACrBma,EAA6BjpB,EAAQH,GAAWA,EAAO,MAAM,CAAC,EAAE,OAAO,CAACgmB,EAAKzW,EAAO+H,IAAU,CAClG,MAAMmK,EAAWzhB,EAAOsX,CAAK,EAC7B,OAAO0O,EAAM,KAAK,IAAIzW,EAAM,EAAIkS,EAAS,CAAC,EAAI,KAAK,IAAIlS,EAAM,EAAIkS,EAAS,CAAC,CAC7E,EAAG,CAAC,EAAG,YAAY,EACbsE,EAA6B5lB,EAAO,CAAC0lB,EAA+B,IAAI,MAAUhC,EAAa,OACnG,CAACmC,EAAKrjB,IAASqjB,EAAM5W,GAAqBwW,EAAqBjjB,EAAMkjB,CAAY,CAAC,EAClF,CACJ,EAAK,YAAY,EACTuG,EAA8BjsB,EAAO,CAAC0lB,EAA+B,IAAI,MAAUhC,EAAa,OACpG,CAACmC,EAAKrjB,IAASqjB,EAAMoD,EAAWxD,EAAqBjjB,EAAMkjB,CAAY,CAAC,EACxE,CACJ,EAAK,aAAa,EACVwG,EAAyClsB,EAAO,CAACwC,EAAM8jB,EAAMZ,EAA+B,IAAI,MAAU,CAC9G,MAAMyG,EAAenM,GAAYsG,CAAI,EACrC,UAAWpS,KAASwP,EAClB,GAAIxP,IAAU1R,GAGd,UAAWwgB,KAAoBmJ,EAC7B,UAAWlJ,KAAgBjD,GAAYyF,EAAqBvR,EAAOwR,CAAY,CAAC,EAC9E,GAAI9W,GAA6BoU,EAAkBC,EAAc,EAAG,GAAKlD,GACvE,MAAO,GAKf,MAAO,EACT,EAAG,wBAAwB,EACrBqM,EAA+BpsB,EAAO,CAACwC,EAAM8jB,IAAS,CAC1D,MAAMjH,EAAc,CAAC7c,EAAK,MAAOA,EAAK,GAAG,EAAE,OACxCmI,GAAO,EAAQA,CACtB,EACI,UAAWmY,KAAW9C,GAAYsG,CAAI,EACpC,GAAI5T,GAAmBoQ,EAAQ,EAAGA,EAAQ,EAAGhR,EAAeuN,EAAa,EAAE,EACzE,MAAO,GAGX,MAAO,EACT,EAAG,cAAc,EACXgN,EAA0CrsB,EAAO,CAACqiB,EAAYxiB,IAAW,CAC7E,MAAMmW,EAAYT,GAAiBpG,GAAwBtP,CAAM,CAAC,EAC9DmgB,GAAYhK,CAAS,EAAE,SAAWA,EAAU,OAAS,GACvDqM,EAAW,KAAKrM,CAAS,CAE7B,EAAG,yBAAyB,EACtBsW,EAAmCtsB,EAAQ2Q,GAASA,IAAS,QAAUA,IAAS,QAAS,kBAAkB,EAC3G4b,EAAwCvsB,EAAO,CAAC2J,EAAKgH,EAAM/G,IAAQ,CACvE,OAAQ+G,EAAI,CACV,IAAK,OACH,OAAO,KAAK,IAAIhH,EAAI,EAAGC,EAAI,CAAC,EAAI,GAClC,IAAK,QACH,OAAO,KAAK,IAAID,EAAI,EAAGC,EAAI,CAAC,EAAI,GAClC,IAAK,MACH,OAAO,KAAK,IAAID,EAAI,EAAGC,EAAI,CAAC,EAAI,GAClC,IAAK,SACH,OAAO,KAAK,IAAID,EAAI,EAAGC,EAAI,CAAC,EAAI,EACxC,CACE,EAAG,uBAAuB,EACpB4iB,EAAwCxsB,EAAO,CAACqiB,EAAY1Y,EAAKkH,EAASjH,IAAQ,CACtF,MAAMwgB,EAAUvZ,IAAY,QAAUA,IAAY,MAAQ,GAAK,EACzD4b,EAAa,CAACF,EAAsB5iB,EAAKkH,EAASjH,CAAG,EAAGqgB,EAAcpZ,CAAO,CAAC,EACpF,UAAW6b,KAAQD,EACjB,QAASnC,EAAU,EAAGA,GAAW,EAAqBA,IACpD+B,EACEhK,EACA3Q,GAAuB/H,EAAKkH,EAASjH,EAAK8iB,EAAOtC,EAAU,GAASE,CAAO,CACrF,CAGE,EAAG,uBAAuB,EACpBqC,GAAoD3sB,EAAO,CAACqiB,EAAY1Y,EAAKkH,EAASjH,EAAKkH,IAAY,CAC3G,UAAW8b,KAAUzC,EAAqBtZ,CAAO,EAC/C,UAAWgc,KAAU1C,EAAqBrZ,CAAO,EAC/Cub,EAAwBhK,EAAY,CAClC1Y,EACA,CAAE,EAAGijB,EAAQ,EAAGjjB,EAAI,CAAC,EACrB,CAAE,EAAGijB,EAAQ,EAAGC,CAAM,EACtB,CAAE,EAAGjjB,EAAI,EAAG,EAAGijB,CAAM,EACrBjjB,CACV,CAAS,CAGP,EAAG,mCAAmC,EAChCkjB,GAAoD9sB,EAAO,CAACqiB,EAAY1Y,EAAKkH,EAASjH,EAAKkH,IAAY,CAC3G,UAAW+b,KAAU1C,EAAqBtZ,CAAO,EAC/C,UAAW+b,KAAUzC,EAAqBrZ,CAAO,EAC/Cub,EAAwBhK,EAAY,CAClC1Y,EACA,CAAE,EAAGA,EAAI,EAAG,EAAGkjB,CAAM,EACrB,CAAE,EAAGD,EAAQ,EAAGC,CAAM,EACtB,CAAE,EAAGD,EAAQ,EAAGhjB,EAAI,CAAC,EACrBA,CACV,CAAS,CAGP,EAAG,mCAAmC,EAChCmjB,GAA8C/sB,EAAO,CAACqiB,EAAY1Y,EAAKkH,EAASjH,EAAKkH,IAAY,CACrG,MAAMkc,EAAU,CAAC,GAAG7C,EAAqB,KAAK,EAAG,GAAGA,EAAqB,QAAQ,CAAC,EAClF,UAAW8C,KAAY9C,EAAqBtZ,CAAO,EACjD,UAAWqc,KAAY/C,EAAqBrZ,CAAO,EACjD,UAAW+b,KAAUG,EACnBX,EAAwBhK,EAAY,CAClC1Y,EACA,CAAE,EAAGsjB,EAAU,EAAGtjB,EAAI,CAAC,EACvB,CAAE,EAAGsjB,EAAU,EAAGJ,CAAM,EACxB,CAAE,EAAGK,EAAU,EAAGL,CAAM,EACxB,CAAE,EAAGK,EAAU,EAAGtjB,EAAI,CAAC,EACvBA,CACZ,CAAW,CAIT,EAAG,6BAA6B,EAC1BujB,GAA4CntB,EAAO,CAACqiB,EAAY1Y,EAAKkH,EAASjH,EAAKkH,IAAY,CACnG,MAAMsc,EAAU,CAAC,GAAGjD,EAAqB,MAAM,EAAG,GAAGA,EAAqB,OAAO,CAAC,EAClF,UAAW8C,KAAY9C,EAAqBtZ,CAAO,EACjD,UAAWqc,KAAY/C,EAAqBrZ,CAAO,EACjD,UAAW8b,KAAUQ,EACnBf,EAAwBhK,EAAY,CAClC1Y,EACA,CAAE,EAAGA,EAAI,EAAG,EAAGsjB,CAAQ,EACvB,CAAE,EAAGL,EAAQ,EAAGK,CAAQ,EACxB,CAAE,EAAGL,EAAQ,EAAGM,CAAQ,EACxB,CAAE,EAAGtjB,EAAI,EAAG,EAAGsjB,CAAQ,EACvBtjB,CACZ,CAAW,CAIT,EAAG,2BAA2B,EACxByjB,EAAuCrtB,EAAQqiB,GAAe,CAClE,MAAM6F,EAAuB,IAAI,IACjC,OAAO7F,EAAW,IAAKrM,GAAc7G,GAAwB6G,CAAS,CAAC,EAAE,OAAQA,GAAc,CAC7F,MAAMuT,EAAMvT,EAAU,IAAK5G,GAAU,GAAGA,EAAM,EAAE,QAAQ,CAAC,CAAC,IAAIA,EAAM,EAAE,QAAQ,CAAC,CAAC,EAAE,EAAE,KAAK,GAAG,EAC5F,OAAI8Y,EAAK,IAAIqB,CAAG,GAAKvT,EAAU,OAAS,EAC/B,IAETkS,EAAK,IAAIqB,CAAG,EACL,GACT,CAAC,CACH,EAAG,sBAAsB,EACnB+D,EAA0CttB,EAAO,CAAC2J,EAAKkH,EAASjH,EAAKkH,IAAY,CACrF,MAAMuR,EAAa,CAAA,EACbkL,EAAO3c,GAAwBjH,EAAKkH,EAASjH,EAAKkH,EAAS,GAAQgP,CAAS,EAC9EyN,GACFlB,EAAwBhK,EAAYkL,CAAI,EAEtC1c,IAAYC,GACd0b,EAAsBnK,EAAY1Y,EAAKkH,EAASjH,CAAG,EAErD,MAAM4jB,EAAgBlB,EAAiBzb,CAAO,EACxC4c,EAAgBnB,EAAiBxb,CAAO,EAC9C,OAAI0c,GAAiB,CAACC,EACpBd,GAAkCtK,EAAY1Y,EAAKkH,EAASjH,EAAKkH,CAAO,EAC/D,CAAC0c,GAAiBC,EAC3BX,GAAkCzK,EAAY1Y,EAAKkH,EAASjH,EAAKkH,CAAO,EAC/D0c,EACTT,GAA4B1K,EAAY1Y,EAAKkH,EAASjH,EAAKkH,CAAO,EAElEqc,GAA0B9K,EAAY1Y,EAAKkH,EAASjH,EAAKkH,CAAO,EAE3Duc,EAAqBhL,CAAU,CACxC,EAAG,yBAAyB,EACtBqL,GAA2D1tB,EAAO,CAACqiB,EAAYH,EAAOyL,EAAWpG,IAAY,CACjH,MAAMqG,EAAkB,CAAC,GAAGzD,EAAqB,MAAM,EAAG,GAAGA,EAAqB,OAAO,CAAC,EACpF0D,EAAkB,CAAC,GAAG1D,EAAqB,KAAK,EAAG,GAAGA,EAAqB,QAAQ,CAAC,EAC1F,UAAWxZ,KAAQqZ,EAAO,CACxB,MAAMpgB,EAAM8G,GAAgB6W,EAAS5W,CAAI,EACnCmd,EAAgBnd,IAAS,OAASA,IAAS,SAAWwZ,EAAqBxZ,CAAI,EAAIkd,EACzF,UAAWlc,KAASic,EAAiB,CACnCvB,EAAwBhK,EAAY,CAClCH,EACAyL,EACA,CAAE,EAAGhc,EAAO,EAAGgc,EAAU,CAAC,EAC1B,CAAE,EAAGhc,EAAO,EAAG/H,EAAI,CAAC,EACpBA,CACV,CAAS,EACD,UAAWmkB,KAAeD,EACxBzB,EAAwBhK,EAAY,CAClCH,EACAyL,EACA,CAAE,EAAGhc,EAAO,EAAGgc,EAAU,CAAC,EAC1B,CAAE,EAAGhc,EAAO,EAAGoc,CAAW,EAC1B,CAAE,EAAGnkB,EAAI,EAAG,EAAGmkB,CAAW,EAC1BnkB,CACZ,CAAW,CAEL,CACF,CACF,EAAG,0CAA0C,EACvCokB,GAA6DhuB,EAAO,CAACqiB,EAAYH,EAAOyL,EAAWpG,IAAY,CACnH,MAAMqG,EAAkB,CAAC,GAAGzD,EAAqB,MAAM,EAAG,GAAGA,EAAqB,OAAO,CAAC,EACpF0D,EAAkB,CAAC,GAAG1D,EAAqB,KAAK,EAAG,GAAGA,EAAqB,QAAQ,CAAC,EAC1F,UAAWxZ,KAAQqZ,EAAO,CACxB,MAAMpgB,EAAM8G,GAAgB6W,EAAS5W,CAAI,EACnCsd,EAAgBtd,IAAS,QAAUA,IAAS,QAAUwZ,EAAqBxZ,CAAI,EAAIid,EACzF,UAAWjc,KAASkc,EAAiB,CACnCxB,EAAwBhK,EAAY,CAClCH,EACAyL,EACA,CAAE,EAAGA,EAAU,EAAG,EAAGhc,CAAK,EAC1B,CAAE,EAAG/H,EAAI,EAAG,EAAG+H,CAAK,EACpB/H,CACV,CAAS,EACD,UAAWmkB,KAAeE,EACxB5B,EAAwBhK,EAAY,CAClCH,EACAyL,EACA,CAAE,EAAGA,EAAU,EAAG,EAAGhc,CAAK,EAC1B,CAAE,EAAGoc,EAAa,EAAGpc,CAAK,EAC1B,CAAE,EAAGoc,EAAa,EAAGnkB,EAAI,CAAC,EAC1BA,CACZ,CAAW,CAEL,CACF,CACF,EAAG,4CAA4C,EACzCskB,GAAyDluB,EAAQwC,GAAS,CAC9E,MAAM8P,EAAQ9P,EAAK,MACb+P,EAAQ/P,EAAK,IACb+kB,EAAUhV,EAAQV,EAAa,IAAIU,CAAK,EAAI,OAClD,GAAI,CAACD,GAAS,CAACiV,EACb,MAAO,CAAA,EAET,MAAM1nB,EAASsP,GAAwB3M,EAAK,QAAU,CAAA,CAAE,EACxD,GAAI3C,EAAO,OAAS,EAClB,MAAO,CAAA,EAET,MAAMqiB,EAAQriB,EAAO,CAAC,EAChB8tB,EAAY9tB,EAAO,CAAC,EACpBwiB,EAAa,CAAA,EACnB,OAAI3T,GAAkBwT,EAAOyL,EAAW7N,CAAS,EAC/C4N,GAAyCrL,EAAYH,EAAOyL,EAAWpG,CAAO,EACrE9Y,GAAoByT,EAAOyL,EAAW7N,CAAS,GACxDkO,GAA2C3L,EAAYH,EAAOyL,EAAWpG,CAAO,EAE3ElF,CACT,EAAG,wCAAwC,EACrC8L,GAAoCnuB,EAAQwC,GAAS,CACzD,MAAM8P,EAAQ9P,EAAK,MACb+P,EAAQ/P,EAAK,IACb8kB,EAAUhV,EAAQT,EAAa,IAAIS,CAAK,EAAI,OAC5CiV,EAAUhV,EAAQV,EAAa,IAAIU,CAAK,EAAI,OAClD,GAAI,CAAC+U,GAAW,CAACC,EACf,MAAO,CAAA,EAET,MAAMlF,EAAa,CAAA,EACnB,UAAWxR,KAAWmZ,EAAO,CAC3B,MAAMoE,EAAU1d,GAAgB4W,EAASzW,CAAO,EAChD,UAAWC,KAAWkZ,EACpB3H,EAAW,KACT,GAAGiL,EAAwBc,EAASvd,EAASH,GAAgB6W,EAASzW,CAAO,EAAGA,CAAO,CACjG,CAEI,CACA,OAAAuR,EAAW,KAAK,GAAG6L,GAAuC1rB,CAAI,CAAC,EACxD6f,CACT,EAAG,mBAAmB,EAChBgM,GAAwCruB,EAAO,IAAM,IAAI,IAAI0jB,EAAa,IAAKlhB,GAAS,CAACA,EAAMwd,GAAYyF,EAAqBjjB,CAAI,CAAC,CAAC,CAAC,CAAC,EAAG,uBAAuB,EAClK8rB,GAA0CtuB,EAAO,CAACwC,EAAMqgB,EAAmB0L,IAAiB,CAChG,MAAMC,EAA4B,IAAI,IACtC,UAAWta,KAASwP,EAAc,CAChC,GAAIxP,IAAU1R,EACZ,SAEF,MAAMisB,EAAgBF,EAAa,IAAIra,CAAK,GAAK8L,GAAYyF,EAAqBvR,CAAK,CAAC,EACpF2O,EAAkB,KACnBG,GAAqByL,EAAc,KACjCxL,GAAiBrU,GAA6BoU,EAAkBC,EAAc,EAAG,GAAKlD,EACjG,CACA,GACQyO,EAAU,IAAIta,CAAK,CAEvB,CACA,OAAOsa,CACT,EAAG,yBAAyB,EACtBE,GAAoC1uB,EAAO,CAACwC,EAAM+V,EAASgW,EAAcI,IAAwB,CACrG,MAAMzG,EAAuB,IAAI,IAgCjC,OA/BmBiG,GAAkB3rB,CAAI,EAAE,IAAKwT,GAAcT,GAAiBpG,GAAwB6G,CAAS,CAAC,CAAC,EAAE,OAAQA,GAAc,CACxI,GAAIoW,EAAa5pB,EAAMwT,CAAS,EAC9B,MAAO,GAET,MAAMuT,EAAMvT,EAAU,IAAK5G,GAAU,GAAGA,EAAM,EAAE,QAAQ,CAAC,CAAC,IAAIA,EAAM,EAAE,QAAQ,CAAC,CAAC,EAAE,EAAE,KAAK,GAAG,EAC5F,OAAI8Y,EAAK,IAAIqB,CAAG,GAAKvT,EAAU,OAAS,EAC/B,IAETkS,EAAK,IAAIqB,CAAG,EACL,GACT,CAAC,EAAE,IAAKvT,GAAc,CACpB,MAAM6M,EAAoB7C,GAAYhK,CAAS,EAC/C,IAAImV,EAAsB,EAC1B,UAAWjX,KAASwP,EACdxP,IAAU1R,IAGd2oB,GAAuBZ,EACrB1H,EACA0L,EAAa,IAAIra,CAAK,GAAK8L,GAAYyF,EAAqBvR,CAAK,CAAC,CAC5E,GAEM,MAAO,CACL,UAAA8B,EACA,kBAAA6M,EACA,UAAWtK,EAAQ,OAASoW,EAAoB,IAAInsB,CAAI,GAAK,GAAK2oB,EAClE,MAAOlc,GAAqB+G,EAAW8J,CAAS,EAChD,WAAY7Q,GAAqB+G,CAAS,EAC1C,OAAQiT,EAAWjT,CAAS,CACpC,CACI,CAAC,EAAE,OAAO,CAAC,CAAE,UAAA7U,CAAS,IAAOA,GAAaoX,EAAQ,KAAK,EAAE,KAAK,CAAC3V,EAAGC,IAAMD,EAAE,UAAYC,EAAE,WAAaD,EAAE,MAAQC,EAAE,OAASD,EAAE,OAASC,EAAE,MAAM,EAC3H,MAAM,EAAG,EAA4B,EAAE,IAAKmT,IACrD,CACL,KAAMA,EAAU,UAChB,SAAUA,EAAU,kBACpB,qBAAsBsY,GACpB9rB,EACAwT,EAAU,kBACVuY,CACV,EACQ,WAAYvY,EAAU,WACtB,OAAQA,EAAU,MAC1B,EACK,CACH,EAAG,mBAAmB,EAChB4Y,GAAoC5uB,EAAO,CAACuY,EAASsW,EAAW7H,EAAgB8H,EAAY7H,EAAiBsH,IAAiB,CAClI,IAAItD,EAAkB,EACtB,UAAWC,KAAQ3S,EAAQ,OACrB2S,EAAK,QAAU2D,GAAa3D,EAAK,SAAW2D,GAAa3D,EAAK,QAAU4D,GAAc5D,EAAK,SAAW4D,KACxG7D,GAAmBC,EAAK,OAG5B,IAAIC,EAAsBZ,EACxBvD,EAAe,SACfC,EAAgB,QACtB,EACI,UAAW/S,KAASwP,EAAc,CAChC,GAAIxP,IAAU2a,GAAa3a,IAAU4a,EACnC,SAEF,MAAML,EAAgBF,EAAa,IAAIra,CAAK,GAAK8L,GAAYyF,EAAqBvR,CAAK,CAAC,EACxFiX,GAAuBZ,EAA6BvD,EAAe,SAAUyH,CAAa,EAAIlE,EAA6BtD,EAAgB,SAAUwH,CAAa,CACpK,CACA,OAAOlW,EAAQ,MAAQ0S,EAAkBE,CAC3C,EAAG,mBAAmB,EAChB4D,GAAoC/uB,EAAO,CAACgW,EAAWxT,IAAS,CACpE,UAAWwsB,KAAYhZ,EAAU,qBAC/B,GAAIgZ,IAAaxsB,EACf,MAAO,GAGX,MAAO,EACT,EAAG,mBAAmB,EAChBysB,GAAuCjvB,EAAO,CAACgnB,EAAgBC,IAAoBD,EAAe,SAAS,KAC9G/C,GAAiBgD,EAAgB,SAAS,KACxC/C,GAAkBtV,GAA6BqV,EAAcC,EAAe,EAAG,GAAKnE,EAC3F,CACA,EAAK,sBAAsB,EACnBmP,GAA8ClvB,EAAO,CAACkiB,EAAO8E,EAAgB7E,EAAQ8E,IAAoB8H,GAAkB/H,EAAgB7E,EAAO,IAAI,GAAK4M,GAAkB9H,EAAiB/E,EAAM,IAAI,GAAK,CAAC+M,GAAqBjI,EAAgBC,CAAe,EAAG,6BAA6B,EAClSkI,GAAuCnvB,EAAO,CAAC2W,EAASuL,EAAO8E,EAAgB7E,EAAQ8E,IAAoB,CAC/G,MAAM9lB,EAAYytB,GAChBjY,EAAQ,QACRuL,EAAM,KACN8E,EACA7E,EAAO,KACP8E,EACAtQ,EAAQ,YACd,EACI,GAAI,EAAAxV,GAAawV,EAAQ,QAAQ,OAGjC,MAAO,CACL,aAA8B,IAAI,IAAI,CACpC,CAACuL,EAAM,KAAM8E,EAAe,IAAI,EAChC,CAAC7E,EAAO,KAAM8E,EAAgB,IAAI,CAC1C,CAAO,EACD,UAAA9lB,EACA,MAAOwV,EAAQ,cAAgBA,EAAQ,gBAAgB,IAAIuL,EAAM,IAAI,GAAK,IAAMvL,EAAQ,gBAAgB,IAAIwL,EAAO,IAAI,GAAK,GAAK6E,EAAe,WAAaC,EAAgB,WAC7K,OAAQtQ,EAAQ,eAAiBA,EAAQ,iBAAiB,IAAIuL,EAAM,IAAI,GAAK,IAAMvL,EAAQ,iBAAiB,IAAIwL,EAAO,IAAI,GAAK,GAAK6E,EAAe,OAASC,EAAgB,MACnL,CACE,EAAG,sBAAsB,EACnBmI,GAAoCpvB,EAAO,CAACgW,EAAWqZ,IAASrZ,EAAU,UAAYqZ,EAAK,WAAarZ,EAAU,YAAcqZ,EAAK,YAAcrZ,EAAU,MAAQqZ,EAAK,OAASrZ,EAAU,QAAUqZ,EAAK,OAASrZ,EAAU,OAASqZ,EAAK,QAAS,mBAAmB,EACzQC,GAAyCtvB,EAAO,CAAC2W,EAASuL,EAAOC,EAAQkN,IAAS,CACtF,IAAIE,EAAWF,EACf,UAAWrI,KAAkB9E,EAAM,WACjC,UAAW+E,KAAmB9E,EAAO,WAAY,CAC/C,GAAI,CAAC+M,GAA4BhN,EAAO8E,EAAgB7E,EAAQ8E,CAAe,EAC7E,SAEF,MAAMuI,EAAQL,GAAqBxY,EAASuL,EAAO8E,EAAgB7E,EAAQ8E,CAAe,EACtFuI,GAASJ,GAAkBI,EAAOD,CAAQ,IAC5CA,EAAWC,EAEf,CAEF,OAAOD,CACT,EAAG,wBAAwB,EACrBE,GAAwCzvB,EAAQuY,GAAY,CAChE,MAAMkO,EAAeb,EAAU,EACzBgE,EAAgBqC,EAAW,EAC3BsC,EAAeF,GAAqB,EACpCM,EAAsB3C,EAAuBzT,CAAO,EACpDmX,EAAkB,IAAI,IAC1BhM,EAAa,IAAKlhB,GAAS,CAACA,EAAMyM,GAAqBwW,EAAqBjjB,CAAI,CAAC,CAAC,CAAC,CACzF,EACUmtB,EAAmB,IAAI,IAC3BjM,EAAa,IAAKlhB,GAAS,CAACA,EAAMymB,EAAWxD,EAAqBjjB,CAAI,CAAC,CAAC,CAAC,CAC/E,EACUotB,EAAgC,IAAI,IACpChE,EAASD,EAAiBpT,CAAO,EACvC,UAAWzN,KAAS8gB,EAClB,UAAWppB,KAAQsI,EAAO,CACxB,GAAI8kB,EAAc,IAAIptB,CAAI,EACxB,SAEF,MAAM6f,EAAaqM,GAAkBlsB,EAAM+V,EAASgW,EAAcI,CAAmB,EACjFtM,EAAW,OAAS,GACtBuN,EAAc,IAAIptB,EAAM,CAAE,KAAAA,EAAM,WAAA6f,CAAU,CAAE,CAEhD,CAEF,IAAIgN,EAAO,CACT,aAA8B,IAAI,IAClC,UAAW9W,EAAQ,MACnB,MAAOkO,EACP,OAAQmD,CACd,EACI,MAAMiG,EAAiB,CACrB,QAAAtX,EACA,aAAAkO,EACA,cAAAmD,EACA,gBAAA8F,EACA,iBAAAC,EACA,aAAApB,CACN,EACI,UAAWzjB,KAAS8gB,EAAQ,CAC1B,MAAMkE,EAAkB,IAAI,IAAIhlB,EAAM,OAAQtI,IAAS+V,EAAQ,QAAQ,IAAI/V,EAAI,CAAC,CAAC,EAC3EutB,EAAUjlB,EAAM,IAAKtI,IAASotB,EAAc,IAAIptB,EAAI,CAAC,EAAE,OAAQwtB,IAAW,EAAQA,EAAO,EAC/F,QAASjwB,GAAI,EAAGA,GAAIgwB,EAAQ,OAAQhwB,KAAK,CACvC,MAAMmiB,GAAQ6N,EAAQhwB,EAAC,EACvB,QAASuB,GAAIvB,GAAI,EAAGuB,GAAIyuB,EAAQ,OAAQzuB,KAAK,CAC3C,MAAM6gB,GAAS4N,EAAQzuB,EAAC,EACpB,CAACwuB,EAAgB,IAAI5N,GAAM,IAAI,GAAK,CAAC4N,EAAgB,IAAI3N,GAAO,IAAI,IAGxEkN,EAAOC,GAAuBO,EAAgB3N,GAAOC,GAAQkN,CAAI,EACnE,CACF,CACF,CACA,OAAOA,EAAK,aAAa,KAAO,EAAIA,EAAK,aAAe,MAC1D,EAAG,uBAAuB,EAC1B,QAAStN,EAAY,EAAGA,EAAY,EAAgBA,IAAa,CAC/D,MAAMxJ,EAAUkS,EAAgB,EAC1B/F,EAAmBnM,EAAQ,MACjC,GAAImM,IAAqB,EACvB,OAEF,IAAI8E,EACAC,EACA9C,EAAgBjC,EAChBkC,EAAY,OAAO,kBACvB,UAAWpkB,KAAQ+V,EAAQ,MAAO,CAChC,MAAM0X,EAAmBhhB,GAAqBwW,EAAqBjjB,CAAI,EAAGsd,CAAS,EACnF,UAAW9J,KAAamY,GAAkB3rB,CAAI,EAAG,CAC/C,MAAM0tB,EAAoB9D,EAAa5pB,EAAMwT,CAAS,EAChDma,EAA8B,CAACD,GAAqBhE,EAAuB1pB,EAAMwT,CAAS,EAC1FkR,EAAqB6E,EAAmCxT,EAAS/V,EAAMwT,CAAS,EAChFmR,GAAiBlY,GAAqB+G,EAAW8J,CAAS,EAC5DoQ,GAAqBC,GAIrB,EADwBjJ,EAAqBxC,GAAoBwC,IAAuBxC,GAAoByC,GAAiB8I,IAI7H/I,EAAqBP,GAAiBO,IAAuBP,GAAiBQ,IAAkBP,IAGpG4C,EAAWhnB,EACXinB,EAAWzT,EACX2Q,EAAgBO,EAChBN,EAAYO,GACd,CACF,CACA,GAAIqC,GAAYC,EAAU,CACxBD,EAAS,OAASC,EAClB,QACF,CACA,MAAM2G,EAAoBX,GAAsBlX,CAAO,EACvD,GAAI,CAAC6X,EACH,OAEF,SAAW,CAAC5tB,EAAM3C,CAAM,IAAKuwB,EAC3B5tB,EAAK,OAAS3C,CAElB,CACF,CACAG,EAAO8pB,GAAoC,oCAAoC,EAG/E,IAAIuG,GAAO,KACPC,GAAc,EAClB,SAASC,GAAsBrvB,EAAOmI,EAAO,CAC3C,KAAM,CAAE,aAAAwI,EAAc,cAAAC,GAAkBF,GAAsBvI,CAAK,EAC7D2gB,EAAQ,CAAC,MAAO,SAAU,OAAQ,OAAO,EACzCwG,EAAS,GACTvG,EAAgB,CACpB,IAAK,KAAK,IAAI,GAAGnY,EAAc,IAAKxI,GAASA,EAAK,KAAK,GAAG,CAAC,EAAIknB,EAC/D,OAAQ,KAAK,IAAI,GAAG1e,EAAc,IAAKxI,GAASA,EAAK,KAAK,MAAM,CAAC,EAAIknB,EACrE,KAAM,KAAK,IAAI,GAAG1e,EAAc,IAAKxI,GAASA,EAAK,KAAK,IAAI,CAAC,EAAIknB,EACjE,MAAO,KAAK,IAAI,GAAG1e,EAAc,IAAKxI,GAASA,EAAK,KAAK,KAAK,CAAC,EAAIknB,CACvE,EACQC,EAAgDzwB,EAAO,CAAC2J,EAAKkH,EAASjH,EAAKkH,IAAY,CAC3F,MAAM4f,EAAQ,CAAA,EACRnD,EAAO3c,GAAwBjH,EAAKkH,EAASjH,EAAKkH,EAAS0f,EAAQH,EAAI,EAC7E,OAAI9C,GACFmD,EAAM,KAAKnD,CAAI,EAEb1c,IAAYC,GACd4f,EAAM,KAAKhf,GAAuB/H,EAAKkH,EAASjH,EAAKqgB,EAAcpZ,CAAO,CAAC,CAAC,EAEvE6f,CACT,EAAG,+BAA+B,EAC5BtE,EAA+BpsB,EAAO,CAACqG,EAAKuM,IAAe,CAC/D,QAAS7S,EAAI,EAAGA,EAAIsG,EAAI,OAAS,EAAGtG,IAAK,CACvC,MAAM6C,EAAIyD,EAAItG,CAAC,EACT8C,EAAIwD,EAAItG,EAAI,CAAC,EACnB,GAAI2S,GAAmB9P,EAAGC,EAAGiP,EAAec,EAAY,CAAC,EACvD,MAAO,EAEX,CACA,MAAO,EACT,EAAG,cAAc,EACX+d,EAAoC3wB,EAAO,CAACsmB,EAAMsK,EAAaC,EAAuB,KAAU,CACpG,IAAIrC,EAAY,EAChB,MAAMrC,EAAetd,GAA4ByX,EAAM+J,EAAI,EACrDS,EAAeF,EAAY,MAC3BG,EAAaH,EAAY,IAC/B,UAAW1c,KAAShT,EAAO,CACzB,GAAIgT,IAAU0c,GAAe1c,EAAM,aACjC,SAEF,MAAM8c,EAAa9c,EAAM,MACnB+c,EAAW/c,EAAM,IACvB,GAAI,CAAC2c,GAAwBC,GAAgBC,IAAeC,IAAeF,GAAgBE,IAAeD,GAAcE,IAAaH,GAAgBG,IAAaF,GAChK,SAEF,MAAMG,EAAWhd,EAAM,OACvB,GAAI,GAACgd,GAAYA,EAAS,OAAS,GAGnC,UAAWC,KAAehF,EACxB,UAAWlJ,KAAgBpU,GAA4BqiB,EAAUb,EAAI,EAAG,CACtE,GAAIvd,GACFqe,EAAY,EACZA,EAAY,EACZlO,EAAa,EACbA,EAAa,EACboN,GACAA,EACZ,EAAa,CACD7B,IACA,QACF,CACI5f,GAA6BuiB,EAAalO,EAAcoN,EAAI,GAAKC,IACnE9B,GAEJ,CAEJ,CACA,OAAOA,CACT,EAAG,mBAAmB,EAChB4C,EAAiB,EACjBC,EAAoCrxB,EAAO,CAACsxB,EAAIvf,IAAS,CAC7D,MAAMwf,EAAO,KAAK,IAAID,EAAG,EAAIvf,EAAK,KAAK,GAAG,EACpCyf,EAAU,KAAK,IAAIF,EAAG,EAAIvf,EAAK,KAAK,MAAM,EAC1C0f,EAAQ,KAAK,IAAIH,EAAG,EAAIvf,EAAK,KAAK,IAAI,EACtC2f,EAAS,KAAK,IAAIJ,EAAG,EAAIvf,EAAK,KAAK,KAAK,EAC9C,IAAIsd,EAAO,MACPsC,EAAWJ,EACf,OAAIC,EAAUG,IACZtC,EAAO,SACPsC,EAAWH,GAETC,EAAQE,IACVtC,EAAO,OACPsC,EAAWF,GAETC,EAASC,IACXtC,EAAO,QACPsC,EAAWD,GAENrC,CACT,EAAG,mBAAmB,EAChBuC,EAA6B,IAAI,IACjCC,EAA+B7xB,EAAO,CAACqgB,EAAQ1P,EAAMmhB,IAAW,CACpE,MAAMC,EAASH,EAAW,IAAIvR,CAAM,GAAK,CAAA,EACzC0R,EAAO,KAAK,CAAE,KAAAphB,EAAM,OAAAmhB,CAAM,CAAE,EAC5BF,EAAW,IAAIvR,EAAQ0R,CAAM,CAC/B,EAAG,cAAc,EACjB,UAAWrrB,KAAKxF,EAAO,CACrB,GAAIwF,EAAE,aACJ,SAEF,MAAML,EAAMK,EAAE,QAAU,CAAA,EACxB,GAAIL,EAAI,OAAS,EACf,SAEF,MAAM2rB,EAAMtrB,EAAE,IAAM,GACd8a,EAAU9a,EAAE,MACZ+a,EAAQ/a,EAAE,IAChB,GAAI8a,EAAS,CACX,MAAMzP,EAAOF,EAAa,IAAI2P,CAAO,EACjCzP,GACF8f,EAAarQ,EAAS6P,EAAkBhrB,EAAI,CAAC,EAAG0L,CAAI,EAAGigB,CAAG,CAE9D,CACA,GAAIvQ,EAAO,CACT,MAAM1P,EAAOF,EAAa,IAAI4P,CAAK,EAC/B1P,GACF8f,EAAapQ,EAAO4P,EAAkBhrB,EAAIA,EAAI,OAAS,CAAC,EAAG0L,CAAI,EAAGigB,CAAG,CAEzE,CACF,CACA,MAAMC,EAAgCjyB,EAAO,CAACqgB,EAAQ1P,EAAMuhB,IACnDN,EAAW,IAAIvR,CAAM,GAAG,KAAMrZ,GAAMA,EAAE,SAAWkrB,GAAgBlrB,EAAE,OAAS2J,CAAI,GAAK,GAC3F,eAAe,EAClB,UAAWnO,KAAQtB,EAAO,CACxB,GAAIsB,EAAK,aACP,SAEF,MAAM6D,EAAM7D,EAAK,OACjB,GAAI,CAAC6D,GAAOA,EAAI,OAAS,EACvB,SAEF,MAAMogB,EAAexX,GAAqB5I,EAAKgqB,EAAI,EACnD,GAAI5J,EAAe2K,EACjB,SAEF,MAAM9e,EAAQ9P,EAAK,MACb+P,EAAQ/P,EAAK,IACnB,GAAI,CAAC8P,GAAS,CAACC,EACb,SAEF,MAAMC,EAAUX,EAAa,IAAIS,CAAK,EAChCG,EAAUZ,EAAa,IAAIU,CAAK,EACtC,GAAI,CAACC,GAAW,CAACC,EACf,SAEF,MAAMqf,EAAStvB,EAAK,IAAM,GACpB2vB,EAA2BxB,EAAkBtqB,EAAK7D,EAAM,EAAI,EAC5D4vB,EAA8BzB,EAAkBtqB,EAAK7D,CAAI,EAC/D,IAAIinB,EACA4I,EAAwBF,EACxBvL,EAAYH,EAChB,UAAW5V,KAAWmZ,EAAO,CAC3B,GAAIiI,EAAc3f,EAAOzB,EAASihB,CAAM,EACtC,SAEF,MAAM1D,EAAU1d,GAAgB8B,EAAS3B,CAAO,EAChD,UAAWC,KAAWkZ,EAAO,CAC3B,GAAIiI,EAAc1f,EAAOzB,EAASghB,CAAM,EACtC,SAEF,MAAMQ,EAAU5hB,GAAgB+B,EAAS3B,CAAO,EAChD,UAAWwV,KAAQmK,EAA8BrC,EAASvd,EAASyhB,EAASxhB,CAAO,EAAG,CACpF,GAAIsb,EAAa9F,EAAM,CAAChU,EAAOC,CAAK,CAAC,EACnC,SAEF,MAAMggB,GAAYtjB,GAAqBqX,EAAM+J,EAAI,EACjD,GAAI8B,EAA2B,EAAG,CAChC,MAAMK,GAAwB7B,EAAkBrK,EAAM9jB,EAAM,EAAI,EAChE,GAAIgwB,GAAwBH,GAAyBG,KAA0BH,GAAyBE,IAAa3L,EACnH,SAEFyL,EAAwBG,GACxB5L,EAAY2L,GACZ9I,EAAWnD,EACX,QACF,CACIqK,EAAkBrK,EAAM9jB,CAAI,EAAI4vB,GAGhCG,GAAY3L,IACdA,EAAY2L,GACZ9I,EAAWnD,EAEf,CACF,CACF,CACA,GAAImD,EAAU,CACZjnB,EAAK,OAASinB,EACd,MAAMgJ,EAAab,EAAW,IAAItf,CAAK,EACnCmgB,GACFb,EAAW,IACTtf,EACAmgB,EAAW,OAAQzrB,GAAMA,EAAE,SAAW8qB,CAAM,CACtD,EAEM,MAAMY,EAAad,EAAW,IAAIrf,CAAK,EACnCmgB,GACFd,EAAW,IACTrf,EACAmgB,EAAW,OAAQ1rB,GAAMA,EAAE,SAAW8qB,CAAM,CACtD,EAEMD,EAAavf,EAAO+e,EAAkB5H,EAAS,CAAC,EAAGjX,CAAO,EAAGsf,CAAM,EACnED,EAAatf,EAAO8e,EAAkB5H,EAASA,EAAS,OAAS,CAAC,EAAGhX,CAAO,EAAGqf,CAAM,CACvF,CACF,CACF,CACA9xB,EAAOuwB,GAAuB,uBAAuB,EAGrD,IAAIoC,GAAO,KACPC,GAA0B,GAC1BC,GAA8B,EAClC,SAASC,GAAuBzsB,EAAKiQ,EAAS,CAC5C,MAAMyc,EAAgBzc,EAAU,EAAIjQ,EAAI,OAAS,EAC3CkQ,EAAOD,EAAU,EAAI,GACrB0c,EAAM3sB,EAAI0sB,CAAa,EACvB1iB,EAAQhK,EAAI0sB,EAAgBxc,CAAI,EACtC,GAAI,CAACyc,GAAO,CAAC3iB,EACX,OAEF,MAAM1P,EAAK0P,EAAM,EAAI2iB,EAAI,EACnBpyB,EAAKyP,EAAM,EAAI2iB,EAAI,EAEzB,GAAI,EADQ,KAAK,IAAIryB,CAAE,EAAI,KAAK,IAAIC,CAAE,EAC5B+xB,IAGV,IAAI,KAAK,IAAI/xB,CAAE,GAAK+xB,GAAM,CACxB,MAAMM,EAAKD,EAAI,EAAI,KAAK,KAAKryB,CAAE,EAAIiyB,GACnC,MAAO,CACL,KAAM,KAAK,IAAII,EAAI,EAAGC,CAAE,EACxB,MAAO,KAAK,IAAID,EAAI,EAAGC,CAAE,EACzB,IAAKD,EAAI,EAAIH,GACb,OAAQG,EAAI,EAAIH,EACtB,CACE,CACA,GAAI,KAAK,IAAIlyB,CAAE,GAAKgyB,GAAM,CACxB,MAAMO,EAAKF,EAAI,EAAI,KAAK,KAAKpyB,CAAE,EAAIgyB,GACnC,MAAO,CACL,KAAMI,EAAI,EAAIH,GACd,MAAOG,EAAI,EAAIH,GACf,IAAK,KAAK,IAAIG,EAAI,EAAGE,CAAE,EACvB,OAAQ,KAAK,IAAIF,EAAI,EAAGE,CAAE,CAChC,CACE,CACA,MAAO,CACL,KAAM,KAAK,IAAIF,EAAI,EAAG3iB,EAAM,CAAC,EAC7B,MAAO,KAAK,IAAI2iB,EAAI,EAAG3iB,EAAM,CAAC,EAC9B,IAAK,KAAK,IAAI2iB,EAAI,EAAG3iB,EAAM,CAAC,EAC5B,OAAQ,KAAK,IAAI2iB,EAAI,EAAG3iB,EAAM,CAAC,CACnC,EACA,CACArQ,EAAO8yB,GAAwB,wBAAwB,EACvD,SAASK,GAAcvjB,EAAM,CAC3B,MAAO,CACL,KAAM,KAAK,IAAIA,EAAK,KAAMA,EAAK,KAAK,EACpC,MAAO,KAAK,IAAIA,EAAK,KAAMA,EAAK,KAAK,EACrC,IAAK,KAAK,IAAIA,EAAK,IAAKA,EAAK,MAAM,EACnC,OAAQ,KAAK,IAAIA,EAAK,IAAKA,EAAK,MAAM,CAC1C,CACA,CACA5P,EAAOmzB,GAAe,eAAe,EACrC,SAASC,GAAuBxjB,EAAMvJ,EAAK,CACzC,MAAMgtB,EAAalkB,GAAwB9I,CAAG,EACxCitB,EAAcR,GAAuBO,EAAY,EAAI,EACrDE,EAAYT,GAAuBO,EAAY,EAAK,EAC1D,MAAO,CAACC,EAAaC,CAAS,EAAE,KAC7BC,GAAWA,GAAUljB,GAAaV,EAAMujB,GAAcK,CAAM,CAAC,CAClE,CACA,CACAxzB,EAAOozB,GAAwB,wBAAwB,EACvD,SAASK,GAAuBvyB,EAAO4U,EAAa,CAClD,MAAM4d,EAAkB,CAAA,EACxB,UAAWxf,KAAShT,EAAO,CACzB,GAAIgT,EAAM,aACR,SAEF,MAAM7N,EAAM6N,EAAM,OAClB,GAAI,GAAC7N,GAAOA,EAAI,OAAS,GAGzB,QAAStG,EAAI,EAAGA,EAAIsG,EAAI,OAAS,EAAGtG,IAClC2zB,EAAgB,KAAK,CAAE,OAAQxf,EAAM,GAAI,GAAI7N,EAAItG,CAAC,EAAG,GAAIsG,EAAItG,EAAI,CAAC,CAAC,CAAE,CAEzE,CACA,MAAM4zB,EAAmB,CAAA,EACnBC,EAAa,CAAA,EACnB,UAAW3xB,KAAK6T,EAAY,SAAU,CACpC,MAAM+d,EAAU5xB,EAAE,QACZ2X,EAAW3X,EAAE,SACnB,GAAI4xB,GAAW,CAACja,EAAU,CACxB,MAAMka,EAAQrjB,GAAiBxO,CAAC,EAC5B6xB,GACFF,EAAW,KAAK,CACd,GAAI3xB,EAAE,GACN,KAAM6xB,CAChB,CAAS,EAEH,QACF,CAIA,GAHID,GAGA5xB,EAAE,YACJ,SAEF,MAAM2N,EAAOa,GAAiBxO,CAAC,EAC1B2N,GAGL+jB,EAAiB,KAAK,CACpB,OAAQ1xB,EAAE,GACV,KAAA2N,CACN,CAAK,CACH,CACA,MAAMmkB,EAAyB,EACzBC,EAAoB,EACpBC,EAA2B,GAC3BC,EAA2Cl0B,EAAO,CAACsf,EAAS1P,IAAS,CACzE,MAAMukB,EAAW5jB,GAAYX,EAAMmkB,CAAsB,EACzD,SAAW,CAAE,OAAA1T,EAAQ,KAAM+T,CAAE,IAAMT,EACjC,GAAItT,IAAWf,GAGXhP,GAAa6jB,EAAUC,CAAE,EAC3B,MAAO,GAGX,MAAO,EACT,EAAG,0BAA0B,EACvBC,EAA2Cr0B,EAAO,CAAC8xB,EAAQliB,IAAS,CACxE,MAAMukB,EAAW5jB,GAAYX,EAAMmkB,CAAsB,EACzD,UAAWO,KAAKZ,EACd,GAAIY,EAAE,SAAWxC,GAGbniB,GAAyB2kB,EAAE,GAAIA,EAAE,GAAIH,CAAQ,EAC/C,MAAO,GAGX,MAAO,EACT,EAAG,0BAA0B,EACvBI,EAAwCv0B,EAAO,CAACsf,EAASwS,EAAQliB,IAASskB,EAAyB5U,EAAS1P,CAAI,GAAKykB,EAAyBvC,EAAQliB,CAAI,EAAG,uBAAuB,EACpL4kB,EAAmB,CAAA,EACnBC,EAAqCz0B,EAAQ4P,GAAS,CAC1D,SAAW,CAAE,GAAAjF,EAAI,KAAM+pB,CAAQ,IAAMd,EACnC,GAAIzjB,GAAiBukB,EAAU9kB,CAAI,EACjC,OAAOjF,CAIb,EAAG,oBAAoB,EACjBgqB,EAAsC30B,EAAO,CAACsf,EAAS1P,IAAS4kB,EAAiB,KACpFI,GAAWA,EAAO,UAAYtV,GAAWhP,GAAaV,EAAMglB,EAAO,IAAI,CAC5E,EAAK,qBAAqB,EACxB,UAAWpyB,KAAQtB,EAAO,CACxB,GAAIsB,EAAK,aACP,SAEF,MAAM8c,EAAU9c,EAAK,YACrB,GAAI,CAAC8c,EACH,SAEF,MAAM3R,EAAYmI,EAAY,IAAIwJ,CAAO,EACzC,GAAI,CAAC3R,EACH,SAEF,MAAMtH,EAAM7D,EAAK,OACjB,GAAI,CAAC6D,GAAOA,EAAI,OAAS,EACvB,SAEF,MAAMkZ,EAAK5R,EAAU,OAAS,EACxB6R,EAAK7R,EAAU,QAAU,EAC/B,GAAI4R,GAAM,GAAKC,GAAM,EACnB,SAEF,MAAM1f,EAAW,CAAA,EACjB,QAASC,EAAI,EAAGA,EAAIsG,EAAI,OAAS,EAAGtG,IAAK,CACvC,MAAM6C,EAAIyD,EAAItG,CAAC,EACT8C,GAAIwD,EAAItG,EAAI,CAAC,EACbY,GAAK,KAAK,IAAIiC,EAAE,EAAIC,GAAE,CAAC,EACvBjC,GAAK,KAAK,IAAIgC,EAAE,EAAIC,GAAE,CAAC,EACzBlC,GAAKgyB,IAAQ/xB,GAAK+xB,IAGlBhyB,IAAMgyB,IAAQ/xB,IAAM+xB,IAGxB7yB,EAAS,KAAK,CACZ,IAAKC,EACL,OAAQY,GAAKC,GACb,YAAaD,IAAMgyB,GAAO,aAAe,WACzC,MAAO/vB,EAAE,EAAIC,GAAE,GAAK,EACpB,MAAOD,EAAE,EAAIC,GAAE,GAAK,CAC5B,CAAO,CACH,CACA,GAAI/C,EAAS,SAAW,EACtB,SAEF,MAAM+0B,EAAiB/0B,EAAS,QAAU,EAAIA,EAAS,OAAQw0B,GAAMA,EAAE,IAAM,GAAKA,EAAE,IAAMx0B,EAAS,OAAS,CAAC,EAAIA,EAC3Gg1B,EAAWD,EAAe,OAAS,EAAIA,EAAiB/0B,EACxDi1B,EAAgBxV,GAAMC,EAAK,aAAe,WAC1CwV,EAA+Bh1B,EAAQi1B,GACpC,CAAC,GAAGA,CAAI,EAAE,KAAK,CAACryB,EAAGC,KAAM,CAC9B,MAAMqyB,GAAYtyB,EAAE,cAAgBmyB,EAC9BI,GAAYtyB,GAAE,cAAgBkyB,EACpC,GAAIG,KAAcC,GAChB,OAAOD,GAAY,GAAK,EAE1B,MAAME,GAAQxyB,EAAE,SAAWA,EAAE,cAAgB,aAAe2c,EAAKC,GAAM,EACjE6V,GAAQxyB,GAAE,SAAWA,GAAE,cAAgB,aAAe0c,EAAKC,GAAM,EACvE,OAAI4V,KAAUC,GACLD,GAAQ,GAAK,EAEfvyB,GAAE,OAASD,EAAE,MACtB,CAAC,EACA,cAAc,EACX0yB,EAAsBx1B,EAAS,CAAC,EAChCy1B,EAAqBz1B,EAASA,EAAS,OAAS,CAAC,EACjD01B,EAAmB,CAAC,GAAK,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAK,EAAG,EACrEC,EAA4Bz1B,EAAO,CAACgB,EAAK00B,IAAM,CACnD,MAAM9yB,GAAIyD,EAAIrF,EAAI,GAAG,EACf6B,GAAIwD,EAAIrF,EAAI,IAAM,CAAC,EACzB,MAAO,CACL,KAAM4B,GAAE,GAAKC,GAAE,EAAID,GAAE,GAAK8yB,EAC1B,KAAM9yB,GAAE,GAAKC,GAAE,EAAID,GAAE,GAAK8yB,CAClC,CACI,EAAG,WAAW,EACRC,EAAwB31B,EAAO,CAAC6U,EAAOwC,EAAKC,KAAQ,KAAK,IAAIA,GAAK,KAAK,IAAID,EAAKxC,CAAK,CAAC,EAAG,OAAO,EAChG+gB,EAA2C51B,EAAO,CAACoP,EAAOQ,IAASR,EAAM,MAAQQ,EAAK,KAAO+iB,IAAQvjB,EAAM,MAAQQ,EAAK,MAAQ+iB,IAAQvjB,EAAM,MAAQQ,EAAK,IAAM+iB,IAAQvjB,EAAM,MAAQQ,EAAK,OAAS+iB,GAAM,0BAA0B,EACrOkD,EAAqC71B,EAAQ+Q,GAAW,CAC5D,MAAM+kB,EAAe5nB,GAAmB6C,EAAO,KAAMA,EAAO,KAAMwO,EAAIC,CAAE,EAClEuW,GAAetB,EAAmBqB,CAAY,EACpD,GAAIC,GACF,MAAO,CAAE,OAAQA,GAAc,OAAAhlB,EAAQ,KAAM+kB,CAAY,EAE3D,MAAME,GAAiBpC,EAAW,KAAK,CAAC,CAAE,KAAAhkB,EAAI,IAAOgmB,EAAyB7kB,EAAQnB,EAAI,CAAC,EAC3F,GAAI,CAAComB,GACH,OAEF,MAAMhrB,GAAOgrB,GAAe,KAAK,KAAOzW,EAAK,EAAIyU,EAC3C/oB,GAAO+qB,GAAe,KAAK,MAAQzW,EAAK,EAAIyU,EAC5C9oB,GAAO8qB,GAAe,KAAK,IAAMxW,EAAK,EAAIwU,EAC1C7oB,GAAO6qB,GAAe,KAAK,OAASxW,EAAK,EAAIwU,EACnD,GAAIhpB,GAAOC,IAAQC,GAAOC,GACxB,OAEF,MAAM8qB,GAAgB,CACpB,KAAMN,EAAM5kB,EAAO,KAAM/F,GAAMC,EAAI,EACnC,KAAM0qB,EAAM5kB,EAAO,KAAM7F,GAAMC,EAAI,CAC3C,EACY+qB,GAAchoB,GAAmB+nB,GAAc,KAAMA,GAAc,KAAM1W,EAAIC,CAAE,EACrF,OAAOoW,EAAyB7kB,EAAQmlB,EAAW,EAAI,CAAE,OAAQF,GAAe,GAAI,OAAQC,GAAe,KAAMC,EAAW,EAAK,MACnI,EAAG,oBAAoB,EACjBC,EAAuCn2B,EAAO,CAACgB,EAAK+P,EAAQ+F,KAAa9V,EAAI,cAAgB,aAAe,KAAK,IAAI+P,EAAO,KAAO+F,GAAS,CAAC,EAAI,KAAK,IAAI/F,EAAO,KAAO+F,GAAS,CAAC,EAAG,sBAAsB,EAC3Msf,GAA+Cp2B,EAAO,CAACgB,EAAK+P,IAAW,CAE3E,MAAMslB,IADkBr1B,EAAI,cAAgB,aAAeue,EAAK,EAAIC,EAAK,GAC9ByU,EAC3C,GAAIjzB,IAAQs0B,EAAqB,CAC/B,MAAMpd,GAAQ7R,EAAIrF,EAAI,GAAG,EACzB,GAAIm1B,EAAqBn1B,EAAK+P,EAAQmH,EAAK,EAAIya,GAAO0D,GACpD,MAAO,EAEX,CACA,GAAIr1B,IAAQu0B,EAAoB,CAC9B,MAAMpd,GAAM9R,EAAIrF,EAAI,IAAM,CAAC,EAC3B,GAAIm1B,EAAqBn1B,EAAK+P,EAAQoH,EAAG,EAAIwa,GAAO0D,GAClD,MAAO,EAEX,CACA,MAAO,EACT,EAAG,8BAA8B,EAC3BC,GAA0Bt2B,EAAQi1B,GAAS,CAC/C,MAAMsB,EAAavB,EAAaC,CAAI,EACpC,UAAWj0B,MAAOu1B,EAChB,UAAWb,MAAKF,EAAkB,CAChC,MAAMzkB,GAAS0kB,EAAUz0B,GAAK00B,EAAC,EAC/B,GAAI,CAACU,GAA6Bp1B,GAAK+P,EAAM,EAC3C,SAEF,MAAMylB,GAAYX,EAAmB9kB,EAAM,EAC3C,GAAKylB,IAGD,CAAApD,GAAuBoD,GAAU,KAAMnwB,CAAG,GAG1C,CAAAsuB,EAAoBrV,EAASkX,GAAU,IAAI,GAG3C,CAACjC,EAAsBjV,EAAS9c,EAAK,GAAIg0B,GAAU,IAAI,EACzD,MAAO,CAAE,OAAQA,GAAU,OAAQ,OAAQA,GAAU,MAAM,CAE/D,CAGJ,EAAG,SAAS,EACNC,GAA6Cz2B,EAAO,CAACi1B,EAAMyB,EAA0BC,GAA0B,KAAU,CAC7H,MAAMJ,GAAavB,EAAaC,CAAI,EACpC,UAAWj0B,MAAOu1B,GAAY,CAC5B,MAAMxlB,GAAS,CAAE,KAAM/P,GAAI,KAAM,KAAMA,GAAI,IAAI,EAC/C,GAAI01B,GAA4B,CAACN,GAA6Bp1B,GAAK+P,EAAM,EACvE,SAEF,MAAMylB,GAAYX,EAAmB9kB,EAAM,EAC3C,GAAIylB,IAAa,CAACpD,GAAuBoD,GAAU,KAAMnwB,CAAG,GAAK,CAACsuB,EAAoBrV,EAASkX,GAAU,IAAI,GAAK,CAACtC,EAAyB5U,EAASkX,GAAU,IAAI,IAAMG,IAA2B,CAACtC,EAAyB7xB,EAAK,GAAIg0B,GAAU,IAAI,GACnP,MAAO,CAAE,OAAQA,GAAU,OAAQ,OAAQA,GAAU,MAAM,CAE/D,CAEF,EAAG,4BAA4B,EACzBI,GAASN,GAAQxB,CAAQ,IAAMA,EAAS,OAASh1B,EAAS,OAASw2B,GAAQx2B,CAAQ,EAAI,SAAW22B,GAA2B32B,EAAU,EAAI,GAAK22B,GAA2B32B,EAAU,EAAK,GAAK22B,GAA2B32B,EAAU,GAAO,EAAI,EACrP,GAAI82B,GAAQ,CACVjpB,EAAU,EAAIipB,GAAO,OAAO,KAC5BjpB,EAAU,EAAIipB,GAAO,OAAO,KAC5BjpB,EAAU,SAAWipB,GAAO,OAC5B,MAAMC,EAAa3oB,GAAmB0oB,GAAO,OAAO,KAAMA,GAAO,OAAO,KAAMrX,EAAIC,CAAE,EAC9EsX,EAAWtC,EAAiB,UAAWI,IAAWA,GAAO,UAAYtV,CAAO,EAC9EwX,GAAY,EACdtC,EAAiBsC,CAAQ,EAAI,CAAE,QAAAxX,EAAS,KAAMuX,CAAU,EAExDrC,EAAiB,KAAK,CAAE,QAAAlV,EAAS,KAAMuX,CAAU,CAAE,CAEvD,CACF,CACF,CACA72B,EAAOyzB,GAAwB,wBAAwB,EAGvD,IAAIsD,GAAO,KACPC,GAAoB,EACpBC,GAAcD,GAAoB,EAClCE,GAAyB,EAC7B,SAASC,GAAQv0B,EAAGC,EAAG,CACrB,OAAOD,EAAIC,EAAI,GAAGD,CAAC,KAAKC,CAAC,GAAK,GAAGA,CAAC,KAAKD,CAAC,EAC1C,CACA5C,EAAOm3B,GAAS,SAAS,EACzB,SAASC,GAAkCl2B,EAAOmI,EAAO,CACvD,KAAM,CAAE,aAAAwI,EAAc,cAAAC,GAAkBF,GAAsBvI,CAAK,EAC7DguB,EAA+B,IAAI,IACzC,UAAWp1B,KAAKoH,EAAO,CACrB,MAAMsB,EAAK1I,EAAE,GACb,GAAI,CAAAA,EAAE,SAGFA,EAAE,YAAa,CACjBo1B,EAAa,IAAI1sB,EAAI,CACnB,EAAG1I,EAAE,OAAS,EACd,EAAGA,EAAE,QAAU,CACvB,CAAO,EACD,QACF,CACF,CACA,MAAMq1B,EAAoCt3B,EAAO,CAACu3B,EAAUC,EAAWC,EAAWld,IAAS,CACzF,MAAMmd,EAAaP,GAAQK,EAAWC,CAAS,EAC/C,IAAIE,EAAU,EACd,MAAMC,EAA2B53B,EAAQsf,GAAY,CACnD,GAAI,CAACA,EACH,OAEF,MAAMuY,EAAMR,EAAa,IAAI/X,CAAO,EACpC,GAAI,CAACuY,EACH,OAEF,MAAMjyB,EAAO2U,IAAS,IAAMsd,EAAI,EAAI,EAAIA,EAAI,EAAI,EAC5CjyB,EAAO+xB,IACTA,EAAU/xB,EAEd,EAAG,UAAU,EACbgyB,EAASL,EAAS,WAAW,EAC7B,UAAWrjB,KAAShT,EAAO,CAIzB,GAHIgT,IAAUqjB,GAGVrjB,EAAM,aACR,SAEF,MAAM4jB,EAAO5jB,EAAM,MACb6jB,EAAO7jB,EAAM,IACf,CAAC4jB,GAAQ,CAACC,GAGVZ,GAAQW,EAAMC,CAAI,IAAML,GAG5BE,EAAS1jB,EAAM,WAAW,CAC5B,CACA,OAAOyjB,EAAU,EAAIA,EAAUT,GAAyB,CAC1D,EAAG,mBAAmB,EACtB,UAAW10B,KAAQtB,EAAO,CACxB,GAAIsB,EAAK,aACP,SAEF,MAAM6D,EAAM7D,EAAK,OACjB,GAAI,CAAC8M,GAA0BjJ,EAAK0wB,EAAI,EACtC,SAEF,MAAMla,EAAWxK,GAAoB7P,EAAMqP,EAAcklB,EAAI,EAC7D,GAAI,CAACla,EACH,SAEF,KAAM,CAAE,MAAAvK,EAAO,MAAAC,EAAO,QAAAC,EAAS,QAAAC,EAAS,WAAAqK,EAAY,WAAAC,CAAU,EAAKF,EACnE,GAAIC,IAAeC,EACjB,SAEF,IAAIib,EACAC,EACJ,GAAInb,EAAY,CACd,MAAMob,EAAWzlB,EAAQ,GAAKD,EAAQ,GACtCwlB,EAAY,CAAE,EAAGxlB,EAAQ,GAAI,EAAG0lB,EAAW1lB,EAAQ,KAAK,OAASA,EAAQ,KAAK,GAAG,EACjFylB,EAAY,CAAE,EAAGxlB,EAAQ,GAAI,EAAGylB,EAAWzlB,EAAQ,KAAK,IAAMA,EAAQ,KAAK,MAAM,CACnF,KAAO,CACL,MAAM0lB,EAAU1lB,EAAQ,GAAKD,EAAQ,GACrCwlB,EAAY,CAAE,EAAGG,EAAU3lB,EAAQ,KAAK,MAAQA,EAAQ,KAAK,KAAM,EAAGA,EAAQ,EAAE,EAChFylB,EAAY,CAAE,EAAGE,EAAU1lB,EAAQ,KAAK,KAAOA,EAAQ,KAAK,MAAO,EAAGA,EAAQ,EAAE,CAClF,CACA,GAAIC,GAAmBslB,EAAWC,EAAWnmB,EAAe,CAACQ,EAAOC,CAAK,EAAG,CAAC,EAC3E,SAGF,MAAM6lB,EAAad,EAAkB90B,EAAM8P,EAAOC,EADhCuK,EAAa,IAAM,GAC6B,EAC5Dub,EAAiBD,EAAanB,GAAcmB,EAAanB,GACzDqB,EAAS,CAAC,EAAGD,EAAgB,CAACA,CAAc,EAClD,UAAWrb,KAASsb,EAAQ,CAC1B,MAAMC,EAAa,CAAE,GAAGP,CAAS,EAC3BQ,EAAa,CAAE,GAAGP,CAAS,EACjC,GAAInb,GAMF,GALAyb,EAAW,GAAKvb,EAChBwb,EAAW,GAAKxb,EACZub,EAAW,GAAK/lB,EAAQ,KAAK,MAAQ+lB,EAAW,GAAK/lB,EAAQ,KAAK,OAGlEgmB,EAAW,GAAK/lB,EAAQ,KAAK,MAAQ+lB,EAAW,GAAK/lB,EAAQ,KAAK,MACpE,iBAGF8lB,EAAW,GAAKvb,EAChBwb,EAAW,GAAKxb,EACZub,EAAW,GAAK/lB,EAAQ,KAAK,KAAO+lB,EAAW,GAAK/lB,EAAQ,KAAK,QAGjEgmB,EAAW,GAAK/lB,EAAQ,KAAK,KAAO+lB,EAAW,GAAK/lB,EAAQ,KAAK,OACnE,SAGJ,GAAI,CAAAC,GAAmB6lB,EAAYC,EAAY1mB,EAAe,CAACQ,EAAOC,CAAK,EAAG,CAAC,GAG3E,CAAAwB,GAA4BwkB,EAAYC,EAAYt3B,EAAOsB,EAAM,CAAE,QAASu0B,EAAI,CAAE,EAGtF,CAAAv0B,EAAK,OAAS,CAAC+1B,EAAYC,CAAU,EACrC,MACF,CACF,CACF,CACAx4B,EAAOo3B,GAAmC,mCAAmC,EAG7E,SAASqB,GAA4Bv3B,EAAO4U,EAAa,CAQvD,KAAM,CAAE,cAAAhE,EAAe,eAAgB6L,CAAU,EAAK3L,GACpD8D,EAAY,OAAM,CACtB,EACQ4iB,EAA+B14B,EAAO,CAACwC,EAAM3C,IAC1CgP,GAA4BhP,EAAQ,IAAU,EAAE,IAAKijB,IAAa,CACvE,GAAGA,EACH,KAAAtgB,EACA,SAAUsgB,EAAQ,OAAS,GAAKA,EAAQ,OAASjjB,EAAO,OAAS,CACvE,EAAM,EACD,aAAa,EACV84B,EAA8B34B,EAAO,IAAM,CAC/C,MAAM8O,EAAS,CAAA,EACf,UAAWtM,KAAQtB,EAAO,CACxB,GAAIsB,EAAK,aACP,SAEF,MAAM3C,EAAS2C,EAAK,OAChB,CAAC3C,GAAUA,EAAO,OAAS,GAG/BiP,EAAO,KAAK,GAAG4pB,EAAal2B,EAAM2M,GAAwBtP,CAAM,CAAC,CAAC,CACpE,CACA,OAAOiP,CACT,EAAG,aAAa,EACV8pB,EAA0C54B,EAAO,CAAC4C,EAAGC,IACrDD,EAAE,YAAcC,EAAE,WACb8L,GAAc/L,EAAE,EAAE,EAAGA,EAAE,EAAE,EAAGC,EAAE,EAAE,EAAGA,EAAE,EAAE,CAAC,GAAK,GAAe,KAAK,IAAID,EAAE,EAAE,EAAIC,EAAE,EAAE,CAAC,EAAI,EAE3FD,EAAE,UAAYC,EAAE,SACX8L,GAAc/L,EAAE,EAAE,EAAGA,EAAE,EAAE,EAAGC,EAAE,EAAE,EAAGA,EAAE,EAAE,CAAC,GAAK,GAAe,KAAK,IAAID,EAAE,EAAE,EAAIC,EAAE,EAAE,CAAC,EAAI,EAExF,GACN,yBAAyB,EACtB6f,EAAkC1iB,EAAO,CAACwC,EAAMwT,IAAc,CAClE,MAAM2M,EAAWngB,EAAK,MAChBogB,EAAWpgB,EAAK,IAChBqgB,EAAoB6V,EAAal2B,EAAMwT,CAAS,EACtD,GAAI6M,EAAkB,SAAW7M,EAAU,OAAS,EAClD,MAAO,GAET,MAAMqJ,EAAc,CAACsD,EAAUC,CAAQ,EAAE,OAAQjY,GAAO,EAAQA,CAAG,EAC7DkuB,EAAcr2B,EAAK,YAAc,CAACA,EAAK,WAAW,EAAI,CAAA,EAC5D,UAAWsgB,KAAWD,EAIpB,GAHInQ,GAAmBoQ,EAAQ,EAAGA,EAAQ,EAAGhR,EAAeuN,EAAa,EAAO,GAG5E3M,GAAmBoQ,EAAQ,EAAGA,EAAQ,EAAGnF,EAAYkb,EAAa,EAAO,EAC3E,MAAO,GAGX,UAAW3kB,KAAShT,EAAO,CACzB,GAAIgT,IAAU1R,GAAQ0R,EAAM,aAC1B,SAEF,MAAM6O,EAAc7O,EAAM,OAC1B,GAAI,GAAC6O,GAAeA,EAAY,OAAS,IAGzC,UAAWC,KAAoBH,EAC7B,UAAWI,KAAgByV,EAAaxkB,EAAO/E,GAAwB4T,CAAW,CAAC,EAIjF,GAHI6V,EAAwB5V,EAAkBC,CAAY,GAGtD5O,GACF2O,EAAiB,EACjBA,EAAiB,EACjBC,EAAa,EACbA,EAAa,EACb,IACZ,EACY,MAAO,GAIf,CACA,MAAO,EACT,EAAG,iBAAiB,EACdnC,EAAmC9gB,EAAO,CAAC8iB,EAAS/B,IAAU,CAClE,MAAMlhB,EAASsP,GAAwB2T,EAAQ,KAAK,QAAU,CAAA,CAAE,EAChE,GAAIjjB,EAAO,OAAS,GAAKijB,EAAQ,OAASjjB,EAAO,OAAS,EACxD,OAEF,MAAMmW,EAAYnW,EAAO,IAAKuC,IAAO,CAAE,GAAGA,CAAC,EAAG,EAC9C,GAAI0gB,EAAQ,WACV9M,EAAU8M,EAAQ,KAAK,EAAE,GAAK/B,EAC9B/K,EAAU8M,EAAQ,MAAQ,CAAC,EAAE,GAAK/B,UACzB+B,EAAQ,SACjB9M,EAAU8M,EAAQ,KAAK,EAAE,GAAK/B,EAC9B/K,EAAU8M,EAAQ,MAAQ,CAAC,EAAE,GAAK/B,MAElC,QAEF,OAAO2X,EAAa5V,EAAQ,KAAM9M,CAAS,EAAE,SAAWA,EAAU,OAAS,EAAIA,EAAY,MAC7F,EAAG,kBAAkB,EACf8iB,EAA6B94B,EAAO,CAACsJ,EAAMsG,KAAU,CACzD,EAAGtG,EAAK,IAAMsG,EAAK,KAAOA,EAAK,OAAS,EACxC,EAAGtG,EAAK,IAAMsG,EAAK,IAAMA,EAAK,QAAU,CAC5C,GAAM,YAAY,EACVmpB,EAAyC/4B,EAAQ8iB,GAAY,CACjE,MAAMtgB,EAAOsgB,EAAQ,KACfjjB,EAASsP,GAAwB3M,EAAK,QAAU,CAAA,CAAE,EACxD,GAAI3C,EAAO,SAAW,GAAKijB,EAAQ,QAAU,EAC3C,OAEF,MAAMxV,EAAa9K,EAAK,MAAQsT,EAAY,IAAItT,EAAK,KAAK,EAAI,OACxD+K,EAAa/K,EAAK,IAAMsT,EAAY,IAAItT,EAAK,GAAG,EAAI,OACpDw2B,EAAa1rB,EAAamD,GAAiBnD,CAAU,EAAI,OACzD2rB,EAAa1rB,EAAakD,GAAiBlD,CAAU,EAAI,OACzD2Y,EAAOrmB,EAAO,MAAMijB,EAAQ,MAAQ,CAAC,EAC3C,GAAI,GAACxV,GAAc,CAACC,GAAc,CAACyrB,GAAc,CAACC,GAAc/S,EAAK,SAAW,GAGhF,MAAO,CACL,aAAc4S,EAAWxrB,EAAY0rB,CAAU,EAC/C,aAAcF,EAAWvrB,EAAY0rB,CAAU,EAC/C,WAAAD,EACA,KAAA9S,CACN,CACE,EAAG,wBAAwB,EACrBgT,EAAuCl5B,EAAO,CAAC8iB,EAAS/B,EAAOoY,EAAcC,EAAcJ,EAAY9S,IAAS,CACpH,MAAMmT,EAAcD,EAAa,GAAKD,EAAa,EAC7CG,EAAcD,EAAcL,EAAW,OAASA,EAAW,IAC3DO,EAAQD,GAAeD,EAAc,GAAqB,KAChE,GAAIA,GAAevW,EAAQ,EAAE,GAAKyW,EAAQ,MAAc,CAACF,GAAevW,EAAQ,EAAE,GAAKyW,EAAQ,KAC7F,OAEF,MAAMC,EAAQ1W,EAAQ,EAAE,EAAI/B,EAC5B,OAAO5R,GACL,CACE,CAAE,EAAGgqB,EAAa,EAAG,EAAGG,CAAW,EACnC,CAAE,EAAGH,EAAa,EAAG,EAAGI,CAAK,EAC7B,CAAE,EAAGC,EAAO,EAAGD,CAAK,EACpB,CAAE,EAAGC,EAAO,EAAG1W,EAAQ,EAAE,CAAC,EAC1B,GAAGoD,CACX,EACM,IACN,CACE,EAAG,sBAAsB,EACnBuT,EAAyCz5B,EAAO,CAAC8iB,EAAS/B,EAAOoY,EAAcC,EAAcJ,EAAY9S,IAAS,CACtH,MAAMwT,EAAcN,EAAa,GAAKD,EAAa,EAC7CQ,EAAcD,EAAcV,EAAW,MAAQA,EAAW,KAC1DY,EAAQD,GAAeD,EAAc,GAAqB,KAChE,GAAIA,GAAe5W,EAAQ,EAAE,GAAK8W,EAAQ,MAAc,CAACF,GAAe5W,EAAQ,EAAE,GAAK8W,EAAQ,KAC7F,OAEF,MAAMC,EAAQ/W,EAAQ,EAAE,EAAI/B,EAC5B,OAAO5R,GACL,CACE,CAAE,EAAGwqB,EAAa,EAAGR,EAAa,CAAC,EACnC,CAAE,EAAGS,EAAO,EAAGT,EAAa,CAAC,EAC7B,CAAE,EAAGS,EAAO,EAAGC,CAAK,EACpB,CAAE,EAAG/W,EAAQ,EAAE,EAAG,EAAG+W,CAAK,EAC1B,GAAG3T,CACX,EACM,IACN,CACE,EAAG,wBAAwB,EACrB4T,EAAwC95B,EAAO,CAAC8iB,EAAS/B,IAAU,CACvE,MAAMpK,EAAUoiB,EAAuBjW,CAAO,EAC9C,GAAKnM,EAGL,IAAImM,EAAQ,SACV,OAAOoW,EACLpW,EACA/B,EACApK,EAAQ,aACRA,EAAQ,aACRA,EAAQ,WACRA,EAAQ,IAChB,EAEI,GAAImM,EAAQ,WACV,OAAO2W,EACL3W,EACA/B,EACApK,EAAQ,aACRA,EAAQ,aACRA,EAAQ,WACRA,EAAQ,IAChB,EAGE,EAAG,uBAAuB,EACpBmL,EAAS,CACb,GACA,EACA,IACA,GACA,IACA,EACJ,EACE,QAASC,EAAY,EAAGA,EAAY,GAAgBA,IAAa,CAC/D,MAAMjiB,EAAW64B,EAAW,EAC5B,IAAI1W,EAAQ,GACZ,QAASliB,EAAI,EAAGA,EAAID,EAAS,QAAU,CAACmiB,EAAOliB,IAC7C,QAASuB,EAAIvB,EAAI,EAAGuB,EAAIxB,EAAS,QAAU,CAACmiB,EAAO3gB,IAAK,CACtD,MAAM4gB,EAAQpiB,EAASC,CAAC,EAClBoiB,EAASriB,EAASwB,CAAC,EACzB,GAAI4gB,EAAM,OAASC,EAAO,MAAQ,CAACyW,EAAwB1W,EAAOC,CAAM,EACtE,SAEF,MAAME,EAAa,CAACH,EAAOC,CAAM,EAAE,OAAQW,GAAYA,EAAQ,QAAQ,EACvE,UAAWA,KAAWT,EAAY,CAChC,UAAWtB,KAASe,EAAQ,CAC1B,MAAMiY,EAASjZ,EAAiBgC,EAAS/B,CAAK,EAC9C,GAAIgZ,GAAUrX,EAAgBI,EAAQ,KAAMiX,CAAM,EAAG,CACnDjX,EAAQ,KAAK,OAASiX,EACtB9X,EAAQ,GACR,KACF,CACA,MAAM+X,EAAWF,EAAsBhX,EAAS/B,CAAK,EACrD,GAAIiZ,GAAYtX,EAAgBI,EAAQ,KAAMkX,CAAQ,EAAG,CACvDlX,EAAQ,KAAK,OAASkX,EACtB/X,EAAQ,GACR,KACF,CACF,CACA,GAAIA,EACF,KAEJ,CACF,CAEF,GAAI,CAACA,EACH,MAEJ,CACF,CACAjiB,EAAOy4B,GAA6B,6BAA6B,EAGjE,SAASwB,GAAkBzqB,EAAIC,EAAIC,EAAIyT,EAAI,CACzC,MAAM+W,EAAMzqB,EAAG,EAAID,EAAG,EAChB2qB,EAAM1qB,EAAG,EAAID,EAAG,EAChB4qB,EAAMjX,EAAG,EAAIzT,EAAG,EAChB2qB,EAAMlX,EAAG,EAAIzT,EAAG,EAChB4qB,EAAQJ,EAAMG,EAAMF,EAAMC,EAChC,GAAI,KAAK,IAAIE,CAAK,EAAI,MACpB,MAAO,GAET,MAAM35B,EAAK+O,EAAG,EAAIF,EAAG,EACf5O,EAAK8O,EAAG,EAAIF,EAAG,EACfkmB,GAAK/0B,EAAK05B,EAAMz5B,EAAKw5B,GAAOE,EAC5B1tB,GAAKjM,EAAKw5B,EAAMv5B,EAAKs5B,GAAOI,EAC5BC,EAAM,IACZ,OAAO7E,EAAI6E,GAAO7E,EAAI,EAAI6E,GAAO3tB,EAAI2tB,GAAO3tB,EAAI,EAAI2tB,CACtD,CACAv6B,EAAOi6B,GAAmB,mBAAmB,EAC7C,SAASO,GAAwBrxB,EAAQ,CACvC,MAAME,EAAQF,EAAO,OAAS,CAAA,EACxBjI,EAAQiI,EAAO,OAAS,CAAA,EACxBsxB,EAAS,CAAA,EACf,GAAI,CAACv5B,EAAM,QAAU,CAACmI,EAAM,OAC1B,OAAOoxB,EAET,MAAMC,EAAYvoB,GAAuB9I,CAAK,EAExCsxB,EAAe,CAAA,EACrB,UAAWn4B,KAAQtB,EAAO,CACxB,GAAIsB,EAAK,aACP,SAEF,MAAM3C,EAAS2C,EAAK,OACpB,GAAI,CAAC3C,GAAUA,EAAO,OAAS,EAC7B,SAEF,MAAM+6B,EAAYp4B,EAAK,MACjBq4B,EAAUr4B,EAAK,IACfs4B,EAAat4B,EAAK,YAClBsvB,EAAStvB,EAAK,IAAM,GAAGo4B,CAAS,KAAKC,CAAO,GAClD,UAAWjrB,KAAQ8qB,EACjB,GAAI,EAAA9qB,EAAK,SAAWgrB,GAAahrB,EAAK,SAAWirB,IAG7C,EAAAC,GAAclrB,EAAK,SAAWkrB,IAGlC,QAAS/6B,EAAI,EAAGA,EAAIF,EAAO,OAAS,EAAGE,IACrC,GAAI4P,GAAyB9P,EAAOE,CAAC,EAAGF,EAAOE,EAAI,CAAC,EAAG6P,EAAM,EAAQ,EAAG,CACtE6qB,EAAO,KAAK,CACV,KAAM,oBACN,OAAA3I,EACA,SAAUliB,EAAK,OACf,OAAQ,WAAW7P,CAAC,yBAAyB6P,EAAK,MAAM,GACpE,CAAW,EACD,KACF,EAGJ,QAAS7P,EAAI,EAAGA,EAAIF,EAAO,OAAS,EAAGE,IACrC46B,EAAa,KAAK,CAChB,OAAA7I,EACA,MAAO8I,EACP,IAAKC,EACL,GAAIh7B,EAAOE,CAAC,EACZ,GAAIF,EAAOE,EAAI,CAAC,CACxB,CAAO,CAEL,CACA,MAAMg7B,EAAgC,IAAI,IAC1C,QAASh7B,EAAI,EAAGA,EAAI46B,EAAa,OAAQ56B,IACvC,QAASuB,EAAIvB,EAAI,EAAGuB,EAAIq5B,EAAa,OAAQr5B,IAAK,CAChD,MAAMsB,EAAI+3B,EAAa56B,CAAC,EAClB8C,EAAI83B,EAAar5B,CAAC,EACxB,GAAIsB,EAAE,SAAWC,EAAE,QAGf,EAAAD,EAAE,QAAUC,EAAE,OAASD,EAAE,QAAUC,EAAE,KAAOD,EAAE,MAAQC,EAAE,OAASD,EAAE,MAAQC,EAAE,MAG7Eo3B,GAAkBr3B,EAAE,GAAIA,EAAE,GAAIC,EAAE,GAAIA,EAAE,EAAE,EAAG,CAC7C,MAAMm4B,EAAWp4B,EAAE,OAASC,EAAE,OAAS,GAAGD,EAAE,MAAM,IAAIC,EAAE,MAAM,GAAK,GAAGA,EAAE,MAAM,IAAID,EAAE,MAAM,GACrFm4B,EAAc,IAAIC,CAAQ,IAC7BD,EAAc,IAAIC,CAAQ,EAC1BP,EAAO,KAAK,CACV,KAAM,qBACN,OAAQ73B,EAAE,OACV,SAAUC,EAAE,OACZ,OAAQ,UAAUD,EAAE,MAAM,UAAUC,EAAE,MAAM,SACxD,CAAW,EAEL,CACF,CAEF,GAAI43B,EAAO,OAAS,EAAG,CACrB,MAAMQ,EAAWR,EAAO,OAAQ,GAAM,EAAE,OAAS,mBAAmB,EAAE,OAChEt5B,EAAYs5B,EAAO,OAAQ,GAAM,EAAE,OAAS,oBAAoB,EAAE,OACxEjtB,GAAI,KACF,uBAAuBitB,EAAO,MAAM,uBAAuBQ,CAAQ,0BAA0B95B,CAAS,mBAC5G,EACI,UAAW+5B,KAAST,EAClBjtB,GAAI,KAAK,yBAAyB0tB,EAAM,IAAI,KAAKA,EAAM,MAAM,EAAE,CAEnE,CACA,OAAOT,CACT,CACAz6B,EAAOw6B,GAAyB,yBAAyB,EAGzD,SAASW,GAA0BhyB,EAAQC,EAAW,CACpD,MAAMC,EAAQF,EAAO,OAAS,CAAA,EACxBjI,EAAQiI,EAAO,OAAS,CAAA,EACxBqR,EAAenR,EAAM,OAAQpH,GAAM,CAACA,EAAE,OAAO,EAInD,IAHKmH,IAAc,MAAQA,IAAc,OAASoR,EAAa,OAAS,GAAK,CAACI,GAA0BzR,EAAQC,CAAS,GAGrHA,IAAc,MAAQoR,EAAa,OAAS,GAAK,CAACG,GAA0BxR,CAAM,EACpF,OAEF,UAAW3G,KAAQtB,EAAO,CACxB,GAAIsB,EAAK,aACP,SAEF,MAAM6D,EAAM7D,EAAK,OACb,CAAC6D,GAAOA,EAAI,OAAS,IAGzB7D,EAAK,OAAS+S,GACZH,GAAsB/O,CAAG,CAC/B,EACE,CACAkqB,GAAsBrvB,EAAOmI,CAAK,EAClC+tB,GAAkCl2B,EAAOmI,CAAK,EAC9CqT,GAAiBxb,EAAOmI,CAAK,EAC7B,MAAMyM,EAA8B,IAAI,IACxC,UAAW7T,KAAKoH,EACdyM,EAAY,IAAI,OAAO7T,EAAE,EAAE,EAAGA,CAAC,EAEjCwxB,GAAuBvyB,EAAO4U,CAAW,EACzCY,GAAkCxV,EAAO4U,CAAW,EACpD4H,GAA0Bxc,EAAO4U,CAAW,EAC5C2iB,GAA4Bv3B,EAAO4U,CAAW,EAC9CoK,GAAoChf,EAAO4U,CAAW,EACtD2M,GAAoCvhB,EAAO4U,CAAW,EACtD2N,GAAiCviB,EAAO4U,CAAW,EACnD0P,GAA8CtkB,EAAO4U,CAAW,EAChE,MAAMslB,EAAwCp7B,EAAO,IAAM,CACzD8pB,GAAmC5oB,EAAO4U,CAAW,EACrDsR,GAAqClmB,EAAO4U,CAAW,EACvDkT,GAAgC9nB,EAAO4U,CAAW,EAClD2d,GAAuBvyB,EAAO4U,CAAW,EACzCwD,GAAgCpY,EAAO4U,CAAW,EAClD2N,GAAiCviB,EAAO4U,CAAW,EACnD2d,GAAuBvyB,EAAO4U,CAAW,EACzCwD,GAAgCpY,EAAO4U,CAAW,CACpD,EAAG,uBAAuB,EAC1BslB,EAAqB,EACrB3C,GAA4Bv3B,EAAO4U,CAAW,EAC9CslB,EAAqB,EACrBxW,GAAgC1jB,EAAO4U,CAAW,EAClDqP,GAAmCjkB,EAAO4U,CAAW,EACrD8O,GAAgC1jB,EAAO4U,CAAW,EAClDqP,GAAmCjkB,EAAO4U,CAAW,CACvD,CACA9V,EAAOm7B,GAA2B,2BAA2B,EAG7D,SAASE,GAAepxB,EAAG,CACzB,MAAMP,EAAW,IAAI,IAAIO,EAAE,QAAQ,EAC7Bie,EAAuB,IAAI,IAC3BhnB,EAAQ,CAAA,EACd,UAAWwF,KAAKuD,EAAE,MAAO,CACvB,GAAI,CAACP,EAAS,IAAIhD,EAAE,GAAG,GAAK,CAACgD,EAAS,IAAIhD,EAAE,GAAG,EAC7C,SAEF,MAAM6iB,EAAM,GAAG7iB,EAAE,EAAE,IAAIA,EAAE,GAAG,KAAKA,EAAE,GAAG,GAClCwhB,EAAK,IAAIqB,CAAG,IAGhBrB,EAAK,IAAIqB,CAAG,EACZroB,EAAM,KAAKwF,CAAC,EACd,CAEA,MAAO,CAAE,MADK,CAAC,GAAGgD,EAAS,KAAI,CAAE,EACjB,MAAAxI,EAAO,OAAQ+I,EAAE,OAAQ,SAAAP,CAAQ,CACnD,CACA1J,EAAOq7B,GAAgB,gBAAgB,EACvC,SAASC,GAASrxB,EAAGsxB,EAAG,CACtB,OAAOtxB,EAAE,MAAM,OAAQvD,GAAMA,EAAE,MAAQ60B,CAAC,CAC1C,CACAv7B,EAAOs7B,GAAU,UAAU,EAC3B,SAASE,GAAkBvxB,EAAG,CAC5B,MAAMwxB,EAAwB,IAAI,IAClC,UAAWF,KAAKtxB,EAAE,MAChBwxB,EAAM,IAAIF,EAAG,EAAE,EAEjB,UAAW70B,KAAKuD,EAAE,MAChBwxB,EAAM,IAAI/0B,EAAE,GAAG,EAAE,KAAKA,EAAE,GAAG,EAE7B,OAAO+0B,CACT,CACAz7B,EAAOw7B,GAAmB,mBAAmB,EAC7C,SAASE,GAAwBzxB,EAAG,CAClC,MAAMwxB,EAAQD,GAAkBvxB,CAAC,EACjC,UAAW0xB,KAAcF,EAAM,SAC7BE,EAAW,KAAK,CAAC/4B,EAAGC,IAAMD,EAAE,cAAcC,CAAC,CAAC,EAE9C,OAAO44B,CACT,CACAz7B,EAAO07B,GAAyB,yBAAyB,EACzD,SAASE,GAAiB3xB,EAAG,CAC3B,MAAM4xB,EAAwB,IAAI,IAClC,UAAWN,KAAKtxB,EAAE,MAChB4xB,EAAM,IAAIN,EAAG,CAAC,EAEhB,UAAW70B,KAAKuD,EAAE,MAChB4xB,EAAM,IAAIn1B,EAAE,KAAMm1B,EAAM,IAAIn1B,EAAE,GAAG,GAAK,GAAK,CAAC,EAE9C,OAAOm1B,CACT,CACA77B,EAAO47B,GAAkB,kBAAkB,EAC3C,SAASE,GAAwBD,EAAO,CACtC,MAAO,CAAC,GAAGA,EAAM,QAAO,CAAE,EAAE,OAAO,CAAC,CAAA,CAAGE,CAAM,IAAMA,IAAW,CAAC,EAAE,IAAI,CAAC,CAACpxB,CAAE,IAAMA,CAAE,EAAE,KAAK,CAAC/H,EAAGC,IAAMD,EAAE,cAAcC,CAAC,CAAC,CACtH,CACA7C,EAAO87B,GAAyB,yBAAyB,EACzD,SAASE,GAA8B/xB,EAAGgyB,EAAc,IAAM,GAAM,CAClE,MAAMC,EAAwB,IAAI,IAC5BT,EAAwB,IAAI,IAClC,UAAWF,KAAKtxB,EAAE,MAChBiyB,EAAM,IAAIX,EAAG,EAAE,EACfE,EAAM,IAAIF,EAAG,EAAE,EAEjB,UAAW70B,KAAKuD,EAAE,MACXgyB,EAAYv1B,CAAC,IAGlB+0B,EAAM,IAAI/0B,EAAE,GAAG,EAAE,KAAKA,EAAE,GAAG,EAC3Bw1B,EAAM,IAAIx1B,EAAE,GAAG,EAAE,KAAKA,EAAE,GAAG,GAE7B,MAAO,CAAE,MAAAw1B,EAAO,MAAAT,CAAK,CACvB,CACAz7B,EAAOg8B,GAA+B,+BAA+B,EACrE,SAASG,GAAqBlyB,EAAGmyB,EAAOC,EAAQjyB,EAAM,CACpD,IAAIkyB,EAAU,EACd,UAAWf,KAAKtxB,EAAE,MACZG,GAAM,YAAcH,EAAE,SAAS,IAAIsxB,CAAC,GAAG,UAG3Ce,EAAU,KAAK,IAAIA,EAASD,EAAOd,CAAC,GAAK,CAAC,GAE5C,MAAMgB,EAAS,MAAM,KAAK,CAAE,OAAQD,EAAU,GAAK,IAAM,EAAE,EAC3D,UAAWf,KAAKa,EACVhyB,GAAM,YAAcH,EAAE,SAAS,IAAIsxB,CAAC,GAAG,SAG3CgB,EAAO,KAAK,IAAI,EAAGF,EAAOd,CAAC,GAAK,CAAC,CAAC,EAAE,KAAKA,CAAC,EAE5C,OAAOgB,CACT,CACAv8B,EAAOm8B,GAAsB,sBAAsB,EACnD,SAASK,GAAkBvyB,EAAG,CAC5B,MAAM4xB,EAAQD,GAAiB3xB,CAAC,EAC1Bke,EAAQ2T,GAAwBD,CAAK,EACrCO,EAAQ,CAAA,EACRK,EAAMf,GAAwBzxB,CAAC,EACrC,KAAOke,EAAM,QAAQ,CACnB,MAAMvb,EAAIub,EAAM,MAAK,EACrBiU,EAAM,KAAKxvB,CAAC,EACZ,UAAW2uB,KAAKkB,EAAI,IAAI7vB,CAAC,GAAK,CAAA,EAE5B,GADAivB,EAAM,IAAIN,GAAIM,EAAM,IAAIN,CAAC,GAAK,GAAK,CAAC,GAC/BM,EAAM,IAAIN,CAAC,GAAK,KAAO,EAAG,CAC7B,IAAIx7B,EAAI,EACR,KAAOA,EAAIooB,EAAM,QAAUA,EAAMpoB,CAAC,EAAIw7B,GACpCx7B,IAEFooB,EAAM,OAAOpoB,EAAG,EAAGw7B,CAAC,CACtB,CAEJ,CACA,OAAOa,EAAM,SAAWnyB,EAAE,MAAM,OAASmyB,EAAQ,IACnD,CACAp8B,EAAOw8B,GAAmB,mBAAmB,EAC7C,SAASE,GAAgBjyB,EAAO,CAC9B,MAAMkyB,EAAoB,IAAI,IAC9B,IAAIxlB,EAAQ,EACZ,UAAWxM,KAAMF,EACfkyB,EAAE,IAAIhyB,EAAIwM,CAAK,EACfA,IAEF,OAAOwlB,CACT,CACA38B,EAAO08B,GAAiB,iBAAiB,EACzC,SAASE,GAAgBC,EAAQ,CAC/B,MAAMC,EAAM,IAAI,MAAMD,EAAO,MAAM,EAC7BnwB,EAAwB1M,EAAO,CAAC+8B,EAAMC,IAAU,CACpD,GAAIA,EAAQD,GAAQ,EAClB,MAAO,GAET,MAAME,EAAMF,EAAOC,GAAS,EAC5B,IAAIE,EAAaxwB,EAAMqwB,EAAME,CAAG,EAAIvwB,EAAMuwB,EAAKD,CAAK,EAChDj9B,EAAIg9B,EACJz7B,EAAI27B,EACJv3B,EAAIq3B,EACR,KAAOh9B,EAAIk9B,GAAO37B,EAAI07B,GAChB17B,GAAK07B,GAASj9B,EAAIk9B,GAAOJ,EAAO98B,CAAC,GAAK88B,EAAOv7B,CAAC,EAChDw7B,EAAIp3B,GAAG,EAAIm3B,EAAO98B,GAAG,GAErB+8B,EAAIp3B,GAAG,EAAIm3B,EAAOv7B,GAAG,EACrB47B,GAAcD,EAAMl9B,GAGxB,QAAS21B,EAAIqH,EAAMrH,EAAIsH,EAAOtH,IAC5BmH,EAAOnH,CAAC,EAAIoH,EAAIpH,CAAC,EAEnB,OAAOwH,CACT,EAAG,OAAO,EACV,OAAOxwB,EAAM,EAAGmwB,EAAO,MAAM,CAC/B,CACA78B,EAAO48B,GAAiB,iBAAiB,EAGzC,SAASO,GAAiBlzB,EAAG,CAC3B,MAAMmzB,EAAK/B,GAAepxB,CAAC,EACrBwyB,EAAsB,IAAI,IAChC,UAAWlB,KAAK6B,EAAG,MACjBX,EAAI,IAAIlB,EAAG,EAAE,EAEf,UAAW70B,KAAK02B,EAAG,MACjBX,EAAI,IAAI/1B,EAAE,GAAG,EAAE,KAAKA,CAAC,EAEvB,UAAW22B,KAAOZ,EAAI,SACpBY,EAAI,KAAK,CAACz6B,EAAGC,IAAMD,EAAE,MAAQC,EAAE,IAAMD,EAAE,GAAG,cAAcC,EAAE,EAAE,EAAID,EAAE,IAAI,cAAcC,EAAE,GAAG,CAAC,EAE5F,MAAMy6B,EAAwB,OAAO,OAAO,IAAI,EAChD,UAAW/B,KAAK6B,EAAG,MACjBE,EAAM/B,CAAC,EAAI,EAEb,MAAMgC,EAAW,CAAA,EACXC,EAAsBx9B,EAAQ4M,GAAM,CACxC0wB,EAAM1wB,CAAC,EAAI,EACX,UAAWlG,KAAK+1B,EAAI,IAAI7vB,CAAC,GAAK,CAAA,EAAI,CAChC,MAAM2uB,EAAI70B,EAAE,IACR42B,EAAM/B,CAAC,IAAM,EACfiC,EAAIjC,CAAC,EACI+B,EAAM/B,CAAC,IAAM,GACtBgC,EAAS,KAAK72B,CAAC,CAEnB,CACA42B,EAAM1wB,CAAC,EAAI,CACb,EAAG,KAAK,EACF6wB,EAAc,CAAC,GAAGL,EAAG,KAAK,EAAE,KAAK,CAACx6B,EAAGC,IAAMD,EAAE,cAAcC,CAAC,CAAC,EACnE,UAAW04B,KAAKkC,EACVH,EAAM/B,CAAC,IAAM,GACfiC,EAAIjC,CAAC,EAGT,MAAMmC,EAAY,IAAI,IAAIH,EAAS,IAAK72B,GAAM,GAAGA,EAAE,EAAE,IAAIA,EAAE,GAAG,KAAKA,EAAE,GAAG,EAAE,CAAC,EACrEi3B,EAAYP,EAAG,MAAM,IACxB12B,GAAMg3B,EAAU,IAAI,GAAGh3B,EAAE,EAAE,IAAIA,EAAE,GAAG,KAAKA,EAAE,GAAG,EAAE,EAAI,CAAE,GAAIA,EAAE,GAAI,IAAKA,EAAE,IAAK,IAAKA,EAAE,IAAK,OAAQA,EAAE,OAAQ,IAAKA,EAAE,GAAG,EAAKA,CAC9H,EAOE,MAAO,CAAE,QANO,CACd,MAAO,CAAC,GAAG02B,EAAG,KAAK,EACnB,MAAOO,EACP,OAAQP,EAAG,OACX,SAAU,IAAI,IAAIA,EAAG,QAAQ,CACjC,EACoB,SAAAG,CAAQ,CAC5B,CACAv9B,EAAOm9B,GAAkB,kBAAkB,EAG3C,SAASS,GAAgB3zB,EAAG,CAC1B,MAAM4zB,EAAwB,IAAI,IAC5BC,EAA0B99B,EAAQ2K,GAAO,CAC7C,GAAIkzB,EAAM,IAAIlzB,CAAE,EACd,OAAOkzB,EAAM,IAAIlzB,CAAE,EAErB,MAAMrB,EAAOW,EAAE,SAAS,IAAIU,CAAE,EAC9B,GAAI,CAACrB,EACH,OAAAu0B,EAAM,IAAIlzB,EAAI,IAAI,EACX,KAET,MAAMiP,EAAWtQ,EAAK,SACtB,GAAI,CAACsQ,EACH,OAAAikB,EAAM,IAAIlzB,EAAI,IAAI,EACX,KAGT,MAAMpC,EADau1B,EAAQlkB,CAAQ,GACRA,EAC3B,OAAAikB,EAAM,IAAIlzB,EAAIpC,CAAI,EACXA,CACT,EAAG,SAAS,EACZ,UAAWoC,KAAMV,EAAE,MACjB6zB,EAAQnzB,CAAE,EAEZ,OAAOkzB,CACT,CACA79B,EAAO49B,GAAiB,iBAAiB,EACzC,SAASG,GAAsB9zB,EAAG,CAChC,MAAM+zB,EAAaJ,GAAgB3zB,CAAC,EACpC,OAAQU,GAAOqzB,EAAW,IAAIrzB,CAAE,GAAK,IACvC,CACA3K,EAAO+9B,GAAuB,uBAAuB,EACrD,SAASE,GAAkBh0B,EAAG,CAC5B,MAAM+X,EAAQ,CAAA,EACd,UAAW1Y,KAAQW,EAAE,OAAO,OAAS,CAAA,EAC/BX,EAAK,SAAW,CAACA,EAAK,UACxB0Y,EAAM,KAAK1Y,EAAK,EAAE,EAGtB,MAAO,CAAC,GAAG,IAAI,IAAI0Y,CAAK,CAAC,EAAE,QAAO,CACpC,CACAhiB,EAAOi+B,GAAmB,mBAAmB,EAC7C,SAASC,GAAoBj0B,EAAGk0B,EAAgB,CAC9C,MAAMC,EAAcH,GAAkBh0B,CAAC,EACvC,GAAI,CAACk0B,GAAkBA,EAAe,SAAW,EAC/C,OAAOC,EAET,MAAMC,EAAgB,IAAI,IAAID,CAAW,EACnClW,EAAuB,IAAI,IAC3BoW,EAAW,CAAA,EACjB,UAAW7iB,KAAU0iB,EACf,CAACE,EAAc,IAAI5iB,CAAM,GAAKyM,EAAK,IAAIzM,CAAM,IAGjDyM,EAAK,IAAIzM,CAAM,EACf6iB,EAAS,KAAK7iB,CAAM,GAEtB,UAAWA,KAAU2iB,EACflW,EAAK,IAAIzM,CAAM,GAGnB6iB,EAAS,KAAK7iB,CAAM,EAEtB,OAAO6iB,CACT,CACAt+B,EAAOk+B,GAAqB,qBAAqB,EAGjD,IAAIK,GAAY,CAEd,QAAS,IACX,EACIC,GAAW,CAEb,mBAAoB,EAEpB,iCAAkC,EAElC,6BAA8B,EAChC,EACIC,GAAc,CAEhB,kBAAmB,IAEnB,iBAAkB,EACpB,EAGA,SAASC,GAAiBC,EAAOv0B,EAAM,CACrC,MAAMH,EAAIoxB,GAAesD,CAAK,EACxBC,EAASx0B,GAAM,SAAW,IAAM,MAChCy0B,EAAWz0B,GAAM,SACjB,CAAE,MAAA8xB,CAAK,EAAKF,GAA8B/xB,CAAC,EACjD,UAAWozB,KAAOnB,EAAM,SACtBmB,EAAI,KAAK,CAACz6B,EAAGC,IAAMD,EAAE,cAAcC,CAAC,CAAC,EAEvC,MAAMi8B,EAAYtC,GAAkBvyB,CAAC,GAAK,CAAC,GAAGA,EAAE,KAAK,EAAE,KAAK,CAACrH,EAAGC,IAAMD,EAAE,cAAcC,CAAC,CAAC,EAClFk8B,EAA4B,IAAI,IACtC,SAAW,CAACC,EAAKr0B,CAAE,IAAKm0B,EAAU,QAAO,EACvCC,EAAU,IAAIp0B,EAAIq0B,CAAG,EAEvB,MAAMllB,EAAyB,IAAI,IAC7B/O,EAA2B,IAAI,IACrC,UAAWzB,KAAQW,EAAE,MACnBc,EAAS,IAAIzB,EAAM,EAAE,EAEvB,UAAWA,KAAQw1B,EAAW,CAC5B,MAAMzc,GAAc6Z,EAAM,IAAI5yB,CAAI,GAAK,CAAA,GAAI,OAAQlH,GAAM0X,EAAO,IAAI1X,CAAC,CAAC,EACtE,GAAIigB,EAAW,OAAS,EAAG,CACzB,MAAMuU,EAASqI,GAAa31B,EAAM+Y,EAAY,CAC5C,OAAAuc,EACA,SAAAC,EACA,UAAAE,CACR,CAAO,EACDjlB,EAAO,IAAIxQ,EAAMstB,CAAM,EACvB7rB,EAAS,IAAI6rB,CAAM,EAAE,KAAKttB,CAAI,CAChC,MAAYwQ,EAAO,IAAIxQ,CAAI,GACzBwQ,EAAO,IAAIxQ,EAAM,IAAI,CAEzB,CACA,UAAWA,KAAQW,EAAE,MACd6P,EAAO,IAAIxQ,CAAI,GAClBwQ,EAAO,IAAIxQ,EAAM,IAAI,EAGzB,MAAM41B,EAA0B,IAAI,IACpC,UAAW51B,KAAQW,EAAE,OACd6P,EAAO,IAAIxQ,CAAI,GAAK,QAAU,MACjC41B,EAAQ,IAAI51B,CAAI,EAGpB,MAAM61B,EAAQ,CAAC,GAAGD,CAAO,EAAE,KAAK,CAACt8B,EAAGC,IAAM,CACxC,MAAMu8B,EAAKL,EAAU,IAAIn8B,CAAC,GAAK,EACzBy8B,EAAKN,EAAU,IAAIl8B,CAAC,GAAK,EAC/B,OAAIu8B,IAAOC,EACFz8B,EAAE,cAAcC,CAAC,EAEnBu8B,EAAKC,CACd,CAAC,EACKC,EAAYC,GAAet1B,CAAC,EAC5Bu1B,EAAgC,IAAI,IAC1C,SAAW,CAACl2B,EAAMm2B,CAAG,IAAKH,EAAU,QAAO,EACzCE,EAAc,IACZl2B,EACA,CAAC,GAAGm2B,CAAG,EAAE,KAAK,CAAC78B,EAAGC,IAAMD,EAAE,cAAcC,CAAC,CAAC,CAChD,EAEE,MAAM68B,EAAcC,GAAiBH,CAAa,EAC5CI,EAASC,GAAcL,CAAa,EACpCM,EAA6B,IAAI,IACvC,UAAWx2B,KAAQW,EAAE,MACnB61B,EAAW,IAAIx2B,EAAM,EAAE,EAEzB,UAAWy2B,KAASH,EAClB,UAAWt2B,KAAQy2B,EAAM,MAAO,CAC9B,MAAM56B,EAAO26B,EAAW,IAAIx2B,CAAI,EAC5BnE,EACFA,EAAK,KAAK46B,EAAM,EAAE,EAElBD,EAAW,IAAIx2B,EAAM,CAACy2B,EAAM,EAAE,CAAC,CAEnC,CAEF,MAAMC,EAAW,CAAA,EACXC,EAAY,CAAA,EACZ/X,EAAuB,IAAI,IAC3BgY,EAAuBlgC,EAAQsJ,GAAS,CAC5C,GAAI,CAAA4e,EAAK,IAAI5e,CAAI,EAGjB,CAAA4e,EAAK,IAAI5e,CAAI,EACb02B,EAAS,KAAK12B,CAAI,EAClB,UAAW8B,KAASL,EAAS,IAAIzB,CAAI,GAAK,CAAA,EACxC42B,EAAK90B,CAAK,EAEZ60B,EAAU,KAAK32B,CAAI,EACrB,EAAG,MAAM,EACT,UAAW62B,KAAQhB,EACjBe,EAAKC,CAAI,EAEX,UAAW72B,KAAQw1B,EACjBoB,EAAK52B,CAAI,EAEX,MAAO,CACL,OAAAwQ,EACA,SAAA/O,EACA,MAAAo0B,EACA,YAAAO,EACA,OAAAE,EACA,WAAAE,EACA,UAAWN,EACX,SAAAQ,EACA,UAAAC,EACA,iBAAkBnB,CACtB,CACA,CACA9+B,EAAO0+B,GAAkB,kBAAkB,EAC3C,SAASO,GAAa31B,EAAM+Y,EAAY+d,EAAK,CAC3C,MAAMC,EAAWD,EAAI,OAAO92B,CAAI,EAqBhC,MApBe,CAAC,GAAG+Y,CAAU,EAAE,KAAK,CAACzf,EAAGC,IAAM,CAC5C,MAAMy9B,EAAQF,EAAI,OAAOx9B,CAAC,EACpB29B,EAAQH,EAAI,OAAOv9B,CAAC,EACpB29B,EAAYF,GAAS,MAAQA,IAAUD,EACvCI,EAAYF,GAAS,MAAQA,IAAUF,EAC7C,GAAIG,IAAcC,EAChB,OAAOD,EAAY,GAAK,EAE1B,MAAME,EAAQN,EAAI,WAAWx9B,CAAC,EACxB+9B,EAAQP,EAAI,WAAWv9B,CAAC,EAC9B,GAAI69B,GAAS,MAAQC,GAAS,MAAQD,IAAUC,EAC9C,OAAOA,EAAQD,EAEjB,MAAME,EAAOR,EAAI,UAAU,IAAIx9B,CAAC,GAAK,EAC/Bi+B,EAAOT,EAAI,UAAU,IAAIv9B,CAAC,GAAK,EACrC,OAAI+9B,IAASC,EACJD,EAAOC,EAETj+B,EAAE,cAAcC,CAAC,CAC1B,CAAC,EACa,CAAC,CACjB,CACA7C,EAAOi/B,GAAc,cAAc,EACnC,SAASM,GAAet1B,EAAG,CACzB,MAAMq1B,EAA4B,IAAI,IACtC,UAAWh2B,KAAQW,EAAE,MACnBq1B,EAAU,IAAIh2B,EAAsB,IAAI,GAAK,EAE/C,UAAW5C,KAAKuD,EAAE,MAChBq1B,EAAU,IAAI54B,EAAE,GAAG,EAAE,IAAIA,EAAE,GAAG,EAC9B44B,EAAU,IAAI54B,EAAE,GAAG,EAAE,IAAIA,EAAE,GAAG,EAEhC,OAAO44B,CACT,CACAt/B,EAAOu/B,GAAgB,gBAAgB,EACvC,SAASI,GAAiBL,EAAW,CACnC,MAAMI,EAA8B,IAAI,IACxC,IAAIoB,EAAc,EAClB,UAAWx3B,KAAQg2B,EAAU,OAAQ,CACnC,GAAII,EAAY,IAAIp2B,CAAI,EACtB,SAEF,MAAMy3B,EAAQ,CAACz3B,CAAI,EACnB,KAAOy3B,EAAM,OAAS,GAAG,CACvB,MAAM9rB,EAAM8rB,EAAM,IAAG,EACrB,GAAI,CAAArB,EAAY,IAAIzqB,CAAG,EAGvB,CAAAyqB,EAAY,IAAIzqB,EAAK6rB,CAAW,EAChC,UAAWj9B,KAAQy7B,EAAU,IAAIrqB,CAAG,GAAK,CAAA,EAClCyqB,EAAY,IAAI77B,CAAI,GACvBk9B,EAAM,KAAKl9B,CAAI,EAGrB,CACAi9B,GACF,CACA,OAAOpB,CACT,CACA1/B,EAAO2/B,GAAkB,kBAAkB,EAC3C,SAASE,GAAcP,EAAW,CAChC,MAAM0B,EAA4B,IAAI,IAChCC,EAAsB,IAAI,IAC1BC,EAAY,CAAA,EACZtB,EAAS,CAAA,EACf,IAAIuB,EAAO,EACX,MAAM1Y,EAAwBzoB,EAAO,CAACsJ,EAAMwQ,IAAW,CACrDknB,EAAU,IAAI13B,EAAM,EAAE63B,CAAI,EAC1BF,EAAI,IAAI33B,EAAM63B,CAAI,EAClB,UAAWt9B,KAAQy7B,EAAU,IAAIh2B,CAAI,GAAK,CAAA,EACpCzF,IAASiW,IAGRknB,EAAU,IAAIn9B,CAAI,GAOXm9B,EAAU,IAAIn9B,CAAI,GAAK,IAAMm9B,EAAU,IAAI13B,CAAI,GAAK,KAC9D43B,EAAU,KAAK,CAAC53B,EAAMzF,CAAI,CAAC,EAC3Bo9B,EAAI,IAAI33B,EAAM,KAAK,IAAI23B,EAAI,IAAI33B,CAAI,GAAK63B,EAAMH,EAAU,IAAIn9B,CAAI,GAAKs9B,CAAI,CAAC,IAR1ED,EAAU,KAAK,CAAC53B,EAAMzF,CAAI,CAAC,EAC3B4kB,EAAM5kB,EAAMyF,CAAI,EAChB23B,EAAI,IAAI33B,EAAM,KAAK,IAAI23B,EAAI,IAAI33B,CAAI,GAAK63B,EAAMF,EAAI,IAAIp9B,CAAI,GAAKs9B,CAAI,CAAC,GAC/DF,EAAI,IAAIp9B,CAAI,GAAK,KAAOm9B,EAAU,IAAI13B,CAAI,GAAK,IAClDs2B,EAAO,KAAKwB,GAAS93B,EAAMzF,EAAMq9B,EAAWtB,EAAO,MAAM,CAAC,GAOlE,EAAG,OAAO,EACV,UAAWt2B,KAAQg2B,EAAU,OACtB0B,EAAU,IAAI13B,CAAI,GACrBmf,EAAMnf,EAAM,IAAI,EAGpB,OAAOs2B,CACT,CACA5/B,EAAO6/B,GAAe,eAAe,EACrC,SAASuB,GAASx0B,EAAG2uB,EAAGwF,EAAOp2B,EAAI,CACjC,MAAMzJ,EAAQ,CAAA,EACRmI,EAAwB,IAAI,IAClC,KAAO03B,EAAM,OAAS,GAAG,CACvB,MAAMv+B,EAAOu+B,EAAM,IAAG,EAItB,GAHA7/B,EAAM,KAAKsB,CAAI,EACf6G,EAAM,IAAI7G,EAAK,CAAC,CAAC,EACjB6G,EAAM,IAAI7G,EAAK,CAAC,CAAC,EACbA,EAAK,CAAC,IAAMoK,GAAKpK,EAAK,CAAC,IAAM+4B,GAAK/4B,EAAK,CAAC,IAAM+4B,GAAK/4B,EAAK,CAAC,IAAMoK,EACjE,KAEJ,CACA,MAAO,CAAE,GAAAjC,EAAI,MAAAzJ,EAAO,MAAO,CAAC,GAAGmI,CAAK,CAAC,CACvC,CACArJ,EAAOohC,GAAU,UAAU,EAG3B,SAASC,GAA0Bp3B,EAAGoyB,EAAQiF,EAAM,CAClD,MAAMj4B,EAAQ,CAAC,GAAGY,EAAE,KAAK,EACnBs3B,EAA0B,IAAI,IACpC,SAAW,CAACxhC,EAAGuJ,CAAI,IAAKD,EAAM,QAAO,EACnCk4B,EAAQ,IAAIj4B,EAAMvJ,CAAC,EAErB,MAAMkC,EAAIoH,EAAM,OACVm4B,EAAY,IAAI,MAAMv/B,CAAC,EAAE,KAAK,EAAE,EAChC+X,EAAQ,IAAI,MAAM/X,CAAC,EAAE,KAAK,CAAC,EAC3BkmB,EAAQ,CAAA,EACRD,EAAuB,IAAI,IACjC,UAAW5e,KAAQD,EAAO,CACxB,MAAMuQ,EAAW0nB,EAAK,OAAO,IAAIh4B,CAAI,GAAK,KACpC01B,EAAMuC,EAAQ,IAAIj4B,CAAI,EACxB01B,GAAO,MAGPplB,GAAY,OACd4nB,EAAUxC,CAAG,EAAI,GACjBhlB,EAAMglB,CAAG,EAAI,EACR9W,EAAK,IAAI5e,CAAI,IAChB4e,EAAK,IAAI5e,CAAI,EACb6e,EAAM,KAAK7e,CAAI,GAGrB,CACA,KAAO6e,EAAM,OAAS,GAAG,CACvB,MAAM5P,EAAU4P,EAAM,MAAK,EACrBsZ,EAAaF,EAAQ,IAAIhpB,CAAO,EACtC,GAAIkpB,GAAc,KAChB,SAEF,MAAMC,EAAYJ,EAAK,SAAS,IAAI/oB,CAAO,GAAK,CAAA,EAChD,UAAWnN,KAASs2B,EAAW,CAC7B,GAAIxZ,EAAK,IAAI9c,CAAK,EAChB,SAEF,MAAMu2B,EAAWJ,EAAQ,IAAIn2B,CAAK,EAC9Bu2B,GAAY,OAGhBH,EAAUG,CAAQ,EAAIF,EACtBznB,EAAM2nB,CAAQ,EAAI3nB,EAAMynB,CAAU,EAAI,EACtCvZ,EAAK,IAAI9c,CAAK,EACd+c,EAAM,KAAK/c,CAAK,EAClB,CACF,CACA,UAAW9B,KAAQD,EAAO,CACxB,GAAI6e,EAAK,IAAI5e,CAAI,EACf,SAEF,MAAM01B,EAAMuC,EAAQ,IAAIj4B,CAAI,EACxB01B,GAAO,OAGXwC,EAAUxC,CAAG,EAAI,GACjBhlB,EAAMglB,CAAG,EAAI,EACb9W,EAAK,IAAI5e,CAAI,EACf,CACA,MAAMs4B,EAAS,KAAK,IAAI,EAAG,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,EAAG3/B,CAAC,CAAC,CAAC,EAAI,CAAC,EAC7D4/B,EAAK,MAAM,KAAK,CAAE,OAAQD,CAAM,EAAI,IAAM,IAAI,MAAM3/B,CAAC,EAAE,KAAK,EAAE,CAAC,EACrE,QAASlC,EAAI,EAAGA,EAAIkC,EAAGlC,IACrB8hC,EAAG,CAAC,EAAE9hC,CAAC,EAAIyhC,EAAUzhC,CAAC,EAExB,QAAS2F,EAAI,EAAGA,EAAIk8B,EAAQl8B,IAC1B,QAAS3F,EAAI,EAAGA,EAAIkC,EAAGlC,IAAK,CAC1B,MAAM4D,EAAOk+B,EAAGn8B,EAAI,CAAC,EAAE3F,CAAC,EACxB8hC,EAAGn8B,CAAC,EAAE3F,CAAC,EAAI4D,IAAS,GAAK,GAAKk+B,EAAGn8B,EAAI,CAAC,EAAE/B,CAAI,CAC9C,CAEF,MAAMm+B,EAA2B9hC,EAAO,CAAC+hC,EAAMC,IAAS,CACtD,GAAID,IAAS,IAAMC,IAAS,GAC1B,MAAO,GAELhoB,EAAM+nB,CAAI,EAAI/nB,EAAMgoB,CAAI,IAC1B,CAACD,EAAMC,CAAI,EAAI,CAACA,EAAMD,CAAI,GAE5B,MAAME,EAAOjoB,EAAM+nB,CAAI,EAAI/nB,EAAMgoB,CAAI,EACrC,QAASt8B,EAAI,EAAGA,EAAIk8B,EAAQl8B,IAC1B,GAAIu8B,GAAQv8B,EAAI,IACdq8B,EAAOF,EAAGn8B,CAAC,EAAEq8B,CAAI,EACbA,IAAS,IACX,MAAO,GAIb,GAAIA,IAASC,EACX,OAAOD,EAET,QAASr8B,EAAIk8B,EAAS,EAAGl8B,GAAK,EAAGA,IAAK,CACpC,MAAMw8B,EAAML,EAAGn8B,CAAC,EAAEq8B,CAAI,EAChBI,EAAMN,EAAGn8B,CAAC,EAAEs8B,CAAI,EAClBE,IAAQ,IAAMC,IAAQ,IAGtBD,IAAQC,IACVJ,EAAOG,EACPF,EAAOG,EAEX,CACA,OAAON,EAAG,CAAC,EAAEE,CAAI,CACnB,EAAG,UAAU,EACPK,EAAY,MAAM,KAAK,CAAE,OAAQngC,CAAC,EAAI,IAAsB,IAAI,GAAK,EAC3E,UAAWO,KAAQyH,EAAE,MAAO,CAC1B,IAAIN,EAAMnH,EAAK,IACXoH,EAAMpH,EAAK,IACX6/B,EAAKhG,EAAO1yB,CAAG,EACf24B,EAAKjG,EAAOzyB,CAAG,EAQnB,GAPIy4B,GAAM,MAAQC,GAAM,OAGpBD,EAAKC,IACP,CAAC34B,EAAKC,CAAG,EAAI,CAACA,EAAKD,CAAG,EACtB,CAAC04B,EAAIC,CAAE,EAAI,CAACA,EAAID,CAAE,GAEhBA,GAAM,MAAQC,GAAM,MAAQD,IAAOC,GACrC,SAEF,MAAMC,EAAWhB,EAAQ,IAAI53B,CAAG,EAC1B64B,EAAWjB,EAAQ,IAAI33B,CAAG,EAChC,GAAI24B,GAAY,MAAQC,GAAY,KAClC,SAEF,MAAMC,EAAMX,EAASS,EAAUC,CAAQ,EACvC,GAAIC,IAAQ,GACV,SAEF,MAAM/mB,EAAS0mB,EAAUK,CAAG,EAC5B,QAASh4B,EAAQ43B,EAAI53B,EAAQ63B,EAAI73B,IAC/BiR,EAAO,IAAIjR,GAAQiR,EAAO,IAAIjR,CAAK,GAAK,GAAK,CAAC,CAElD,CACA,MAAMi4B,EAA8B,IAAI,IAClCC,EAA4B3iC,EAAO,CAAC4iC,EAAQC,IAAW,CAC3D,GAAIA,EAAO,OAAS,EAGpB,SAAW,CAACp4B,EAAOoK,CAAK,IAAKguB,EAC3BD,EAAO,IAAIn4B,GAAQm4B,EAAO,IAAIn4B,CAAK,GAAK,GAAKoK,CAAK,CAEtD,EAAG,WAAW,EACRiuB,EAA0B,IAAI,IAC9BtF,EAAsBx9B,EAAQsJ,GAAS,CAC3C,MAAM01B,EAAMuC,EAAQ,IAAIj4B,CAAI,EAC5Bw5B,EAAQ,IAAIx5B,CAAI,EAChB,MAAMikB,EAAOyR,GAAO,KAAO,OAASoD,EAAUpD,CAAG,EAC3C+D,EAAcxV,EAAO,IAAI,IAAIA,CAAI,EAAoB,IAAI,IACzDmU,EAAYJ,EAAK,SAAS,IAAIh4B,CAAI,GAAK,CAAA,EAC7C,UAAW8B,KAASs2B,EAAW,CAC7B,MAAMsB,EAAWxF,EAAIpyB,CAAK,EACpB63B,EAAc5G,EAAO/yB,CAAI,EAC/B,GAAI25B,GAAe,KAAM,CACvB,IAAIC,EAAMR,EAAY,IAAIp5B,CAAI,EACzB45B,IACHA,EAAsB,IAAI,IAC1BR,EAAY,IAAIp5B,EAAM45B,CAAG,GAE3B,IAAIruB,EAAQmuB,EAAS,IAAIC,CAAW,GAAK,EACzC,MAAME,EAAa9G,EAAOjxB,CAAK,EAC3B+3B,GAAc,MAAQA,EAAaF,IACrCpuB,GAAS,GAEXquB,EAAI,IAAI93B,EAAOyJ,CAAK,CACtB,CACA8tB,EAAUI,EAAaC,CAAQ,CACjC,CACA,OAAOD,CACT,EAAG,KAAK,EACR,UAAW5C,KAAQmB,EAAK,MACjBwB,EAAQ,IAAI3C,CAAI,GACnB3C,EAAI2C,CAAI,EAGZ,UAAW72B,KAAQD,EACZy5B,EAAQ,IAAIx5B,CAAI,GACnBk0B,EAAIl0B,CAAI,EAGZ,OAAOo5B,CACT,CACA1iC,EAAOqhC,GAA2B,2BAA2B,EAG7D,SAAS+B,GAAsB/5B,EAAO0B,EAAUsxB,EAAQ,CACtD,MAAMgH,EAA2B,IAAI,IAC/BC,EAA2BtjC,EAAQsJ,GAAS,CAChD,IAAIi6B,EAAOlH,EAAO/yB,CAAI,GAAK,EAC3B,MAAMo4B,EAAY,CAAC,GAAG32B,EAAS,IAAIzB,CAAI,GAAK,EAAE,EAC9Co4B,EAAU,KAAK8B,GAAoBnH,CAAM,CAAC,EAC1C,UAAWjxB,KAASs2B,EAAW,CAC7B4B,EAASl4B,CAAK,EACd,MAAMq4B,EAAWJ,EAAS,IAAIj4B,CAAK,EAC/Bq4B,GAAY,OACdF,EAAO,KAAK,IAAIA,EAAME,CAAQ,EAElC,CACAJ,EAAS,IAAI/5B,EAAMi6B,CAAI,CACzB,EAAG,UAAU,EACb,UAAWj6B,KAAQD,EACjBi6B,EAASh6B,CAAI,EAEf,OAAO+5B,CACT,CACArjC,EAAOojC,GAAuB,uBAAuB,EACrD,SAASI,GAAoBnH,EAAQ,CACnC,MAAO,CAACz5B,EAAGC,IAAM,CACf,MAAM6gC,EAAKrH,EAAOz5B,CAAC,GAAK,EAClB+gC,EAAKtH,EAAOx5B,CAAC,GAAK,EACxB,OAAO6gC,IAAOC,EAAK/gC,EAAE,cAAcC,CAAC,EAAI6gC,EAAKC,CAC/C,CACF,CACA3jC,EAAOwjC,GAAqB,qBAAqB,EACjD,SAASI,GAAqBzE,EAAOt1B,EAAUwyB,EAAQwH,EAAe,CACpE,IAAIvH,EAAU,EACd,UAAWhzB,KAAQO,EAAU,CAC3B,MAAMuM,EAAIimB,EAAO/yB,CAAI,GAAK,EACtB8M,EAAIkmB,IACNA,EAAUlmB,EAEd,CACA,MAAMmmB,EAAS,MAAM,KAAK,CAAE,OAAQD,EAAU,GAAK,IAAM,EAAE,EACrDwH,EAA0B,IAAI,IAC9BC,EAAuB/jC,EAAQsJ,GAAS,CAC5C,GAAIw6B,EAAQ,IAAIx6B,CAAI,EAClB,OAEFw6B,EAAQ,IAAIx6B,CAAI,EAChB,MAAMmB,EAAQ4xB,EAAO/yB,CAAI,GAAK,EACzBizB,EAAO9xB,CAAK,IACf8xB,EAAO9xB,CAAK,EAAI,CAAA,GAElB8xB,EAAO9xB,CAAK,EAAE,KAAKnB,CAAI,EACvB,UAAW8B,KAASy4B,EAAcv6B,CAAI,EACpCy6B,EAAK34B,CAAK,CAEd,EAAG,MAAM,EACT,UAAW+0B,KAAQhB,EACjB4E,EAAK5D,CAAI,EAEX,UAAW72B,KAAQO,EACjB,GAAI,CAACi6B,EAAQ,IAAIx6B,CAAI,EAAG,CACtB,MAAMmB,EAAQ4xB,EAAO/yB,CAAI,GAAK,EACzBizB,EAAO9xB,CAAK,IACf8xB,EAAO9xB,CAAK,EAAI,CAAA,GAElB8xB,EAAO9xB,CAAK,EAAE,KAAKnB,CAAI,EACvBw6B,EAAQ,IAAIx6B,CAAI,CAClB,CAEF,OAAOizB,CACT,CACAv8B,EAAO4jC,GAAsB,sBAAsB,EACnD,SAASI,GAAkBzH,EAAQ,CACjC,MAAMztB,EAAS,CAAA,EACf,UAAWrE,KAAS8xB,EAAQ,CAC1B,MAAMrU,EAAuB,IAAI,IAC3B5S,EAAU,CAAA,EAChB,UAAW3K,KAAMF,EACXyd,EAAK,IAAIvd,CAAE,IAGfud,EAAK,IAAIvd,CAAE,EACX2K,EAAQ,KAAK3K,CAAE,GAEjBmE,EAAO,KAAKwG,CAAO,CACrB,CACA,OAAOxG,CACT,CACA9O,EAAOgkC,GAAmB,mBAAmB,EAG7C,SAASC,GAAmBl5B,EAAUsxB,EAAQqG,EAAaW,EAAU,CACnE,OAAQ/5B,GAAS,CACf,MAAMpD,EAAM6E,EAAS,IAAIzB,CAAI,GAAK,CAAA,EAClC,GAAIpD,EAAI,SAAW,EACjB,MAAO,CAAA,EAET,MAAMuE,EAAQ4xB,EAAO/yB,CAAI,GAAK,EACxB46B,EAAS,CAAA,EACTC,EAAU,CAAA,EACVC,EAAW1B,EAAY,IAAIp5B,CAAI,EACrC,UAAW8B,KAASlF,EAAK,CACvB,MAAMq9B,EAAOF,EAAS,IAAIj4B,CAAK,GAAKX,EAChC84B,EAAO94B,EACTy5B,EAAO,KAAK,CAAE,MAAA94B,EAAO,IAAKm4B,CAAI,CAAE,EAEhCY,EAAQ,KAAK/4B,CAAK,CAEtB,CACA,OAAA84B,EAAO,KAAK,CAACthC,EAAGC,IACVD,EAAE,MAAQC,EAAE,IACPD,EAAE,MAAM,cAAcC,EAAE,KAAK,EAE/BD,EAAE,IAAMC,EAAE,GAClB,EACDshC,EAAQ,KAAK,CAACvhC,EAAGC,IAAM,CACrB,MAAMwhC,EAAKD,GAAU,IAAIxhC,CAAC,GAAK,EACzB0hC,EAAKF,GAAU,IAAIvhC,CAAC,GAAK,EAC/B,GAAIwhC,IAAOC,EACT,OAAOD,EAAKC,EAEd,MAAMC,EAAKlB,EAAS,IAAIzgC,CAAC,GAAK6H,EACxB+5B,EAAKnB,EAAS,IAAIxgC,CAAC,GAAK4H,EAC9B,OAAI85B,IAAOC,EACFD,EAAKC,EAEP5hC,EAAE,cAAcC,CAAC,CAC1B,CAAC,EACM,CAAC,GAAGqhC,EAAO,IAAKO,GAASA,EAAK,KAAK,EAAG,GAAGN,CAAO,CACzD,CACF,CACAnkC,EAAOikC,GAAoB,oBAAoB,EAC/C,SAASS,GAAyBz6B,EAAGoyB,EAAQuC,EAAQ,CACnD,MAAM0C,EAAO5C,GAAiBz0B,EAAG,CAC/B,SAAUoyB,EACV,OAAAuC,CACJ,CAAG,EACK,CAAE,SAAA7zB,EAAU,MAAAo0B,CAAK,EAAKmC,EAC5B,UAAWh4B,KAAQW,EAAE,MACdc,EAAS,IAAIzB,CAAI,GACpByB,EAAS,IAAIzB,EAAM,EAAE,EAGzB,MAAMo5B,EAAcrB,GAA0Bp3B,EAAGoyB,EAAQiF,CAAI,EACvDqD,EAAc,CAAC,GAAGxF,CAAK,EAAE,KAAKqE,GAAoBnH,CAAM,CAAC,EACzDgH,EAAWD,GAAsBuB,EAAa55B,EAAUsxB,CAAM,EAC9DwH,EAAgBI,GAAmBl5B,EAAUsxB,EAAQqG,EAAaW,CAAQ,EAChF,IAAI9G,EAASqH,GAAqBe,EAAa16B,EAAE,MAAOoyB,EAAQwH,CAAa,EAC7E,OAAAtH,EAASyH,GAAkBzH,CAAM,EAC1BA,CACT,CACAv8B,EAAO0kC,GAA0B,0BAA0B,EAG3D,SAASE,GAA8BC,EAAOC,EAAO5jC,EAAO,CAC1D,MAAM6jC,EAAW,IAAI,IAAIF,CAAK,EACxBG,EAAW,IAAI,IAAIF,CAAK,EACxBG,EAAKvI,GAAgBoI,CAAK,EAC1BI,EAAK,CAAA,EACX,UAAWx+B,KAAKxF,EACV6jC,EAAS,IAAIr+B,EAAE,GAAG,GAAKs+B,EAAS,IAAIt+B,EAAE,GAAG,GAC3Cw+B,EAAG,KAAKD,EAAG,IAAIv+B,EAAE,GAAG,CAAC,EAGzB,OAAOk2B,GAAgBsI,CAAE,CAC3B,CACAllC,EAAO4kC,GAA+B,+BAA+B,EACrE,SAASO,GAAe5I,EAAQr7B,EAAOm7B,EAAQ,CAC7C,MAAM+I,EAAW,CAAA,EACjB,UAAW1+B,KAAKxF,EAAO,CACrB,MAAMmhC,EAAKhG,EAAO31B,EAAE,GAAG,EACjB47B,EAAKjG,EAAO31B,EAAE,GAAG,EACvB,GAAI27B,GAAM,MAAQC,GAAM,MAAQD,IAAOC,EACrC,SAEF,IAAIuC,EAAQn+B,EAAE,IACVo+B,EAAQp+B,EAAE,IACV2+B,EAAShD,EACTiD,EAAShD,EACTD,EAAKC,IACPuC,EAAQn+B,EAAE,IACVo+B,EAAQp+B,EAAE,IACV2+B,EAAS/C,EACTgD,EAASjD,GAEX,QAASkD,EAAIF,EAAQE,EAAID,EAAQC,IAC/BH,EAAS,KAAK,CAAE,GAAI,GAAG1+B,EAAE,EAAE,IAAI6+B,CAAC,GAAI,IAAKV,EAAO,IAAKC,EAAO,IAAKp+B,EAAE,IAAK,CAE5E,CACA,IAAImf,EAAM,EACV,QAAS9lB,EAAI,EAAGA,EAAI,EAAIw8B,EAAO,OAAQx8B,IACrC8lB,GAAO+e,GAA8BrI,EAAOx8B,CAAC,EAAGw8B,EAAOx8B,EAAI,CAAC,EAAGqlC,CAAQ,EAEzE,OAAOvf,CACT,CACA7lB,EAAOmlC,GAAgB,gBAAgB,EACvC,SAASK,GAAyBv7B,EAAGw7B,EAAa,CAChD,MAAMpJ,EAAS,CAAE,GAAGoJ,CAAW,EACzB,CAAE,MAAAvJ,CAAK,EAAKF,GAA8B/xB,CAAC,EAC3C20B,EAASb,GAAsB9zB,CAAC,EAChCsyB,EAASmI,GAAyBz6B,EAAGoyB,EAAQuC,CAAM,EACzD,IAAIvP,EAAO8V,GAAe5I,EAAQtyB,EAAE,MAAOoyB,CAAM,EACjD,MAAMqJ,EAAYlH,GAAS,iCAC3B,QAASmH,EAAO,EAAGA,EAAOD,EAAWC,IAAQ,CAC3C,IAAIxwB,EAAU,GACd,MAAMywB,EAAc,CAAC,GAAG37B,EAAE,KAAK,EAAE,KAAK,CAACrH,EAAGC,KAAOw5B,EAAOx5B,CAAC,GAAK,IAAMw5B,EAAOz5B,CAAC,GAAK,EAAE,EACnF,UAAW24B,KAAKqK,EAAa,CAC3B,MAAMxvB,EAAIimB,EAAOd,CAAC,GAAK,EACvB,GAAInlB,IAAM,EACR,SAEF,IAAIyvB,EAAK,EACT,UAAWj5B,KAAKsvB,EAAM,IAAIX,CAAC,GAAK,CAAA,EAC9BsK,EAAK,KAAK,IAAIA,GAAKxJ,EAAOzvB,CAAC,GAAK,GAAK,CAAC,EAExC,GAAIi5B,GAAMzvB,EACR,SAEF,MAAM0vB,EAAM1vB,EACZimB,EAAOd,CAAC,EAAIsK,EACZ,MAAME,EAAcrB,GAAyBz6B,EAAGoyB,EAAQuC,CAAM,EACxDpP,EAAQ2V,GAAeY,EAAa97B,EAAE,MAAOoyB,CAAM,EACrD7M,EAAQH,GACVA,EAAOG,EACPra,EAAU,IAEVknB,EAAOd,CAAC,EAAIuK,CAEhB,CACA,GAAI,CAAC3wB,EACH,KAEJ,CACA,OAAOknB,CACT,CACAr8B,EAAOwlC,GAA0B,0BAA0B,EAG3D,SAASQ,GAAuB/7B,EAAGoyB,EAAQ,CACzC,MAAM4J,EAAYlI,GAAsB9zB,CAAC,EACnC27B,EAAc,CAAC,GAAG37B,EAAE,KAAK,EAAE,KAC/B,CAACrH,EAAGC,KAAOw5B,EAAOz5B,CAAC,GAAK,IAAMy5B,EAAOx5B,CAAC,GAAK,IAAMD,EAAE,cAAcC,CAAC,CACtE,EACE,UAAW04B,KAAKqK,EAAa,CAC3B,MAAMM,EAAQD,EAAU1K,CAAC,EACzB,GAAI,CAAC2K,EACH,SAEF,MAAMC,EAAWl8B,EAAE,MAAM,OAAQvD,GAAMA,EAAE,MAAQ60B,CAAC,EAClD,GAAI4K,EAAS,SAAW,EACtB,SAEF,IAAIC,EAAkB,GAClBC,EAAiB,EACrB,UAAW3/B,KAAKy/B,EAAU,CACxB,MAAMG,EAAUL,EAAUv/B,EAAE,GAAG,EAC3B4/B,GAAW,MAAQA,IAAYJ,EACjCE,EAAkB,GAElBC,GAEJ,CACA,GAAIA,IAAmB,GAAKD,EAC1B,SAEF,IAAIG,EAAoB,EACpBC,EAAkB,GACtB,UAAW9/B,KAAKuD,EAAE,MAAO,CACvB,GAAIvD,EAAE,MAAQ60B,EACZ,SAEF,MAAMkL,EAAUR,EAAUv/B,EAAE,GAAG,EAC1B+/B,IAGDA,IAAYP,EACdM,EAAkB,GAElBD,IAEJ,CACA,GAAIA,EAAoB,GAAK,CAACC,EAC5B,SAEF,MAAMjuB,EAAU8jB,EAAOd,CAAC,GAAK,EACvBqH,EAASrqB,EAAU8tB,EACzB,IAAIR,EAAK,EACT,UAAWn/B,KAAKuD,EAAE,MACZvD,EAAE,MAAQ60B,IACZsK,EAAK,KAAK,IAAIA,GAAKxJ,EAAO31B,EAAE,GAAG,GAAK,GAAK,CAAC,GAG9C,MAAMggC,EAAU,KAAK,IAAInuB,EAASstB,EAAIjD,CAAM,EACxC8D,IAAYnuB,IACd8jB,EAAOd,CAAC,EAAImL,EAEhB,CACF,CACA1mC,EAAOgmC,GAAwB,wBAAwB,EAGvD,SAASW,GAAyBC,EAAUx8B,EAAM,CAChD,MAAMH,EAAIoxB,GAAeuL,CAAQ,EAC3BxK,EAAQI,GAAkBvyB,CAAC,GAAK,CAAC,GAAGA,EAAE,KAAK,EAAE,KAAI,EACjD48B,EAAUz8B,GAAM,oBAAsB,GACtC67B,EAAYlI,GAAsB9zB,CAAC,EACzC,IAAIoyB,EAAyB,OAAO,OAAO,IAAI,EAC/C,UAAWd,KAAKa,EAAO,CACrB,MAAM0K,EAASxL,GAASrxB,EAAGsxB,CAAC,EACtBwL,EAAM38B,GAAM,qBAAuB08B,EAAO,OAAQpgC,GAAM,CAC5D,MAAM+/B,EAAUR,EAAUv/B,EAAE,GAAG,EACzB4/B,EAAUL,EAAU1K,CAAC,EAC3B,MAAI,CAACkL,GAAW,CAACH,EACR,GAEFG,IAAYH,CACrB,CAAC,EAAIQ,EACL,GAAIC,EAAI,SAAW,EACjB1K,EAAOd,CAAC,EAAI,UACHsL,GAAWE,EAAI,SAAW,EAAG,CACtC,MAAMn6B,EAAIm6B,EAAI,CAAC,EAAE,IACXC,EAAQf,EAAUr5B,CAAC,EACnBs5B,EAAQD,EAAU1K,CAAC,EACrByL,IAAUd,EACZ7J,EAAOd,CAAC,EAAIc,EAAOzvB,CAAC,GAAK,EAEzByvB,EAAOd,CAAC,GAAKc,EAAOzvB,CAAC,GAAK,GAAK,CAEnC,KAAO,CACL,IAAIq6B,EAAK,KACT,UAAWvgC,KAAKqgC,EACdE,EAAK,KAAK,IAAIA,GAAK5K,EAAO31B,EAAE,GAAG,GAAK,GAAK,CAAC,EAE5C21B,EAAOd,CAAC,EAAI0L,IAAO,KAAY,EAAIA,CACrC,CACF,CACA,OAAI78B,GAAM,0BAA4B,MACpCiyB,EAASmJ,GAAyBv7B,EAAGoyB,CAAM,GAEzCjyB,GAAM,sBACR47B,GAAuB/7B,EAAGoyB,CAAM,EAG3B,CAAE,OADMqI,GAAyBz6B,EAAGoyB,EAAQ4J,CAAS,EAC3C,OAAA5J,EAAQ,MAAuB,IAAI,GAAK,CAC3D,CACAr8B,EAAO2mC,GAA0B,0BAA0B,EAG3D,SAASO,GAAqBN,EAAUx8B,EAAM,CAC5C,MAAMH,EAAIoxB,GAAeuL,CAAQ,EAM3BvK,EAAS,CAAE,GALJsK,GAAyB18B,EAAG,CACvC,mBAAoBG,GAAM,mBAC1B,qBAAsBA,GAAM,qBAC5B,yBAA0BA,GAAM,wBACpC,CAAG,EACwB,MAAM,EACzB67B,EAAYlI,GAAsB9zB,CAAC,EACnC,CAAE,MAAAiyB,EAAO,MAAAT,CAAK,EAAKO,GAA8B/xB,EAAIvD,GAAM,CAC/D,GAAI0D,GAAM,qBAAsB,CAC9B,MAAMq8B,EAAUR,EAAUv/B,EAAE,GAAG,EACzB4/B,EAAUL,EAAUv/B,EAAE,GAAG,EAC/B,GAAI+/B,GAAWH,GAAWG,IAAYH,EACpC,MAAO,EAEX,CACA,MAAO,EACT,CAAC,EACKlK,EAAQI,GAAkBvyB,CAAC,GAAK,CAAC,GAAGA,EAAE,KAAK,EAC3Ck9B,EAAW,CAAC,GAAG/K,CAAK,EAAE,QAAO,EAC7BgL,EAAgCpnC,EAAO,CAACu7B,EAAG8L,IAAY,CAC3D,IAAIxB,EAAK,EACT,UAAWj5B,KAAKsvB,EAAM,IAAIX,CAAC,GAAK,CAAA,EAC9BsK,EAAK,KAAK,IAAIA,GAAKxJ,EAAOzvB,CAAC,GAAK,GAAK,CAAC,EAExC,IAAI06B,EAAK,OAAO,kBAChB,MAAMhT,EAAImH,EAAM,IAAIF,CAAC,GAAK,CAAA,EAC1B,OAAIjH,EAAE,OAAS,IACbgT,EAAK,KAAK,IAAI,GAAGhT,EAAE,IAAK5oB,IAAO2wB,EAAO3wB,CAAC,GAAK,GAAK,CAAC,CAAC,GAEhD,OAAO,SAAS47B,CAAE,IACrBA,EAAK,KAAK,IAAIzB,EAAIwB,CAAO,GAEpB,KAAK,IAAI,KAAK,IAAIA,EAASxB,CAAE,EAAGyB,CAAE,CAC3C,EAAG,eAAe,EACZC,EAAQ/I,GAAS,mBACjBgJ,EAA6BxnC,EAAQynC,GAAc,CACvD,IAAItyB,EAAU,GACd,UAAWomB,KAAKkM,EAAW,CACzB,MAAMC,EAAKxL,EAAM,IAAIX,CAAC,GAAK,CAAA,EACrBoM,EAAKlM,EAAM,IAAIF,CAAC,GAAK,CAAA,EAC3B,GAAImM,EAAG,SAAW,GAAKC,EAAG,SAAW,EACnC,SAEF,MAAMC,EAAUF,EAAG,OAAS,EAAIA,EAAG,OAAO,CAAC9kC,EAAGgK,IAAMhK,GAAKy5B,EAAOzvB,CAAC,GAAK,GAAK,EAAG,CAAC,EAAI86B,EAAG,OAASrL,EAAOd,CAAC,GAAK,EACtGsM,EAAUF,EAAG,OAAS,EAAIA,EAAG,OAAO,CAAC/kC,EAAG8I,IAAM9I,GAAKy5B,EAAO3wB,CAAC,GAAK,GAAK,EAAG,CAAC,EAAIi8B,EAAG,OAAStL,EAAOd,CAAC,GAAK,EACtG8L,EAAU,KAAK,OAAOO,EAAUC,GAAW,CAAC,EAC5CnjC,EAAU0iC,EAAc7L,EAAG8L,CAAO,EACpC3iC,IAAY23B,EAAOd,CAAC,IACtBc,EAAOd,CAAC,EAAI72B,EACZyQ,EAAU,GAEd,CACA,OAAOA,CACT,EAAG,YAAY,EACf,QAAS2yB,EAAK,EAAGA,EAAKP,EAAOO,IAAM,CACjC,MAAMC,EAAiBP,EAAWpL,CAAK,EACjC4L,EAAkBR,EAAWL,CAAQ,EAC3C,GAAI,CAACY,GAAkB,CAACC,EACtB,KAEJ,CACA,UAAWzM,KAAKa,EAAO,CACrB,IAAIyJ,EAAK,EACT,UAAWj5B,KAAKsvB,EAAM,IAAIX,CAAC,GAAK,CAAA,EAC9BsK,EAAK,KAAK,IAAIA,GAAKxJ,EAAOzvB,CAAC,GAAK,GAAK,CAAC,GAEnCyvB,EAAOd,CAAC,GAAK,GAAKsK,IACrBxJ,EAAOd,CAAC,EAAIsK,EAEhB,CACA,UAAWtK,KAAK4L,EAAU,CACxB,MAAM7S,EAAImH,EAAM,IAAIF,CAAC,GAAK,CAAA,EAC1B,GAAIjH,EAAE,OAAS,EAAG,CAChB,MAAMgT,EAAK,KAAK,IAAI,GAAGhT,EAAE,IAAK5oB,IAAO2wB,EAAO3wB,CAAC,GAAK,GAAK,CAAC,CAAC,GACpD2wB,EAAOd,CAAC,GAAK,GAAK+L,IACrBjL,EAAOd,CAAC,EAAI+L,EAEhB,CACF,CAEA,MAAO,CAAE,OADMnL,GAAqBlyB,EAAGmyB,EAAOC,CAAM,EACnC,OAAAA,EAAQ,MAAuB,IAAI,GAAK,CAC3D,CACAr8B,EAAOknC,GAAsB,sBAAsB,EAGnD,SAASe,GAA8Bh+B,EAAG,CACxC,MAAM4xB,EAAQD,GAAiB3xB,CAAC,EAC1BwyB,EAAMf,GAAwBzxB,CAAC,EACrC,IAAIi+B,EAAWpM,GAAwBD,CAAK,EAC5C,MAAMO,EAAQ,CAAA,EACd,KAAO8L,EAAS,OAAS,GAAG,CAC1B,MAAMC,EAAe,CAAA,EACrB,UAAWv7B,KAAKs7B,EAAU,CACxB9L,EAAM,KAAKxvB,CAAC,EACZ,UAAW2uB,KAAKkB,EAAI,IAAI7vB,CAAC,GAAK,CAAA,EAC5BivB,EAAM,IAAIN,GAAIM,EAAM,IAAIN,CAAC,GAAK,GAAK,CAAC,GAC/BM,EAAM,IAAIN,CAAC,GAAK,KAAO,GAC1B4M,EAAa,KAAK5M,CAAC,CAGzB,CACA2M,EAAWC,EAAa,KAAK,CAAC,EAAGtlC,IAAM,EAAE,cAAcA,CAAC,CAAC,CAC3D,CACA,OAAOu5B,EAAM,SAAWnyB,EAAE,MAAM,OAASmyB,EAAQ,IACnD,CACAp8B,EAAOioC,GAA+B,+BAA+B,EACrE,SAASG,GAA8BxB,EAAUx8B,EAAM,CACrD,MAAMH,EAAIoxB,GAAeuL,CAAQ,EAC3BxK,EAAQhyB,GAAM,YAAc,KAAO69B,GAA8Bh+B,CAAC,GAAK,CAAC,GAAGA,EAAE,KAAK,EAAE,KAAI,EAAKuyB,GAAkBvyB,CAAC,GAAK,CAAC,GAAGA,EAAE,KAAK,EAAE,KAAI,EACtIg8B,EAAYlI,GAAsB9zB,CAAC,EACnC20B,EAAyB5+B,EAAQ2K,GAAOs7B,EAAUt7B,CAAE,GAAKA,EAAI,QAAQ,EACrE0xB,EAAyB,OAAO,OAAO,IAAI,EAC3CgM,EAA2B,IAAI,IAC/BC,EAA6BtoC,EAAO,CAAC4M,EAAG2uB,IACpBnxB,GAAM,sBAAwB,GAE7Cw0B,EAAOhyB,CAAC,IAAMgyB,EAAOrD,CAAC,EAAI,EAAI,EAEhC,EACN,YAAY,EACf,UAAWA,KAAKa,EAAO,CAErB,GADanyB,EAAE,SAAS,IAAIsxB,CAAC,GACnB,QACR,SAEF,MAAMW,EAAQZ,GAASrxB,EAAGsxB,CAAC,EAC3B,IAAIhO,EAAO,EACX,GAAI2O,EAAM,OAAS,EACjB,UAAWx1B,KAAKw1B,EAAO,CACrB,MAAMtvB,EAAIlG,EAAE,IACN27B,EAAKhG,EAAOzvB,CAAC,GAAK,EACxB2gB,EAAO,KAAK,IAAIA,EAAM8U,EAAKiG,EAAW17B,EAAG2uB,CAAC,CAAC,CAC7C,CAEF,MAAMhzB,EAAOq2B,EAAOrD,CAAC,EACfgN,EAAKF,EAAS,IAAI9/B,CAAI,GAAK,EAC3Bg9B,EAAI,KAAK,IAAIhY,EAAMgb,CAAE,EAC3BlM,EAAOd,CAAC,EAAIgK,EACZ8C,EAAS,IAAI9/B,EAAMg9B,EAAI,CAAC,CAC1B,CAEA,MAAO,CAAE,OADMpJ,GAAqBlyB,EAAGmyB,EAAOC,EAAQ,CAAE,WAAY,GAAM,EACzD,OAAAA,EAAQ,MAAuB,IAAI,GAAK,CAC3D,CACAr8B,EAAOooC,GAA+B,+BAA+B,EAGrE,SAASI,GAAmBC,EAAU7B,EAAU,CAC9C,MAAM38B,EAAIoxB,GAAeuL,CAAQ,EAC3B,CAAE,OAAAvK,CAAM,EAAKoM,EACblM,EAASkM,EAAS,OAAO,IAAKC,GAAM,CAAC,GAAGA,CAAC,CAAC,EAC1CC,EAAQ,IAAI,IAAIF,EAAS,MAAQ,CAAC,GAAGA,EAAS,KAAK,EAAI,EAAE,EAC/D,IAAIG,EAAW,EACf,MAAMl/B,EAAW,IAAI,IAAIO,EAAE,QAAQ,EAC7B4+B,EAA6B7oC,EAAQulC,GAAM,CAC/C,MAAM56B,EAAK,eAAei+B,GAAU,GAC9BE,EAAK,CAAE,GAAAn+B,EAAI,QAAS,GAAO,QAAS,GAAM,MAAO,EAAG,OAAQ,CAAC,EAGnE,IAFAjB,EAAS,IAAIiB,EAAIm+B,CAAE,EACnBH,EAAM,IAAIh+B,CAAE,EACL4xB,EAAO,QAAUgJ,GACtBhJ,EAAO,KAAK,EAAE,EAEhB,OAAAA,EAAOgJ,CAAC,EAAE,KAAK56B,CAAE,EACjB0xB,EAAO1xB,CAAE,EAAI46B,EACN56B,CACT,EAAG,YAAY,EACTo+B,EAAc,CAAC,GAAG9+B,EAAE,KAAK,EAAE,KAC/B,CAACrH,EAAGC,IAAMD,EAAE,KAAOC,EAAE,GAAKD,EAAE,MAAQC,EAAE,IAAMD,EAAE,IAAI,cAAcC,EAAE,GAAG,EAAID,EAAE,IAAI,cAAcC,EAAE,GAAG,EAAID,EAAE,GAAG,cAAcC,EAAE,EAAE,CACjI,EACQkL,EAAW,CAAA,EACjB,UAAWrH,KAAKqiC,EAAa,CAC3B,MAAMC,EAAK3M,EAAO31B,EAAE,GAAG,GAAK,EACtBuiC,EAAK5M,EAAO31B,EAAE,GAAG,GAAK,EAC5B,GAAIuiC,EAAKD,GAAM,EAAG,CAChBj7B,EAAS,KAAKrH,CAAC,EACf,QACF,CACA,IAAI/C,EAAO+C,EAAE,IACb,QAAS6+B,EAAIyD,EAAK,EAAGtjC,EAAI,EAAG6/B,EAAI0D,EAAI1D,IAAK7/B,IAAK,CAC5C,MAAMI,EAAI+iC,EAAWtD,CAAC,EACtBx3B,EAAS,KAAK,CAAE,GAAI,GAAGrH,EAAE,EAAE,IAAIhB,CAAC,GAAI,IAAK/B,EAAM,IAAKmC,EAAG,OAAQY,EAAE,OAAQ,IAAKA,EAAE,IAAK,EACrF/C,EAAOmC,CACT,CACA,MAAMojC,EAAYD,EAAKD,EAAK,EAC5Bj7B,EAAS,KAAK,CACZ,GAAI,GAAGrH,EAAE,EAAE,IAAI,KAAK,IAAIwiC,EAAY,EAAG,CAAC,CAAC,GACzC,IAAKvlC,EACL,IAAK+C,EAAE,IACP,OAAQA,EAAE,OACV,IAAKA,EAAE,GACb,CAAK,CACH,CAEA,MAAMyiC,EAAmB,CAAE,MADb,CAAC,GAAGl/B,EAAE,MAAO,GAAG,CAAC,GAAG0+B,CAAK,EAAE,OAAQh+B,GAAO,CAACV,EAAE,MAAM,SAASU,CAAE,CAAC,CAAC,EAC5C,MAAOoD,EAAU,OAAQ9D,EAAE,OAAQ,SAAAP,CAAQ,EAC7E,MAAO,CAAE,SAAU,CAAE,OAAA6yB,EAAQ,OAAAF,EAAQ,MAAAsM,CAAK,EAAI,iBAAAQ,CAAgB,CAChE,CACAnpC,EAAOwoC,GAAoB,oBAAoB,EAG/C,SAASY,GAAOvM,EAAQ,CACtB,MAAM56B,EAAI46B,EAAO,OACjB,GAAI56B,IAAM,EACR,OAAO,OAAO,kBAEhB,MAAMW,EAAI,CAAC,GAAGi6B,CAAM,EAAE,KAAK,CAACp0B,EAAGC,IAAMD,EAAIC,CAAC,EAC1C,OAAIzG,EAAI,IAAM,EACLW,GAAGX,EAAI,GAAK,CAAC,EAEf,IAAOW,EAAEX,EAAI,EAAI,CAAC,EAAIW,EAAEX,EAAI,CAAC,EACtC,CACAjC,EAAOopC,GAAQ,QAAQ,EACvB,SAASC,GAAWxM,EAAQ,CAC1B,OAAIA,EAAO,SAAW,EACb,OAAO,kBAENA,EAAO,OAAO,CAACyM,EAAK/N,IAAM+N,EAAM/N,EAAG,CAAC,EACnCsB,EAAO,MACpB,CACA78B,EAAOqpC,GAAY,YAAY,EAC/B,SAASE,GAAqBC,EAAaC,EAAYvoC,EAAOkI,EAAW,CACvE,MAAMsgC,EAAoC,IAAI,IAC9C,UAAWnO,KAAKiO,EACdE,EAAkB,IAAInO,EAAG,EAAE,EAE7B,UAAW70B,KAAKxF,EACVkI,IAAc,OACZqgC,EAAW,IAAI/iC,EAAE,GAAG,GAAKgjC,EAAkB,IAAIhjC,EAAE,GAAG,GACtDgjC,EAAkB,IAAIhjC,EAAE,GAAG,EAAE,KAAK+iC,EAAW,IAAI/iC,EAAE,GAAG,CAAC,EAEhD+iC,EAAW,IAAI/iC,EAAE,GAAG,GAAKgjC,EAAkB,IAAIhjC,EAAE,GAAG,GAC7DgjC,EAAkB,IAAIhjC,EAAE,GAAG,EAAE,KAAK+iC,EAAW,IAAI/iC,EAAE,GAAG,CAAC,EAG3D,OAAOgjC,CACT,CACA1pC,EAAOupC,GAAsB,sBAAsB,EACnD,SAASI,GAAqB/mC,EAAGC,EAAG+mC,EAAmB,CACrD,MAAMC,EAAKD,EAAkB,IAAIhnC,CAAC,GAAK,EACjCknC,EAAKF,EAAkB,IAAI/mC,CAAC,GAAK,EACvC,OAAOgnC,IAAOC,EAAKD,EAAKC,EAAKlnC,EAAE,cAAcC,CAAC,CAChD,CACA7C,EAAO2pC,GAAsB,sBAAsB,EACnD,SAASI,GAA+BlF,EAAOC,EAAO5jC,EAAO,CAC3D,MAAM6jC,EAAW,IAAI,IAAIF,CAAK,EACxBG,EAAW,IAAI,IAAIF,CAAK,EACxBkF,EAAatN,GAAgBmI,CAAK,EAClCoF,EAAavN,GAAgBoI,CAAK,EAClCpa,EAAQ,CAAA,EACd,UAAWhkB,KAAKxF,EACV6jC,EAAS,IAAIr+B,EAAE,GAAG,GAAKs+B,EAAS,IAAIt+B,EAAE,GAAG,GAC3CgkB,EAAM,KAAK,CAAE,EAAGsf,EAAW,IAAItjC,EAAE,GAAG,EAAG,EAAGujC,EAAW,IAAIvjC,EAAE,GAAG,CAAC,CAAE,EAGrEgkB,EAAM,KAAK,CAAC9nB,EAAGC,IAAMD,EAAE,IAAMC,EAAE,EAAID,EAAE,EAAIC,EAAE,EAAID,EAAE,EAAIC,EAAE,CAAC,EACxD,MAAMqiC,EAAKxa,EAAM,IAAKtoB,GAAMA,EAAE,CAAC,EAC/B,OAAOw6B,GAAgBsI,CAAE,CAC3B,CACAllC,EAAO+pC,GAAgC,+BAA+B,EACtE,SAASG,GAAgB7gC,EAAOqgC,EAAmBE,EAAmB,CACpE,MAAO,CAAC,GAAGvgC,CAAK,EAAE,KAAK,CAACzG,EAAGC,IAAM,CAC/B,MAAMsnC,EAAKf,GAAOM,EAAkB,IAAI9mC,CAAC,GAAK,EAAE,EAC1CwnC,EAAKhB,GAAOM,EAAkB,IAAI7mC,CAAC,GAAK,EAAE,EAChD,OAAIsnC,IAAOC,EACFT,GAAqB/mC,EAAGC,EAAG+mC,CAAiB,EAEhD,SAASO,CAAE,EAGX,SAASC,CAAE,EAGTD,EAAKC,EAFH,GAHA,CAMX,CAAC,CACH,CACApqC,EAAOkqC,GAAiB,iBAAiB,EACzC,SAASG,GAAaC,EAAYC,EAAarpC,EAAOkI,EAAW68B,EAAWuE,EAAW,CACrF,MAAMf,EAAa/M,GAAgB4N,CAAU,EACvCG,EAAY/N,GAAgB6N,CAAW,EACvCb,EAAoBH,GAAqBgB,EAAad,EAAYvoC,EAAOkI,CAAS,EACxF,GAAI,CAAC68B,GAAa,CAACuE,GAAaA,EAAU,SAAW,EACnD,OAAON,GAAgBK,EAAab,EAAmBe,CAAS,EAElE,MAAMC,EAAyB,IAAI,IACnC,UAAW//B,KAAM4/B,EAAa,CAC5B,MAAMhiC,EAAO09B,EAAUt7B,CAAE,EACnB0yB,EAAMqN,EAAO,IAAIniC,CAAI,GAAK,CAAA,EAChC80B,EAAI,KAAK1yB,CAAE,EACX+/B,EAAO,IAAIniC,EAAM80B,CAAG,CACtB,CACA,MAAMvuB,EAAS,CAAA,EACf,UAAWvG,KAAQiiC,EAAW,CAC5B,MAAMG,EAAcD,EAAO,IAAIniC,CAAI,EACnC,GAAI,CAACoiC,GAAeA,EAAY,SAAW,EACzC,SAEF,MAAMC,EAASV,GAAgBS,EAAajB,EAAmBe,CAAS,EACxE37B,EAAO,KAAK,GAAG87B,CAAM,CACvB,CACA,MAAMC,EAAYH,EAAO,IAAI,IAAI,EACjC,GAAIG,GAAaA,EAAU,OAAS,EAAG,CACrC,MAAMD,EAASV,GAAgBW,EAAWnB,EAAmBe,CAAS,EACtE,UAAWK,KAAOF,EAAQ,CACxB,MAAMG,EAAK1B,GAAWK,EAAkB,IAAIoB,CAAG,GAAK,EAAE,EACtD,IAAIE,EAAUl8B,EAAO,OACrB,GAAI,SAASi8B,CAAE,EACb,SAAW,CAAChrC,EAAGkrC,CAAG,IAAKn8B,EAAO,QAAO,EAAI,CACvC,MAAMo8B,EAAM7B,GAAWK,EAAkB,IAAIuB,CAAG,GAAK,EAAE,EACvD,GAAIF,EAAKG,EAAK,CACZF,EAAUjrC,EACV,KACF,CACF,CAEF+O,EAAO,OAAOk8B,EAAS,EAAGF,CAAG,CAC/B,CACF,CACA,OAAOh8B,CACT,CACA9O,EAAOqqC,GAAc,cAAc,EACnC,SAASc,GAAiBtG,EAAOtsB,EAASrX,EAAO2C,EAAMoiC,EAAW,CAChE,MAAM5W,EAAO,CAAC,GAAG9W,CAAO,EAClBwsB,EAAW,IAAI,IAAIF,CAAK,EACxBuG,EAAW,IAAI,IAAI7yB,CAAO,EAC1B8yB,EAAUxnC,EAAO,IAAI,IAAIA,CAAI,EAAI,KACjCynC,EAAUpqC,EAAM,OAAQwF,GAAMq+B,EAAS,IAAIr+B,EAAE,GAAG,GAAK0kC,EAAS,IAAI1kC,EAAE,GAAG,CAAC,EACxE6kC,EAAWF,EAAUnqC,EAAM,OAAQwF,GAAM0kC,EAAS,IAAI1kC,EAAE,GAAG,GAAK2kC,EAAQ,IAAI3kC,EAAE,GAAG,CAAC,EAAI,OACtF8kC,EAAgCxrC,EAAQo8B,GAAU,CACtD,IAAI5M,EAAQua,GAA+BlF,EAAOzI,EAAOkP,CAAO,EAChE,OAAIC,GAAY1nC,IACd2rB,GAASua,GAA+B3N,EAAOv4B,EAAM0nC,CAAQ,GAExD/b,CACT,EAAG,eAAe,EACZoP,EAASqH,EAA4B,IAAI,IAAQ,KACvD,GAAIA,GAAarH,EACf,UAAWj0B,KAAM4N,EACfqmB,EAAO,IAAIj0B,EAAIs7B,EAAUt7B,CAAE,CAAC,EAGhC,IAAI8gC,EAAW,GACXC,EAAYF,EAAcnc,CAAI,EAClC,KAAOoc,GAAU,CACfA,EAAW,GACX,QAAS1rC,EAAI,EAAGA,EAAI,EAAIsvB,EAAK,OAAQtvB,IAAK,CACxC,GAAI6+B,EAAQ,CACV,MAAM0B,EAAQ1B,EAAO,IAAIvP,EAAKtvB,CAAC,CAAC,EAC1BwgC,EAAQ3B,EAAO,IAAIvP,EAAKtvB,EAAI,CAAC,CAAC,EACpC,GAAIugC,IAAUC,EACZ,QAEJ,CACA,MAAM58B,EAAO+nC,EACb,CAACrc,EAAKtvB,CAAC,EAAGsvB,EAAKtvB,EAAI,CAAC,CAAC,EAAI,CAACsvB,EAAKtvB,EAAI,CAAC,EAAGsvB,EAAKtvB,CAAC,CAAC,EAC9C,MAAM4rC,EAAYH,EAAcnc,CAAI,EAChCsc,EAAYhoC,GACd+nC,EAAYC,EACZF,EAAW,IAEX,CAACpc,EAAKtvB,CAAC,EAAGsvB,EAAKtvB,EAAI,CAAC,CAAC,EAAI,CAACsvB,EAAKtvB,EAAI,CAAC,EAAGsvB,EAAKtvB,CAAC,CAAC,CAElD,CACF,CACA,OAAOsvB,CACT,CACArvB,EAAOmrC,GAAkB,kBAAkB,EAC3C,SAASS,GAAYnD,EAAUoD,EAAczhC,EAAM,CACjD,MAAMmyB,EAASkM,EAAS,OAAO,IAAK,GAAM,CAAC,GAAG,CAAC,CAAC,EAC1CvnC,EAAQ2qC,EAAa,MACrB5F,EAAYlI,GAAsB8N,CAAY,EAC9CrB,EAAYtM,GAAoB2N,EAAczhC,GAAM,SAAS,EACnE,QAASkqB,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,QAASv0B,EAAI,EAAGA,EAAIw8B,EAAO,OAAQx8B,IACjCw8B,EAAOx8B,CAAC,EAAIsqC,GAAa9N,EAAOx8B,EAAI,CAAC,EAAGw8B,EAAOx8B,CAAC,EAAGmB,EAAO,OAAQ+kC,EAAWuE,CAAS,EACtFjO,EAAOx8B,CAAC,EAAIorC,GAAiB5O,EAAOx8B,EAAI,CAAC,EAAGw8B,EAAOx8B,CAAC,EAAGmB,EAAOq7B,EAAOx8B,EAAI,CAAC,EAAGkmC,CAAS,EAExF,QAASlmC,EAAIw8B,EAAO,OAAS,EAAGx8B,GAAK,EAAGA,IACtCw8B,EAAOx8B,CAAC,EAAIsqC,GAAa9N,EAAOx8B,EAAI,CAAC,EAAGw8B,EAAOx8B,CAAC,EAAGmB,EAAO,KAAM+kC,EAAWuE,CAAS,EACpFjO,EAAOx8B,CAAC,EAAIorC,GAAiB5O,EAAOx8B,EAAI,CAAC,EAAGw8B,EAAOx8B,CAAC,EAAGmB,EAAOq7B,EAAOx8B,EAAI,CAAC,EAAGkmC,CAAS,CAE1F,CACA,MAAO,CAAE,OAAA1J,CAAM,CACjB,CACAv8B,EAAO4rC,GAAa,aAAa,EAGjC,SAASE,GAAkB5hC,EAAS2hC,EAAczhC,EAAM,CACtD,MAAME,EAAWF,GAAM,UAAYq0B,GAAY,kBACzCl0B,EAAUH,GAAM,SAAWq0B,GAAY,iBACvCsN,EAAU3hC,GAAM,SAAWG,EAAU,EACrCnB,EAAYgB,GAAM,WAAa,KAC/B4hC,EAAe5iC,IAAc,MAAQA,IAAc,KACnDmzB,EAASryB,EAAQ,OACjBzB,EAAoB,OAAO,OAAO,IAAI,EACtCC,EAAoB,OAAO,OAAO,IAAI,EACtCujC,EAA0BjsC,EAAQ2K,GAAOkhC,EAAa,SAAS,IAAIlhC,CAAE,EAAG,SAAS,EACjFuhC,EAA2BlsC,EAAQ2K,GAAOshC,EAAQthC,CAAE,GAAG,OAAS,EAAG,UAAU,EAC7EwhC,EAA4BnsC,EAAQ2K,GAAOshC,EAAQthC,CAAE,GAAG,QAAU,EAAG,WAAW,EAChFs7B,EAAYlI,GAAsB8N,CAAY,EAC9CO,EAAkBlO,GAAoB2N,EAAczhC,GAAM,SAAS,EACnEiiC,EAAe9P,EAAO,IACzB9xB,GAAUA,EAAM,OAAO,CAACkyB,EAAGpB,IAAM,KAAK,IAAIoB,EAAGwP,EAAU5Q,CAAC,CAAC,EAAG,CAAC,CAClE,EACQ+Q,EAAiB,CAAA,EACvB,GAAIN,EACF,QAASjsC,EAAI,EAAGA,EAAI,EAAIw8B,EAAO,OAAQx8B,IAAK,CAC1C,MAAMwsC,EAAoBhQ,EAAOx8B,CAAC,EAAE,OAAO,CAAC48B,GAAGpB,KAAM,KAAK,IAAIoB,GAAGuP,EAAS3Q,EAAC,CAAC,EAAG,CAAC,EAC1EiR,EAAoBjQ,EAAOx8B,EAAI,CAAC,EAAE,OAAO,CAAC48B,GAAGpB,KAAM,KAAK,IAAIoB,GAAGuP,EAAS3Q,EAAC,CAAC,EAAG,CAAC,EAC9EkR,EAAqBJ,EAAatsC,CAAC,EACnC2sC,EAAqBL,EAAatsC,EAAI,CAAC,EACvC4sC,EAAgBF,EAAqB,EAAIC,EAAqB,EAC9DE,GAAmBL,EAAoBC,GAAqB,EAC5DK,GAAc,KAAK,IAAI,EAAGD,EAAkBD,EAAgBriC,CAAQ,EAC1EgiC,EAAe,KAAKO,EAAW,CACjC,CAEF,MAAMC,EAA+B,IAAI,IACzC,UAAWriC,KAAS8xB,EAClB,UAAW5xB,KAAMF,EACfqiC,EAAa,IAAI7G,EAAUt7B,CAAE,CAAC,EAGlC,MAAMoiC,EAAcD,EAAa,IAAI,IAAI,EACnCE,EAAYZ,EAAgB,OAAQ7G,GAAMuH,EAAa,IAAIvH,CAAC,CAAC,EAC7D0H,EAAmB,CAAC,GAAGF,EAAc,CAAC,IAAI,EAAI,CAAA,EAAI,GAAGC,CAAS,EAC9D/wB,EAA4B,OAAO,OAAO,IAAI,EACpD,UAAWspB,KAAKyH,EACd/wB,EAAUspB,CAAC,EAAI,EAEbwH,IACF9wB,EAAU,KAAO,GAEnB,UAAWxR,KAAS8xB,EAAQ,CAC1B,MAAM2Q,EAA0B,OAAO,OAAO,IAAI,EAC5CC,EAAU,CAAA,EAChB,UAAWxiC,KAAMF,EAAO,CACtB,MAAM86B,EAAIU,EAAUt7B,CAAE,EAClB46B,IAAM,KACR4H,EAAQ,KAAKxiC,CAAE,GAEduiC,EAAQ3H,CAAC,IAAM,CAAA,GAAI,KAAK56B,CAAE,CAE/B,CACA,SAAW,CAAC46B,EAAG6H,CAAG,IAAK,OAAO,QAAQF,CAAO,EAAG,CAC9C,MAAMG,EAAQD,EAAI,OAAO,CAAC9Y,EAAG3pB,KAAO2pB,EAAI4X,EAASvhC,EAAE,EAAG,CAAC,EAAIJ,EAAU,KAAK,IAAI,EAAG6iC,EAAI,OAAS,CAAC,EAC/FnxB,EAAUspB,CAAC,EAAI,KAAK,IAAItpB,EAAUspB,CAAC,GAAK,EAAG8H,CAAK,CAClD,CACA,GAAIN,GAAeI,EAAQ,OAAQ,CACjC,MAAMG,EAAYH,EAAQ,OAAO,CAAC7Y,EAAG3pB,IAAO2pB,EAAI4X,EAASvhC,CAAE,EAAG,CAAC,EAAIJ,EAAU,KAAK,IAAI,EAAG4iC,EAAQ,OAAS,CAAC,EAC3GlxB,EAAU,KAAO,KAAK,IAAIA,EAAU,MAAQ,EAAGqxB,CAAS,CAC1D,CACF,CACA,MAAMnxB,EAA0B,IAAI,IACpC,CACE,MAAMoxB,EAASN,EAAiB,IAC7B1H,IAAOA,IAAM,KAAOtpB,EAAU,KAAOA,EAAUspB,CAAC,IAAM,CAC7D,EAEI,IAAIiI,EAAS,EADED,EAAO,OAAO,CAAC3qC,EAAGC,IAAMD,EAAIC,EAAG,CAAC,EAAIkpC,EAAU,KAAK,IAAI,EAAGkB,EAAiB,OAAS,CAAC,GAC7E,EACvB,QAASltC,EAAI,EAAGA,EAAIktC,EAAiB,OAAQltC,IAAK,CAChD,MAAMwlC,EAAI0H,EAAiBltC,CAAC,EACtB2L,EAAI6hC,EAAOxtC,CAAC,GAAK,EACjBuD,EAAKkqC,EAAS9hC,EAAI,EACxByQ,EAAQ,IAAIopB,EAAGjiC,CAAE,EACjBkqC,GAAU9hC,EACN3L,EAAIktC,EAAiB,OAAS,IAChCO,GAAUzB,EAEd,CACF,CACA,IAAI0B,EAAU,EACd,SAAW,CAACxI,EAAIx6B,CAAK,IAAK8xB,EAAO,QAAO,EAAI,CAC1C,MAAMmR,EAASrB,EAAapH,CAAE,GAAK,EAC7ByF,EAAyB,IAAI,IACnC,UAAW//B,KAAMF,EAAO,CACtB,MAAMgR,EAASwqB,EAAUt7B,CAAE,EACrB0yB,GAAMqN,EAAO,IAAIjvB,CAAM,GAAK,CAAA,EAClC4hB,GAAI,KAAK1yB,CAAE,EACX+/B,EAAO,IAAIjvB,EAAQ4hB,EAAG,CACxB,CACA,UAAWkI,KAAK0H,EAAkB,CAChC,MAAMtC,EAAcD,EAAO,IAAInF,CAAC,GAAK,CAAA,EACrC,GAAIoF,EAAY,SAAW,EACzB,SAEF,MAAMrnC,GAAK6Y,EAAQ,IAAIopB,CAAC,EACxB,GAAIoF,EAAY,SAAW,EAAG,CAC5B,MAAMhgC,GAAKggC,EAAY,CAAC,EACxBliC,EAAEkC,EAAE,EAAIrH,GACRoF,EAAEiC,EAAE,EAAI8iC,EAAUC,EAAS,CAC7B,KAAO,CACL,MAAMH,GAAS5C,EAAY,IAAKhgC,GAAOuhC,EAASvhC,CAAE,CAAC,EAC7C0iC,GAAQE,GAAO,OAAO,CAAC3qC,EAAGC,IAAMD,EAAIC,EAAG,CAAC,EAAI0H,GAAWogC,EAAY,OAAS,GAClF,IAAIzyB,GAAQ5U,GAAK+pC,GAAQ,EACzB,SAAW,CAACttC,EAAG4K,CAAE,IAAKggC,EAAY,QAAO,EAAI,CAC3C,MAAMj/B,GAAI6hC,GAAOxtC,CAAC,EAClB0I,EAAEkC,CAAE,EAAIuN,GAAQxM,GAAI,EACpBhD,EAAEiC,CAAE,EAAI8iC,EAAUC,EAAS,EAC3Bx1B,IAASxM,GAAInB,CACf,CACF,CACF,CACA,MAAMojC,EAAWrB,EAAerH,CAAE,GAAK,EACvCwI,GAAWC,EAASpjC,EAAWqjC,CACjC,CACA,MAAMC,EAAwB,IAAI,IAClC,UAAWlnC,KAAKmlC,EAAa,MAAO,CAClC,MAAMZ,EAAMvkC,EAAE,IAAI,GACbknC,EAAM,IAAI3C,CAAG,GAChB2C,EAAM,IAAI3C,EAAK,EAAE,EAEnB2C,EAAM,IAAI3C,CAAG,EAAE,KAAKvkC,CAAC,CACvB,CACA,SAAW,CAAA,CAAGmnC,CAAU,IAAKD,EAAO,CAClC,GAAIC,EAAW,SAAW,EACxB,SAEF,MAAMC,EAAMD,EAAW,CAAC,EAAE,IACpBlkC,EAAMmkC,EAAI,MACVlkC,EAAMkkC,EAAI,IAChB,GAAInkC,GAAO,MAAQC,GAAO,KACxB,SAEF,MAAMsH,EAAO,KAAK,QAAQzI,EAAEkB,CAAG,GAAK,IAAMlB,EAAEmB,CAAG,GAAK,IAAM,CAAC,EACrDmkC,EAA2B,IAAI,IACrC,UAAWrnC,KAAKmnC,EACdE,EAAS,IAAIrnC,EAAE,GAAG,EAClBqnC,EAAS,IAAIrnC,EAAE,GAAG,EAEpB,UAAWsnC,KAAOD,EAAU,CAC1B,GAAIC,IAAQrkC,GAAOqkC,IAAQpkC,EACzB,SAEWiiC,EAAa,SAAS,IAAImC,CAAG,GAChC,UACRvlC,EAAEulC,CAAG,EAAI98B,EAEb,CACF,CACA,MAAO,CAAE,EAAAzI,EAAG,EAAAC,CAAC,CACf,CACA1I,EAAO8rC,GAAmB,mBAAmB,EAG7C,IAAImC,GAAmC,EACvC,SAASC,GAAW30B,EAAO,CACzB,IAAI40B,EAAO,WACX,QAASpuC,EAAI,EAAGA,EAAIwZ,EAAM,OAAQxZ,IAChCouC,GAAQ50B,EAAM,WAAWxZ,CAAC,EAC1BouC,EAAO,KAAK,KAAKA,EAAM,QAAQ,EAEjC,OAAOA,IAAS,CAClB,CACAnuC,EAAOkuC,GAAY,YAAY,EAC/B,SAASE,GAAW1hB,EAAM,CACxB,IAAI2hB,EAAQ3hB,IAAS,EACrB,MAAO,IAAM,CACX2hB,GAAS,WACT,IAAI3Y,EAAI2Y,EACR,OAAA3Y,EAAI,KAAK,KAAKA,EAAIA,IAAM,GAAIA,EAAI,CAAC,EACjCA,GAAKA,EAAI,KAAK,KAAKA,EAAIA,IAAM,EAAGA,EAAI,EAAE,IAC7BA,EAAIA,IAAM,MAAQ,GAAK,UAClC,CACF,CACA11B,EAAOouC,GAAY,YAAY,EAC/B,SAASE,GAAqBlS,EAAO1P,EAAM,CACzC,MAAM6hB,EAAW,CAAC,GAAGnS,CAAK,EACpBoS,EAASJ,GAAW1hB,CAAI,EAC9B,QAAS3sB,EAAIwuC,EAAS,OAAS,EAAGxuC,EAAI,EAAGA,IAAK,CAC5C,MAAMuB,EAAI,KAAK,MAAMktC,EAAM,GAAMzuC,EAAI,EAAE,EACvC,CAACwuC,EAASxuC,CAAC,EAAGwuC,EAASjtC,CAAC,CAAC,EAAI,CAACitC,EAASjtC,CAAC,EAAGitC,EAASxuC,CAAC,CAAC,CACxD,CACA,OAAOwuC,CACT,CACAvuC,EAAOsuC,GAAsB,sBAAsB,EACnD,SAASG,GAAerS,EAAOsS,EAAa,CAC1C,IAAIC,EAAW,EACf,SAAW,CAACx3B,EAAOsE,CAAM,IAAK2gB,EAAM,QAAO,EACzCuS,GAAY,KAAK,IAAIx3B,GAASu3B,EAAY,IAAIjzB,CAAM,GAAKtE,EAAM,EAEjE,OAAOw3B,CACT,CACA3uC,EAAOyuC,GAAgB,gBAAgB,EACvC,SAASG,GAAoBxS,EAAOyS,EAAS,CAC3C,MAAMC,EAA2B,IAAI,IACrC,SAAW,CAAC33B,EAAOsE,CAAM,IAAK2gB,EAAM,QAAO,EACzC0S,EAAS,IAAIrzB,EAAQtE,CAAK,EAE5B,IAAI43B,EAAO,EACX,SAAW,CAAE,EAAAnsC,EAAG,EAAAC,EAAG,OAAAmsC,CAAM,IAAMH,EAAS,CACtC,MAAMI,EAAKH,EAAS,IAAIlsC,CAAC,EACnBssC,EAAKJ,EAAS,IAAIjsC,CAAC,EACrBosC,GAAM,MAAQC,GAAM,OAGxBH,GAAQC,EAAS,KAAK,IAAIC,EAAKC,CAAE,EACnC,CACA,OAAOH,CACT,CACA/uC,EAAO4uC,GAAqB,qBAAqB,EACjD,SAASO,GAAuBllC,EAAG,CACjC,MAAMm0B,EAAcH,GAAkBh0B,CAAC,EACvC,GAAIm0B,EAAY,OAAS,EACvB,MAAO,CAAA,EAET,MAAMsQ,EAAc,IAAI,IAAItQ,EAAY,IAAI,CAAC3iB,EAAQtE,IAAU,CAACsE,EAAQtE,CAAK,CAAC,CAAC,EACzE8uB,EAAYlI,GAAsB9zB,CAAC,EACnC4kC,EAA0B,IAAI,IACpC,UAAWrsC,KAAQyH,EAAE,OAAO,OAAS,CAAA,EAAI,CACvC,GAAIzH,EAAK,aACP,SAEF,MAAMmH,EAAM,OAAOnH,EAAK,OAAU,SAAWA,EAAK,MAAQ,OACpDoH,EAAM,OAAOpH,EAAK,KAAQ,SAAWA,EAAK,IAAM,OACtD,GAAI,CAACmH,GAAO,CAACC,GAAO,CAACK,EAAE,SAAS,IAAIN,CAAG,GAAK,CAACM,EAAE,SAAS,IAAIL,CAAG,EAC7D,SAEF,MAAM02B,EAAQ2F,EAAUt8B,CAAG,EACrB42B,EAAQ0F,EAAUr8B,CAAG,EAC3B,GAAI,CAAC02B,GAAS,CAACC,GAASD,IAAUC,EAChC,SAEF,MAAMsJ,EAAK6E,EAAY,IAAIpO,CAAK,EAC1BwJ,EAAK4E,EAAY,IAAInO,CAAK,EAChC,GAAIsJ,GAAM,MAAQC,GAAM,KACtB,SAEF,KAAM,CAAClnC,EAAGC,CAAC,EAAIgnC,GAAMC,EAAK,CAACxJ,EAAOC,CAAK,EAAI,CAACA,EAAOD,CAAK,EAClD/W,EAAM,GAAG3mB,CAAC,KAAKC,CAAC,GAChBusC,EAAWP,EAAQ,IAAItlB,CAAG,EAC5B6lB,EACFA,EAAS,SAETP,EAAQ,IAAItlB,EAAK,CAAE,EAAA3mB,EAAG,EAAAC,EAAG,OAAQ,EAAG,CAExC,CACA,MAAO,CAAC,GAAGgsC,EAAQ,QAAQ,CAC7B,CACA7uC,EAAOmvC,GAAwB,wBAAwB,EACvD,SAASE,GAAaC,EAAYT,EAASH,EAAa,CACtD,MAAMtS,EAAQ,CAAC,GAAGkT,CAAU,EAC5B,IAAIP,EAAOH,GAAoBxS,EAAOyS,CAAO,EACzC15B,EAAU,GACVo6B,EAAS,EACb,MAAMC,EAAY,KAAK,IAAI,EAAGpT,EAAM,MAAM,EAC1C,KAAOjnB,GAAWo6B,EAASC,GAAW,CACpCr6B,EAAU,GACVo6B,IACA,QAASxvC,EAAI,EAAGA,EAAI,EAAIq8B,EAAM,OAAQr8B,IAAK,CACzC,CAACq8B,EAAMr8B,CAAC,EAAGq8B,EAAMr8B,EAAI,CAAC,CAAC,EAAI,CAACq8B,EAAMr8B,EAAI,CAAC,EAAGq8B,EAAMr8B,CAAC,CAAC,EAClD,MAAM0vC,EAAWb,GAAoBxS,EAAOyS,CAAO,EAC/CY,EAAWV,GACbA,EAAOU,EACPt6B,EAAU,IAEV,CAACinB,EAAMr8B,CAAC,EAAGq8B,EAAMr8B,EAAI,CAAC,CAAC,EAAI,CAACq8B,EAAMr8B,EAAI,CAAC,EAAGq8B,EAAMr8B,CAAC,CAAC,CAEtD,CACF,CACA,MAAO,CACL,MAAAq8B,EACA,KAAA2S,EACA,eAAgBN,GAAerS,EAAOsS,CAAW,CACrD,CACA,CACA1uC,EAAOqvC,GAAc,cAAc,EACnC,SAASK,GAAkB15B,EAAWqZ,EAAM,CAC1C,OAAIrZ,EAAU,OAASqZ,EAAK,KACnBrZ,EAAU,KAAOqZ,EAAK,KAExBrZ,EAAU,eAAiBqZ,EAAK,cACzC,CACArvB,EAAO0vC,GAAmB,mBAAmB,EAC7C,SAASC,GAAevR,EAAayQ,EAASe,EAAc,CAC1D,MAAMC,EAAkB,CAAC,GAAGhB,CAAO,EAAE,KAAK,CAACjsC,EAAGC,IAAMD,EAAE,IAAMC,EAAE,EAAID,EAAE,EAAE,cAAcC,EAAE,CAAC,EAAID,EAAE,EAAE,cAAcC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAE,EAAAD,EAAG,EAAAC,EAAG,OAAAmsC,CAAM,IAAO,GAAGpsC,CAAC,IAAIC,CAAC,IAAImsC,CAAM,EAAE,EAAE,KAAK,GAAG,EAC5K,OAAOd,GAAW,GAAG9P,EAAY,KAAK,GAAG,CAAC,IAAIyR,CAAe,IAAID,CAAY,EAAE,CACjF,CACA5vC,EAAO2vC,GAAgB,gBAAgB,EACvC,SAASG,GAAqB7lC,EAAGG,EAAO,GAAI,CAC1C,MAAMg0B,EAAcH,GAAkBh0B,CAAC,EACvC,GAAIm0B,EAAY,OAAS,EACvB,OAAOA,EAET,MAAMyQ,EAAUM,GAAuBllC,CAAC,EACxC,GAAI4kC,EAAQ,SAAW,EACrB,OAAOzQ,EAET,MAAMsQ,EAAc,IAAI,IAAItQ,EAAY,IAAI,CAAC3iB,EAAQtE,IAAU,CAACsE,EAAQtE,CAAK,CAAC,CAAC,EAC/E,IAAIkY,EAAOggB,GAAajR,EAAayQ,EAASH,CAAW,EACzD,MAAMqB,EAAW,KAAK,IAAI,EAAG3lC,EAAK,UAAY6jC,EAAgC,EAC9E,QAASluC,EAAI,EAAGA,EAAIgwC,EAAUhwC,IAAK,CACjC,MAAM2sB,EAAOijB,GAAevR,EAAayQ,EAAS9uC,CAAC,EAC7CmY,EAAQo2B,GAAqBlQ,EAAa1R,CAAI,EAC9C1W,EAAYq5B,GAAan3B,EAAO22B,EAASH,CAAW,EACtDgB,GAAkB15B,EAAWqZ,CAAI,IACnCA,EAAOrZ,EAEX,CACA,OAAOqZ,EAAK,KACd,CACArvB,EAAO8vC,GAAsB,sBAAsB,EAGnD,SAASE,GAAe/lC,EAAGG,EAAM,CAC/B,MAAM6lC,EAAuB7lC,GAAM,sBAAwB,GACrD8lC,EAA4B9lC,GAAM,0BAA4B,GAC9D+lC,EAAK9U,GAAepxB,CAAC,EACrBugC,EAAYpgC,GAAM,sBAAwB0lC,GAAqBK,EAAI,CAAE,SAAUlC,EAAgC,CAAE,EAAI,OACrHmC,EAAWjT,GAAiBgT,CAAE,EAC9BvJ,EAAWwJ,EAAS,QACpB3H,EAAWwH,EAAuB7H,GAA8BxB,EAAU,CAC9E,mBAAoBx8B,GAAM,oBAAsBo0B,GAAS,6BACzD,qBAAsB,GACtB,UAAWp0B,GAAM,SACrB,CAAG,EAAI88B,GAAqBN,EAAU,CAClC,mBAAoBx8B,GAAM,oBAAsBo0B,GAAS,6BACzD,qBAAsB,GACtB,yBAA0B0R,CAC9B,CAAG,EACK,CAAE,SAAUG,EAAgB,iBAAAlH,CAAgB,EAAKX,GAAmBC,EAAU7B,CAAQ,EACtF18B,EAAU0hC,GAAYyE,EAAgBlH,EAAkB,CAAE,UAAAqB,CAAS,CAAE,EACrE8F,EAAcxE,GAAkB5hC,EAASi/B,EAAkB,CAC/D,SAAU/+B,GAAM,SAChB,QAASA,GAAM,QACf,UAAWA,GAAM,UACjB,UAAAogC,CACJ,CAAG,EACD,MAAO,CACL,QAAS5D,EACT,SAAUwJ,EAAS,SACnB,SAAUC,EACV,QAAAnmC,EACA,YAAAomC,CACJ,CACA,CACAtwC,EAAOgwC,GAAgB,gBAAgB,EAGvC,IAAIO,GAAOhS,GAAU,QACjBiS,GAAe,EACfC,GAAyB,GACzBC,GAAuB,GACvBC,GAAiB,GACjBC,GAAgB,GAChBC,GAAgB,GACpB,SAASC,GAAqBxnC,EAAMs5B,EAAQmO,EAAU,CACpD,MAAMztC,EAAKgG,EAAK,GAAK,EACf/F,EAAK+F,EAAK,GAAK,EACf3I,EAAKiiC,EAAO,EAAIt/B,EAChB1C,EAAKgiC,EAAO,EAAIr/B,EAChBytC,EAAQ,KAAK,IAAIrwC,CAAE,EACnBswC,EAAQ,KAAK,IAAIrwC,CAAE,EACzB,OAAIowC,EAAQT,IAAQU,EAAQV,GACnBQ,EAGLE,EAAQV,IAAQU,EADC,GACuBD,EACnCpwC,EAAK,EAAI,SAAW,MAEzBowC,EAAQT,GACH5vC,EAAK,EAAI,QAAU,OAErBowC,CACT,CACA/wC,EAAO8wC,GAAsB,sBAAsB,EACnD,SAASI,GAAwBC,EAAMC,EAAU,CAC/C,OAAO,KAAK,IAAID,EAAK,GAAKC,EAAS,IAAI,EAAIb,IAAQ,KAAK,IAAIY,EAAK,GAAKC,EAAS,EAAE,EAAIb,GAAOY,EAAK,GAAKA,EAAK,IAC7G,CACAnxC,EAAOkxC,GAAyB,yBAAyB,EACzD,SAASG,GAAYF,EAAMG,EAAO,CAChC,OAAOH,EAAK,SAAW,WAAa,CAAE,EAAGA,EAAK,MAAO,EAAGG,CAAK,EAAK,CAAE,EAAGA,EAAO,EAAGH,EAAK,KAAK,CAC7F,CACAnxC,EAAOqxC,GAAa,aAAa,EACjC,SAASE,GAAqBpkC,EAAM/D,EAAW,CAC7C,MAAMC,EAAQ8D,EAAK,OAAS,CAAA,EACtBqkC,EAAgBrkC,EAAK,OAAS,CAAA,EAC9BjM,EAAQ,CAAA,EACd,UAAWuwC,KAAMD,EACXC,EAAG,cAGPvwC,EAAM,KAAK,CACT,GAAGuwC,EACH,eAAgBA,CACtB,CAAK,EAEH,MAAM/nC,EAA2B,IAAI,IAC/BgoC,EAA+B,IAAI,IACnCC,EAAQ,CAAA,EACRC,EAAOxoC,IAAc,KAC3B,UAAWnH,KAAKoH,EACdK,EAAS,IAAIzH,EAAE,GAAIA,CAAC,EAEtB,MAAM4I,EAAiBxB,EAAM,OAAQpH,GAAMA,EAAE,SAAW,CAACA,EAAE,QAAQ,EACnE,UAAW6I,KAASD,EAAgB,CAClC,MAAMtC,EAAO,CAAE,GAAIuC,EAAM,EAAE,EACrB+mC,EAA6B7xC,EAAQiC,GAAM,CAC/CyvC,EAAa,IAAIzvC,EAAE,GAAIsG,CAAI,EAC3Bc,EAAM,OAAQ+B,GAAUA,EAAM,WAAanJ,EAAE,EAAE,EAAE,QAAQ4vC,CAAU,CACrE,EAAG,YAAY,EACfA,EAAW/mC,CAAK,CAClB,CACA,MAAMgnC,EAAYzoC,EAAM,OAAQpH,GAAM,CAACA,EAAE,SAAW,CAACA,EAAE,WAAW,EAAE,IAAKA,GAAM,CAC7E,MAAMyJ,EAAIzJ,EAAE,OAAS,GACf0J,EAAI1J,EAAE,QAAU,GAChBwG,EAAIxG,EAAE,GAAK,EACXyG,EAAIzG,EAAE,GAAK,EACX8vC,EAAUvB,GAChB,MAAO,CACL,OAAQvuC,EAAE,GACV,KAAMwG,EAAIiD,EAAI,EAAIqmC,EAClB,KAAMtpC,EAAIiD,EAAI,EAAIqmC,EAClB,KAAMrpC,EAAIiD,EAAI,EAAIomC,EAClB,KAAMrpC,EAAIiD,EAAI,EAAIomC,EAElB,kBAAmBH,EAAOjmC,EAAI,EAAIomC,EAAUrmC,EAAI,EAAIqmC,CAC1D,CACE,CAAC,EACKC,EAA+BhyC,EAAO,CAACiyC,EAAaztB,EAAO0tB,EAASC,IAAY,CACpF,IAAIC,EAAOT,EAAM,KAAMvvC,GAAMA,EAAE,cAAgB6vC,GAAe,KAAK,IAAI7vC,EAAE,MAAQoiB,CAAK,EAAI,CAAC,EAC3F,OAAK4tB,IACHA,EAAO,CACL,GAAI,QAAQH,CAAW,IAAIztB,EAAM,QAAQ,CAAC,CAAC,GAC3C,YAAAytB,EACA,MAAAztB,EACA,QAAA0tB,EACA,QAAAC,EACA,OAAQ,CAAA,CAChB,EACMR,EAAM,KAAKS,CAAI,GAEjBA,EAAK,QAAU,KAAK,IAAIA,EAAK,QAASF,CAAO,EAC7CE,EAAK,QAAU,KAAK,IAAIA,EAAK,QAASD,CAAO,EACtCC,CACT,EAAG,cAAc,EACXC,EAA8BryC,EAAO,CAACsJ,EAAMqH,IAAS,CACzD,MAAMjF,EAAIpC,EAAK,OAAS,GAClBqC,EAAIrC,EAAK,QAAU,GACnBhG,EAAKgG,EAAK,GAAK,EACf/F,EAAK+F,EAAK,GAAK,EACrB,OAAQqH,EAAI,CACV,IAAK,MACH,MAAO,CAAE,EAAGrN,EAAI,EAAGC,EAAKoI,EAAI,CAAC,EAC/B,IAAK,SACH,MAAO,CAAE,EAAGrI,EAAI,EAAGC,EAAKoI,EAAI,CAAC,EAC/B,IAAK,OACH,MAAO,CAAE,EAAGrI,EAAKoI,EAAI,EAAG,EAAGnI,CAAE,EAC/B,IAAK,QACH,MAAO,CAAE,EAAGD,EAAKoI,EAAI,EAAG,EAAGnI,CAAE,CACrC,CACE,EAAG,aAAa,EACV+uC,EAAoCtyC,EAAO,CAACsJ,EAAMs5B,EAAQ2P,IAAaF,EAAY/oC,EAAMwnC,GAAqBxnC,EAAMs5B,EAAQ2P,EAAW,SAAW,KAAK,CAAC,EAAG,mBAAmB,EAC9KC,EAAoB,CAAA,EACpBC,EAAqB,CAAA,EACrBC,EAAyC,IAAI,IAC7CC,EAAmB,IACnBC,EAAkC5yC,EAAO,CAAC6yC,EAAS95B,EAAMC,IAAO,CACpE,GAAIw5B,EAAkB,SAAW,EAC/B,MAAO,GAET,MAAMxG,EAAe,KAAK,IAAIjzB,EAAK,EAAIC,EAAG,CAAC,EAAIu3B,GACzCuC,EAAa,KAAK,IAAI/5B,EAAK,EAAIC,EAAG,CAAC,EAAIu3B,GAC7C,GAAI,CAACvE,GAAgB,CAAC8G,EACpB,MAAO,GAET,IAAIC,EAAY,EAChB,GAAI/G,EAAc,CAChB,MAAMtjC,EAAIqQ,EAAK,EACT/N,EAAO,KAAK,IAAI+N,EAAK,EAAGC,EAAG,CAAC,EAAIu3B,GAChCtlC,EAAO,KAAK,IAAI8N,EAAK,EAAGC,EAAG,CAAC,EAAIu3B,GACtC,GAAItlC,GAAQD,EACV,MAAO,GAET,UAAWhK,KAAOwxC,EACZxxC,EAAI,YAAc6xC,GAAW7xC,EAAI,cAAgB,YAGjDA,EAAI,KAAK,MAAQgK,GAAQhK,EAAI,KAAK,MAAQiK,GAG1CjK,EAAI,KAAOuvC,IAAQ7nC,GAAK1H,EAAI,GAAKuvC,IAAQ7nC,IAC3CqqC,GAAaJ,EAGnB,SAAWG,EAAY,CACrB,MAAMrqC,EAAIsQ,EAAK,EACT7N,EAAO,KAAK,IAAI6N,EAAK,EAAGC,EAAG,CAAC,EAAIu3B,GAChCplC,EAAO,KAAK,IAAI4N,EAAK,EAAGC,EAAG,CAAC,EAAIu3B,GACtC,GAAIplC,GAAQD,EACV,MAAO,GAET,UAAWlK,KAAOwxC,EACZxxC,EAAI,YAAc6xC,GAAW7xC,EAAI,cAAgB,cAGjDA,EAAI,KAAK,MAAQkK,GAAQlK,EAAI,KAAK,MAAQmK,GAG1CnK,EAAI,KAAOuvC,IAAQ9nC,GAAKzH,EAAI,GAAKuvC,IAAQ9nC,IAC3CsqC,GAAaJ,EAGnB,CACA,OAAOI,CACT,EAAG,iBAAiB,EACdC,EAAe9xC,EAAM,IAAI,CAACsB,EAAMw8B,IAAQ,CAC5C,GAAI,CAACx8B,EAAK,OAAS,CAACA,EAAK,IACvB,MAAO,CAAE,IAAAw8B,EAAK,UAAW,EAAG,GAAI,EAAG,GAAI,CAAC,EAE1C,MAAM1X,EAAU5d,EAAS,IAAIlH,EAAK,KAAK,EACjC+kB,EAAU7d,EAAS,IAAIlH,EAAK,GAAG,EAC/BywC,EAAUvB,EAAa,IAAIlvC,EAAK,KAAK,EACrC0wC,EAAUxB,EAAa,IAAIlvC,EAAK,GAAG,EACnC2wC,EAAYF,GAAWC,GAAWD,EAAQ,KAAOC,EAAQ,GAAK,EAAI,EAClEvyC,EAAK2mB,GAAWC,EAAU,KAAK,KAAKA,EAAQ,GAAK,IAAMD,EAAQ,GAAK,EAAE,EAAI,EAC1E1mB,EAAK0mB,GAAWC,EAAU,KAAK,KAAKA,EAAQ,GAAK,IAAMD,EAAQ,GAAK,EAAE,EAAI,EAChF,MAAO,CAAE,IAAA0X,EAAK,UAAAmU,EAAW,GAAAxyC,EAAI,GAAAC,CAAE,CACjC,CAAC,EAAE,KAAK,CAACgC,EAAG,IAAM,CAChB,GAAIA,EAAE,YAAc,EAAE,UACpB,OAAO,EAAE,UAAYA,EAAE,UAEzB,MAAMwwC,EAAQxwC,EAAE,GAAKA,EAAE,GACjBywC,EAAQ,EAAE,GAAK,EAAE,GACvB,OAAI,KAAK,IAAID,EAAQC,CAAK,EAAI,EACrBD,EAAQC,EAEVzwC,EAAE,IAAM,EAAE,GACnB,CAAC,EAAE,IAAKsP,GAAUA,EAAM,GAAG,EACrBohC,EAAmCtzC,EAAO,CAACwP,EAAIC,EAAI8jC,EAAcC,IAAe,CACpF,MAAM1jC,EAAU,KAAK,IAAIN,EAAG,EAAGC,EAAG,CAAC,EAC7BM,EAAU,KAAK,IAAIP,EAAG,EAAGC,EAAG,CAAC,EAC7BO,EAAU,KAAK,IAAIR,EAAG,EAAGC,EAAG,CAAC,EAC7BQ,EAAU,KAAK,IAAIT,EAAG,EAAGC,EAAG,CAAC,EAcnC,MAAO,CAAC,CAbYqiC,EAAU,KAAM2B,GAC9BF,GAAgBE,EAAI,SAAWF,GAG/BC,GAAcC,EAAI,SAAWD,EACxB,GAEL,KAAK,IAAIhkC,EAAG,EAAIC,EAAG,CAAC,EAAI8gC,GACnBkD,EAAI,KAAOjkC,EAAG,GAAKikC,EAAI,KAAOjkC,EAAG,GAAKikC,EAAI,KAAO3jC,GAAW2jC,EAAI,KAAO1jC,EAEvE0jC,EAAI,KAAOjkC,EAAG,GAAKikC,EAAI,KAAOjkC,EAAG,GAAKikC,EAAI,KAAOzjC,GAAWyjC,EAAI,KAAOxjC,CAEjF,CAEH,EAAG,kBAAkB,EACfyjC,EAA6B,IAAI,IACjCC,EAAqC,IAAI,IAC/C,UAAWnxC,KAAQtB,EACb,CAACsB,EAAK,OAAS,CAACA,EAAK,KAAOA,EAAK,QAAUA,EAAK,MAGpDmxC,EAAmB,IAAInxC,EAAK,OAAQmxC,EAAmB,IAAInxC,EAAK,KAAK,GAAK,GAAK,CAAC,EAChFmxC,EAAmB,IAAInxC,EAAK,KAAMmxC,EAAmB,IAAInxC,EAAK,GAAG,GAAK,GAAK,CAAC,GAE9E,MAAMoxC,EAAgC5zC,EAAO,CAACsJ,EAAMs5B,IAAWkO,GAAqBxnC,EAAMs5B,EAAQ,QAAQ,EAAG,eAAe,EACtHiR,EAAgC,IAAI,IAC1C,SAAW,CAAC9zC,EAAG2G,CAAC,IAAKxF,EAAM,QAAO,EAAI,CAIpC,GAHI,CAACwF,EAAE,OAAS,CAACA,EAAE,KAAOA,EAAE,QAAUA,EAAE,KAGpCA,EAAE,QAAUA,EAAE,OAAO,OAAS,EAChC,SAEF,MAAMiD,EAAMD,EAAS,IAAIhD,EAAE,KAAK,EAC1BkD,EAAMF,EAAS,IAAIhD,EAAE,GAAG,EAC9B,GAAI,CAACiD,GAAO,CAACC,EACX,SAEF,MAAMjJ,GAAMiJ,EAAI,GAAK,IAAMD,EAAI,GAAK,GAC9B/I,GAAMgJ,EAAI,GAAK,IAAMD,EAAI,GAAK,GACpCkqC,EAAc,IAAI9zC,EAAG,CACnB,QAASA,EACT,MAAO2G,EAAE,MACT,MAAOA,EAAE,IACT,QAASktC,EAAcjqC,EAAK,CAAE,EAAGC,EAAI,GAAK,EAAG,EAAGA,EAAI,GAAK,CAAC,CAAE,EAC5D,QAASgqC,EAAchqC,EAAK,CAAE,EAAGD,EAAI,GAAK,EAAG,EAAGA,EAAI,GAAK,CAAC,CAAE,EAC5D,MAAO,KAAK,IAAIhJ,CAAE,EAClB,MAAO,KAAK,IAAIC,CAAE,EAClB,OAAQ,KAAK,KAAKD,CAAE,EACpB,OAAQ,KAAK,KAAKC,CAAE,CAC1B,CAAK,CACH,CACA,MAAMkzC,EAAqC9zC,EAAQ+R,GAC7CA,EAAK,UAAY,OAASA,EAAK,UAAY,SACtCA,EAAK,QAAU,EAAI,IAAWA,EAAK,MAAQA,EAAK,MAElDA,EAAK,QAAU,EAAI,IAAWA,EAAK,MAAQA,EAAK,MACtD,oBAAoB,EACjBgiC,EAAgC/zC,EAAQ+R,GACxCA,EAAK,UAAY,OAASA,EAAK,UAAY,SACtCA,EAAK,QAAU,EAAI,QAAU,OAE/BA,EAAK,QAAU,EAAI,SAAW,MACpC,eAAe,EACZiiC,EAAmC,IAAI,IAC7C,UAAWjiC,KAAQ8hC,EAAc,SAAU,CACzC,MAAMtqB,EAAM,GAAGxX,EAAK,KAAK,IAAIA,EAAK,OAAO,GACpCiiC,EAAiB,IAAIzqB,CAAG,GAC3ByqB,EAAiB,IAAIzqB,EAAK,EAAE,EAE9ByqB,EAAiB,IAAIzqB,CAAG,EAAE,KAAKxX,CAAI,CACrC,CACA,MAAMkiC,EAA2B,IAAI,IAC/BC,EAA0Bl0C,EAAO,CAACqgB,EAAQ1P,IAAS,GAAG0P,CAAM,IAAI1P,CAAI,GAAI,SAAS,EACvF,UAAWoB,KAAQ8hC,EAAc,SAC/BI,EAAS,IACPC,EAAQniC,EAAK,MAAOA,EAAK,OAAO,GAC/BkiC,EAAS,IAAIC,EAAQniC,EAAK,MAAOA,EAAK,OAAO,CAAC,GAAK,GAAK,CAC/D,EACIkiC,EAAS,IACPC,EAAQniC,EAAK,MAAOA,EAAK,OAAO,GAC/BkiC,EAAS,IAAIC,EAAQniC,EAAK,MAAOA,EAAK,OAAO,CAAC,GAAK,GAAK,CAC/D,EAEE,UAAWjH,KAASkpC,EAAiB,SACnC,GAAI,EAAAlpC,EAAM,OAAS,GAGnB,CAAAA,EAAM,KAAK,CAAClI,EAAGC,IAAM,CACnB,MAAMsnC,EAAK2J,EAAmBlxC,CAAC,EACzBwnC,EAAK0J,EAAmBjxC,CAAC,EAC/B,OAAI,KAAK,IAAIsnC,EAAKC,CAAE,EAAI,KACfA,EAAKD,EAEPvnC,EAAE,QAAUC,EAAE,OACvB,CAAC,EACD,QAASoH,EAAI,EAAGA,EAAIa,EAAM,OAAQb,IAAK,CACrC,MAAM8H,EAAOjH,EAAMb,CAAC,EACdkqC,EAAYJ,EAAchiC,CAAI,EAC9BqiC,EAAcH,EAAS,IAAIC,EAAQniC,EAAK,MAAOA,EAAK,OAAO,CAAC,GAAK,EACjEsiC,EAAgBJ,EAAS,IAAIC,EAAQniC,EAAK,MAAOoiC,CAAS,CAAC,GAAK,EAClEE,GAAiBD,IAGrBH,EAAS,IAAIC,EAAQniC,EAAK,MAAOA,EAAK,OAAO,EAAGqiC,EAAc,CAAC,EAC/DH,EAAS,IAAIC,EAAQniC,EAAK,MAAOoiC,CAAS,EAAGE,EAAgB,CAAC,EAC9DtiC,EAAK,QAAUoiC,EACjB,EAEF,MAAMG,EAAgCt0C,EAAQsJ,GAAS,CACrD,MAAMirC,EAAQjrC,GAAM,MACpB,OAAOirC,IAAU,YAAcA,IAAU,SAC3C,EAAG,eAAe,EACZC,EAAgC,IAAI,IAC1C,UAAWziC,KAAQ8hC,EAAc,SAC1BW,EAAc,IAAIziC,EAAK,KAAK,GAC/ByiC,EAAc,IAAIziC,EAAK,MAAuB,IAAI,GAAK,EAEzDyiC,EAAc,IAAIziC,EAAK,KAAK,EAAE,IAAIA,EAAK,OAAO,EAEhD,UAAWA,KAAQ8hC,EAAc,SAAU,CACzC,GAAI,CAACS,EAAc5qC,EAAS,IAAIqI,EAAK,KAAK,CAAC,EACzC,SAEF,MAAM0iC,EAAUD,EAAc,IAAIziC,EAAK,KAAK,EAC5C,GAAI,CAAC0iC,GAAS,IAAI1iC,EAAK,OAAO,EAC5B,SAEF,MAAMoiC,EAAYJ,EAAchiC,CAAI,EACpC,GAAI0iC,EAAQ,IAAIN,CAAS,IAAMF,EAAS,IAAIC,EAAQniC,EAAK,MAAOoiC,CAAS,CAAC,GAAK,GAAK,EAClF,SAEF,MAAMC,EAAcH,EAAS,IAAIC,EAAQniC,EAAK,MAAOA,EAAK,OAAO,CAAC,GAAK,EACvEkiC,EAAS,IAAIC,EAAQniC,EAAK,MAAOA,EAAK,OAAO,EAAG,KAAK,IAAI,EAAGqiC,EAAc,CAAC,CAAC,EAC5EH,EAAS,IAAIC,EAAQniC,EAAK,MAAOoiC,CAAS,EAAG,CAAC,EAC9CpiC,EAAK,QAAUoiC,CACjB,CACA,UAAWpiC,KAAQ8hC,EAAc,SAAU,CACzC,KAAM,CAAE,QAAS9zC,EAAG,MAAAuS,EAAO,MAAAC,EAAO,QAAA1B,EAAS,QAAAC,CAAO,EAAKiB,EACjDpI,EAAMD,EAAS,IAAI4I,CAAK,EACxB1I,EAAMF,EAAS,IAAI6I,CAAK,EACxBmiC,EAAS,GAAGpiC,CAAK,IAAIzB,CAAO,OAC5B8jC,EAAW9jC,IAAY,OAASA,IAAY,SAAWjH,EAAI,GAAK,EAAIA,EAAI,GAAK,EAC9E8pC,EAAW,IAAIgB,CAAM,GACxBhB,EAAW,IAAIgB,EAAQ,EAAE,EAE3BhB,EAAW,IAAIgB,CAAM,EAAE,KAAK,CAAE,QAAS30C,EAAG,cAAe40C,EAAU,EACnE,MAAMC,GAAS,GAAGriC,CAAK,IAAIzB,CAAO,OAC5B+jC,GAAW/jC,IAAY,OAASA,IAAY,SAAWnH,EAAI,GAAK,EAAIA,EAAI,GAAK,EAC9E+pC,EAAW,IAAIkB,EAAM,GACxBlB,EAAW,IAAIkB,GAAQ,EAAE,EAE3BlB,EAAW,IAAIkB,EAAM,EAAE,KAAK,CAAE,QAAS70C,EAAG,cAAe80C,GAAU,CACrE,CACA,MAAMC,EAA8B,IAAI,IAClCC,GAAoB,EAC1B,SAAW,CAACxrB,EAAKze,CAAK,IAAK4oC,EAAY,CACrC,GAAI5oC,EAAM,OAAS,EACjB,SAEFA,EAAM,KAAK,CAAClI,GAAGC,KAAMD,GAAE,cAAgBC,GAAE,aAAa,EACtD,MAAMuC,EAAQmkB,EAAI,MAAM,GAAG,EACrBlJ,EAASjb,EAAM,MAAM,EAAG,EAAE,EAAE,KAAK,GAAG,EACpCuL,EAAOvL,EAAMA,EAAM,OAAS,CAAC,EAC7B4vC,EAAO5vC,EAAMA,EAAM,OAAS,CAAC,EAC7BkE,EAAOI,EAAS,IAAI2W,CAAM,EAChC,GAAI,CAAC/W,EACH,SAGF,MAAM2rC,EADiBtkC,IAAS,QAAUA,IAAS,QACfrH,EAAK,QAAU,GAAKA,EAAK,OAAS,GAChEirC,EAAQjrC,EAAK,MAEb4rC,GADYX,IAAU,YAAcA,IAAU,UAChBU,EAAa,GAAMA,EAEjDE,GAAU,KAAK,IADI,GAGvB,KAAK,IAAIJ,GAAmBG,IAAmBpqC,EAAM,OAAS,EAAE,CACtE,EAEUsqC,GAAc,EADFD,IAAWrqC,EAAM,OAAS,IACX,EACjC,SAAW,CAACxJ,GAAG+zC,EAAO,IAAKvqC,EAAM,QAAO,EAAI,CAC1C,MAAMwqC,GAASF,GAAc9zC,GAAI6zC,GAC3BI,GAAY,GAAGF,GAAQ,OAAO,IAAIL,CAAI,GAC5CF,EAAY,IAAIS,GAAWD,EAAM,CACnC,CACF,CACA,MAAME,GAAmCx1C,EAAQ6yC,GAAY,EAAQ3xC,EAAM2xC,CAAO,GAAG,YAAc,kBAAkB,EAC/G4C,GAAmCz1C,EAAO,CAACqgB,EAAQ1P,IAClD0P,GAGGqzB,EAAW,IAAI,GAAGrzB,CAAM,IAAI1P,CAAI,MAAM,GAAK,CAAA,GAAI,KACrD,CAAC,CAAE,QAAAkiC,KAAc2C,GAAiB3C,CAAO,CAC/C,IAAUa,EAAW,IAAI,GAAGrzB,CAAM,IAAI1P,CAAI,MAAM,GAAK,CAAA,GAAI,KACnD,CAAC,CAAE,QAAAkiC,KAAc2C,GAAiB3C,CAAO,CAC/C,EANa,GAOR,kBAAkB,EACf6C,GAAkC11C,EAAO,CAAC21C,EAAUhlC,EAAM2kC,IAC1D3kC,IAAS,OAASA,IAAS,SACtB,CAAE,EAAGglC,EAAS,EAAIL,EAAQ,EAAGK,EAAS,CAAC,EAEvC,CAAE,EAAGA,EAAS,EAAG,EAAGA,EAAS,EAAIL,CAAM,EAE/C,iBAAiB,EACdM,EAA+B51C,EAAO,CAACkqB,EAAWvgB,EAAKC,IAAQ,CACnE,MAAMisC,EAAWhC,EAAc,IAAI3pB,CAAS,EACtC4rB,EAAY,CAAE,EAAGlsC,EAAI,GAAK,EAAG,EAAGA,EAAI,GAAK,CAAC,EAC1CmsC,EAAY,CAAE,EAAGpsC,EAAI,GAAK,EAAG,EAAGA,EAAI,GAAK,CAAC,EAC1CkH,EAAUglC,GAAU,SAAWjC,EAAcjqC,EAAKmsC,CAAS,EAC3DhlC,EAAU+kC,GAAU,SAAWjC,EAAchqC,EAAKmsC,CAAS,EACjE,IAAIC,EAAWH,EAAWxD,EAAY1oC,EAAKksC,EAAS,OAAO,EAAIvD,EAAkB3oC,EAAKmsC,EAAW,EAAI,EACjGG,EAAWJ,EAAWxD,EAAYzoC,EAAKisC,EAAS,OAAO,EAAIvD,EAAkB1oC,EAAKmsC,EAAW,EAAK,EACtG,MAAMG,GAAYpB,EAAY,IAAI,GAAG5qB,CAAS,MAAM,EAC9CisB,GAAYrB,EAAY,IAAI,GAAG5qB,CAAS,MAAM,EACpD,OAAIgsB,KAAc,SAChBF,EAAWN,GAAgBM,EAAUnlC,EAASqlC,EAAS,GAErDC,KAAc,SAChBF,EAAWP,GAAgBO,EAAUnlC,EAASqlC,EAAS,GAElD,CAAE,SAAAH,EAAU,SAAAC,EAAU,QAAAplC,EAAS,QAAAC,CAAO,CAC/C,EAAG,cAAc,EACjB,UAAW/Q,KAAKizC,EAAc,CAC5B,MAAMtsC,EAAIxF,EAAMnB,CAAC,EAQjB,GAPA0yC,EAAmB1yC,CAAC,EAAI,CAAA,EACpB,CAAC2G,EAAE,OAAS,CAACA,EAAE,KAGfA,EAAE,QAAUA,EAAE,OAAO,OAAS,GAG9BA,EAAE,QAAUA,EAAE,IAChB,SAEF,MAAMiD,EAAMD,EAAS,IAAIhD,EAAE,KAAK,EAC1BkD,EAAMF,EAAS,IAAIhD,EAAE,GAAG,EAC9B,GAAI,CAACiD,GAAO,CAACC,EACX,SAEF,KAAM,CACJ,SAAAosC,EACA,SAAAC,EACA,QAASG,EACT,QAASC,CACf,EAAQT,EAAa71C,EAAG4J,EAAKC,CAAG,EACtB0sC,EAAa,CAAE,GAAGN,CAAQ,EAC1BO,EAAa,CAAE,GAAGN,CAAQ,EAC1BO,GAAoBJ,IAAgB,OAASA,IAAgB,SAC7DK,GAAoBJ,IAAgB,OAASA,IAAgB,SACnE,GAAIG,GAAmB,CACrB,MAAME,EAAWV,EAAS,GAAKrsC,EAAI,GAAK,GACxC2sC,EAAW,EAAII,EAAWV,EAAS,EAAIpF,GAAgBoF,EAAS,EAAIpF,EACtE,KAAO,CACL,MAAM+F,EAAUX,EAAS,GAAKrsC,EAAI,GAAK,GACvC2sC,EAAW,EAAIK,EAAUX,EAAS,EAAIpF,GAAgBoF,EAAS,EAAIpF,EACrE,CACA,GAAI6F,GAAmB,CACrB,MAAMC,EAAWT,EAAS,GAAKrsC,EAAI,GAAK,GACxC2sC,EAAW,EAAIG,EAAWT,EAAS,EAAIrF,GAAgBqF,EAAS,EAAIrF,EACtE,KAAO,CACL,MAAM+F,EAAUV,EAAS,GAAKrsC,EAAI,GAAK,GACvC2sC,EAAW,EAAII,EAAUV,EAAS,EAAIrF,GAAgBqF,EAAS,EAAIrF,EACrE,CACA,MAAMgG,GAAoC52C,EAAO,CAACsxB,EAAIulB,IAAmB,CACvE,UAAWpD,KAAO3B,EAChB,GAAI,CAAA+E,EAAe,SAASpD,EAAI,MAAM,GAGlCniB,EAAG,EAAImiB,EAAI,MAAQniB,EAAG,EAAImiB,EAAI,MAAQniB,EAAG,EAAImiB,EAAI,MAAQniB,EAAG,EAAImiB,EAAI,KACtE,MAAO,CAAE,OAAQ,GAAM,SAAUA,CAAG,EAGxC,MAAO,CAAE,OAAQ,EAAK,CACxB,EAAG,mBAAmB,EAChBqD,GAAiC92C,EAAO,CAAC+2C,EAAMztC,EAAM0tC,EAAUvD,GAAKwD,KAAmB,CAC3F,GAAIA,GAAgB,CAClB,MAAMC,GAAsBH,EAAK,GAAKztC,EAAK,GAAK,GAEhD,MAAO,CACL,GAFe0tC,EAAS,GAAK,IAAMD,EAAK,EAE3BtD,GAAI,KAAOhD,GAAyBgD,GAAI,KAAOhD,GAC5D,EAAGyG,GAAsBzD,GAAI,KAAO/C,GAAuB+C,GAAI,KAAO/C,GACtE,mBAAoBwG,EAC9B,CACM,CACA,MAAMC,GAAqBJ,EAAK,GAAKztC,EAAK,GAAK,GACzC8tC,IAAUJ,EAAS,GAAK,IAAMD,EAAK,EACzC,MAAO,CACL,EAAGI,GAAqB1D,GAAI,KAAOhD,GAAyBgD,GAAI,KAAOhD,GACvE,EAAG2G,GAAS3D,GAAI,KAAO/C,GAAuB+C,GAAI,KAAO/C,GACzD,mBAAAyG,EACR,CACI,EAAG,gBAAgB,EACnB,IAAIE,GAAqB,CAAA,EACzB,MAAMh4B,GAAc,CAAC3Y,EAAE,MAAOA,EAAE,GAAG,EAC7B4wC,GAAWV,GAAkBN,EAAYj3B,EAAW,EAC1D,GAAIi4B,GAAS,QAAUA,GAAS,SAAU,CACxC,MAAM7D,EAAM6D,GAAS,SACrB,GAAId,GAAmB,CACrB,MAAMe,EAAST,GAAed,EAAUrsC,EAAKC,EAAK6pC,EAAK,EAAI,EAC3D6C,EAAW,EAAIiB,EAAO,EACtBjB,EAAW,EAAIiB,EAAO,EACtB,MAAMC,EAAOD,EAAO,mBAAqB,KAAK,IAAI9D,EAAI,KAAO,EAAGuC,EAAS,EAAIpF,EAAa,EAAI,KAAK,IAAI6C,EAAI,KAAO,EAAGuC,EAAS,EAAIpF,EAAa,EAC/IyG,GAAqB,CACnB,CAAE,EAAGrB,EAAS,EAAG,EAAGwB,CAAI,EAExB,CAAE,EAAGD,EAAO,EAAG,EAAGC,CAAI,EAEtB,CAAE,EAAGD,EAAO,EAAG,EAAGA,EAAO,CAAC,CAEpC,CACM,KAAO,CACL,MAAMA,EAAST,GAAed,EAAUrsC,EAAKC,EAAK6pC,EAAK,EAAK,EACtDgE,EAAOF,EAAO,mBAAqB,KAAK,IAAI9D,EAAI,KAAO,EAAGuC,EAAS,EAAIpF,EAAa,EAAI,KAAK,IAAI6C,EAAI,KAAO,EAAGuC,EAAS,EAAIpF,EAAa,EAC/I0F,EAAW,EAAIiB,EAAO,EACtBjB,EAAW,EAAIiB,EAAO,EACtBF,GAAqB,CACnB,CAAE,EAAGI,EAAM,EAAGzB,EAAS,CAAC,EAExB,CAAE,EAAGyB,EAAM,EAAGF,EAAO,CAAC,EAEtB,CAAE,EAAGA,EAAO,EAAG,EAAGA,EAAO,CAAC,CAEpC,CACM,CACF,CACA,IAAIG,GAAqB,CAAA,EACzB,MAAMC,GAAWf,GAAkBL,EAAYl3B,EAAW,EAC1D,GAAIs4B,GAAS,QAAUA,GAAS,SAAU,CACxC,MAAMlE,EAAMkE,GAAS,SACrB,GAAIlB,GAAmB,CACrB,MAAMc,EAAST,GAAeb,EAAUrsC,EAAKD,EAAK8pC,EAAK,EAAI,EAC3D8C,EAAW,EAAIgB,EAAO,EACtBhB,EAAW,EAAIgB,EAAO,EACtBG,GAAqB,CACnB,CAAE,EAAGH,EAAO,EAAG,EAAGA,EAAO,CAAC,EAE1B,CAAE,EAAGtB,EAAS,EAAG,EAAGsB,EAAO,CAAC,CAGtC,CACM,KAAO,CACL,MAAMA,EAAST,GAAeb,EAAUrsC,EAAKD,EAAK8pC,EAAK,EAAK,EAC5D8C,EAAW,EAAIgB,EAAO,EACtBhB,EAAW,EAAIgB,EAAO,EACtBG,GAAqB,CACnB,CAAE,EAAGH,EAAO,EAAG,EAAGA,EAAO,CAAC,EAE1B,CAAE,EAAGA,EAAO,EAAG,EAAGtB,EAAS,CAAC,CAEtC,CACM,CACF,CACA,GAAIoB,GAAmB,SAAW,GAAKK,GAAmB,SAAW,EAAG,CACtE,MAAME,EAAWnH,GACXoH,EAAe,KAAK,IAAIvB,EAAW,EAAIC,EAAW,CAAC,EAAIqB,EACvDE,EAAe,KAAK,IAAIxB,EAAW,EAAIC,EAAW,CAAC,EAAIqB,EACvDG,GAAgBjD,EAAY,IAAI,GAAG/0C,CAAC,MAAM,IAAM,QAAU+0C,EAAY,IAAI,GAAG/0C,CAAC,MAAM,IAAM,OAC1Fi4C,IAAgBtE,EAAW,IAAI,GAAGhtC,EAAE,OAAS,EAAE,IAAI0vC,CAAW,MAAM,GAAG,QAAU,IAAM1C,EAAW,IAAI,GAAGhtC,EAAE,OAAS,EAAE,IAAI0vC,CAAW,MAAM,GAAG,QAAU,GACxJ6B,IAAgBvE,EAAW,IAAI,GAAGhtC,EAAE,KAAO,EAAE,IAAI2vC,CAAW,MAAM,GAAG,QAAU,IAAM3C,EAAW,IAAI,GAAGhtC,EAAE,KAAO,EAAE,IAAI2vC,CAAW,MAAM,GAAG,QAAU,GACpJ6B,GAAgBF,GAAe,GAAKC,GAAe,EACnDE,GAAmBxE,EAAmB,IAAIjtC,EAAE,OAAS,EAAE,GAAK,EAC5D0xC,GAAmBzE,EAAmB,IAAIjtC,EAAE,KAAO,EAAE,GAAK,EAC1D2xC,GAAwBL,GAAe,GAAKvC,GAAiB/uC,EAAE,MAAO0vC,CAAW,GAAK6B,GAAe,GAAKxC,GAAiB/uC,EAAE,IAAK2vC,CAAW,EAC7IiC,GAAmCN,IAAgB,GAAKG,IAAoB,EAC5EI,GAAmCN,IAAgB,GAAKG,IAAoB,EAElF,IAAKP,GAAgBC,IAAiB,CAACC,KAAkB,CAACG,IADfA,IAAiB,CAACG,IAAyBC,IAAoCC,KAGpH,CADkBjF,EAAiB0C,EAAUC,EAAUvvC,EAAE,MAAOA,EAAE,GAAG,EACrD,CAClBA,EAAE,OAAS,CAAC,CAAE,GAAGsvC,CAAQ,EAAI,CAAE,GAAGM,CAAU,EAAI,CAAE,GAAGC,CAAU,EAAI,CAAE,GAAGN,CAAQ,CAAE,EAClFvD,EAAuB,IAAI3yC,CAAC,EAC5B,MAAMy4C,GAAsBV,EAAe,aAAe,WACpDW,GAAgBX,EAAe9B,EAAS,EAAIA,EAAS,EACrD0C,GAAeZ,EAAe,KAAK,IAAI9B,EAAS,EAAGC,EAAS,CAAC,EAAI,KAAK,IAAID,EAAS,EAAGC,EAAS,CAAC,EAChG0C,GAAab,EAAe,KAAK,IAAI9B,EAAS,EAAGC,EAAS,CAAC,EAAI,KAAK,IAAID,EAAS,EAAGC,EAAS,CAAC,EAC9F2C,GAAe,CACnB,GAAI,aAAaJ,EAAmB,IAAIC,GAAc,QAAQ,CAAC,CAAC,IAAI14C,CAAC,GACrE,YAAay4C,GACb,MAAOC,GACP,QAASC,GACT,QAASC,GACT,OAAQ,CAAA,CACpB,EACUnG,EAAkB,KAAK,CACrB,UAAWzyC,EACX,aAAc,EACd,YAAay4C,GACb,KAAMI,GACN,WAAY,EACZ,KAAMF,GACN,GAAIC,EAChB,CAAW,EACD,QACF,CAEJ,CACA,MAAME,GAAU7G,EAAa,WAAYsE,EAAW,EAAGA,EAAW,EAAGA,EAAW,CAAC,EACjFA,EAAW,EAAIuC,GAAQ,MACvB,MAAMC,GAAU9G,EAAa,WAAYuE,EAAW,EAAGA,EAAW,EAAGA,EAAW,CAAC,EACjFA,EAAW,EAAIuC,GAAQ,MACvB,IAAIC,GAAS,KAAK,IAAIzC,EAAW,EAAGC,EAAW,CAAC,EAAI,GAChDyC,GAAS,KAAK,IAAI1C,EAAW,EAAGC,EAAW,CAAC,EAAI,GAChD0C,GAAS,KAAK,IAAI3C,EAAW,EAAGC,EAAW,CAAC,EAAI,GAChD2C,GAAS,KAAK,IAAI5C,EAAW,EAAGC,EAAW,CAAC,EAAI,GACpD,UAAW9C,KAAO3B,EAAW,CAC3B,MAAMqH,EAAW,KAAK,IAAI7C,EAAW,EAAGC,EAAW,CAAC,EAC9C6C,EAAW,KAAK,IAAI9C,EAAW,EAAGC,EAAW,CAAC,EAC9C8C,GAAW,KAAK,IAAI/C,EAAW,EAAGC,EAAW,CAAC,EAC9C+C,GAAW,KAAK,IAAIhD,EAAW,EAAGC,EAAW,CAAC,EAC9B9C,EAAI,KAAO2F,GAAY3F,EAAI,KAAO0F,GAAY1F,EAAI,KAAO6F,IAAY7F,EAAI,KAAO4F,KAEpGN,GAAS,KAAK,IAAIA,GAAQtF,EAAI,KAAO9C,EAAc,EACnDqI,GAAS,KAAK,IAAIA,GAAQvF,EAAI,KAAO9C,EAAc,EACnDsI,GAAS,KAAK,IAAIA,GAAQxF,EAAI,KAAO9C,EAAc,EACnDuI,GAAS,KAAK,IAAIA,GAAQzF,EAAI,KAAO9C,EAAc,EAEvD,CACA,UAAW8C,KAAO3B,EAAW,CAC3B,GAAI2B,EAAI,KAAOsF,IAAUtF,EAAI,KAAOuF,IAAUvF,EAAI,KAAOwF,IAAUxF,EAAI,KAAOyF,GAC5E,SAEF,MAAMK,EAAU9I,GAChBuB,EAAa,aAAcyB,EAAI,KAAO8F,EAASR,GAAQC,EAAM,EAC7DhH,EAAa,aAAcyB,EAAI,KAAO8F,EAASR,GAAQC,EAAM,EAC7D,MAAMQ,EAAU9I,GAChBsB,EAAa,WAAYyB,EAAI,KAAO+F,EAASP,GAAQC,EAAM,EAC3DlH,EAAa,WAAYyB,EAAI,KAAO+F,EAASP,GAAQC,EAAM,CAC7D,CACAlH,EAAa,aAAcsE,EAAW,EAAGyC,GAAQC,EAAM,EACvDhH,EAAa,aAAcuE,EAAW,EAAGwC,GAAQC,EAAM,EACvD,MAAMS,GAAS9H,EAAM,OAClBvvC,GAAMA,EAAE,cAAgB,cAAgBA,EAAE,OAAS62C,IAAU72C,EAAE,OAAS82C,EAC/E,EACUQ,GAAS/H,EAAM,OAClBvvC,GAAMA,EAAE,cAAgB,YAAcA,EAAE,OAAS22C,IAAU32C,EAAE,OAAS42C,EAC7E,EACUW,GAAyB35C,EAAO,CAACyI,EAAGC,IAAM,GAAGD,EAAE,QAAQ,CAAC,CAAC,IAAIC,EAAE,QAAQ,CAAC,CAAC,GAAI,QAAQ,EACrFkxC,GAAWD,GAAOrD,EAAW,EAAGA,EAAW,CAAC,EAC5CuD,GAASF,GAAOpD,EAAW,EAAGA,EAAW,CAAC,EAC1CuD,GAAyB,IAAI,IAC7BC,GAA2B,IAAI,IAC/BC,GAA6B,IAAI,IACjCC,GAA0B,IAAI,IAC9BC,GAAW,CAAA,EACjBJ,GAAO,IAAIF,GAAU,CAAC,EACtBI,GAAW,IAAIJ,GAAU,GAAG,EAC5BM,GAAS,KAAK,CACZ,IAAKN,GACL,EAAG,KAAK,MAAMrD,EAAW,EAAID,EAAW,EAAGC,EAAW,EAAID,EAAW,CAAC,EACtE,GAAIA,CACV,CAAK,EACD2D,GAAQ,IAAIL,EAAQ,EACpB,IAAIO,GAAY,CAAA,EAChB,MAAMC,GAAsCp6C,EAAO,CAACwP,EAAIC,IAC/C6jC,EAAiB9jC,EAAIC,EAAI/I,EAAE,MAAOA,EAAE,GAAG,EAC7C,qBAAqB,EAClB2zC,GAAW,CAAE,EAAG9D,EAAW,EAAG,EAAGD,EAAW,CAAC,EAC7CgE,GAAiBF,GAAoB9D,EAAY+D,EAAQ,EACzDE,GAAiBH,GAAoBC,GAAU9D,CAAU,EACzDiE,GAAiBF,IAAkBC,GACnCE,GAAW,CAAE,EAAGnE,EAAW,EAAG,EAAGC,EAAW,CAAC,EAC7CmE,GAAiBN,GAAoB9D,EAAYmE,EAAQ,EACzDE,GAAiBP,GAAoBK,GAAUlE,CAAU,EAe/D,GAbKiE,GADkBE,IAAkBC,KAQnC,KAAK,IAAIrE,EAAW,EAAIC,EAAW,CAAC,EAAIhG,GAC1C4J,GAAY,CAAC7D,EAAYC,CAAU,EAEnC4D,GAAY,CAAC7D,EAAYmE,GAAUlE,CAAU,GAT3C,KAAK,IAAID,EAAW,EAAIC,EAAW,CAAC,EAAIhG,IAAQ,KAAK,IAAI+F,EAAW,EAAIC,EAAW,CAAC,EAAIhG,GAC1F4J,GAAY,CAAC7D,EAAYC,CAAU,EAEnC4D,GAAY,CAAC7D,EAAY+D,GAAU9D,CAAU,EAS7C4D,GAAU,SAAW,EACvB,KAAOD,GAAS,OAAS,GAAG,CAC1BA,GAAS,KAAK,CAACt3C,GAAGC,KAAMD,GAAE,EAAIC,GAAE,CAAC,EACjC,MAAM0V,EAAU2hC,GAAS,MAAK,EAE9B,GADAD,GAAQ,OAAO1hC,EAAQ,GAAG,EACtBA,EAAQ,MAAQshC,GAAQ,CAC1B,IAAIe,GAAUf,GACVgB,GAAStE,EAEb,IADA4D,GAAY,CAACU,EAAM,EACZd,GAAS,IAAIa,EAAO,GAAG,CAC5B,MAAMj3C,GAAOo2C,GAAS,IAAIa,EAAO,EACjCT,GAAU,QAAQx2C,EAAI,EACtBk3C,GAASl3C,GACTi3C,GAAUjB,GAAOh2C,GAAK,EAAGA,GAAK,CAAC,CACjC,CACA,KACF,CACA,MAAML,EAAKiV,EAAQ,GAAG,EAChBhV,EAAKgV,EAAQ,GAAG,EAChBuiC,GAAepB,GAAO,KAAK,CAAC92C,GAAGC,KAAMD,GAAE,MAAQC,GAAE,KAAK,EACtDk4C,GAAOD,GAAa,UAAW14C,IAAM,KAAK,IAAIA,GAAE,MAAQkB,CAAE,EAAI,CAAC,EAC/D03C,GAAevB,GAAO,KAAK,CAAC72C,GAAGC,KAAMD,GAAE,MAAQC,GAAE,KAAK,EACtDo4C,GAAOD,GAAa,UAAW54C,IAAM,KAAK,IAAIA,GAAE,MAAQmB,CAAE,EAAI,CAAC,EAC/D+nB,GAAY,CAAA,EACdyvB,GAAO,GACTzvB,GAAU,KAAK,CAAE,EAAGwvB,GAAaC,GAAO,CAAC,EAAE,MAAO,EAAGx3C,EAAI,EAEvDw3C,IAAQ,GAAKA,GAAOD,GAAa,OAAS,GAC5CxvB,GAAU,KAAK,CAAE,EAAGwvB,GAAaC,GAAO,CAAC,EAAE,MAAO,EAAGx3C,EAAI,EAEvD03C,GAAO,GACT3vB,GAAU,KAAK,CAAE,EAAGhoB,EAAI,EAAG03C,GAAaC,GAAO,CAAC,EAAE,MAAO,EAEvDA,IAAQ,GAAKA,GAAOD,GAAa,OAAS,GAC5C1vB,GAAU,KAAK,CAAE,EAAGhoB,EAAI,EAAG03C,GAAaC,GAAO,CAAC,EAAE,MAAO,EAE3D,UAAWC,MAAY5vB,GAAW,CAChC,MAAMtgB,GAAO,KAAK,IAAI1H,EAAI43C,GAAS,CAAC,EAC9BjwC,GAAO,KAAK,IAAI3H,EAAI43C,GAAS,CAAC,EAC9BhwC,GAAO,KAAK,IAAI3H,EAAI23C,GAAS,CAAC,EAC9B/vC,GAAO,KAAK,IAAI5H,EAAI23C,GAAS,CAAC,EAWpC,GAVgBpJ,EAAU,KAAM2B,IAC1BA,GAAI,SAAW/sC,EAAE,OAAS+sC,GAAI,SAAW/sC,EAAE,IACtC,GAELsE,KAASC,GACJwoC,GAAI,KAAOlwC,GAAMkwC,GAAI,KAAOlwC,GAAMkwC,GAAI,KAAOzoC,IAAQyoC,GAAI,KAAOxoC,GAEhEwoC,GAAI,KAAOnwC,GAAMmwC,GAAI,KAAOnwC,GAAMmwC,GAAI,KAAOvoC,IAAQuoC,GAAI,KAAOtoC,EAE1E,EAEC,SAEF,MAAMgwC,GAAOxB,GAAOuB,GAAS,EAAGA,GAAS,CAAC,EACpCE,GAAO,KAAK,IAAIF,GAAS,EAAI53C,CAAE,EAAI,KAAK,IAAI43C,GAAS,EAAI33C,CAAE,EAC3D83C,GAAUzI,EAAgB7yC,EAAGwY,EAAQ,GAAI2iC,EAAQ,EACvD,IAAII,GAAa,EACjB,MAAMC,GAAShF,EAAW,EAAID,EAAW,EACnCkF,GAASjF,EAAW,EAAID,EAAW,EACnCmF,GAASP,GAAS,EAAI53C,EACtBo4C,GAASR,GAAS,EAAI33C,GACxBi4C,GAAS,IAAME,GAAS,IAAMF,GAAS,KAAOE,GAAS,KACzDJ,GAAa,KAAK,IAAII,EAAM,EAAI,MAE9BH,GAAS,IAAME,GAAS,IAAMF,GAAS,KAAOE,GAAS,KACzDH,IAAc,KAAK,IAAIG,EAAM,EAAI,IAEnC,IAAIE,GAAc,EAClB,MAAMC,GAAa5B,GAAW,IAAIzhC,EAAQ,GAAG,GAAK,IAC5CsjC,GAAU,KAAK,IAAIJ,EAAM,EAAIlL,GAAO,IAAM,IAC5CqL,KAAe,KAAOA,KAAeC,KACvCF,GAAc,IAEhB,MAAMG,GAAWV,GAAOC,GAAUC,GAAaK,GACzCI,IAAcjC,GAAO,IAAIvhC,EAAQ,GAAG,GAAK,KAAYujC,GACrDnwC,GAAI,KAAK,IAAI4qC,EAAW,EAAI2E,GAAS,CAAC,EAAI,KAAK,IAAI3E,EAAW,EAAI2E,GAAS,CAAC,EAClF,GAAIa,IAAcjC,GAAO,IAAIqB,EAAI,GAAK,KAIpC,GAHApB,GAAS,IAAIoB,GAAM5iC,EAAQ,EAAE,EAC7BuhC,GAAO,IAAIqB,GAAMY,EAAU,EAC3B/B,GAAW,IAAImB,GAAMU,EAAO,EACxB,CAAC5B,GAAQ,IAAIkB,EAAI,EACnBjB,GAAS,KAAK,CAAE,IAAKiB,GAAM,EAAGY,GAAapwC,GAAG,GAAIuvC,GAAU,EAC5DjB,GAAQ,IAAIkB,EAAI,MACX,CACL,MAAMnc,GAAMkb,GAAS,UAAWzxC,IAAMA,GAAE,MAAQ0yC,EAAI,EAChDnc,KAAQ,KACVkb,GAASlb,EAAG,EAAE,EAAI+c,GAAapwC,GAEnC,CAEJ,CACF,CAKF,GAHIwuC,GAAU,SAAW,IACvBA,GAAY,CAAC7D,EAAY,CAAE,EAAGA,EAAW,EAAG,EAAGC,EAAW,CAAC,EAAIA,CAAU,GAEvE4D,GAAU,OAAS,EAAG,CACxB,MAAMjiC,EAAQiiC,GAAU,CAAC,EACnBhiC,EAAMgiC,GAAUA,GAAU,OAAS,CAAC,EAC1C,IAAInvC,EAAO,KAAK,IAAIkN,EAAM,EAAGC,EAAI,CAAC,EAC9BlN,GAAO,KAAK,IAAIiN,EAAM,EAAGC,EAAI,CAAC,EAC9BjN,GAAO,KAAK,IAAIgN,EAAM,EAAGC,EAAI,CAAC,EAC9BhN,GAAO,KAAK,IAAI+M,EAAM,EAAGC,EAAI,CAAC,EAClC,UAAWmZ,MAAM6oB,GACfnvC,EAAO,KAAK,IAAIA,EAAMsmB,GAAG,CAAC,EAC1BrmB,GAAO,KAAK,IAAIA,GAAMqmB,GAAG,CAAC,EAC1BpmB,GAAO,KAAK,IAAIA,GAAMomB,GAAG,CAAC,EAC1BnmB,GAAO,KAAK,IAAIA,GAAMmmB,GAAG,CAAC,EAE5B,MAAM0qB,GAAY/wC,GAAO,KAAK,IAAIiN,EAAM,EAAGC,EAAI,CAAC,EAC1C8jC,GAAWjxC,EAAO,KAAK,IAAIkN,EAAM,EAAGC,EAAI,CAAC,EAC/C,GAAIy5B,EAAM,CACR,MAAMphC,GAASkgC,GACf,GAAIsL,GAAW,CACb,MAAME,GAAQ,KAAK,IAAIhkC,EAAM,EAAGC,EAAI,CAAC,EAC/BkhC,GAAW,KAAK,IAAInhC,EAAM,EAAGC,EAAI,CAAC,EAClCmhC,GAAW,KAAK,IAAIphC,EAAM,EAAGC,EAAI,CAAC,EAClCgkC,GAAkBrK,EAAU,OAC/B2B,IAAQA,GAAI,KAAOyI,IAASzI,GAAI,KAAOyI,IACxCzI,GAAI,KAAO6F,IAAY7F,GAAI,KAAO4F,EAE9C,EACU,GAAI8C,GAAgB,OAAS,EAAG,CAC9B,IAAIC,GAAa,KAAK,IAAIlkC,EAAM,EAAGC,EAAI,CAAC,EACxC,UAAWs7B,MAAO0I,GAAiB,CACjC,MAAME,IAAc5I,GAAI,KAAOA,GAAI,MAAQ,EAC3C,GAAIA,GAAI,oBAAsB,QAAU,MAAMA,GAAI,iBAAiB,EACjE,SAEF,MAAM6I,GAAcD,GAAa5I,GAAI,kBAAoBjjC,GACzD4rC,GAAa,KAAK,IAAIA,GAAYE,EAAW,CAC/C,CACK,MAAMF,EAAU,IACnBnxC,GAAOmxC,GAEX,CACF,CACA,GAAIH,GAAU,CACZ,MAAME,GAAkBrK,EAAU,OAC/B2B,IAAQA,GAAI,KAAO,KAAK,IAAIv7B,EAAM,EAAGC,EAAI,CAAC,EAAI3H,IAC/CijC,GAAI,KAAO,KAAK,IAAIv7B,EAAM,EAAGC,EAAI,CAAC,GAAKs7B,GAAI,KAAO,KAAK,IAAIv7B,EAAM,EAAGC,EAAI,CAAC,CAErF,EACU,GAAIgkC,GAAgB,OAAS,EAAG,CAC9B,IAAII,GAAa,KAAK,IAAIrkC,EAAM,EAAGC,EAAI,CAAC,EACxC,UAAWs7B,MAAO0I,GAAiB,CAEjC,MAAMK,IADc/I,GAAI,KAAOA,GAAI,MAAQ,EACXA,GAAI,kBAAoBjjC,GACxD+rC,GAAa,KAAK,IAAIA,GAAYC,EAAU,CAC9C,CACAxxC,EAAOuxC,EACT,CACF,CACF,CACA,MAAME,GAAkCz8C,EAAQ08C,IAAY,CAC1D,MAAMC,GAAYxkC,EAAI,EAAID,EAAM,EAC1B0kC,GAAc9K,EAAU,OAAQ2B,IAAQ,CAC5C,MAAMoJ,GAAc,KAAK,IAAI3kC,EAAM,EAAGC,EAAI,CAAC,EAAIs7B,GAAI,MAAQ,KAAK,IAAIv7B,EAAM,EAAGC,EAAI,CAAC,EAAIs7B,GAAI,KACpFqJ,GAAc,KAAK,IAAI5kC,EAAM,EAAGC,EAAI,CAAC,EAAIs7B,GAAI,MAAQ,KAAK,IAAIv7B,EAAM,EAAGC,EAAI,CAAC,EAAIs7B,GAAI,KAC1F,OAAOoJ,IAAeC,EACxB,CAAC,EACD,IAAIC,GAAcH,GAClB,GAAIhL,GAAQgL,GAAY,OAAS,EAAG,CAClC,MAAMI,GAAeJ,GAAY,OAC9BnJ,IAAQA,GAAI,KAAOiJ,IAAWjJ,GAAI,KAAOiJ,EACtD,EACcM,GAAa,OAAS,IACxBD,GAAcC,GAElB,CACA,GAAID,GAAY,SAAW,EACzB,OAAO5kC,EAAI,EAEb,MAAM3H,GAASigC,GACf,GAAIkM,GAAW,CAEb,MAAMM,GADkB,KAAK,IAAI,GAAGF,GAAY,IAAKtJ,IAAQA,GAAI,IAAI,CAAC,EACtCjjC,GAChC,GAAIysC,GAAQ9kC,EAAI,EAAIo4B,GAClB,OAAO0M,EAEX,KAAO,CAEL,MAAMA,GADgB,KAAK,IAAI,GAAGF,GAAY,IAAKtJ,IAAQA,GAAI,IAAI,CAAC,EACtCjjC,GAC9B,GAAIysC,GAAQ9kC,EAAI,EAAIo4B,GAClB,OAAO0M,EAEX,CACA,OAAO9kC,EAAI,CACb,EAAG,iBAAiB,EACd+kC,GAAyCl9C,EAAQ08C,IAAY,CACjE,MAAMO,GAAQR,GAAgBC,EAAO,EAC/BS,GAAU,CAAE,EAAGT,GAAS,EAAGxkC,EAAM,CAAC,EAClCklC,GAAU,CAAE,EAAGV,GAAS,EAAGO,EAAK,EAChCI,GAAU,CAAE,EAAGllC,EAAI,EAAG,EAAG8kC,EAAK,EAC9BK,GAAclD,GAAoBliC,EAAOilC,EAAO,EAChDI,GAAcnD,GAAoB+C,GAASC,EAAO,EAClDI,GAAcpD,GAAoBgD,GAASC,EAAO,EAClDI,GAAcR,KAAU9kC,EAAI,EAAIiiC,GAAoBiD,GAASllC,CAAG,EAAI,GAC1E,MAAI,CAACmlC,IAAe,CAACC,IAAe,CAACC,IAAe,CAACC,GAC/C,KAAK,IAAIR,GAAQ9kC,EAAI,CAAC,EAAIo4B,GACrB,CAACr4B,EAAOilC,GAASC,GAASjlC,CAAG,EAE/B,CAACD,EAAOilC,GAASC,GAASC,GAASllC,CAAG,EAExC,IACT,EAAG,wBAAwB,EACrBulC,GAAc1B,IAAa,CAACC,GAAWiB,GAAuBjyC,EAAI,EAAIgxC,IAAY,CAACD,GAAYkB,GAAuBlyC,CAAI,EAAI,KAChI0yC,KACFvD,GAAYuD,GAEhB,CACA,MAAMC,GAAa,CACjB3H,EACA,GAAGqB,GACH,GAAG8C,GACH,GAAGzC,GAAmB,QAAO,EAE7BzB,CACN,EACI,GAAI0H,GAAW,QAAU,EAAG,CAC1B,MAAMC,EAAID,GAAWA,GAAW,OAAS,CAAC,EACpCE,EAAIF,GAAWA,GAAW,OAAS,CAAC,EACpCG,EAAIH,GAAWA,GAAW,OAAS,CAAC,EACpC/9B,GAAU,KAAK,IAAIk+B,EAAE,EAAID,EAAE,CAAC,EAAItN,IAAQ,KAAK,IAAIsN,EAAE,EAAID,EAAE,CAAC,EAAIrN,GAC9D1wB,GAAS,KAAK,IAAIi+B,EAAE,EAAID,EAAE,CAAC,EAAItN,IAAQ,KAAK,IAAIsN,EAAE,EAAID,EAAE,CAAC,EAAIrN,GACnE,GAAI3wB,GAAS,CACX,MAAMm+B,GAAS,KAAK,KAAKF,EAAE,EAAIC,EAAE,CAAC,EAC5BE,GAAS,KAAK,KAAKJ,EAAE,EAAIE,EAAE,CAAC,EAC9BC,KAAW,GAAKA,KAAWC,IAAU,KAAK,IAAIH,EAAE,EAAIC,EAAE,CAAC,EAAI,KAAK,IAAIF,EAAE,EAAIE,EAAE,CAAC,GAC/EH,GAAW,OAAO,GAAI,CAAC,CAE3B,SAAW99B,GAAQ,CACjB,MAAMk+B,GAAS,KAAK,KAAKF,EAAE,EAAIC,EAAE,CAAC,EAC5BE,GAAS,KAAK,KAAKJ,EAAE,EAAIE,EAAE,CAAC,EAC9BC,KAAW,GAAKA,KAAWC,IAAU,KAAK,IAAIH,EAAE,EAAIC,EAAE,CAAC,EAAI,KAAK,IAAIF,EAAE,EAAIE,EAAE,CAAC,GAC/EH,GAAW,OAAO,GAAI,CAAC,CAE3B,CACF,CACA,MAAMl5B,GAAa,CAACk5B,GAAW,CAAC,CAAC,EACjC,QAASj4C,EAAI,EAAGA,EAAIi4C,GAAW,OAAS,EAAGj4C,IAAK,CAC9C,GAAIA,IAAM,EAAG,CACX+e,GAAW,KAAKk5B,GAAWj4C,CAAC,CAAC,EAC7B,QACF,CACA,MAAM/B,EAAO8gB,GAAWA,GAAW,OAAS,CAAC,EACvC7gB,EAAO+5C,GAAWj4C,CAAC,EACnB7B,GAAO85C,GAAWj4C,EAAI,CAAC,EAC7B,GAAI,KAAK,IAAI/B,EAAK,EAAIC,EAAK,CAAC,EAAI2sC,IAAQ,KAAK,IAAI3sC,EAAK,EAAIC,GAAK,CAAC,EAAI0sC,GAAM,CACxE,MAAM0N,GAAOr6C,EAAK,EAAID,EAAK,EACrBu6C,GAAOr6C,GAAK,EAAID,EAAK,EAC3B,GAAIq6C,KAASC,GAAM,CACjBz5B,GAAW,KAAK7gB,CAAI,EACpB,QACF,CACA,QACF,CACA,GAAI,KAAK,IAAID,EAAK,EAAIC,EAAK,CAAC,EAAI2sC,IAAQ,KAAK,IAAI3sC,EAAK,EAAIC,GAAK,CAAC,EAAI0sC,GAAM,CACxE,MAAM0N,GAAOr6C,EAAK,EAAID,EAAK,EACrBu6C,GAAOr6C,GAAK,EAAID,EAAK,EAC3B,GAAIq6C,KAASC,GAAM,CACjBz5B,GAAW,KAAK7gB,CAAI,EACpB,QACF,CACA,QACF,CACA6gB,GAAW,KAAK7gB,CAAI,CACtB,CACA6gB,GAAW,KAAKk5B,GAAWA,GAAW,OAAS,CAAC,CAAC,EACjD,QAASj4C,EAAI,EAAGA,EAAI+e,GAAW,OAAS,EAAG/e,IAAK,CAC9C,MAAM8J,EAAKiV,GAAW/e,CAAC,EACjB+J,EAAKgV,GAAW/e,EAAI,CAAC,EACrBusC,GAAc,KAAK,IAAIziC,EAAG,EAAIC,EAAG,CAAC,EAAI8gC,GAAO,WAAa,aAC1D/rB,GAAQytB,KAAgB,WAAaziC,EAAG,EAAIA,EAAG,EAC/CuJ,GAAOk5B,KAAgB,WAAa,KAAK,IAAIziC,EAAG,EAAGC,EAAG,CAAC,EAAI,KAAK,IAAID,EAAG,EAAGC,EAAG,CAAC,EAC9EuJ,GAAKi5B,KAAgB,WAAa,KAAK,IAAIziC,EAAG,EAAGC,EAAG,CAAC,EAAI,KAAK,IAAID,EAAG,EAAGC,EAAG,CAAC,EAC5E2iC,GAAOJ,EAAaC,GAAaztB,GAAOzL,GAAMC,EAAE,EAChDmlC,GAAO,CACX,UAAWp+C,EACX,aAAc2F,EACd,YAAAusC,GACA,KAAAG,GACA,WAAY,EAEZ,KAAAr5B,GACA,GAAAC,EACR,EACMw5B,EAAkB,KAAK2L,EAAI,EAC3B1L,EAAmB1yC,CAAC,EAAE,KAAKyyC,EAAkB,OAAS,CAAC,EAClDJ,GAAK,OAAO,CAAC,IAChBA,GAAK,OAAO,CAAC,EAAI,CAAE,MAAO,EAAG,MAAOA,GAAK,MAAO,SAAU,CAAA,CAAE,GAE9DA,GAAK,OAAO,CAAC,EAAE,SAAS,KAAK,CAC3B,UAAWryC,EACX,aAAc2F,EACd,KAAAqT,GACA,GAAAC,EACR,CAAO,CACH,CACF,CACA,MAAMolC,EAAkCp+C,EAAO,CAACq+C,EAAIC,IAC3CD,EAAG,KAAOC,EAAG,IAAMA,EAAG,KAAOD,EAAG,GACtC,iBAAiB,EACdE,GAA8Cv+C,EAAO,CAACq+C,EAAIC,EAAIE,EAAIC,IAAO,CAC7E,MAAMC,EAAY,CAACD,EAAG,SAAS,KAC5BroC,IAAOA,EAAE,YAAckoC,EAAG,WAAaloC,EAAE,eAAiBkoC,EAAG,eAAiBF,EAAgBhoC,EAAGioC,CAAE,CAC1G,EACUM,EAAY,CAACH,EAAG,SAAS,KAC5BpoC,IAAOA,EAAE,YAAcioC,EAAG,WAAajoC,EAAE,eAAiBioC,EAAG,eAAiBD,EAAgBhoC,EAAGkoC,CAAE,CAC1G,EACI,OAAII,GAAaC,GACfN,EAAG,WAAaI,EAAG,MACnBH,EAAG,WAAaE,EAAG,MACnBA,EAAG,SAAW,CACZ,GAAGA,EAAG,SAAS,OACZpoC,GAAMA,EAAE,YAAcioC,EAAG,WAAajoC,EAAE,eAAiBioC,EAAG,YACvE,EACQ,CACE,UAAWC,EAAG,UACd,aAAcA,EAAG,aACjB,KAAMA,EAAG,KACT,GAAIA,EAAG,EACjB,CACA,EACMG,EAAG,SAAW,CACZ,GAAGA,EAAG,SAAS,OACZroC,GAAMA,EAAE,YAAckoC,EAAG,WAAaloC,EAAE,eAAiBkoC,EAAG,YACvE,EACQ,CACE,UAAWD,EAAG,UACd,aAAcA,EAAG,aACjB,KAAMA,EAAG,KACT,GAAIA,EAAG,EACjB,CACA,EACa,IAEF,EACT,EAAG,6BAA6B,EAC1BO,GAAiC5+C,EAAQoyC,GAAS,CACtD,MAAMpT,EAAMoT,EAAK,OAAO,OACxB,OAAAA,EAAK,OAAOpT,CAAG,EAAI,CAAE,MAAOA,EAAK,MAAOoT,EAAK,MAAO,SAAU,CAAA,CAAE,EACzDpT,CACT,EAAG,gBAAgB,EACb6f,GAAqC7+C,EAAO,CAACgB,EAAK89C,IAAa,CACnE,MAAMC,EAAW/9C,EAAI,KAAK,OAAOA,EAAI,UAAU,EAC/C+9C,EAAS,SAAWA,EAAS,SAAS,OACnC3oC,GAAMA,EAAE,YAAcpV,EAAI,WAAaoV,EAAE,eAAiBpV,EAAI,YACrE,EACIA,EAAI,WAAa89C,EACA99C,EAAI,KAAK,OAAO89C,CAAQ,EAChC,SAAS,KAAK,CACrB,UAAW99C,EAAI,UACf,aAAcA,EAAI,aAClB,KAAMA,EAAI,KACV,GAAIA,EAAI,EACd,CAAK,CACH,EAAG,oBAAoB,EACjBg+C,GAA0Ch/C,EAAO,CAACgB,EAAK89C,IAAa,CACxE,MAAMG,EAAUxM,EAAmBzxC,EAAI,SAAS,EAChD,UAAWg+B,KAAOigB,EAAS,CACzB,MAAM3qB,EAAIke,EAAkBxT,CAAG,EAC3B1K,EAAE,OAAStzB,EAAI,MACjB69C,GAAmBvqB,EAAGwqB,CAAQ,CAElC,CACF,EAAG,yBAAyB,EACtBI,GAA+Cl/C,EAAQgB,GAAQ,CACnE,MAAMi+C,EAAUxM,EAAmBzxC,EAAI,SAAS,EAC1Cm+C,EAAYF,EAAQ,QAAQzM,EAAkB,QAAQxxC,CAAG,CAAC,EAC1Dy7B,EAAM,CAAA,EACZ,OAAI0iB,EAAY,GACd1iB,EAAI,KAAK+V,EAAkByM,EAAQE,EAAY,CAAC,CAAC,CAAC,EAEhDA,EAAYF,EAAQ,OAAS,GAC/BxiB,EAAI,KAAK+V,EAAkByM,EAAQE,EAAY,CAAC,CAAC,CAAC,EAE7C1iB,CACT,EAAG,8BAA8B,EAC3B2iB,GAAkCp/C,EAAO,CAAC0B,EAAME,IAAS,CAC7D,GAAIF,EAAK,cAAgBE,EAAK,YAC5B,MAAO,GAET,MAAM+J,EAAIjK,EAAK,cAAgB,aAAeA,EAAOE,EAC/C25B,EAAI75B,EAAK,cAAgB,aAAeE,EAAOF,EACrD,OAAO65B,EAAE,KAAK,MAAQ5vB,EAAE,MAAQ4vB,EAAE,KAAK,MAAQ5vB,EAAE,IAAMA,EAAE,KAAK,MAAQ4vB,EAAE,MAAQ5vB,EAAE,KAAK,MAAQ4vB,EAAE,EACnG,EAAG,iBAAiB,EACd8jB,GAAqCr/C,EAAO,CAACoyC,EAAMpxC,IAAQ,CAC/D,UAAW2Q,KAASygC,EAAK,OAIvB,GAAI,CAHYzgC,EAAM,SAAS,KAC5ByE,IAAOA,EAAE,YAAcpV,EAAI,WAAaoV,EAAE,eAAiBpV,EAAI,eAAiBo9C,EAAgBhoC,EAAGpV,CAAG,CAC/G,EAEQ,OAAO2Q,EAAM,MAGjB,MAAO,EACT,EAAG,oBAAoB,EACjB2tC,GAAmCt/C,EAAO,CAACq+C,EAAIC,IAAO,CAC1D,GAAID,EAAG,aAAeC,EAAG,WACvB,OAAOF,EAAgBC,EAAIC,CAAE,EAE/B,MAAMiB,EAAOL,GAA6Bb,CAAE,EACtCmB,EAAON,GAA6BZ,CAAE,EAC5C,OAAOiB,EAAK,KAAMr/C,GAAOs/C,EAAK,KAAMr/C,GAAOi/C,GAAgBl/C,EAAIC,CAAE,CAAC,CAAC,CACrE,EAAG,kBAAkB,EACfs/C,GAAuCz/C,EAAO,CAACq+C,EAAIC,EAAIoB,IAAS,CACpE,GAAInB,GACFF,EACAC,EACAD,EAAG,KAAK,OAAOA,EAAG,UAAU,EAC5BC,EAAG,KAAK,OAAOA,EAAG,UAAU,CAClC,EACM,OAEF,MAAMqB,EAAQN,GAAmBhB,EAAG,KAAMC,CAAE,EAC5CoB,EAAKpB,EAAIqB,IAAU,GAAKA,EAAQf,GAAeP,EAAG,IAAI,CAAC,CACzD,EAAG,sBAAsB,EACnBuB,GAAyC5/C,EAAQ6/C,GAAY,CACjE,IAAI1+C,EAAY,EAChB,QAASpB,EAAI,EAAGA,EAAI8/C,EAAQ,OAAQ9/C,IAClC,QAASuB,EAAIvB,EAAI,EAAGuB,EAAIu+C,EAAQ,OAAQv+C,IAAK,CAC3C,MAAMw+C,EAAKD,EAAQ9/C,CAAC,EACdggD,EAAKF,EAAQv+C,CAAC,EAChBw+C,EAAG,OAASC,EAAG,MAGfT,GAAiBQ,EAAIC,CAAE,IACzB5+C,IACAs+C,GAAqBK,EAAIC,EAAIf,EAAuB,EAExD,CAEF,OAAO79C,CACT,EAAG,wBAAwB,EACrB6+C,GAAgC,IAAI,IACpCC,GAA8BjgD,EAAQ6yC,GAAY,CACtD,GAAImN,GAAc,IAAInN,CAAO,EAC3B,OAAOmN,GAAc,IAAInN,CAAO,EAElC,MAAMoM,EAAUxM,EAAmBI,CAAO,EAC1C,GAAIoM,EAAQ,SAAW,EAAG,CACxB,MAAMiB,EAAQ,CAAE,KAAM,EAAG,UAAW,EAAG,KAAM,EAAG,MAAO,CAAC,EACxD,OAAAF,GAAc,IAAInN,EAASqN,CAAK,EACzBA,CACT,CAEA,MAAM3yB,EADWilB,EAAkByM,EAAQ,CAAC,CAAC,EACvB,KAAK,MAC3B,IAAIkB,EAAO5yB,EACX,QAASyR,EAAM,EAAGA,EAAMigB,EAAQ,OAAQjgB,IAAO,CAC7C,MAAMh+B,EAAMwxC,EAAkByM,EAAQjgB,CAAG,CAAC,EAC1C,GAAIh+B,EAAI,cAAgB,aAAc,CACpC,MAAMo/C,EAAap/C,EAAI,KACjBq/C,GAAar/C,EAAI,GACvBm/C,EAAO,KAAK,IAAIC,EAAa7yB,CAAI,EAAI,KAAK,IAAI8yB,GAAa9yB,CAAI,EAAI6yB,EAAaC,GAChF,KACF,CACF,CACA,MAAMC,EAAY,KAAK,IAAIH,EAAO5yB,CAAI,EAChCxb,EAAO,CAAE,KAAAouC,EAAM,UAAAG,EAAW,KAAA/yB,EAAM,MAAO4yB,EAAO5yB,CAAI,EACxD,OAAAyyB,GAAc,IAAInN,EAAS9gC,CAAI,EACxBA,CACT,EAAG,aAAa,EACVwuC,GAA2CvgD,EAAO,IAAM,CAC5D,IAAImB,EAAY,EAChB,MAAMq/C,EAAgC,IAAI,IAC1C,SAAW,CAACzgD,EAAG2G,CAAC,IAAKxF,EAAM,QAAO,EAC5BuxC,EAAmB1yC,CAAC,EAAE,SAAW,GAGhC2G,EAAE,QAGF85C,EAAc,IAAI95C,EAAE,KAAK,GAC5B85C,EAAc,IAAI95C,EAAE,MAAO,CAAA,CAAE,EAE/B85C,EAAc,IAAI95C,EAAE,KAAK,EAAE,KAAK3G,CAAC,GAEnC,MAAM0gD,EAAkCzgD,EAAQ6yC,GAAY,CAC1D,MAAMrwC,EAAOtB,EAAM2xC,CAAO,EAC1B,GAAI,CAACrwC,EAAK,OAAS,CAACA,EAAK,IACvB,MAAO,GAET,MAAM8kB,EAAU5d,EAAS,IAAIlH,EAAK,KAAK,EACjC+kB,EAAU7d,EAAS,IAAIlH,EAAK,GAAG,EACrC,GAAI,CAAC8kB,GAAW,CAACC,EACf,MAAO,GAET,MAAM5mB,GAAM4mB,EAAQ,GAAK,IAAMD,EAAQ,GAAK,GACtC1mB,GAAM2mB,EAAQ,GAAK,IAAMD,EAAQ,GAAK,GAC5C,OAAO,KAAK,IAAI3mB,CAAE,EAAI,KAAK,IAAIC,CAAE,CACnC,EAAG,iBAAiB,EACpB,UAAW8/C,KAAOF,EAAc,SAAU,CACxCE,EAAI,KAAK,CAAC99C,EAAGC,IAAM,CACjB,MAAM89C,EAAQV,GAAYr9C,CAAC,EACrBg+C,EAAQX,GAAYp9C,CAAC,EAC3B,GAAI,KAAK,IAAI89C,EAAM,UAAYC,EAAM,SAAS,EAAI,EAChD,OAAOD,EAAM,UAAYC,EAAM,UAEjC,GAAI,KAAK,IAAID,EAAM,KAAOC,EAAM,IAAI,EAAI,EACtC,OAAOD,EAAM,KAAOC,EAAM,KAE5B,MAAMC,EAAQJ,EAAgB79C,CAAC,EACzBk+C,GAAQL,EAAgB59C,CAAC,EAC/B,GAAI,KAAK,IAAIg+C,EAAQC,EAAK,EAAI,EAC5B,OAAOA,GAAQD,EAEjB,MAAME,GAAOtO,EAAmB7vC,CAAC,EAAE,OAC7Bo+C,GAAOvO,EAAmB5vC,CAAC,EAAE,OACnC,GAAIk+C,KAASC,GACX,OAAOD,GAAOC,GAEhB,GAAID,KAAS,EAAG,CACd,MAAMngB,GAAO6R,EAAmB7vC,CAAC,EAAE,CAAC,EAC9Bi+B,GAAO4R,EAAmB5vC,CAAC,EAAE,CAAC,EACpC,GAAI2vC,EAAkB5R,EAAI,GAAK4R,EAAkB3R,EAAI,EAAG,CACtD,MAAMn/B,GAAO8wC,EAAkB5R,EAAI,EAC7Bh/B,GAAO4wC,EAAkB3R,EAAI,EAC7BogB,GAAS,KAAK,IAAIv/C,GAAK,GAAKA,GAAK,IAAI,EACrCw/C,GAAS,KAAK,IAAIt/C,GAAK,GAAKA,GAAK,IAAI,EAC3C,GAAI,KAAK,IAAIq/C,GAASC,EAAM,EAAI,EAC9B,OAAOD,GAASC,EAEpB,CACF,CACA,MAAO,EACT,CAAC,EACD,MAAMrB,EAAUa,EAAI,IAAKS,GAAO3O,EAAkBC,EAAmB0O,CAAE,EAAE,CAAC,CAAC,CAAC,EAC5EhgD,GAAay+C,GAAuBC,CAAO,CAC7C,CACA,OAAO1+C,CACT,EAAG,0BAA0B,EACvBigD,GAA2CphD,EAAO,IAAM,CAC5D,IAAImB,EAAY,EAChB,MAAMkgD,EAAgC,IAAI,IAC1C,SAAW,CAACthD,EAAG2G,CAAC,IAAKxF,EAAM,QAAO,EAChBuxC,EAAmB1yC,CAAC,EACxB,SAAW,GAGlB2G,EAAE,MAGF26C,EAAc,IAAI36C,EAAE,GAAG,GAC1B26C,EAAc,IAAI36C,EAAE,IAAK,CAAA,CAAE,EAE7B26C,EAAc,IAAI36C,EAAE,GAAG,EAAE,KAAK3G,CAAC,GAEjC,UAAW2gD,KAAOW,EAAc,SAAU,CACxCX,EAAI,KAAK,CAAC99C,EAAGC,IAAM,CACjB,MAAMy+C,EAA0BthD,EAAQ6yC,GAAY,CAClD,MAAMoM,GAAUxM,EAAmBI,CAAO,EAC1C,GAAIoM,GAAQ,OAAS,EACnB,MAAO,GAET,MAAMt7C,GAAO6uC,EAAkByM,GAAQA,GAAQ,OAAS,CAAC,CAAC,EAC1D,OAAO,KAAK,IAAIt7C,GAAK,GAAKA,GAAK,IAAI,CACrC,EAAG,SAAS,EACN49C,EAASD,EAAQ1+C,CAAC,EAClB4+C,EAASF,EAAQz+C,CAAC,EACxB,OAAI,KAAK,IAAI0+C,EAASC,CAAM,EAAI,GACvBD,EAASC,EAEX5+C,EAAIC,CACb,CAAC,EACD,MAAMg9C,EAAUa,EAAI,IACjBS,GAAO3O,EAAkBC,EAAmB0O,CAAE,EAAE1O,EAAmB0O,CAAE,EAAE,OAAS,CAAC,CAAC,CAC3F,EACMhgD,GAAay+C,GAAuBC,CAAO,CAC7C,CACA,OAAO1+C,CACT,EAAG,0BAA0B,EACvBsgD,GAAmCzhD,EAAO,IAAM,CACpD,IAAImB,EAAY,EAChB,UAAWixC,KAAQT,EAAO,CACxB,MAAM+P,EAAe,CAAA,EACrB,UAAWhsB,KAAK0c,EAAK,OACnB,UAAWtE,KAAOpY,EAAE,SAAU,CAC5B,MAAMsJ,EAAMyT,EAAmB3E,EAAI,SAAS,EAAE,KAC3C6T,GAAOnP,EAAkBmP,CAAE,EAAE,eAAiB7T,EAAI,YAC/D,EACc9O,IAAQ,QACV0iB,EAAa,KAAKlP,EAAkBxT,CAAG,CAAC,CAE5C,CAEF0iB,EAAa,KAAK,CAAC9+C,EAAGC,IAAMD,EAAE,UAAYC,EAAE,WAAaD,EAAE,aAAeC,EAAE,YAAY,EACxF,QAAS9C,EAAI,EAAGA,EAAI2hD,EAAa,OAAQ3hD,IACvC,QAASuB,EAAIvB,EAAI,EAAGuB,EAAIogD,EAAa,OAAQpgD,IAAK,CAChD,MAAM+8C,EAAKqD,EAAa3hD,CAAC,EACnBu+C,EAAKoD,EAAapgD,CAAC,EACrBg+C,GAAiBjB,EAAIC,CAAE,IACzBn9C,IACAs+C,GAAqBpB,EAAIC,EAAIO,EAAkB,EAEnD,CAEJ,CACA,OAAO19C,CACT,EAAG,kBAAkB,EACrB,IAAIygD,EAAa,EACjB,MAAMC,EAAW,GACjB,KAAOD,EAAaC,GAAU,CAC5B,IAAI1sC,EAAU,EAId,GAHAA,GAAWorC,GAAwB,EACnCprC,GAAWisC,GAAwB,EACnCjsC,GAAWssC,GAAgB,EACvBtsC,IAAY,EACd,MAEFysC,GACF,CACA,MAAME,EAAgC,IAAI,IAC1C,UAAW1P,KAAQT,EAAO,CACxB,MAAM7xC,EAAW,CAAA,EACjBsyC,EAAK,OAAO,QAAS1c,GAAM,CACzBA,EAAE,SAAS,QAASpB,GAAM,CACxBx0B,EAAS,KAAK,CACZ,UAAWw0B,EAAE,UACb,aAAcA,EAAE,aAChB,WAAYoB,EAAE,MACd,KAAMpB,EAAE,KACR,GAAIA,EAAE,EAChB,CAAS,CACH,CAAC,CACH,CAAC,EACDx0B,EAAS,KAAK,CAAC8C,EAAGC,IAAMD,EAAE,KAAOC,EAAE,IAAI,EACvC,MAAMk/C,EAAW,CAAA,EACjB,GAAIjiD,EAAS,OAAS,EAAG,CACvB,IAAIkiD,EAAiB,CAACliD,EAAS,CAAC,CAAC,EAC7BmiD,EAAaniD,EAAS,CAAC,EAAE,GAC7B,QAAS4F,EAAI,EAAGA,EAAI5F,EAAS,OAAQ4F,IAAK,CACxC,MAAM4uB,EAAIx0B,EAAS4F,CAAC,EAChB4uB,EAAE,KAAO2tB,GACXD,EAAe,KAAK1tB,CAAC,EACrB2tB,EAAa,KAAK,IAAIA,EAAY3tB,EAAE,EAAE,IAEtCytB,EAAS,KAAKC,CAAc,EAC5BA,EAAiB,CAAC1tB,CAAC,EACnB2tB,EAAa3tB,EAAE,GAEnB,CACAytB,EAAS,KAAKC,CAAc,CAC9B,CACA,UAAWE,KAAWH,EAAU,CAC9B,MAAMI,EAA6B,IAAI,IACvCD,EAAQ,QAAS5tB,IAAM6tB,EAAW,IAAI7tB,GAAE,UAAU,CAAC,EACnD,MAAM8tB,EAA8B,IAAI,IACxCF,EAAQ,QAAS5tB,IAAM,CACrB,MAAMviB,GAAOkuC,GAAY3rB,GAAE,SAAS,EACpC8tB,EAAY,IAAI9tB,GAAE,YAAa8tB,EAAY,IAAI9tB,GAAE,UAAU,GAAK,GAAKviB,GAAK,KAAK,CACjF,CAAC,EACD,MAAMswC,EAAa,CAAC,GAAGF,CAAU,EAAE,OAAQzsB,KAAO0sB,EAAY,IAAI1sB,EAAC,GAAK,GAAK,EAAE,EACzE4sB,EAAc,CAAC,GAAGH,CAAU,EAAE,OAAQzsB,KAAO0sB,EAAY,IAAI1sB,EAAC,GAAK,GAAK,CAAC,EACzE6sB,EAAgB,CAAC,GAAGJ,CAAU,EAAE,OAAQzsB,IAAM,KAAK,IAAI0sB,EAAY,IAAI1sB,EAAC,GAAK,CAAC,GAAK,CAAC,EAC1F2sB,EAAW,KAAK,CAACz/C,GAAGC,MAAOu/C,EAAY,IAAIv/C,EAAC,GAAK,IAAMu/C,EAAY,IAAIx/C,EAAC,GAAK,EAAE,EAC/E0/C,EAAY,KAAK,CAAC1/C,GAAGC,MAAOu/C,EAAY,IAAIx/C,EAAC,GAAK,IAAMw/C,EAAY,IAAIv/C,EAAC,GAAK,EAAE,EAChF,MAAM2/C,EAA8BxiD,EAAO,CAACyiD,GAAYj+B,KAAU,CAChE09B,EAAQ,OAAQ5tB,IAAMA,GAAE,aAAemuB,EAAU,EAAE,QAASnuB,IAAM,CAChE,MAAMouB,GAAiBhQ,EAAuB,IAAIpe,GAAE,SAAS,EAAI8d,EAAK,MAAQ5tB,GAC9Es9B,EAAc,IAAI,GAAGxtB,GAAE,SAAS,IAAIA,GAAE,YAAY,GAAIouB,EAAc,CACtE,CAAC,CACH,EAAG,aAAa,EAChB,IAAIC,GAAY,EAChB,UAAWF,MAAcJ,EACvBM,KACAH,EAAYC,GAAYrQ,EAAK,MAAQuQ,GAAY9R,EAAa,EAEhE,GAAI0R,EAAc,SAAW,GAAKJ,EAAW,KAAO,EAAG,CACrD,MAAMS,GAAY,CAAC,GAAGT,CAAU,EAAE,KAChC,CAACv/C,GAAGC,KAAM,KAAK,IAAIu/C,EAAY,IAAIx/C,EAAC,GAAK,CAAC,EAAI,KAAK,IAAIw/C,EAAY,IAAIv/C,EAAC,GAAK,CAAC,CACxF,EAAU,CAAC,EACGggD,GAAUR,EAAW,QAAQO,EAAS,EACxCC,KAAY,IACdR,EAAW,OAAOQ,GAAS,CAAC,EAE9B,MAAMC,GAAWR,EAAY,QAAQM,EAAS,EAC1CE,KAAa,IACfR,EAAY,OAAOQ,GAAU,CAAC,EAEhCP,EAAc,KAAKK,EAAS,CAC9B,CACA,IAAIG,GAAkB,EACtB,UAAWN,MAAcF,EAAe,CACtC,GAAIQ,KAAoB,EACtBP,EAAYC,GAAYrQ,EAAK,KAAK,MAC7B,CACL,MAAM4Q,GAAMD,GAAkB,IAAM,EAAI,EAAI,GACtCE,GAAY,KAAK,KAAKF,GAAkB,CAAC,EAC/CP,EAAYC,GAAYrQ,EAAK,MAAQ4Q,GAAMC,GAAYpS,GAAgB,EAAG,CAC5E,CACAkS,IACF,CACA,IAAIG,GAAa,EACjB,UAAWT,MAAcH,EACvBY,KACAV,EAAYC,GAAYrQ,EAAK,MAAQ8Q,GAAarS,EAAa,CAEnE,CACF,CACA,SAAW,CAAC9wC,EAAG2G,CAAC,IAAKxF,EAAM,QAAO,EAAI,CACpC,MAAM+9C,EAAUxM,EAAmB1yC,CAAC,GAAK,CAAA,EACzC,GAAIk/C,EAAQ,SAAW,EACrB,SAEF,MAAMkE,EAAY,CAAA,EACZx5C,EAAMD,EAAS,IAAIhD,EAAE,KAAK,EAC1BkD,EAAMF,EAAS,IAAIhD,EAAE,GAAG,EACxB,CAAE,SAAAsvC,EAAU,SAAAC,CAAQ,EAAKL,EAAa71C,EAAG4J,EAAKC,CAAG,EACjDw5C,EAAQnE,EAAQ,IAAKjgB,IAAQ,CACjC,MAAM1K,GAAIke,EAAkBxT,EAAG,EACzBxa,GAAQs9B,EAAc,IAAI,GAAGxtB,GAAE,SAAS,IAAIA,GAAE,YAAY,EAAE,GAAKA,GAAE,KAAK,MAC9E,MAAO,CACL,OAAQA,GAAE,YACV,MAAA9P,GACA,KAAM8P,GAAE,KACR,GAAIA,GAAE,EACd,CACI,CAAC,EACD6uB,EAAU,KAAKnN,CAAQ,EACvB,QAAStwC,GAAI,EAAGA,GAAI09C,EAAM,OAAQ19C,KAAK,CACrC,MAAMyrC,GAAOiS,EAAM19C,EAAC,EACdsY,GAASmlC,EAAUA,EAAU,OAAS,CAAC,EACvCE,GAAYlS,GAAK,SAAW,WAAanzB,GAAO,EAAIA,GAAO,EAC3DslC,GAAiBnS,GAAK,SAAW,WAAanzB,GAAO,EAAIA,GAAO,EAChEozB,GAAWgS,EAAM19C,GAAI,CAAC,EACtB69C,GAAc79C,GAAI09C,EAAM,OAAS,EAIvC,GAHI,KAAK,IAAIE,GAAiBnS,GAAK,KAAK,EAAIZ,IAC1C4S,EAAU,KAAK9R,GAAYF,GAAMkS,EAAS,CAAC,EAEzCE,IAAenS,GAAS,SAAWD,GAAK,OAC1C,GAAI,KAAK,IAAIA,GAAK,MAAQC,GAAS,KAAK,EAAIb,GAAM,CAChD,MAAMiT,GAAWrS,GAAK,SAAW,YAAckS,GAAYjS,GAAS,MAAQ,EAAIF,GAAwBC,GAAMC,EAAQ,EACtH+R,EAAU,KAAK9R,GAAYF,GAAMqS,EAAQ,EAAGnS,GAAYD,GAAUoS,EAAQ,CAAC,CAC7E,MAAW99C,KAAM,GAAKA,KAAM09C,EAAM,OAAS,IACzCD,EAAU,KAAK9R,GAAYF,GAAMD,GAAwBC,GAAMC,EAAQ,CAAC,CAAC,UAElEmS,GACTJ,EAAU,KAAK9R,GAAYF,GAAMC,GAAS,KAAK,CAAC,MAC3C,CACL,MAAMqS,GAAW,KAAK,IAAItS,GAAK,KAAOkS,EAAS,EAAI,KAAK,IAAIlS,GAAK,GAAKkS,EAAS,EAAIlS,GAAK,GAAKA,GAAK,KAClGgS,EAAU,KAAK9R,GAAYF,GAAMsS,EAAQ,CAAC,CAC5C,CACF,CACA,MAAMp0C,EAAO8zC,EAAUA,EAAU,OAAS,CAAC,GACvC,KAAK,IAAI9zC,EAAK,EAAI4mC,EAAS,CAAC,EAAI1F,IAAQ,KAAK,IAAIlhC,EAAK,EAAI4mC,EAAS,CAAC,EAAI1F,KAC1E4S,EAAU,KAAKlN,CAAQ,EAEzB,MAAMyN,GAAW,CAAA,EACbP,EAAU,OAAS,GACrBO,GAAS,KAAKP,EAAU,CAAC,CAAC,EAE5B,QAASz9C,GAAI,EAAGA,GAAIy9C,EAAU,OAAQz9C,KAAK,CACzC,MAAMtD,GAAI+gD,EAAUz9C,EAAC,EACf/B,GAAO+/C,GAASA,GAAS,OAAS,CAAC,GACrC,KAAK,IAAIthD,GAAE,EAAIuB,GAAK,CAAC,EAAI4sC,IAAQ,KAAK,IAAInuC,GAAE,EAAIuB,GAAK,CAAC,EAAI4sC,KAC5DmT,GAAS,KAAKthD,EAAC,CAEnB,CACAsE,EAAE,OAASg9C,EACb,CACA,UAAWC,KAAMziD,EAAO,CACtB,MAAM0iD,EAAOD,EAAG,eACZC,GAAQD,EAAG,SACbC,EAAK,OAASD,EAAG,OAErB,CACAx2C,EAAK,OAASA,EAAK,OAAS,CAAA,GAAI,OAAQzG,GAAM,CAACA,EAAE,YAAY,EAC7D,MAAMm9C,EAAoC7jD,EAAO,CAACoC,EAAGkH,IAAS,CAC5D,MAAMhG,EAAKgG,EAAK,GAAK,EACf/F,EAAK+F,EAAK,GAAK,EACfoC,EAAIpC,EAAK,OAAS,EAClBqC,EAAIrC,EAAK,QAAU,EACzB,GAAIoC,GAAK,GAAKC,GAAK,EACjB,OAAOvJ,EAET,MAAM26B,EAAOz5B,EAAKoI,EAAI,EAChBsxB,EAAQ15B,EAAKoI,EAAI,EACjB5C,EAAMvF,EAAKoI,EAAI,EACf1C,EAAS1F,EAAKoI,EAAI,EACxB,GAAIvJ,EAAE,EAAI26B,GAAQ36B,EAAE,EAAI46B,GAAS56B,EAAE,EAAI0G,GAAO1G,EAAE,EAAI6G,EAClD,OAAO7G,EAET,MAAMqvB,GAAQrvB,EAAE,EAAI26B,EACdrL,GAASsL,EAAQ56B,EAAE,EACnBmvB,GAAOnvB,EAAE,EAAI0G,EACb0oB,GAAUvoB,EAAS7G,EAAE,EACrB0hD,GAAO,KAAK,IAAIryB,GAAOC,GAAQH,GAAMC,EAAO,EAClD,OAAIsyB,KAASryB,GACJ,CAAE,EAAGsL,EAAM,EAAG36B,EAAE,CAAC,EAEtB0hD,KAASpyB,GACJ,CAAE,EAAGsL,EAAO,EAAG56B,EAAE,CAAC,EAEvB0hD,KAASvyB,GACJ,CAAE,EAAGnvB,EAAE,EAAG,EAAG0G,CAAG,EAElB,CAAE,EAAG1G,EAAE,EAAG,EAAG6G,CAAM,CAC5B,EAAG,mBAAmB,EACtB,UAAWzG,KAAQ2K,EAAK,MAAO,CAC7B,MAAM9G,EAAM7D,EAAK,OACjB,GAAI,CAAC6D,GAAOA,EAAI,OAAS,EACvB,SAEF,MAAMiM,EAAQ9P,EAAK,MACb+P,EAAQ/P,EAAK,IACbmH,EAAM2I,EAAQ5I,EAAS,IAAI4I,CAAK,EAAI,OACpC1I,EAAM2I,EAAQ7I,EAAS,IAAI6I,CAAK,EAAI,OACtC5I,IACFtD,EAAI,CAAC,EAAIw9C,EAAkBx9C,EAAI,CAAC,EAAGsD,CAAG,GAEpCC,IACFvD,EAAIA,EAAI,OAAS,CAAC,EAAIw9C,EAAkBx9C,EAAIA,EAAI,OAAS,CAAC,EAAGuD,CAAG,EAEpE,CACA,OAAOuD,CACT,CACAnN,EAAOuxC,GAAsB,sBAAsB,EAGnD,SAASwS,GAAqBj8C,EAAa,CACzC,OAAOA,EAAY,WAAa,IAClC,CACA9H,EAAO+jD,GAAsB,sBAAsB,EACnD,SAASC,GAAsBl8C,EAAa,CAC1C,MAAMmC,EAAIR,GAAY3B,CAAW,EAC3ByC,EAAUzC,EAAY,OAAO,WAAW,aAAe,GACvDwC,EAAWxC,EAAY,OAAO,WAAW,aAAe,IACxDmoC,EAAuBnoC,EAAY,OAAO,UAAU,sBAAwB,GAC5EooC,EAA4BpoC,EAAY,OAAO,UAAU,0BAA4B,GACrFm8C,EAAwBn8C,EAAY,OAAO,UAAU,uBAAyB,GAC9EsB,EAAY26C,GAAqBj8C,CAAW,EAC5C,CAAE,QAAAoC,EAAS,YAAAomC,GAAgBN,GAAe/lC,EAAG,CACjD,QAAAM,EACA,SAAAD,EACA,qBAAA2lC,EACA,yBAA0BC,EAC1B,sBAAA+T,EACA,UAAA76C,CACJ,CAAG,EACDY,GAAsBC,EAAGC,EAASomC,EAAa,CAAE,QAAA/lC,EAAS,SAAAD,EAAU,EACpE,UAAW9H,KAAQsF,EAAY,OAAS,CAAA,EACtC,OAAOtF,EAAK,OAEd+uC,GAAqBzpC,EAAasB,CAAS,EAC3C,UAAW5G,KAAQsF,EAAY,OAAS,CAAA,GAClC,CAACtF,EAAK,OAASA,EAAK,QAAU,WAChCA,EAAK,MAAQ,WAGjB,OAAA24B,GAA0BrzB,EAAasB,CAAS,EAChDoxB,GAAwB1yB,CAAW,EAC5BsB,CACT,CACApJ,EAAOgkD,GAAuB,uBAAuB,EAGrD,SAASE,GAAsBp8C,EAAa,CAC1CoB,GAA0BpB,CAAW,EACrC,MAAMq8C,EAAkBj3C,GAAqBpF,CAAW,EACxDA,EAAY,MAAQq8C,EAAgB,MACpCr8C,EAAY,MAAQq8C,EAAgB,KACtC,CACAnkD,EAAOkkD,GAAuB,uBAAuB,EAClD,IAACE,GAASC,GAA2B,CACtC,cAAeH,GACf,cAAeF,GACf,WAAYn8C,EACd,CAAC","x_google_ignoreList":[0]}