jbrowse-plugin-graphgenomeviewer 8.2.0 → 8.3.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (77) hide show
  1. package/dist/chunks/{AddTrackWorkflow-7CXTSSMR.js → AddTrackWorkflow-JAIB6H2T.js} +2 -2
  2. package/dist/chunks/{GbzBaseSyntenyAdapter-EJIR3HZM.js → GbzBaseSyntenyAdapter-Y5VUDFZP.js} +2 -2
  3. package/dist/chunks/{GbzBaseSyntenyAdapter-EJIR3HZM.js.map → GbzBaseSyntenyAdapter-Y5VUDFZP.js.map} +1 -1
  4. package/dist/chunks/{GraphGenomeView-2AKRM74B.js → GraphGenomeView-VW3PEHFP.js} +2 -2
  5. package/dist/chunks/{GraphTrackSettingsDialog-7XRZQW6T.js → GraphTrackSettingsDialog-TT5TXM5I.js} +2 -2
  6. package/dist/chunks/{HighlightColorDialog-LCBGD2ZA.js → HighlightColorDialog-R3EIOO2M.js} +2 -2
  7. package/dist/chunks/{LinearGraphDisplay-WWQ73BO5.js → LinearGraphDisplay-OBD4R5G3.js} +2 -2
  8. package/dist/chunks/{MinigraphBubbleAdapter-4OOBJ44C.js → MinigraphBubbleAdapter-QXISPSHM.js} +2 -2
  9. package/dist/chunks/{RgfaTabixAdapter-CEGFN2QY.js → RgfaTabixAdapter-SVZ5SSEY.js} +2 -2
  10. package/dist/chunks/{WalkFormsAdapter-LTAKACZD.js → WalkFormsAdapter-6LK2XCHQ.js} +2 -2
  11. package/dist/chunks/{WalkTabixSyntenyAdapter-B6V3YNW7.js → WalkTabixSyntenyAdapter-LA22PX4I.js} +2 -2
  12. package/dist/chunks/{chunk-MCBYBZZJ.js → chunk-5ZGRAPN5.js} +2 -2
  13. package/dist/chunks/{chunk-NOXHIOIM.js → chunk-73B6AYVV.js} +2 -2
  14. package/dist/chunks/{chunk-W7IHIVSE.js → chunk-AUQISDXJ.js} +2 -2
  15. package/dist/chunks/{chunk-W7IHIVSE.js.map → chunk-AUQISDXJ.js.map} +1 -1
  16. package/dist/chunks/{chunk-VKZALU57.js → chunk-B2MJV7HN.js} +1 -1
  17. package/dist/chunks/{chunk-VKZALU57.js.map → chunk-B2MJV7HN.js.map} +1 -1
  18. package/dist/chunks/{chunk-CNCYMJ5E.js → chunk-DL2S7QKE.js} +2 -2
  19. package/dist/chunks/{chunk-CNCYMJ5E.js.map → chunk-DL2S7QKE.js.map} +1 -1
  20. package/dist/chunks/{chunk-OGXVDZPS.js → chunk-DSKPOCCE.js} +2 -2
  21. package/dist/chunks/{chunk-OGXVDZPS.js.map → chunk-DSKPOCCE.js.map} +1 -1
  22. package/dist/chunks/{chunk-UHV6XIDG.js → chunk-EKGY6PG2.js} +2 -2
  23. package/dist/chunks/{chunk-UHV6XIDG.js.map → chunk-EKGY6PG2.js.map} +1 -1
  24. package/dist/chunks/{chunk-QWG7NASD.js → chunk-G3L2L62S.js} +2 -2
  25. package/dist/chunks/{chunk-OLZZDBQJ.js → chunk-GIIUVBOH.js} +2 -2
  26. package/dist/chunks/{chunk-OLZZDBQJ.js.map → chunk-GIIUVBOH.js.map} +2 -2
  27. package/dist/chunks/{chunk-CZXJXNZN.js → chunk-HAVM67SF.js} +2 -2
  28. package/dist/chunks/{chunk-UECOGSWM.js → chunk-IUBWMYUA.js} +2 -2
  29. package/dist/chunks/{chunk-UECOGSWM.js.map → chunk-IUBWMYUA.js.map} +1 -1
  30. package/dist/chunks/{chunk-SL4JJJQJ.js → chunk-MHIKXNVU.js} +3 -3
  31. package/dist/chunks/{chunk-SL4JJJQJ.js.map → chunk-MHIKXNVU.js.map} +2 -2
  32. package/dist/chunks/{chunk-IK3MQ4ZJ.js → chunk-NAC3EXT4.js} +2 -2
  33. package/dist/chunks/{chunk-IK3MQ4ZJ.js.map → chunk-NAC3EXT4.js.map} +1 -1
  34. package/dist/chunks/{chunk-CVHKXFVS.js → chunk-NSBH4FIW.js} +2 -2
  35. package/dist/chunks/{chunk-CVHKXFVS.js.map → chunk-NSBH4FIW.js.map} +1 -1
  36. package/dist/chunks/{chunk-BJHWGRMP.js → chunk-PEE2MP7K.js} +1 -1
  37. package/dist/chunks/{chunk-BJHWGRMP.js.map → chunk-PEE2MP7K.js.map} +1 -1
  38. package/dist/chunks/{chunk-T2VC3EEL.js → chunk-PMM6BEKY.js} +1 -1
  39. package/dist/chunks/{chunk-T2VC3EEL.js.map → chunk-PMM6BEKY.js.map} +1 -1
  40. package/dist/chunks/chunk-QATGAV57.js +2 -0
  41. package/dist/chunks/chunk-QATGAV57.js.map +7 -0
  42. package/dist/chunks/{chunk-PTOKTIQG.js → chunk-TMFUYJFG.js} +2 -2
  43. package/dist/chunks/{chunk-WUOXZAGN.js → chunk-WA7FCDLQ.js} +1 -1
  44. package/dist/chunks/{chunk-WUOXZAGN.js.map → chunk-WA7FCDLQ.js.map} +1 -1
  45. package/dist/chunks/chunk-WO3MEQ25.js +2 -0
  46. package/dist/chunks/chunk-ZEE3HTOT.js +2 -0
  47. package/dist/chunks/chunk-ZEE3HTOT.js.map +7 -0
  48. package/dist/chunks/{renderSvg-E5Q7MLCH.js → renderSvg-2DPRP5UX.js} +2 -2
  49. package/dist/jbrowse-plugin-graphgenomeviewer.esm.js +2 -2
  50. package/dist/jbrowse-plugin-graphgenomeviewer.esm.js.map +2 -2
  51. package/package.json +2 -2
  52. package/src/GraphAddTrackWorkflow/buildTrackConfig.test.ts +18 -0
  53. package/src/GraphAddTrackWorkflow/buildTrackConfig.ts +10 -0
  54. package/src/GraphAddTrackWorkflow/graphManifest.test.ts +12 -0
  55. package/src/GraphAddTrackWorkflow/graphManifest.ts +10 -2
  56. package/src/version.ts +1 -1
  57. package/dist/chunks/chunk-5FNGR33G.js +0 -2
  58. package/dist/chunks/chunk-5FNGR33G.js.map +0 -7
  59. package/dist/chunks/chunk-CZI7IP5S.js +0 -2
  60. package/dist/chunks/chunk-CZI7IP5S.js.map +0 -7
  61. package/dist/chunks/chunk-HAAABGE7.js +0 -2
  62. /package/dist/chunks/{AddTrackWorkflow-7CXTSSMR.js.map → AddTrackWorkflow-JAIB6H2T.js.map} +0 -0
  63. /package/dist/chunks/{GraphGenomeView-2AKRM74B.js.map → GraphGenomeView-VW3PEHFP.js.map} +0 -0
  64. /package/dist/chunks/{GraphTrackSettingsDialog-7XRZQW6T.js.map → GraphTrackSettingsDialog-TT5TXM5I.js.map} +0 -0
  65. /package/dist/chunks/{HighlightColorDialog-LCBGD2ZA.js.map → HighlightColorDialog-R3EIOO2M.js.map} +0 -0
  66. /package/dist/chunks/{LinearGraphDisplay-WWQ73BO5.js.map → LinearGraphDisplay-OBD4R5G3.js.map} +0 -0
  67. /package/dist/chunks/{MinigraphBubbleAdapter-4OOBJ44C.js.map → MinigraphBubbleAdapter-QXISPSHM.js.map} +0 -0
  68. /package/dist/chunks/{RgfaTabixAdapter-CEGFN2QY.js.map → RgfaTabixAdapter-SVZ5SSEY.js.map} +0 -0
  69. /package/dist/chunks/{WalkFormsAdapter-LTAKACZD.js.map → WalkFormsAdapter-6LK2XCHQ.js.map} +0 -0
  70. /package/dist/chunks/{WalkTabixSyntenyAdapter-B6V3YNW7.js.map → WalkTabixSyntenyAdapter-LA22PX4I.js.map} +0 -0
  71. /package/dist/chunks/{chunk-MCBYBZZJ.js.map → chunk-5ZGRAPN5.js.map} +0 -0
  72. /package/dist/chunks/{chunk-NOXHIOIM.js.map → chunk-73B6AYVV.js.map} +0 -0
  73. /package/dist/chunks/{chunk-QWG7NASD.js.map → chunk-G3L2L62S.js.map} +0 -0
  74. /package/dist/chunks/{chunk-CZXJXNZN.js.map → chunk-HAVM67SF.js.map} +0 -0
  75. /package/dist/chunks/{chunk-PTOKTIQG.js.map → chunk-TMFUYJFG.js.map} +0 -0
  76. /package/dist/chunks/{chunk-HAAABGE7.js.map → chunk-WO3MEQ25.js.map} +0 -0
  77. /package/dist/chunks/{renderSvg-E5Q7MLCH.js.map → renderSvg-2DPRP5UX.js.map} +0 -0
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "version": 3,
3
- "sources": ["../../node_modules/.pnpm/@jbrowse+graph-fmmm-layout@1.0.2/node_modules/@jbrowse/graph-fmmm-layout/esm/loadFmmm.js", "../../node_modules/.pnpm/@jbrowse+graph-fmmm-layout@1.0.2/node_modules/@jbrowse/graph-fmmm-layout/esm/fmmmLayout.js", "../../node_modules/.pnpm/@jbrowse+graph-stress-layout@1.0.0/node_modules/@jbrowse/graph-stress-layout/esm/stressPlacement.js", "../../node_modules/.pnpm/@jbrowse+graph-stress-layout@1.0.0/node_modules/@jbrowse/graph-stress-layout/esm/stressEngine.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.1.1/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-CO6RGQAD.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.1.1/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-34BOZKIE.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.1.1/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-HKYXWZQS.js"],
3
+ "sources": ["../../node_modules/.pnpm/@jbrowse+graph-fmmm-layout@1.0.2/node_modules/@jbrowse/graph-fmmm-layout/esm/loadFmmm.js", "../../node_modules/.pnpm/@jbrowse+graph-fmmm-layout@1.0.2/node_modules/@jbrowse/graph-fmmm-layout/esm/fmmmLayout.js", "../../node_modules/.pnpm/@jbrowse+graph-stress-layout@1.0.0/node_modules/@jbrowse/graph-stress-layout/esm/stressPlacement.js", "../../node_modules/.pnpm/@jbrowse+graph-stress-layout@1.0.0/node_modules/@jbrowse/graph-stress-layout/esm/stressEngine.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.1.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-CO6RGQAD.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.1.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-34BOZKIE.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.1.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-HKYXWZQS.js"],
4
4
  "sourcesContent": ["let cached;\nexport function loadFmmm() {\n cached !== null && cached !== void 0 ? cached : (cached = import('./bandage-layout.js')\n .then(mod => mod.default())\n .catch((e) => {\n cached = undefined;\n throw e;\n }));\n return cached;\n}\n", "import { loadFmmm } from \"./loadFmmm.js\";\nexport async function fmmmLayout(request) {\n const engine = await loadFmmm();\n return engine.computeLayout(request.graph, request.options);\n}\n", "// A node whose id starts with this is a deletion's route rather than sequence,\n// placed as an arch over the backbone.\nexport const ROUTE_ID = '\\u0000deletion:';\n// Where the stress engine starts an anchored graph. The backbone lies straight\n// along x at drawn length (its seeds). Every other node belongs to a piece: a\n// connected set of unplaced nodes, anchored where its links meet chains already\n// placed. A piece whose anchors sit on one placed curve is drawn in that\n// curve's frame (arc length along it, depth out of it): two anchors give a\n// spine along a circular arc of the piece's drawn length, a lens when it fits\n// its gap and a teardrop when longer, pushed out (legs, then a dropped chord,\n// then a tilt) until it clears what is drawn; a spine shorter than its gap is\n// a straight bar under it, hung deeper the wider the gap so its links leave\n// the lane; one anchor gives a straight tip. Anchors on\n// different curves use the chord between them. What a spine leaves unplaced\n// becomes pieces anchored on it, so nesting recurses. Deletion routes arch\n// above the backbone. Components with no backbone stay NaN for the engine's\n// random start.\nconst MIN_DEPTH = 12;\nconst LANE_GAP = 15;\nconst CLEAR = LANE_GAP * 0.7;\nconst TIP_ANGLE = (25 * Math.PI) / 180;\n// how deep a deletion arch rises, or a short bar hangs, per unit of its gap\nconst BOW = 0.25;\nconst BOW_CAP = 150;\n// a teardrop beside another leans away from it rather than dropping\nconst TEARDROP_TILTS = [0, -0.35, 0.35, -0.7, 0.7, -1.05, 1.05, -1.4, 1.4];\nconst SIDES = [0, 1];\nfunction other(side) {\n return side ? 0 : 1;\n}\nfunction unit(a, b) {\n const dx = b.x - a.x;\n const dy = b.y - a.y;\n const m = Math.hypot(dx, dy) || 1;\n return { x: dx / m, y: dy / m };\n}\nfunction lerp(a, b, f) {\n return { x: a.x + (b.x - a.x) * f, y: a.y + (b.y - a.y) * f };\n}\nfunction centroidOf(pts) {\n let x = 0;\n let y = 0;\n for (const p of pts) {\n x += p.x;\n y += p.y;\n }\n return { x: x / pts.length, y: y / pts.length };\n}\nfunction arcLengths(pts) {\n const arc = new Float64Array(pts.length);\n for (let i = 1; i < pts.length; i++) {\n arc[i] =\n arc[i - 1] +\n Math.hypot(pts[i].x - pts[i - 1].x, pts[i].y - pts[i - 1].y);\n }\n return arc;\n}\nfunction polylineLength(pts) {\n var _a;\n return (_a = arcLengths(pts)[pts.length - 1]) !== null && _a !== void 0 ? _a : 0;\n}\n// arc angle theta in (0, 2pi) with L/c = theta / (2 sin(theta/2)); a piece's\n// candidates ask for a handful of ratios hundreds of times\nconst arcAngles = new Map();\nfunction arcAngle(ratio) {\n const known = arcAngles.get(ratio);\n if (known !== undefined) {\n return known;\n }\n const angle = solveArcAngle(ratio);\n if (arcAngles.size > 10000) {\n arcAngles.clear();\n }\n arcAngles.set(ratio, angle);\n return angle;\n}\nfunction solveArcAngle(ratio) {\n let lo = 1e-6;\n let hi = 2 * Math.PI - 1e-6;\n for (let i = 0; i < 60; i++) {\n const mid = (lo + hi) / 2;\n if (mid / (2 * Math.sin(mid / 2)) < ratio) {\n lo = mid;\n }\n else {\n hi = mid;\n }\n }\n return (lo + hi) / 2;\n}\n// arc length of the circular arc with chord c and sagitta s\nfunction archLength(c, s) {\n if (c < 1e-9) {\n return Math.PI * s;\n }\n const R = ((c * c) / 4 + s * s) / (2 * s);\n const theta = 2 * Math.asin(Math.min(1, c / (2 * R)));\n return R * (s > R ? 2 * Math.PI - theta : theta);\n}\n// from (0, drop) to (c, drop) in `length`: legs of h along v joined by a\n// circular arc\nfunction arcFlat(c, length, h, drop) {\n const arc = length - 2 * h;\n const theta = c < 1e-9 ? 2 * Math.PI : arcAngle(arc / c);\n const R = arc / theta;\n const cos = Math.cos(theta / 2);\n const cu = c / 2;\n const cv = drop + h - R * cos;\n return {\n at: t => {\n if (t <= h) {\n return { u: 0, v: drop + t };\n }\n if (t >= length - h) {\n return { u: c, v: drop + length - t };\n }\n const a = (t - h) / R - theta / 2;\n return { u: cu + R * Math.sin(a), v: cv + R * Math.cos(a) };\n },\n apex: drop + h + R * (1 - cos),\n length,\n };\n}\n// The flat curve rotated about its chord's midpoint, which moves its feet\n// off the anchors by (c/2) sin(angle): one up, one down. A shear that kept\n// the feet swung a deep loop across its neighbours and raised link crossings\n// by half on the KIV-2 eight-haplotype cut.\nfunction tilted(flat, c, angle) {\n if (!angle) {\n return flat;\n }\n const cos = Math.cos(angle);\n const sin = Math.sin(angle);\n return {\n ...flat,\n at: t => {\n const { u, v } = flat.at(t);\n const du = u - c / 2;\n return { u: c / 2 + du * cos - v * sin, v: du * sin + v * cos };\n },\n };\n}\n// whether any of the flat curve lies behind its frame: a loop's top poking\n// up through the reference line, which read as a glitch on every walk panel\nfunction behindFrame(flat) {\n for (let i = 0; i <= 32; i++) {\n if (flat.at((flat.length * i) / 32).v < -1e-6) {\n return true;\n }\n }\n return false;\n}\nfunction lineFlat(u0, v0, du, dv, length) {\n return {\n at: t => ({ u: u0 + du * t, v: v0 + dv * t }),\n apex: v0 + Math.max(0, dv) * length,\n length,\n };\n}\n// A placed curve: dense samples with cumulative arc length and outward normals.\nclass Curve {\n constructor(pts, normals, straight = false) {\n var _a;\n this.pts = pts;\n this.normals = normals;\n this.straight = straight;\n this.arc = arcLengths(pts);\n this.total = (_a = this.arc[pts.length - 1]) !== null && _a !== void 0 ? _a : 0;\n }\n segment(t) {\n const { arc } = this;\n let lo = 1;\n let hi = arc.length - 1;\n while (lo < hi) {\n const mid = (lo + hi) >> 1;\n if (arc[mid] < t) {\n lo = mid + 1;\n }\n else {\n hi = mid;\n }\n }\n return lo;\n }\n fraction(i, t) {\n const span = this.arc[i] - this.arc[i - 1];\n return span > 0 ? (t - this.arc[i - 1]) / span : 0;\n }\n pointAt(t) {\n const { pts } = this;\n const last = pts.length - 1;\n if (last === 0) {\n return { ...pts[0] };\n }\n if (t <= 0) {\n const d = unit(pts[0], pts[1]);\n return { x: pts[0].x + d.x * t, y: pts[0].y + d.y * t };\n }\n if (t >= this.total) {\n const d = unit(pts[last - 1], pts[last]);\n const r = t - this.total;\n return { x: pts[last].x + d.x * r, y: pts[last].y + d.y * r };\n }\n const i = this.segment(t);\n return lerp(pts[i - 1], pts[i], this.fraction(i, t));\n }\n normalAt(t) {\n const { normals } = this;\n if (normals.length === 1 || t <= 0) {\n return normals[0];\n }\n if (t >= this.total) {\n return normals[normals.length - 1];\n }\n const i = this.segment(t);\n const { x, y } = lerp(normals[i - 1], normals[i], this.fraction(i, t));\n const m = Math.hypot(x, y) || 1;\n return { x: x / m, y: y / m };\n }\n}\n// A polyline's outward normals: the perpendicular pointing away from its\n// centroid where the shape is fat enough to say, else the frame's own outward.\nfunction outwardNormals(pts, outRef) {\n const centroid = centroidOf(pts);\n return pts.map((p, i) => {\n const t = unit(pts[Math.max(0, i - 1)], pts[Math.min(pts.length - 1, i + 1)]);\n const n = { x: -t.y, y: t.x };\n const rx = p.x - centroid.x;\n const ry = p.y - centroid.y;\n const rm = Math.hypot(rx, ry);\n const dot = n.x * rx + n.y * ry;\n const ref = outRef[i];\n const sign = rm > 1e-9 && Math.abs(dot) > 0.3 * rm\n ? Math.sign(dot)\n : Math.sign(n.x * ref.x + n.y * ref.y) || 1;\n return { x: n.x * sign, y: n.y * sign };\n });\n}\n// the flat curve carried into the frame from arc length tA, outward by sign,\n// sampled every `step` at most\nfunction mapFlat(frame, tA, sign, flat, step) {\n const ds = Math.min(step, Math.max(flat.length / 24, 0.5));\n const pts = [];\n const refs = [];\n for (let t = 0; t <= flat.length + 1e-9; t += ds) {\n const { u, v } = flat.at(Math.min(t, flat.length));\n const q = frame.pointAt(tA + u);\n const nr = frame.normalAt(tA + u);\n const ox = nr.x * sign;\n const oy = nr.y * sign;\n pts.push({ x: q.x + ox * v, y: q.y + oy * v });\n refs.push({ x: ox, y: oy });\n }\n return { pts, refs };\n}\nconst FINE_STEP = 5;\nconst COARSE_STEP = CLEAR / 2;\n// the flat curve whose image in a curved frame has the asked length, within\n// a tenth of a percent or six tries\nfunction fitted(frame, tA, sign, make, length, step) {\n let flatLength = length;\n let mapped = mapFlat(frame, tA, sign, make(flatLength), step);\n if (frame.straight) {\n return mapped;\n }\n for (let i = 0; i < 6; i++) {\n const got = polylineLength(mapped.pts);\n if (!(got > 0) || Math.abs(got / length - 1) < 1e-3) {\n break;\n }\n flatLength *= length / got;\n mapped = mapFlat(frame, tA, sign, make(flatLength), step);\n }\n return mapped;\n}\nfunction depths(from, n) {\n return Array.from({ length: n }, (_, i) => from + (i * LANE_GAP) / 2);\n}\nfunction spanOf(anchors) {\n if (anchors.length === 0) {\n return Infinity;\n }\n let lo = Infinity;\n let hi = -Infinity;\n for (const a of anchors) {\n lo = Math.min(lo, a.point.x);\n hi = Math.max(hi, a.point.x);\n }\n return hi - lo;\n}\nfunction cellKey(gx, gy) {\n return (gx * 73856093) ^ (gy * 19349663);\n}\nclass Placer {\n constructor(c) {\n this.c = c;\n this.grid = new Map();\n const { ids, first, count, per, seedX, seedY, backbone } = c;\n const N = ids.length;\n this.points = Array.from({ length: N }, () => undefined);\n this.params = Array.from({ length: N }, () => undefined);\n this.curves = Array.from({ length: N }, () => undefined);\n this.links = c.links.map((sides, k) => sides.map(out => out.filter(([v]) => v !== k)));\n this.route = ids.map(id => id.startsWith(ROUTE_ID));\n let min = Infinity;\n let max = -Infinity;\n for (let k = 0; k < N; k++) {\n const start = first[k];\n if (!backbone[start] || Number.isNaN(seedX[start])) {\n continue;\n }\n min = Math.min(min, seedX[start]);\n max = Math.max(max, seedX[start] + per[k] * (count[k] - 1));\n }\n this.backbone = new Curve([\n { x: min, y: 0 },\n { x: max, y: 0 },\n ], [\n { x: 0, y: 1 },\n { x: 0, y: 1 },\n ], true);\n this.backboneCentroid = { x: (min + max) / 2, y: 0 };\n for (let k = 0; k < N; k++) {\n const start = first[k];\n if (!backbone[start] || Number.isNaN(seedX[start])) {\n continue;\n }\n const pts = [];\n const ts = [];\n for (let i = 0; i < count[k]; i++) {\n const x = seedX[start] + i * per[k];\n pts.push({ x, y: seedY[start] });\n ts.push(x - min);\n }\n this.points[k] = pts;\n this.params[k] = ts;\n this.curves[k] = this.backbone;\n this.occupy(pts, this.backbone);\n }\n }\n static hasBackbone(c) {\n for (let k = 0; k < c.ids.length; k++) {\n const start = c.first[k];\n if (c.backbone[start] && !Number.isNaN(c.seedX[start])) {\n return true;\n }\n }\n return false;\n }\n run() {\n const free = [];\n for (let k = 0; k < this.points.length; k++) {\n if (!this.points[k]) {\n free.push(k);\n }\n }\n // Narrow pieces first, short before long, except that pieces on the same\n // feet go longest first so an inner loop nests inside the outer one rather\n // than crossing it. A wide loop whose foot lies inside a narrower loop's\n // disc still drives its leg through it; making the narrow loop yield and\n // re-place after the wide one freed it but re-placed it as a hairpin on\n // long legs, 243/411/13 to 229/459/21 link-node/link-link/node-node\n // crossings on the KIV-2 eight-haplotype cut at twice the time, and\n // leaning the re-placed loop by shear at 0.1-0.4 rad gave 310/480/25.\n const pieces = this.componentsOf(free)\n .map(members => ({ members, anchors: this.anchorsOf(members) }))\n .filter(p => p.anchors.length)\n .map(p => ({\n members: p.members,\n span: spanOf(p.anchors),\n drawn: p.members.reduce((s, k) => s + this.drawn(k), 0),\n feet: p.anchors\n .map(a => `${a.point.x},${a.point.y}`)\n .sort()\n .join(' '),\n }))\n .sort((a, b) => a.span - b.span ||\n (a.feet === b.feet ? b.drawn - a.drawn : a.drawn - b.drawn));\n for (const p of pieces) {\n this.placePiece(p.members, this.backboneCentroid);\n }\n }\n write(X, Y) {\n const { first } = this.c;\n this.points.forEach((pts, k) => {\n pts === null || pts === void 0 ? void 0 : pts.forEach((p, i) => {\n X[first[k] + i] = p.x;\n Y[first[k] + i] = p.y;\n });\n });\n }\n drawn(k) {\n return this.c.per[k] * (this.c.count[k] - 1);\n }\n endIndex(k, side) {\n return side ? this.c.count[k] - 1 : 0;\n }\n occupy(pts, curve) {\n for (const p of pts) {\n const key = cellKey(Math.floor(p.x / CLEAR), Math.floor(p.y / CLEAR));\n const list = this.grid.get(key);\n const occupant = { x: p.x, y: p.y, curve };\n if (list) {\n list.push(occupant);\n }\n else {\n this.grid.set(key, [occupant]);\n }\n }\n }\n // placed points within CLEAR of the candidate, off the exempt curve and\n // beyond a lane of the anchors, up to `limit`. Exempting two lanes let\n // teardrops off adjacent anchors cross at the neck: 3 node crossings on the\n // HPRC KIV-2 cut against 1, and 2 on MHC class II against 0.\n violations(pts, exempt, anchorPts, limit) {\n var _a;\n let n = 0;\n for (const p of pts) {\n if (anchorPts.some(a => Math.hypot(p.x - a.x, p.y - a.y) < LANE_GAP)) {\n continue;\n }\n const cx = Math.floor(p.x / CLEAR);\n const cy = Math.floor(p.y / CLEAR);\n for (let gx = cx - 1; gx <= cx + 1; gx++) {\n for (let gy = cy - 1; gy <= cy + 1; gy++) {\n for (const q of (_a = this.grid.get(cellKey(gx, gy))) !== null && _a !== void 0 ? _a : []) {\n if (q.curve !== exempt &&\n Math.hypot(p.x - q.x, p.y - q.y) < CLEAR) {\n n++;\n if (n >= limit) {\n return n;\n }\n }\n }\n }\n }\n }\n return n;\n }\n // The first candidate that clears what is drawn, else the least crowded.\n // Exempting only the feet of pieces at the same anchor, or adding\n // candidates with legs splayed a lane or more out from the anchors, moved\n // no count that mattered on the HPRC cuts.\n choose(candidates, exempt, anchorPts) {\n let best;\n let bestV = Infinity;\n for (const candidate of candidates) {\n const v = this.violations(candidate(COARSE_STEP).pts, exempt, anchorPts, bestV);\n if (v === 0) {\n return candidate(FINE_STEP);\n }\n if (v < bestV) {\n bestV = v;\n best = candidate;\n }\n }\n return best(FINE_STEP);\n }\n anchorsOf(members) {\n const set = new Set(members);\n const out = [];\n for (const u of members) {\n for (const uSide of SIDES) {\n for (const [v, vSide] of this.links[u][uSide]) {\n const pts = this.points[v];\n if (set.has(v) || !pts) {\n continue;\n }\n const i = this.endIndex(v, vSide);\n out.push({\n u,\n uSide,\n v,\n vSide,\n point: pts[i],\n curve: this.curves[v],\n t: this.params[v][i],\n });\n }\n }\n }\n return out;\n }\n componentsOf(members) {\n const set = new Set(members);\n const seen = new Set();\n const comps = [];\n for (const s of members) {\n if (seen.has(s)) {\n continue;\n }\n const queue = [s];\n seen.add(s);\n for (const u of queue) {\n for (const side of SIDES) {\n for (const [v] of this.links[u][side]) {\n if (set.has(v) && !seen.has(v)) {\n seen.add(v);\n queue.push(v);\n }\n }\n }\n }\n comps.push(queue);\n }\n return comps;\n }\n // side-consistent BFS over (node, entered side) within the piece; without a\n // target, the path to the farthest state\n spinePath(members, from, fromSide, to, toExitSide) {\n const set = new Set(members);\n const key = (k, s) => k * 2 + s;\n const reached = (k, s) => k === to && other(s) === toExitSide;\n const prev = new Map([[key(from, fromSide), -1]]);\n const queue = [[from, fromSide]];\n let far = [from, fromSide];\n for (const [k, s] of queue) {\n far = [k, s];\n if (to !== undefined && reached(k, s)) {\n break;\n }\n for (const [v, t] of this.links[k][other(s)]) {\n if (!set.has(v) || prev.has(key(v, t))) {\n continue;\n }\n prev.set(key(v, t), key(k, s));\n queue.push([v, t]);\n }\n }\n if (to !== undefined && !reached(far[0], far[1])) {\n return undefined;\n }\n const path = [];\n for (let cur = key(far[0], far[1]); cur !== -1; cur = prev.get(cur)) {\n path.push({ k: cur >> 1, enter: (cur & 1) });\n }\n return path.reverse();\n }\n loosePath(members, from, to) {\n const set = new Set(members);\n const prev = new Map([[from, -1]]);\n const side = new Map([[from, 0]]);\n const queue = [from];\n for (const k of queue) {\n if (k === to) {\n break;\n }\n for (const s of SIDES) {\n for (const [v, t] of this.links[k][s]) {\n if (!set.has(v) || prev.has(v)) {\n continue;\n }\n prev.set(v, k);\n side.set(v, t);\n queue.push(v);\n }\n }\n }\n const path = [];\n for (let cur = to; cur !== -1; cur = prev.get(cur)) {\n path.push({ k: cur, enter: side.get(cur) });\n }\n return path.reverse();\n }\n spineLength(spine) {\n const { link } = this.c;\n return spine.reduce((s, { k }) => s + this.drawn(k) + link, link);\n }\n // the spine's chains along the curve from arc length t0, at their own\n // spacing unless one is given\n layAlong(spine, curve, t0, spacing) {\n const { count, per, link } = this.c;\n let t = t0;\n const all = [];\n for (const { k, enter } of spine) {\n const step = spacing !== null && spacing !== void 0 ? spacing : per[k];\n const pts = [];\n const ts = [];\n for (let i = 0; i < count[k]; i++) {\n pts.push(curve.pointAt(t + i * step));\n ts.push(t + i * step);\n }\n if (enter === 1) {\n pts.reverse();\n ts.reverse();\n }\n this.points[k] = pts;\n this.params[k] = ts;\n this.curves[k] = curve;\n all.push(...pts);\n t += step * (count[k] - 1) + link;\n }\n return all;\n }\n arcCandidates(frame, tA, sign, c, L) {\n const hMax = (L - c) / 2 - 1e-6;\n const tilts = L > 2 * c ? TEARDROP_TILTS : [0];\n const candidates = [];\n for (const drop of depths(0, 8)) {\n for (const tilt of tilts) {\n for (let i = 0; i <= 16; i++) {\n const h = (hMax * i) / 16;\n const flat = tilted(arcFlat(c, L, h, drop), c, tilt);\n if ((i < 16 && flat.apex < MIN_DEPTH) || behindFrame(flat)) {\n continue;\n }\n candidates.push(step => fitted(frame, tA, sign, length => tilted(arcFlat(c, length, Math.min(h, (length - c) / 2 - 1e-6), drop), c, tilt), L, step));\n }\n }\n }\n return candidates;\n }\n placePiece(members, parent) {\n var _a;\n const { count, link } = this.c;\n const anchors = this.anchorsOf(members);\n if (anchors.length === 0) {\n return;\n }\n const route = members.every(k => this.route[k]);\n const shared = anchors.every(a => a.curve === anchors[0].curve)\n ? anchors[0].curve\n : undefined;\n let frame;\n let tA;\n let tB;\n let sign;\n if (shared) {\n anchors.sort((a, b) => a.t - b.t);\n frame = shared;\n tA = anchors[0].t;\n tB = anchors[anchors.length - 1].t;\n sign = frame === this.backbone && route ? -1 : 1;\n }\n else {\n // A piece between curves hangs on the chord, and its links stay long.\n // Relaxing just these pieces over their links with the rest held\n // stretched the junction nodes across the gap instead: on the KIV-2\n // eight-haplotype cut, chain length error 0.3% to 57% and node\n // crossings 22 to 48. Hanging the piece on the curve with most anchors\n // more than doubled that cut's link crossings.\n anchors.sort((a, b) => a.point.x - b.point.x || a.point.y - b.point.y);\n const a = anchors[0].point;\n const b = anchors[anchors.length - 1].point;\n const chord = Math.hypot(b.x - a.x, b.y - a.y);\n const u = chord > 1e-9 ? unit(a, b) : { x: 1, y: 0 };\n const n = { x: -u.y, y: u.x };\n const mid = lerp(a, b, 0.5);\n sign = anchors.some(x => x.curve === this.backbone)\n ? (route ? -1 : 1) * (Math.sign(n.y) || 1)\n : (mid.x - parent.x) * n.x + (mid.y - parent.y) * n.y >= 0\n ? 1\n : -1;\n frame = new Curve([a, b], [n, n], true);\n tA = 0;\n tB = chord;\n }\n const A = anchors[0];\n const B = anchors[anchors.length - 1];\n const c = tB - tA;\n const single = anchors.length === 1 || (A.u === B.u && A.uSide === B.uSide && c < 1e-9);\n const anchorPts = [A.point, B.point];\n const pick = (candidates) => this.choose(candidates, shared, anchorPts);\n let spine;\n let mapped;\n let start = link;\n let spacing;\n if (single) {\n spine = this.spinePath(members, A.u, A.uSide);\n const L = this.spineLength(spine);\n const next = A.vSide\n ? Math.max(0, count[A.v] - 2)\n : Math.min(1, count[A.v] - 1);\n const dirU = A.t >= this.params[A.v][next] ? 1 : -1;\n const du = dirU * Math.cos(TIP_ANGLE);\n const dv = Math.sin(TIP_ANGLE);\n mapped = pick(depths(0, 12).map(drop => (step) => fitted(frame, tA, sign, length => lineFlat(0, drop, du, dv, length), L, step)));\n }\n else {\n spine =\n (_a = this.spinePath(members, A.u, A.uSide, B.u, B.uSide)) !== null && _a !== void 0 ? _a : this.loosePath(members, A.u, B.u);\n const L = this.spineLength(spine);\n if (route) {\n const d0 = Math.max(MIN_DEPTH, Math.min(BOW * c, BOW_CAP));\n mapped = pick(depths(d0, 12).map(d => (step) => mapFlat(frame, tA, sign, arcFlat(c, archLength(c, d), 0, 0), step)));\n const total = polylineLength(mapped.pts);\n spacing = Math.max(1e-3, (total - 2 * link) / (count[spine[0].k] - 1));\n }\n else if (L > c + 1e-6) {\n mapped = pick(this.arcCandidates(frame, tA, sign, c, L));\n }\n else {\n const bar = L - 2 * link;\n const d0 = Math.max(MIN_DEPTH, Math.min(BOW * (c - bar), BOW_CAP));\n mapped = pick(depths(d0, 12).map(d => (step) => fitted(frame, tA, sign, length => lineFlat(c / 2 - length / 2, d, 1, 0, length), bar, step)));\n start = 0;\n }\n }\n const curve = new Curve(mapped.pts, outwardNormals(mapped.pts, mapped.refs));\n const placed = this.layAlong(spine, curve, start, spacing);\n this.occupy(placed, curve);\n const centroid = centroidOf(placed);\n const rest = members.filter(k => !this.points[k]);\n const subs = this.componentsOf(rest)\n .map(m => ({ members: m, span: spanOf(this.anchorsOf(m)) }))\n .sort((a, b) => a.span - b.span);\n for (const sub of subs) {\n this.placePiece(sub.members, centroid);\n }\n }\n}\n// Initial positions per point, NaN where the placement reached nothing.\nexport function stressPlacement(c) {\n const X = new Float64Array(c.n).fill(NaN);\n const Y = new Float64Array(c.n).fill(NaN);\n if (Placer.hasBackbone(c)) {\n const placer = new Placer(c);\n placer.run();\n placer.write(X, Y);\n }\n return { X, Y };\n}\n", "import { stressPlacement } from \"./stressPlacement.js\";\n// A layout taking the Bandage engine's request: each node is the chain of\n// points FMMM would build, and the result is a polyline per node.\n//\n// A component with a seeded backbone is drawn by stressPlacement: the\n// backbone straight along x, every other node hung off it. The rest is a\n// stress layout by stochastic gradient descent (Zheng, Pawar & Goodman 2019)\n// with target distances from random walks, after odgi's path-guided SGD:\n// every point starts a few walks of log-uniform length each iteration, and\n// how far a walk got is how far apart its ends should sit, so a repeat's loop\n// draws as a ring of its own circumference. Stress has no repulsion, so a\n// final pass pushes apart points that are close but not joined.\n//\n// Running the schedule on a placed component twists its loops, since a walk\n// from a loop's leg runs on along the backbone and pulls the leg to lie along\n// it: 32 node crossings on HPRC MHC class II against the placement's 4.\n// walks per point and iterations by the quality the request names\nconst QUALITY = [\n { walks: 2, iterations: 15 },\n { walks: 4, iterations: 30 },\n { walks: 8, iterations: 60 },\n { walks: 12, iterations: 90 },\n { walks: 16, iterations: 120 },\n];\nconst UNTANGLE_PASSES = 20;\n// the untangle radius, in link lengths\nconst UNTANGLE_LINKS = 3;\nconst UNTANGLE_PUSH = 0.3;\nconst SMOOTH_PASSES = 2;\n// a 20-link cap balls a 3k-node graph up\nconst MAX_HOPS = 200;\n// the step size the schedule ends on, as a share of the smallest pair's\nconst EPS = 0.1;\n// the share of the schedule a seeded component skips\nconst WARM = 0.5;\nconst isBackbone = (node) => { var _a; return ((_a = node.stable) === null || _a === void 0 ? void 0 : _a.rank) === 0; };\nfunction flipped(strand, name) {\n const own = name.at(-1);\n return ((strand === '+' || strand === '-') &&\n (own === '+' || own === '-') &&\n strand !== own);\n}\nfunction xorshift(seed) {\n let s = Math.imul(seed, 2654435761) >>> 0 || 1;\n return () => {\n s ^= s << 13;\n s >>>= 0;\n s ^= s >>> 17;\n s ^= s << 5;\n s >>>= 0;\n return s / 4294967296;\n };\n}\nexport function num(value, fallback) {\n return typeof value === 'number' && Number.isFinite(value) ? value : fallback;\n}\n// A node's drawn length, in layout units, from its bp\nexport function drawnLength(options, bp) {\n return Math.max((num(options.nodeLengthPerMegabase, 1000) * bp) / 1000000, num(options.minimumNodeLength, 1));\n}\nexport function chains(request) {\n const { nodes, edges } = request.graph;\n const o = request.options;\n const segment = num(o.nodeSegmentLength, 1);\n const link = num(o.edgeLength, 1);\n const ids = nodes.map(n => n.id);\n const first = new Int32Array(nodes.length);\n const count = new Int32Array(nodes.length);\n const per = new Float64Array(nodes.length);\n let n = 0;\n nodes.forEach((node, k) => {\n const drawn = drawnLength(o, node.length);\n const steps = Math.max(1, Math.ceil(drawn / segment));\n first[k] = n;\n count[k] = steps + 1;\n per[k] = drawn / steps;\n n += steps + 1;\n });\n const chainOf = new Int32Array(n);\n const indexOf = new Int32Array(n);\n const seedX = new Float64Array(n).fill(NaN);\n const seedY = new Float64Array(n).fill(NaN);\n const backbone = new Uint8Array(n);\n const adjacent = Array.from({ length: n }, () => []);\n nodes.forEach((node, k) => {\n const seeded = typeof node.x === 'number' && typeof node.y === 'number';\n const reference = isBackbone(node) ? 1 : 0;\n for (let i = 0; i < count[k]; i++) {\n const v = first[k] + i;\n chainOf[v] = k;\n indexOf[v] = i;\n backbone[v] = reference;\n if (seeded) {\n seedX[v] = node.x + i * per[k];\n seedY[v] = node.y;\n }\n if (i > 0) {\n adjacent[v - 1].push([v, per[k]]);\n adjacent[v].push([v - 1, per[k]]);\n }\n }\n });\n const index = new Map(ids.map((id, k) => [id, k]));\n const links = nodes.map(() => [[], []]);\n for (const edge of edges) {\n const a = index.get(edge.from);\n const b = index.get(edge.to);\n if (a === undefined || b === undefined) {\n continue;\n }\n // a self link on a chain of one step has nowhere to go, as in FMMM\n if (a === b && count[a] <= 2) {\n continue;\n }\n const fromSide = flipped(edge.fromStrand, edge.from) ? 0 : 1;\n const toSide = flipped(edge.toStrand, edge.to) ? 1 : 0;\n const u = first[a] + (fromSide ? count[a] - 1 : 0);\n const v = first[b] + (toSide ? count[b] - 1 : 0);\n adjacent[u].push([v, link]);\n adjacent[v].push([u, link]);\n links[a][fromSide].push([b, toSide]);\n links[b][toSide].push([a, fromSide]);\n }\n const off = new Int32Array(n + 1);\n for (let i = 0; i < n; i++) {\n off[i + 1] = off[i] + adjacent[i].length;\n }\n const nb = new Int32Array(off[n]);\n const wt = new Float64Array(off[n]);\n for (let i = 0; i < n; i++) {\n adjacent[i].forEach(([v, w], k) => {\n nb[off[i] + k] = v;\n wt[off[i] + k] = w;\n });\n }\n return {\n ids,\n first,\n count,\n per,\n links,\n chainOf,\n indexOf,\n seedX,\n seedY,\n backbone,\n off,\n nb,\n wt,\n n,\n link,\n };\n}\n// each point's connected component, and the points of each component\nfunction components(c) {\n const { n, off, nb } = c;\n const comp = new Int32Array(n).fill(-1);\n const members = [];\n for (let s = 0; s < n; s++) {\n if (comp[s] >= 0) {\n continue;\n }\n const queue = [s];\n comp[s] = members.length;\n for (const u of queue) {\n for (let e = off[u]; e < off[u + 1]; e++) {\n const v = nb[e];\n if (comp[v] < 0) {\n comp[v] = members.length;\n queue.push(v);\n }\n }\n }\n members.push(queue);\n }\n return { comp, members };\n}\nexport function stressLayout(request, opts = {}) {\n var _a, _b, _c;\n const c = chains(request);\n const { n, off, nb, wt, seedX, seedY, first, count, per, link } = c;\n const o = request.options;\n const quality = QUALITY[Math.max(0, Math.min(4, num((_a = opts.quality) !== null && _a !== void 0 ? _a : o.quality, 2)))];\n const gap = num((_b = opts.componentSeparation) !== null && _b !== void 0 ? _b : o.componentSeparation, 15);\n const rand = xorshift(num((_c = opts.seed) !== null && _c !== void 0 ? _c : o.seed, 1));\n const X = new Float64Array(n);\n const Y = new Float64Array(n);\n const nodePositions = {};\n if (n === 0) {\n return { nodePositions };\n }\n const { comp, members } = components(c);\n let dmin = Infinity;\n let total = 0;\n for (let e = 0; e < nb.length; e++) {\n dmin = Math.min(dmin, wt[e]);\n total += wt[e];\n }\n total /= 2;\n let anySeed = false;\n for (let i = 0; i < n; i++) {\n if (!Number.isNaN(seedX[i])) {\n anySeed = true;\n break;\n }\n }\n const placed = anySeed ? stressPlacement(c) : undefined;\n const side = Math.sqrt(n) * 20;\n for (let i = 0; i < n; i++) {\n if (placed && !Number.isNaN(placed.X[i])) {\n X[i] = placed.X[i];\n Y[i] = placed.Y[i];\n }\n else if (anySeed && !Number.isNaN(seedX[i])) {\n X[i] = seedX[i] + rand() - 0.5;\n Y[i] = seedY[i] + rand() - 0.5;\n }\n else {\n X[i] = rand() * side;\n Y[i] = rand() * side;\n }\n }\n // the points the schedule moves: those of components the placement did not\n // draw whole, in index order so the schedule runs as it would alone\n const drawn = members.map(points => placed !== undefined && points.every(i => !Number.isNaN(placed.X[i])));\n const loose = [];\n let looseSeeded = true;\n for (let i = 0; i < n; i++) {\n if (!drawn[comp[i]]) {\n loose.push(i);\n looseSeeded && (looseSeeded = !Number.isNaN(seedX[i]));\n }\n }\n const dmax = Math.max(total / 4, dmin * 10);\n const etaMax = dmax * dmax;\n const etaMin = EPS * dmin * dmin;\n const { walks, iterations } = quality;\n const lambda = Math.log(etaMax / etaMin) / Math.max(1, iterations - 1);\n const logMin = Math.log(dmin);\n const logMax = Math.log(dmax);\n const move = (i, j, d, eta) => {\n let mu = eta / (d * d);\n if (mu > 1) {\n mu = 1;\n }\n const dx = X[i] - X[j];\n const dy = Y[i] - Y[j];\n const mag = Math.sqrt(dx * dx + dy * dy) || 1e-9;\n const r = (mu * (mag - d)) / (2 * mag);\n const rx = r * dx;\n const ry = r * dy;\n X[i] = X[i] - rx;\n Y[i] = Y[i] - ry;\n X[j] = X[j] + rx;\n Y[j] = Y[j] + ry;\n };\n // The end of a walk of up to `length` from point i, with how far it got in\n // `walked`: a walk stops short at a free chain end.\n let walked = 0;\n const walk = (i, length) => {\n let chain = c.chainOf[i];\n let idx = c.indexOf[i];\n let dir = rand() < 0.5 ? -1 : 1;\n let remaining = length;\n for (let hops = 0; hops < MAX_HOPS; hops++) {\n const points = count[chain];\n const step = per[chain];\n const toEnd = (dir > 0 ? points - 1 - idx : idx) * step;\n if (remaining <= toEnd) {\n const steps = Math.round(remaining / step);\n walked = length - remaining + steps * step;\n return first[chain] + idx + dir * steps;\n }\n remaining -= toEnd;\n const out = c.links[chain][dir > 0 ? 1 : 0];\n if (out.length === 0) {\n walked = length - remaining;\n return first[chain] + (dir > 0 ? points - 1 : 0);\n }\n const [next, enterSide] = out[Math.floor(rand() * out.length)];\n remaining -= link;\n chain = next;\n dir = enterSide === 0 ? 1 : -1;\n idx = enterSide === 0 ? 0 : count[next] - 1;\n if (remaining <= 0) {\n walked = length - remaining;\n return first[chain] + idx;\n }\n }\n return -1;\n };\n const adjacentTerms = (i, eta) => {\n for (let e = off[i]; e < off[i + 1]; e++) {\n const j = nb[e];\n if (j > i) {\n move(i, j, wt[e], eta);\n }\n }\n };\n const order = Int32Array.from(loose);\n const warm = looseSeeded ? Math.floor(WARM * iterations) : 0;\n for (let t = loose.length ? warm : iterations; t < iterations; t++) {\n const eta = etaMax * Math.exp(-lambda * t);\n for (let k = order.length - 1; k > 0; k--) {\n const r = Math.floor(rand() * (k + 1));\n const tmp = order[k];\n order[k] = order[r];\n order[r] = tmp;\n }\n for (const i of order) {\n adjacentTerms(i, eta);\n for (let w = 0; w < walks; w++) {\n const length = Math.exp(logMin + rand() * (logMax - logMin));\n const j = walk(i, length);\n if (j >= 0 && j !== i && walked > 0) {\n move(i, j, walked, eta);\n }\n }\n }\n }\n // untangle: points closer than the radius and not joined push apart, then\n // a sweep over the links pulls each back towards its length\n const radius = UNTANGLE_LINKS * link;\n const key = (x, y) => (Math.floor(x / radius) * 73856093) ^ (Math.floor(y / radius) * 19349663);\n for (let u = 0; u < (loose.length ? UNTANGLE_PASSES : 0); u++) {\n const grid = new Map();\n for (const i of loose) {\n const k = key(X[i], Y[i]);\n const list = grid.get(k);\n if (list) {\n list.push(i);\n }\n else {\n grid.set(k, [i]);\n }\n }\n for (const i of loose) {\n const cx = Math.floor(X[i] / radius);\n const cy = Math.floor(Y[i] / radius);\n for (let gx = cx - 1; gx <= cx + 1; gx++) {\n for (let gy = cy - 1; gy <= cy + 1; gy++) {\n const list = grid.get((gx * 73856093) ^ (gy * 19349663));\n if (!list) {\n continue;\n }\n for (const j of list) {\n if (j <= i) {\n continue;\n }\n let joined = false;\n for (let e = off[i]; e < off[i + 1]; e++) {\n if (nb[e] === j) {\n joined = true;\n break;\n }\n }\n if (joined) {\n continue;\n }\n const dx = X[i] - X[j];\n const dy = Y[i] - Y[j];\n const mag = Math.sqrt(dx * dx + dy * dy);\n if (mag >= radius) {\n continue;\n }\n let rx;\n let ry;\n if (mag > 1e-6) {\n const r = (UNTANGLE_PUSH * (radius - mag)) / (2 * mag);\n rx = r * dx;\n ry = r * dy;\n }\n else {\n rx = UNTANGLE_PUSH * radius * (rand() - 0.5);\n ry = UNTANGLE_PUSH * radius * (rand() - 0.5);\n }\n X[i] = X[i] + rx;\n Y[i] = Y[i] + ry;\n X[j] = X[j] - rx;\n Y[j] = Y[j] - ry;\n }\n }\n }\n }\n for (const i of loose) {\n adjacentTerms(i, Infinity);\n }\n }\n // each chain's interior points smoothed, so a node reads as one curve, then\n // spaced evenly along it at its drawn length\n for (let k = 0; k < count.length; k++) {\n const a = first[k];\n const m = count[k];\n if (m < 3) {\n continue;\n }\n for (let s = 0; s < SMOOTH_PASSES; s++) {\n const xs = X.slice(a, a + m);\n const ys = Y.slice(a, a + m);\n for (let i = 1; i + 1 < m; i++) {\n X[a + i] = 0.5 * xs[i] + 0.25 * (xs[i - 1] + xs[i + 1]);\n Y[a + i] = 0.5 * ys[i] + 0.25 * (ys[i - 1] + ys[i + 1]);\n }\n }\n respace(X, Y, a, m, per[k]);\n }\n packComponents(comp, members, X, Y, anySeed, gap);\n for (let k = 0; k < c.ids.length; k++) {\n const points = [];\n for (let i = 0; i < count[k]; i++) {\n points.push({ x: X[first[k] + i], y: Y[first[k] + i] });\n }\n nodePositions[c.ids[k]] = points;\n }\n return { nodePositions };\n}\n// Points a to a+m-1 moved to equal spacing along their polyline. Smoothing\n// shortens a curve, so the interior first bulges out from the chord between\n// the ends until the length is back, and the points then take their full\n// spacing. The ends stay, since extending them along their tangents ran a\n// node past its anchors and through the links there.\nfunction respace(X, Y, a, m, per) {\n bulge(X, Y, a, m, per * (m - 1));\n const lengths = new Float64Array(m);\n for (let i = 1; i < m; i++) {\n lengths[i] =\n lengths[i - 1] +\n Math.hypot(X[a + i] - X[a + i - 1], Y[a + i] - Y[a + i - 1]);\n }\n if (!lengths[m - 1]) {\n return;\n }\n const total = lengths[m - 1];\n const xs = X.slice(a, a + m);\n const ys = Y.slice(a, a + m);\n let seg = 1;\n for (let i = 1; i + 1 < m; i++) {\n const s = (total * i) / (m - 1);\n while (seg < m - 1 && lengths[seg] < s) {\n seg++;\n }\n const span = lengths[seg] - lengths[seg - 1];\n const t = span > 0 ? (s - lengths[seg - 1]) / span : 0;\n X[a + i] = xs[seg - 1] + (xs[seg] - xs[seg - 1]) * t;\n Y[a + i] = ys[seg - 1] + (ys[seg] - ys[seg - 1]) * t;\n }\n}\n// Interior points a+1 to a+m-2 pushed out from the chord between the ends,\n// their offsets from it scaled by one factor, until the polyline is `target`\n// long. A chain lying along its chord has nothing to push and keeps its\n// length.\nfunction bulge(X, Y, a, m, target) {\n const b = a + m - 1;\n const cx = X[a];\n const cy = Y[a];\n const chord = Math.hypot(X[b] - cx, Y[b] - cy);\n const ux = chord > 1e-9 ? (X[b] - cx) / chord : 1;\n const uy = chord > 1e-9 ? (Y[b] - cy) / chord : 0;\n const along = new Float64Array(m);\n const off = new Float64Array(m);\n let flat = true;\n for (let i = 0; i < m; i++) {\n const dx = X[a + i] - cx;\n const dy = Y[a + i] - cy;\n along[i] = dx * ux + dy * uy;\n off[i] = dy * ux - dx * uy;\n flat && (flat = Math.abs(off[i]) < 1e-6);\n }\n const lengthAt = (f) => {\n let total = 0;\n for (let i = 1; i < m; i++) {\n total += Math.hypot(along[i] - along[i - 1], f * (off[i] - off[i - 1]));\n }\n return total;\n };\n if (flat || lengthAt(1) >= target) {\n return;\n }\n let lo = 1;\n let hi = 2;\n while (lengthAt(hi) < target && hi < 1e6) {\n lo = hi;\n hi *= 2;\n }\n for (let it = 0; it < 40; it++) {\n const mid = (lo + hi) / 2;\n if (lengthAt(mid) < target) {\n lo = mid;\n }\n else {\n hi = mid;\n }\n }\n const f = (lo + hi) / 2;\n for (let i = 1; i + 1 < m; i++) {\n X[a + i] = cx + along[i] * ux - f * off[i] * uy;\n Y[a + i] = cy + along[i] * uy + f * off[i] * ux;\n }\n}\n// Components stacked top to bottom, left aligned, `gap` apart. A component\n// with no seeds is turned so its long axis runs along x; a seeded one keeps\n// the frame its seeds stated.\nfunction packComponents(comp, members, X, Y, anySeed, gap) {\n if (!anySeed) {\n for (const points of members) {\n rotateToPrincipalAxis(X, Y, points);\n }\n }\n if (members.length < 2) {\n return;\n }\n const minX = new Float64Array(members.length).fill(Infinity);\n const minY = new Float64Array(members.length).fill(Infinity);\n const maxY = new Float64Array(members.length).fill(-Infinity);\n for (let i = 0; i < X.length; i++) {\n const k = comp[i];\n minX[k] = Math.min(minX[k], X[i]);\n minY[k] = Math.min(minY[k], Y[i]);\n maxY[k] = Math.max(maxY[k], Y[i]);\n }\n const shift = new Float64Array(members.length);\n let y = 0;\n for (let k = 0; k < members.length; k++) {\n shift[k] = y - minY[k];\n y += maxY[k] - minY[k] + gap;\n }\n for (let i = 0; i < X.length; i++) {\n const k = comp[i];\n X[i] = X[i] - minX[k];\n Y[i] = Y[i] + shift[k];\n }\n}\nfunction rotateToPrincipalAxis(X, Y, points) {\n if (points.length < 3) {\n return;\n }\n let cx = 0;\n let cy = 0;\n for (const i of points) {\n cx += X[i];\n cy += Y[i];\n }\n cx /= points.length;\n cy /= points.length;\n let sxx = 0;\n let syy = 0;\n let sxy = 0;\n for (const i of points) {\n const dx = X[i] - cx;\n const dy = Y[i] - cy;\n sxx += dx * dx;\n syy += dy * dy;\n sxy += dx * dy;\n }\n const angle = -0.5 * Math.atan2(2 * sxy, sxx - syy);\n const cos = Math.cos(angle);\n const sin = Math.sin(angle);\n for (const i of points) {\n const dx = X[i] - cx;\n const dy = Y[i] - cy;\n X[i] = cx + cos * dx - sin * dy;\n Y[i] = cy + sin * dx + cos * dy;\n }\n}\n", "// src/layoutEngines.ts\nimport { fmmmLayout } from \"@jbrowse/graph-fmmm-layout\";\nimport { stressLayout } from \"@jbrowse/graph-stress-layout\";\nvar LAYOUT_ENGINES = [\n {\n value: \"fmmm\",\n label: \"Bandage (FMMM)\",\n description: \"Bandage's force-directed layout: OGDF's fast multipole multilevel method, compiled to wasm.\"\n },\n {\n value: \"stress\",\n label: \"Stress\",\n description: \"Plain JS: the reference drawn straight and each variant placed against it, an allele as a lens, a repeat loop as a ring, a deletion as an arch; stress by stochastic gradient descent for components with no reference.\"\n }\n];\nvar LAYOUT_ENGINE_VALUES = LAYOUT_ENGINES.map((e) => e.value);\nfunction isLayoutEngineKind(value) {\n return LAYOUT_ENGINE_VALUES.includes(value);\n}\nvar layoutEngine = async (request) => {\n const start = performance.now();\n const result = request.options.engine === \"stress\" ? stressLayout(request) : await fmmmLayout(request);\n return { result, duration: performance.now() - start };\n};\n\nexport {\n LAYOUT_ENGINES,\n LAYOUT_ENGINE_VALUES,\n isLayoutEngineKind,\n layoutEngine\n};\n", "// src/layout/drawnScale.ts\nvar MEAN_NODE_LENGTH = 40;\nvar MIN_TOTAL_GRAPH_LENGTH = 500;\nvar BANDAGE_MINIMUM_NODE_LENGTH = 5;\nfunction drawnNodeLength(opts, length) {\n return Math.max(\n opts.nodeLengthPerMegabase * length / 1e6,\n opts.minimumNodeLength\n );\n}\nfunction bandageAutoScale(graph, minNodeLength = BANDAGE_MINIMUM_NODE_LENGTH) {\n const totalLength = graph.nodes.reduce((sum, n) => sum + n.length, 0);\n const megabases = totalLength / 1e6;\n const target = Math.max(\n graph.nodes.length * MEAN_NODE_LENGTH,\n MIN_TOTAL_GRAPH_LENGTH\n );\n return {\n nodeLengthPerMegabase: megabases > 0 ? target / megabases : 1e4,\n minimumNodeLength: Math.max(BANDAGE_MINIMUM_NODE_LENGTH, minNodeLength),\n edgeLength: 5,\n nodeSegmentLength: 20\n };\n}\nvar PROPORTIONAL_LENGTH = { power: 1, effect: 1 };\nfunction isProportional(law) {\n return law.power === 1 && law.effect === 1;\n}\nfunction drawnLengthFor(graph, law) {\n const count = graph.nodes.length;\n const totalLength = graph.nodes.reduce((sum, n) => sum + n.length, 0);\n const meanBp = count > 0 ? totalLength / count : 0;\n const meanDrawn = count > 0 ? Math.max(count * MEAN_NODE_LENGTH, MIN_TOTAL_GRAPH_LENGTH) / count : MEAN_NODE_LENGTH;\n return (bp) => {\n if (meanBp <= 0) {\n return meanDrawn;\n }\n const relative = (bp / meanBp) ** law.power;\n return Math.max(\n meanDrawn * ((relative - 1) * law.effect + 1),\n BANDAGE_MINIMUM_NODE_LENGTH\n );\n };\n}\nvar LAYOUT_LENGTH_PRECISION = 1e3;\nvar PROPORTIONAL_SPREAD = {\n law: PROPORTIONAL_LENGTH,\n minNodeLength: 0\n};\nfunction layoutScaling(graph, spread = PROPORTIONAL_SPREAD) {\n const { law, minNodeLength } = spread;\n const opts = bandageAutoScale(graph, minNodeLength);\n if (isProportional(law)) {\n return { nodes: graph.nodes, opts };\n }\n const drawn = drawnLengthFor(graph, law);\n return {\n nodes: graph.nodes.map((node) => ({\n ...node,\n length: Math.round(drawn(node.length) * LAYOUT_LENGTH_PRECISION)\n })),\n opts: {\n ...opts,\n nodeLengthPerMegabase: 1e6 / LAYOUT_LENGTH_PRECISION,\n // Bandage's own floor only. A law and a raised floor are alternatives\n // rather than a stack: the law has already lifted the small end, and a\n // floor on top of it would flatten exactly what it just spread.\n minimumNodeLength: BANDAGE_MINIMUM_NODE_LENGTH\n }\n };\n}\nfunction drawnLengthOf(graph, spread = PROPORTIONAL_SPREAD) {\n if (isProportional(spread.law)) {\n const opts = bandageAutoScale(graph, spread.minNodeLength);\n return (bp) => drawnNodeLength(opts, bp);\n }\n return drawnLengthFor(graph, spread.law);\n}\n\nexport {\n MEAN_NODE_LENGTH,\n drawnNodeLength,\n bandageAutoScale,\n PROPORTIONAL_LENGTH,\n drawnLengthFor,\n layoutScaling,\n drawnLengthOf\n};\n", "import {\n MEAN_NODE_LENGTH,\n PROPORTIONAL_LENGTH\n} from \"./chunk-34BOZKIE.js\";\n\n// src/bubbleSpreads.ts\nvar BUBBLE_SPREADS = [\n {\n value: \"auto\",\n label: \"Proportional\",\n description: \"Bandage's own scale: a node draws proportional to its length, so a 1 bp allele is a speck.\",\n law: PROPORTIONAL_LENGTH,\n minNodeFactor: 0\n },\n {\n value: \"open\",\n label: \"Open bubbles\",\n description: \"Give every allele a drawn length, so a bubble reads as two arms rather than a knot.\",\n law: PROPORTIONAL_LENGTH,\n minNodeFactor: 2.5\n },\n {\n value: \"wide\",\n label: \"Wide bubbles\",\n description: \"As open, spread further. Best on a window of a dozen bubbles.\",\n law: PROPORTIONAL_LENGTH,\n minNodeFactor: 10\n },\n {\n value: \"compress\",\n label: \"Compress lengths\",\n description: \"Pull the longest and shortest nodes towards the graph\\u2019s mean, so a cut spanning kb and bp fits one pane.\",\n law: { power: 0.5, effect: 0.5 },\n minNodeFactor: 0\n }\n];\nvar BUBBLE_SPREAD_VALUES = BUBBLE_SPREADS.map((s) => s.value);\nfunction spreadFor(spread) {\n const entry = BUBBLE_SPREADS.find((s) => s.value === spread);\n return {\n law: entry?.law ?? PROPORTIONAL_LENGTH,\n minNodeLength: (entry?.minNodeFactor ?? 0) * MEAN_NODE_LENGTH\n };\n}\n\nexport {\n BUBBLE_SPREADS,\n BUBBLE_SPREAD_VALUES,\n spreadFor\n};\n"],
5
5
  "mappings": "AAAA,IAAIA,GACG,SAASC,IAAW,CACvB,OAAAD,KAAiDA,GAAS,OAAO,8BAAqB,EACjF,KAAKE,GAAOA,EAAI,QAAQ,CAAC,EACzB,MAAOC,GAAM,CACd,MAAAH,GAAS,OACHG,CACV,CAAC,GACMH,EACX,CCRA,eAAsBI,GAAWC,EAAS,CAEtC,OADe,MAAMC,GAAS,GAChB,cAAcD,EAAQ,MAAOA,EAAQ,OAAO,CAC9D,CCFO,IAAME,GAAW,cAkBxB,IAAMC,GAAa,GAAK,KAAK,GAAM,IAE7BC,GAAM,IACNC,GAAU,IAEVC,GAAiB,CAAC,EAAG,KAAO,IAAM,IAAM,GAAK,MAAO,KAAM,KAAM,GAAG,EACnEC,GAAQ,CAAC,EAAG,CAAC,EACnB,SAASC,GAAMC,EAAM,CACjB,OAAOA,EAAO,EAAI,CACtB,CACA,SAASC,GAAKC,EAAGC,EAAG,CAChB,IAAMC,EAAKD,EAAE,EAAID,EAAE,EACbG,EAAKF,EAAE,EAAID,EAAE,EACbI,EAAI,KAAK,MAAMF,EAAIC,CAAE,GAAK,EAChC,MAAO,CAAE,EAAGD,EAAKE,EAAG,EAAGD,EAAKC,CAAE,CAClC,CACA,SAASC,GAAKL,EAAGC,EAAGK,EAAG,CACnB,MAAO,CAAE,EAAGN,EAAE,GAAKC,EAAE,EAAID,EAAE,GAAKM,EAAG,EAAGN,EAAE,GAAKC,EAAE,EAAID,EAAE,GAAKM,CAAE,CAChE,CACA,SAASC,GAAWC,EAAK,CACrB,IAAIC,EAAI,EACJC,EAAI,EACR,QAAWC,KAAKH,EACZC,GAAKE,EAAE,EACPD,GAAKC,EAAE,EAEX,MAAO,CAAE,EAAGF,EAAID,EAAI,OAAQ,EAAGE,EAAIF,EAAI,MAAO,CAClD,CACA,SAASI,GAAWJ,EAAK,CACrB,IAAMK,EAAM,IAAI,aAAaL,EAAI,MAAM,EACvC,QAASM,EAAI,EAAGA,EAAIN,EAAI,OAAQM,IAC5BD,EAAIC,CAAC,EACDD,EAAIC,EAAI,CAAC,EACL,KAAK,MAAMN,EAAIM,CAAC,EAAE,EAAIN,EAAIM,EAAI,CAAC,EAAE,EAAGN,EAAIM,CAAC,EAAE,EAAIN,EAAIM,EAAI,CAAC,EAAE,CAAC,EAEvE,OAAOD,CACX,CACA,SAASE,GAAeP,EAAK,CACzB,IAAIQ,EACJ,OAAQA,EAAKJ,GAAWJ,CAAG,EAAEA,EAAI,OAAS,CAAC,KAAO,MAAQQ,IAAO,OAASA,EAAK,CACnF,CAGA,IAAMC,GAAY,IAAI,IACtB,SAASC,GAASC,EAAO,CACrB,IAAMC,EAAQH,GAAU,IAAIE,CAAK,EACjC,GAAIC,IAAU,OACV,OAAOA,EAEX,IAAMC,EAAQC,GAAcH,CAAK,EACjC,OAAIF,GAAU,KAAO,KACjBA,GAAU,MAAM,EAEpBA,GAAU,IAAIE,EAAOE,CAAK,EACnBA,CACX,CACA,SAASC,GAAcH,EAAO,CAC1B,IAAII,EAAK,KACLC,EAAK,EAAI,KAAK,GAAK,KACvB,QAASV,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,IAAMW,GAAOF,EAAKC,GAAM,EACpBC,GAAO,EAAI,KAAK,IAAIA,EAAM,CAAC,GAAKN,EAChCI,EAAKE,EAGLD,EAAKC,CAEb,CACA,OAAQF,EAAKC,GAAM,CACvB,CAEA,SAASE,GAAWC,EAAGC,EAAG,CACtB,GAAID,EAAI,KACJ,OAAO,KAAK,GAAKC,EAErB,IAAMC,GAAMF,EAAIA,EAAK,EAAIC,EAAIA,IAAM,EAAIA,GACjCE,EAAQ,EAAI,KAAK,KAAK,KAAK,IAAI,EAAGH,GAAK,EAAIE,EAAE,CAAC,EACpD,OAAOA,GAAKD,EAAIC,EAAI,EAAI,KAAK,GAAKC,EAAQA,EAC9C,CAGA,SAASC,GAAQJ,EAAGK,EAAQC,EAAGC,EAAM,CACjC,IAAMrB,EAAMmB,EAAS,EAAIC,EACnBH,EAAQH,EAAI,KAAO,EAAI,KAAK,GAAKT,GAASL,EAAMc,CAAC,EACjDE,EAAIhB,EAAMiB,EACVK,EAAM,KAAK,IAAIL,EAAQ,CAAC,EACxBM,EAAKT,EAAI,EACTU,EAAKH,EAAOD,EAAIJ,EAAIM,EAC1B,MAAO,CACH,GAAIG,GAAK,CACL,GAAIA,GAAKL,EACL,MAAO,CAAE,EAAG,EAAG,EAAGC,EAAOI,CAAE,EAE/B,GAAIA,GAAKN,EAASC,EACd,MAAO,CAAE,EAAGN,EAAG,EAAGO,EAAOF,EAASM,CAAE,EAExC,IAAMtC,GAAKsC,EAAIL,GAAKJ,EAAIC,EAAQ,EAChC,MAAO,CAAE,EAAGM,EAAKP,EAAI,KAAK,IAAI7B,CAAC,EAAG,EAAGqC,EAAKR,EAAI,KAAK,IAAI7B,CAAC,CAAE,CAC9D,EACA,KAAMkC,EAAOD,EAAIJ,GAAK,EAAIM,GAC1B,OAAAH,CACJ,CACJ,CAKA,SAASO,GAAOC,EAAMb,EAAGN,EAAO,CAC5B,GAAI,CAACA,EACD,OAAOmB,EAEX,IAAML,EAAM,KAAK,IAAId,CAAK,EACpBoB,EAAM,KAAK,IAAIpB,CAAK,EAC1B,MAAO,CACH,GAAGmB,EACH,GAAIF,GAAK,CACL,GAAM,CAAE,EAAAI,EAAG,EAAAC,CAAE,EAAIH,EAAK,GAAGF,CAAC,EACpBM,EAAKF,EAAIf,EAAI,EACnB,MAAO,CAAE,EAAGA,EAAI,EAAIiB,EAAKT,EAAMQ,EAAIF,EAAK,EAAGG,EAAKH,EAAME,EAAIR,CAAI,CAClE,CACJ,CACJ,CAGA,SAASU,GAAYL,EAAM,CACvB,QAAS1B,EAAI,EAAGA,GAAK,GAAIA,IACrB,GAAI0B,EAAK,GAAIA,EAAK,OAAS1B,EAAK,EAAE,EAAE,EAAI,MACpC,MAAO,GAGf,MAAO,EACX,CACA,SAASgC,GAASC,EAAIC,EAAIJ,EAAIK,EAAIjB,EAAQ,CACtC,MAAO,CACH,GAAIM,IAAM,CAAE,EAAGS,EAAKH,EAAKN,EAAG,EAAGU,EAAKC,EAAKX,CAAE,GAC3C,KAAMU,EAAK,KAAK,IAAI,EAAGC,CAAE,EAAIjB,EAC7B,OAAAA,CACJ,CACJ,CAEA,IAAMkB,GAAN,KAAY,CACR,YAAY1C,EAAK2C,EAASC,EAAW,GAAO,CACxC,IAAIpC,EACJ,KAAK,IAAMR,EACX,KAAK,QAAU2C,EACf,KAAK,SAAWC,EAChB,KAAK,IAAMxC,GAAWJ,CAAG,EACzB,KAAK,OAASQ,EAAK,KAAK,IAAIR,EAAI,OAAS,CAAC,KAAO,MAAQQ,IAAO,OAASA,EAAK,CAClF,CACA,QAAQ,EAAG,CACP,GAAM,CAAE,IAAAH,CAAI,EAAI,KACZU,EAAK,EACLC,EAAKX,EAAI,OAAS,EACtB,KAAOU,EAAKC,GAAI,CACZ,IAAMC,EAAOF,EAAKC,GAAO,EACrBX,EAAIY,CAAG,EAAI,EACXF,EAAKE,EAAM,EAGXD,EAAKC,CAEb,CACA,OAAOF,CACX,CACA,SAAST,EAAGwB,EAAG,CACX,IAAMe,EAAO,KAAK,IAAIvC,CAAC,EAAI,KAAK,IAAIA,EAAI,CAAC,EACzC,OAAOuC,EAAO,GAAKf,EAAI,KAAK,IAAIxB,EAAI,CAAC,GAAKuC,EAAO,CACrD,CACA,QAAQ,EAAG,CACP,GAAM,CAAE,IAAA7C,CAAI,EAAI,KACV8C,EAAO9C,EAAI,OAAS,EAC1B,GAAI8C,IAAS,EACT,MAAO,CAAE,GAAG9C,EAAI,CAAC,CAAE,EAEvB,GAAI,GAAK,EAAG,CACR,IAAM+C,EAAIxD,GAAKS,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,EAC7B,MAAO,CAAE,EAAGA,EAAI,CAAC,EAAE,EAAI+C,EAAE,EAAI,EAAG,EAAG/C,EAAI,CAAC,EAAE,EAAI+C,EAAE,EAAI,CAAE,CAC1D,CACA,GAAI,GAAK,KAAK,MAAO,CACjB,IAAMA,EAAIxD,GAAKS,EAAI8C,EAAO,CAAC,EAAG9C,EAAI8C,CAAI,CAAC,EACjC,EAAI,EAAI,KAAK,MACnB,MAAO,CAAE,EAAG9C,EAAI8C,CAAI,EAAE,EAAIC,EAAE,EAAI,EAAG,EAAG/C,EAAI8C,CAAI,EAAE,EAAIC,EAAE,EAAI,CAAE,CAChE,CACA,IAAMzC,EAAI,KAAK,QAAQ,CAAC,EACxB,OAAOT,GAAKG,EAAIM,EAAI,CAAC,EAAGN,EAAIM,CAAC,EAAG,KAAK,SAASA,EAAG,CAAC,CAAC,CACvD,CACA,SAAS,EAAG,CACR,GAAM,CAAE,QAAAqC,CAAQ,EAAI,KACpB,GAAIA,EAAQ,SAAW,GAAK,GAAK,EAC7B,OAAOA,EAAQ,CAAC,EAEpB,GAAI,GAAK,KAAK,MACV,OAAOA,EAAQA,EAAQ,OAAS,CAAC,EAErC,IAAMrC,EAAI,KAAK,QAAQ,CAAC,EAClB,CAAE,EAAAL,EAAG,EAAAC,CAAE,EAAIL,GAAK8C,EAAQrC,EAAI,CAAC,EAAGqC,EAAQrC,CAAC,EAAG,KAAK,SAASA,EAAG,CAAC,CAAC,EAC/DV,EAAI,KAAK,MAAMK,EAAGC,CAAC,GAAK,EAC9B,MAAO,CAAE,EAAGD,EAAIL,EAAG,EAAGM,EAAIN,CAAE,CAChC,CACJ,EAGA,SAASoD,GAAehD,EAAKiD,EAAQ,CACjC,IAAMC,EAAWnD,GAAWC,CAAG,EAC/B,OAAOA,EAAI,IAAI,CAACG,EAAGG,IAAM,CACrB,IAAMwB,EAAIvC,GAAKS,EAAI,KAAK,IAAI,EAAGM,EAAI,CAAC,CAAC,EAAGN,EAAI,KAAK,IAAIA,EAAI,OAAS,EAAGM,EAAI,CAAC,CAAC,CAAC,EACtE6C,EAAI,CAAE,EAAG,CAACrB,EAAE,EAAG,EAAGA,EAAE,CAAE,EACtBsB,EAAKjD,EAAE,EAAI+C,EAAS,EACpBG,EAAKlD,EAAE,EAAI+C,EAAS,EACpBI,EAAK,KAAK,MAAMF,EAAIC,CAAE,EACtBE,EAAMJ,EAAE,EAAIC,EAAKD,EAAE,EAAIE,EACvBG,EAAMP,EAAO3C,CAAC,EACdmD,EAAOH,EAAK,MAAQ,KAAK,IAAIC,CAAG,EAAI,GAAMD,EAC1C,KAAK,KAAKC,CAAG,EACb,KAAK,KAAKJ,EAAE,EAAIK,EAAI,EAAIL,EAAE,EAAIK,EAAI,CAAC,GAAK,EAC9C,MAAO,CAAE,EAAGL,EAAE,EAAIM,EAAM,EAAGN,EAAE,EAAIM,CAAK,CAC1C,CAAC,CACL,CAGA,SAASC,GAAQC,EAAOC,EAAIH,EAAMzB,EAAM6B,EAAM,CAC1C,IAAMC,EAAK,KAAK,IAAID,EAAM,KAAK,IAAI7B,EAAK,OAAS,GAAI,EAAG,CAAC,EACnDhC,EAAM,CAAC,EACP+D,EAAO,CAAC,EACd,QAASjC,EAAI,EAAGA,GAAKE,EAAK,OAAS,KAAMF,GAAKgC,EAAI,CAC9C,GAAM,CAAE,EAAA5B,EAAG,EAAAC,CAAE,EAAIH,EAAK,GAAG,KAAK,IAAIF,EAAGE,EAAK,MAAM,CAAC,EAC3CgC,EAAIL,EAAM,QAAQC,EAAK1B,CAAC,EACxB+B,EAAKN,EAAM,SAASC,EAAK1B,CAAC,EAC1BgC,EAAKD,EAAG,EAAIR,EACZU,EAAKF,EAAG,EAAIR,EAClBzD,EAAI,KAAK,CAAE,EAAGgE,EAAE,EAAIE,EAAK/B,EAAG,EAAG6B,EAAE,EAAIG,EAAKhC,CAAE,CAAC,EAC7C4B,EAAK,KAAK,CAAE,EAAGG,EAAI,EAAGC,CAAG,CAAC,CAC9B,CACA,MAAO,CAAE,IAAAnE,EAAK,KAAA+D,CAAK,CACvB,CACA,IAAMK,GAAY,EACZC,GAAc,KAAQ,EAG5B,SAASC,GAAOX,EAAOC,EAAIH,EAAMc,EAAM/C,EAAQqC,EAAM,CACjD,IAAIW,EAAahD,EACbiD,EAASf,GAAQC,EAAOC,EAAIH,EAAMc,EAAKC,CAAU,EAAGX,CAAI,EAC5D,GAAIF,EAAM,SACN,OAAOc,EAEX,QAASnE,EAAI,EAAGA,EAAI,EAAGA,IAAK,CACxB,IAAMoE,EAAMnE,GAAekE,EAAO,GAAG,EACrC,GAAI,EAAEC,EAAM,IAAM,KAAK,IAAIA,EAAMlD,EAAS,CAAC,EAAI,KAC3C,MAEJgD,GAAchD,EAASkD,EACvBD,EAASf,GAAQC,EAAOC,EAAIH,EAAMc,EAAKC,CAAU,EAAGX,CAAI,CAC5D,CACA,OAAOY,CACX,CACA,SAASE,GAAOC,EAAMzB,EAAG,CACrB,OAAO,MAAM,KAAK,CAAE,OAAQA,CAAE,EAAG,CAAC0B,EAAGvE,IAAMsE,EAAQtE,EAAI,GAAY,CAAC,CACxE,CACA,SAASwE,GAAOC,EAAS,CACrB,GAAIA,EAAQ,SAAW,EACnB,MAAO,KAEX,IAAIhE,EAAK,IACLC,EAAK,KACT,QAAWxB,KAAKuF,EACZhE,EAAK,KAAK,IAAIA,EAAIvB,EAAE,MAAM,CAAC,EAC3BwB,EAAK,KAAK,IAAIA,EAAIxB,EAAE,MAAM,CAAC,EAE/B,OAAOwB,EAAKD,CAChB,CACA,SAASiE,GAAQC,EAAIC,EAAI,CACrB,OAAQD,EAAK,SAAaC,EAAK,QACnC,CACA,IAAMC,GAAN,KAAa,CACT,YAAYhE,EAAG,CACX,KAAK,EAAIA,EACT,KAAK,KAAO,IAAI,IAChB,GAAM,CAAE,IAAAiE,EAAK,MAAAC,EAAO,MAAAC,EAAO,IAAAC,EAAK,MAAAC,EAAO,MAAAC,EAAO,SAAAC,CAAS,EAAIvE,EACrDwE,EAAIP,EAAI,OACd,KAAK,OAAS,MAAM,KAAK,CAAE,OAAQO,CAAE,EAAG,IAAG,EAAY,EACvD,KAAK,OAAS,MAAM,KAAK,CAAE,OAAQA,CAAE,EAAG,IAAG,EAAY,EACvD,KAAK,OAAS,MAAM,KAAK,CAAE,OAAQA,CAAE,EAAG,IAAG,EAAY,EACvD,KAAK,MAAQxE,EAAE,MAAM,IAAI,CAACyE,EAAOC,IAAMD,EAAM,IAAIE,GAAOA,EAAI,OAAO,CAAC,CAAC3D,CAAC,IAAMA,IAAM0D,CAAC,CAAC,CAAC,EACrF,KAAK,MAAQT,EAAI,IAAIW,GAAMA,EAAG,WAAWC,EAAQ,CAAC,EAClD,IAAIC,EAAM,IACNC,EAAM,KACV,QAASL,EAAI,EAAGA,EAAIF,EAAGE,IAAK,CACxB,IAAMM,EAAQd,EAAMQ,CAAC,EACjB,CAACH,EAASS,CAAK,GAAK,OAAO,MAAMX,EAAMW,CAAK,CAAC,IAGjDF,EAAM,KAAK,IAAIA,EAAKT,EAAMW,CAAK,CAAC,EAChCD,EAAM,KAAK,IAAIA,EAAKV,EAAMW,CAAK,EAAIZ,EAAIM,CAAC,GAAKP,EAAMO,CAAC,EAAI,EAAE,EAC9D,CACA,KAAK,SAAW,IAAInD,GAAM,CACtB,CAAE,EAAGuD,EAAK,EAAG,CAAE,EACf,CAAE,EAAGC,EAAK,EAAG,CAAE,CACnB,EAAG,CACC,CAAE,EAAG,EAAG,EAAG,CAAE,EACb,CAAE,EAAG,EAAG,EAAG,CAAE,CACjB,EAAG,EAAI,EACP,KAAK,iBAAmB,CAAE,GAAID,EAAMC,GAAO,EAAG,EAAG,CAAE,EACnD,QAASL,EAAI,EAAGA,EAAIF,EAAGE,IAAK,CACxB,IAAMM,EAAQd,EAAMQ,CAAC,EACrB,GAAI,CAACH,EAASS,CAAK,GAAK,OAAO,MAAMX,EAAMW,CAAK,CAAC,EAC7C,SAEJ,IAAMnG,EAAM,CAAC,EACPoG,EAAK,CAAC,EACZ,QAAS9F,EAAI,EAAGA,EAAIgF,EAAMO,CAAC,EAAGvF,IAAK,CAC/B,IAAML,EAAIuF,EAAMW,CAAK,EAAI7F,EAAIiF,EAAIM,CAAC,EAClC7F,EAAI,KAAK,CAAE,EAAAC,EAAG,EAAGwF,EAAMU,CAAK,CAAE,CAAC,EAC/BC,EAAG,KAAKnG,EAAIgG,CAAG,CACnB,CACA,KAAK,OAAOJ,CAAC,EAAI7F,EACjB,KAAK,OAAO6F,CAAC,EAAIO,EACjB,KAAK,OAAOP,CAAC,EAAI,KAAK,SACtB,KAAK,OAAO7F,EAAK,KAAK,QAAQ,CAClC,CACJ,CACA,OAAO,YAAYmB,EAAG,CAClB,QAAS0E,EAAI,EAAGA,EAAI1E,EAAE,IAAI,OAAQ0E,IAAK,CACnC,IAAMM,EAAQhF,EAAE,MAAM0E,CAAC,EACvB,GAAI1E,EAAE,SAASgF,CAAK,GAAK,CAAC,OAAO,MAAMhF,EAAE,MAAMgF,CAAK,CAAC,EACjD,MAAO,EAEf,CACA,MAAO,EACX,CACA,KAAM,CACF,IAAME,EAAO,CAAC,EACd,QAASR,EAAI,EAAGA,EAAI,KAAK,OAAO,OAAQA,IAC/B,KAAK,OAAOA,CAAC,GACdQ,EAAK,KAAKR,CAAC,EAWnB,IAAMS,EAAS,KAAK,aAAaD,CAAI,EAChC,IAAIE,IAAY,CAAE,QAAAA,EAAS,QAAS,KAAK,UAAUA,CAAO,CAAE,EAAE,EAC9D,OAAOpG,GAAKA,EAAE,QAAQ,MAAM,EAC5B,IAAIA,IAAM,CACX,QAASA,EAAE,QACX,KAAM2E,GAAO3E,EAAE,OAAO,EACtB,MAAOA,EAAE,QAAQ,OAAO,CAAC,EAAG0F,IAAM,EAAI,KAAK,MAAMA,CAAC,EAAG,CAAC,EACtD,KAAM1F,EAAE,QACH,IAAIX,GAAK,GAAGA,EAAE,MAAM,CAAC,IAAIA,EAAE,MAAM,CAAC,EAAE,EACpC,KAAK,EACL,KAAK,GAAG,CACjB,EAAE,EACG,KAAK,CAACA,EAAGC,IAAMD,EAAE,KAAOC,EAAE,OAC1BD,EAAE,OAASC,EAAE,KAAOA,EAAE,MAAQD,EAAE,MAAQA,EAAE,MAAQC,EAAE,MAAM,EAC/D,QAAWU,KAAKmG,EACZ,KAAK,WAAWnG,EAAE,QAAS,KAAK,gBAAgB,CAExD,CACA,MAAMqG,EAAGC,EAAG,CACR,GAAM,CAAE,MAAApB,CAAM,EAAI,KAAK,EACvB,KAAK,OAAO,QAAQ,CAACrF,EAAK6F,IAAM,CACc7F,GAAI,QAAQ,CAACG,EAAGG,IAAM,CAC5DkG,EAAEnB,EAAMQ,CAAC,EAAIvF,CAAC,EAAIH,EAAE,EACpBsG,EAAEpB,EAAMQ,CAAC,EAAIvF,CAAC,EAAIH,EAAE,CACxB,CAAC,CACL,CAAC,CACL,CACA,MAAM0F,EAAG,CACL,OAAO,KAAK,EAAE,IAAIA,CAAC,GAAK,KAAK,EAAE,MAAMA,CAAC,EAAI,EAC9C,CACA,SAASA,EAAGvG,EAAM,CACd,OAAOA,EAAO,KAAK,EAAE,MAAMuG,CAAC,EAAI,EAAI,CACxC,CACA,OAAO7F,EAAK0G,EAAO,CACf,QAAWvG,KAAKH,EAAK,CACjB,IAAM2G,EAAM3B,GAAQ,KAAK,MAAM7E,EAAE,EAAI,IAAK,EAAG,KAAK,MAAMA,EAAE,EAAI,IAAK,CAAC,EAC9DyG,EAAO,KAAK,KAAK,IAAID,CAAG,EACxBE,EAAW,CAAE,EAAG1G,EAAE,EAAG,EAAGA,EAAE,EAAG,MAAAuG,CAAM,EACrCE,EACAA,EAAK,KAAKC,CAAQ,EAGlB,KAAK,KAAK,IAAIF,EAAK,CAACE,CAAQ,CAAC,CAErC,CACJ,CAKA,WAAW7G,EAAK8G,EAAQC,EAAWC,EAAO,CACtC,IAAIxG,EACJ,IAAI2C,EAAI,EACR,QAAWhD,KAAKH,EAAK,CACjB,GAAI+G,EAAU,KAAK,GAAK,KAAK,MAAM5G,EAAE,EAAI,EAAE,EAAGA,EAAE,EAAI,EAAE,CAAC,EAAI,EAAQ,EAC/D,SAEJ,IAAM8G,EAAK,KAAK,MAAM9G,EAAE,EAAI,IAAK,EAC3B+G,EAAK,KAAK,MAAM/G,EAAE,EAAI,IAAK,EACjC,QAAS8E,EAAKgC,EAAK,EAAGhC,GAAMgC,EAAK,EAAGhC,IAChC,QAASC,EAAKgC,EAAK,EAAGhC,GAAMgC,EAAK,EAAGhC,IAChC,QAAWlB,KAAMxD,EAAK,KAAK,KAAK,IAAIwE,GAAQC,EAAIC,CAAE,CAAC,KAAO,MAAQ1E,IAAO,OAASA,EAAK,CAAC,EACpF,GAAIwD,EAAE,QAAU8C,GACZ,KAAK,MAAM3G,EAAE,EAAI6D,EAAE,EAAG7D,EAAE,EAAI6D,EAAE,CAAC,EAAI,OACnCb,IACIA,GAAK6D,GACL,OAAO7D,CAM/B,CACA,OAAOA,CACX,CAKA,OAAOgE,EAAYL,EAAQC,EAAW,CAClC,IAAIK,EACAC,EAAQ,IACZ,QAAWC,KAAaH,EAAY,CAChC,IAAMhF,EAAI,KAAK,WAAWmF,EAAUjD,EAAW,EAAE,IAAKyC,EAAQC,EAAWM,CAAK,EAC9E,GAAIlF,IAAM,EACN,OAAOmF,EAAUlD,EAAS,EAE1BjC,EAAIkF,IACJA,EAAQlF,EACRiF,EAAOE,EAEf,CACA,OAAOF,EAAKhD,EAAS,CACzB,CACA,UAAUmC,EAAS,CACf,IAAMgB,EAAM,IAAI,IAAIhB,CAAO,EACrBT,EAAM,CAAC,EACb,QAAW5D,KAAKqE,EACZ,QAAWiB,KAASpI,GAChB,OAAW,CAAC+C,EAAGsF,CAAK,IAAK,KAAK,MAAMvF,CAAC,EAAEsF,CAAK,EAAG,CAC3C,IAAMxH,EAAM,KAAK,OAAOmC,CAAC,EACzB,GAAIoF,EAAI,IAAIpF,CAAC,GAAK,CAACnC,EACf,SAEJ,IAAMM,EAAI,KAAK,SAAS6B,EAAGsF,CAAK,EAChC3B,EAAI,KAAK,CACL,EAAA5D,EACA,MAAAsF,EACA,EAAArF,EACA,MAAAsF,EACA,MAAOzH,EAAIM,CAAC,EACZ,MAAO,KAAK,OAAO6B,CAAC,EACpB,EAAG,KAAK,OAAOA,CAAC,EAAE7B,CAAC,CACvB,CAAC,CACL,CAGR,OAAOwF,CACX,CACA,aAAaS,EAAS,CAClB,IAAMgB,EAAM,IAAI,IAAIhB,CAAO,EACrBmB,EAAO,IAAI,IACXC,EAAQ,CAAC,EACf,QAAWvG,KAAKmF,EAAS,CACrB,GAAImB,EAAK,IAAItG,CAAC,EACV,SAEJ,IAAMwG,EAAQ,CAACxG,CAAC,EAChBsG,EAAK,IAAItG,CAAC,EACV,QAAWc,KAAK0F,EACZ,QAAWtI,KAAQF,GACf,OAAW,CAAC+C,CAAC,IAAK,KAAK,MAAMD,CAAC,EAAE5C,CAAI,EAC5BiI,EAAI,IAAIpF,CAAC,GAAK,CAACuF,EAAK,IAAIvF,CAAC,IACzBuF,EAAK,IAAIvF,CAAC,EACVyF,EAAM,KAAKzF,CAAC,GAK5BwF,EAAM,KAAKC,CAAK,CACpB,CACA,OAAOD,CACX,CAGA,UAAUpB,EAAS3B,EAAMiD,EAAUC,EAAIC,EAAY,CAC/C,IAAMR,EAAM,IAAI,IAAIhB,CAAO,EACrBI,EAAM,CAACd,EAAGzE,IAAMyE,EAAI,EAAIzE,EACxB4G,EAAU,CAACnC,EAAGzE,IAAMyE,IAAMiC,GAAMzI,GAAM+B,CAAC,IAAM2G,EAC7CE,EAAO,IAAI,IAAI,CAAC,CAACtB,EAAI/B,EAAMiD,CAAQ,EAAG,EAAE,CAAC,CAAC,EAC1CD,EAAQ,CAAC,CAAChD,EAAMiD,CAAQ,CAAC,EAC3BK,EAAM,CAACtD,EAAMiD,CAAQ,EACzB,OAAW,CAAChC,EAAGzE,CAAC,IAAKwG,EAAO,CAExB,GADAM,EAAM,CAACrC,EAAGzE,CAAC,EACP0G,IAAO,QAAaE,EAAQnC,EAAGzE,CAAC,EAChC,MAEJ,OAAW,CAACe,EAAGL,CAAC,IAAK,KAAK,MAAM+D,CAAC,EAAExG,GAAM+B,CAAC,CAAC,EACnC,CAACmG,EAAI,IAAIpF,CAAC,GAAK8F,EAAK,IAAItB,EAAIxE,EAAGL,CAAC,CAAC,IAGrCmG,EAAK,IAAItB,EAAIxE,EAAGL,CAAC,EAAG6E,EAAId,EAAGzE,CAAC,CAAC,EAC7BwG,EAAM,KAAK,CAACzF,EAAGL,CAAC,CAAC,EAEzB,CACA,GAAIgG,IAAO,QAAa,CAACE,EAAQE,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,EAC3C,OAEJ,IAAMC,EAAO,CAAC,EACd,QAASC,EAAMzB,EAAIuB,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,EAAGE,IAAQ,GAAIA,EAAMH,EAAK,IAAIG,CAAG,EAC9DD,EAAK,KAAK,CAAE,EAAGC,GAAO,EAAG,MAAQA,EAAM,CAAG,CAAC,EAE/C,OAAOD,EAAK,QAAQ,CACxB,CACA,UAAU5B,EAAS3B,EAAMkD,EAAI,CACzB,IAAMP,EAAM,IAAI,IAAIhB,CAAO,EACrB0B,EAAO,IAAI,IAAI,CAAC,CAACrD,EAAM,EAAE,CAAC,CAAC,EAC3BtF,EAAO,IAAI,IAAI,CAAC,CAACsF,EAAM,CAAC,CAAC,CAAC,EAC1BgD,EAAQ,CAAChD,CAAI,EACnB,QAAWiB,KAAK+B,EAAO,CACnB,GAAI/B,IAAMiC,EACN,MAEJ,QAAW1G,KAAKhC,GACZ,OAAW,CAAC+C,EAAGL,CAAC,IAAK,KAAK,MAAM+D,CAAC,EAAEzE,CAAC,EAC5B,CAACmG,EAAI,IAAIpF,CAAC,GAAK8F,EAAK,IAAI9F,CAAC,IAG7B8F,EAAK,IAAI9F,EAAG0D,CAAC,EACbvG,EAAK,IAAI6C,EAAGL,CAAC,EACb8F,EAAM,KAAKzF,CAAC,EAGxB,CACA,IAAMgG,EAAO,CAAC,EACd,QAASC,EAAMN,EAAIM,IAAQ,GAAIA,EAAMH,EAAK,IAAIG,CAAG,EAC7CD,EAAK,KAAK,CAAE,EAAGC,EAAK,MAAO9I,EAAK,IAAI8I,CAAG,CAAE,CAAC,EAE9C,OAAOD,EAAK,QAAQ,CACxB,CACA,YAAYE,EAAO,CACf,GAAM,CAAE,KAAAC,CAAK,EAAI,KAAK,EACtB,OAAOD,EAAM,OAAO,CAACjH,EAAG,CAAE,EAAAyE,CAAE,IAAMzE,EAAI,KAAK,MAAMyE,CAAC,EAAIyC,EAAMA,CAAI,CACpE,CAGA,SAASD,EAAO3B,EAAO6B,EAAIC,EAAS,CAChC,GAAM,CAAE,MAAAlD,EAAO,IAAAC,EAAK,KAAA+C,CAAK,EAAI,KAAK,EAC9BxG,EAAIyG,EACFE,EAAM,CAAC,EACb,OAAW,CAAE,EAAA5C,EAAG,MAAA6C,CAAM,IAAKL,EAAO,CAC9B,IAAMxE,EAAO2E,GAAmDjD,EAAIM,CAAC,EAC/D7F,EAAM,CAAC,EACPoG,EAAK,CAAC,EACZ,QAAS9F,EAAI,EAAGA,EAAIgF,EAAMO,CAAC,EAAGvF,IAC1BN,EAAI,KAAK0G,EAAM,QAAQ5E,EAAIxB,EAAIuD,CAAI,CAAC,EACpCuC,EAAG,KAAKtE,EAAIxB,EAAIuD,CAAI,EAEpB6E,IAAU,IACV1I,EAAI,QAAQ,EACZoG,EAAG,QAAQ,GAEf,KAAK,OAAOP,CAAC,EAAI7F,EACjB,KAAK,OAAO6F,CAAC,EAAIO,EACjB,KAAK,OAAOP,CAAC,EAAIa,EACjB+B,EAAI,KAAK,GAAGzI,CAAG,EACf8B,GAAK+B,GAAQyB,EAAMO,CAAC,EAAI,GAAKyC,CACjC,CACA,OAAOG,CACX,CACA,cAAc9E,EAAOC,EAAIH,EAAMtC,EAAGwH,EAAG,CACjC,IAAMC,GAAQD,EAAIxH,GAAK,EAAI,KACrB0H,EAAQF,EAAI,EAAIxH,EAAIhC,GAAiB,CAAC,CAAC,EACvCgI,EAAa,CAAC,EACpB,QAAWzF,KAAQiD,GAAO,EAAG,CAAC,EAC1B,QAAWmE,KAAQD,EACf,QAASvI,EAAI,EAAGA,GAAK,GAAIA,IAAK,CAC1B,IAAMmB,EAAKmH,EAAOtI,EAAK,GACjB0B,EAAOD,GAAOR,GAAQJ,EAAGwH,EAAGlH,EAAGC,CAAI,EAAGP,EAAG2H,CAAI,EAC9CxI,EAAI,IAAM0B,EAAK,KAAO,IAAcK,GAAYL,CAAI,GAGzDmF,EAAW,KAAKtD,GAAQS,GAAOX,EAAOC,EAAIH,EAAMjC,GAAUO,GAAOR,GAAQJ,EAAGK,EAAQ,KAAK,IAAIC,GAAID,EAASL,GAAK,EAAI,IAAI,EAAGO,CAAI,EAAGP,EAAG2H,CAAI,EAAGH,EAAG9E,CAAI,CAAC,CACvJ,CAGR,OAAOsD,CACX,CACA,WAAWZ,EAASwC,EAAQ,CACxB,IAAIvI,EACJ,GAAM,CAAE,MAAA8E,EAAO,KAAAgD,CAAK,EAAI,KAAK,EACvBvD,EAAU,KAAK,UAAUwB,CAAO,EACtC,GAAIxB,EAAQ,SAAW,EACnB,OAEJ,IAAMiE,EAAQzC,EAAQ,MAAMV,GAAK,KAAK,MAAMA,CAAC,CAAC,EACxCoD,EAASlE,EAAQ,MAAMvF,GAAKA,EAAE,QAAUuF,EAAQ,CAAC,EAAE,KAAK,EACxDA,EAAQ,CAAC,EAAE,MACX,OACFpB,EACAC,EACAsF,EACAzF,EACJ,GAAIwF,EACAlE,EAAQ,KAAK,CAACvF,EAAGC,IAAMD,EAAE,EAAIC,EAAE,CAAC,EAChCkE,EAAQsF,EACRrF,EAAKmB,EAAQ,CAAC,EAAE,EAChBmE,EAAKnE,EAAQA,EAAQ,OAAS,CAAC,EAAE,EACjCtB,EAAOE,IAAU,KAAK,UAAYqF,EAAQ,GAAK,MAE9C,CAODjE,EAAQ,KAAK,CAACvF,EAAGC,IAAMD,EAAE,MAAM,EAAIC,EAAE,MAAM,GAAKD,EAAE,MAAM,EAAIC,EAAE,MAAM,CAAC,EACrE,IAAMD,EAAIuF,EAAQ,CAAC,EAAE,MACftF,EAAIsF,EAAQA,EAAQ,OAAS,CAAC,EAAE,MAChCoE,EAAQ,KAAK,MAAM1J,EAAE,EAAID,EAAE,EAAGC,EAAE,EAAID,EAAE,CAAC,EACvC0C,EAAIiH,EAAQ,KAAO5J,GAAKC,EAAGC,CAAC,EAAI,CAAE,EAAG,EAAG,EAAG,CAAE,EAC7C0D,EAAI,CAAE,EAAG,CAACjB,EAAE,EAAG,EAAGA,EAAE,CAAE,EACtBjB,EAAMpB,GAAKL,EAAGC,EAAG,EAAG,EAC1BgE,EAAOsB,EAAQ,KAAK9E,GAAKA,EAAE,QAAU,KAAK,QAAQ,GAC3C+I,EAAQ,GAAK,IAAM,KAAK,KAAK7F,EAAE,CAAC,GAAK,IACrClC,EAAI,EAAI8H,EAAO,GAAK5F,EAAE,GAAKlC,EAAI,EAAI8H,EAAO,GAAK5F,EAAE,GAAK,EACnD,EACA,GACVQ,EAAQ,IAAIjB,GAAM,CAAClD,EAAGC,CAAC,EAAG,CAAC0D,EAAGA,CAAC,EAAG,EAAI,EACtCS,EAAK,EACLsF,EAAKC,CACT,CACA,IAAMC,EAAIrE,EAAQ,CAAC,EACbsE,EAAItE,EAAQA,EAAQ,OAAS,CAAC,EAC9B5D,EAAI+H,EAAKtF,EACT0F,EAASvE,EAAQ,SAAW,GAAMqE,EAAE,IAAMC,EAAE,GAAKD,EAAE,QAAUC,EAAE,OAASlI,EAAI,KAC5E4F,EAAY,CAACqC,EAAE,MAAOC,EAAE,KAAK,EAC7BE,EAAQpC,GAAe,KAAK,OAAOA,EAAY8B,EAAQlC,CAAS,EAClEsB,EACA5D,EACA0B,EAAQmC,EACRE,EACJ,GAAIc,EAAQ,CACRjB,EAAQ,KAAK,UAAU9B,EAAS6C,EAAE,EAAGA,EAAE,KAAK,EAC5C,IAAMT,EAAI,KAAK,YAAYN,CAAK,EAC1BmB,EAAOJ,EAAE,MACT,KAAK,IAAI,EAAG9D,EAAM8D,EAAE,CAAC,EAAI,CAAC,EAC1B,KAAK,IAAI,EAAG9D,EAAM8D,EAAE,CAAC,EAAI,CAAC,EAE1BhH,GADOgH,EAAE,GAAK,KAAK,OAAOA,EAAE,CAAC,EAAEI,CAAI,EAAI,EAAI,IAC/B,KAAK,IAAIxK,EAAS,EAC9ByD,EAAK,KAAK,IAAIzD,EAAS,EAC7ByF,EAAS8E,EAAK5E,GAAO,EAAG,EAAE,EAAE,IAAIjD,GAASmC,GAASS,GAAOX,EAAOC,EAAIH,EAAMjC,GAAUc,GAAS,EAAGZ,EAAMU,EAAIK,EAAIjB,CAAM,EAAGmH,EAAG9E,CAAI,CAAC,CAAC,CACpI,KACK,CACDwE,GACK7H,EAAK,KAAK,UAAU+F,EAAS6C,EAAE,EAAGA,EAAE,MAAOC,EAAE,EAAGA,EAAE,KAAK,KAAO,MAAQ7I,IAAO,OAASA,EAAK,KAAK,UAAU+F,EAAS6C,EAAE,EAAGC,EAAE,CAAC,EAChI,IAAMV,EAAI,KAAK,YAAYN,CAAK,EAChC,GAAIW,EAAO,CACP,IAAMS,EAAK,KAAK,IAAI,GAAW,KAAK,IAAIxK,GAAMkC,EAAGjC,EAAO,CAAC,EACzDuF,EAAS8E,EAAK5E,GAAO8E,EAAI,EAAE,EAAE,IAAI1G,GAAMc,GAASH,GAAQC,EAAOC,EAAIH,EAAMlC,GAAQJ,EAAGD,GAAWC,EAAG4B,CAAC,EAAG,EAAG,CAAC,EAAGc,CAAI,CAAC,CAAC,EACnH,IAAM6F,EAAQnJ,GAAekE,EAAO,GAAG,EACvC+D,EAAU,KAAK,IAAI,MAAOkB,EAAQ,EAAIpB,IAAShD,EAAM+C,EAAM,CAAC,EAAE,CAAC,EAAI,EAAE,CACzE,SACSM,EAAIxH,EAAI,KACbsD,EAAS8E,EAAK,KAAK,cAAc5F,EAAOC,EAAIH,EAAMtC,EAAGwH,CAAC,CAAC,MAEtD,CACD,IAAMgB,EAAMhB,EAAI,EAAIL,EACdmB,EAAK,KAAK,IAAI,GAAW,KAAK,IAAIxK,IAAOkC,EAAIwI,GAAMzK,EAAO,CAAC,EACjEuF,EAAS8E,EAAK5E,GAAO8E,EAAI,EAAE,EAAE,IAAI1G,GAAMc,GAASS,GAAOX,EAAOC,EAAIH,EAAMjC,GAAUc,GAASnB,EAAI,EAAIK,EAAS,EAAGuB,EAAG,EAAG,EAAGvB,CAAM,EAAGmI,EAAK9F,CAAI,CAAC,CAAC,EAC5IsC,EAAQ,CACZ,CACJ,CACA,IAAMO,EAAQ,IAAIhE,GAAM+B,EAAO,IAAKzB,GAAeyB,EAAO,IAAKA,EAAO,IAAI,CAAC,EACrEmF,EAAS,KAAK,SAASvB,EAAO3B,EAAOP,EAAOqC,CAAO,EACzD,KAAK,OAAOoB,EAAQlD,CAAK,EACzB,IAAMxD,EAAWnD,GAAW6J,CAAM,EAC5BC,EAAOtD,EAAQ,OAAOV,GAAK,CAAC,KAAK,OAAOA,CAAC,CAAC,EAC1CiE,EAAO,KAAK,aAAaD,CAAI,EAC9B,IAAIjK,IAAM,CAAE,QAASA,EAAG,KAAMkF,GAAO,KAAK,UAAUlF,CAAC,CAAC,CAAE,EAAE,EAC1D,KAAK,CAACJ,EAAGC,IAAMD,EAAE,KAAOC,EAAE,IAAI,EACnC,QAAWsK,KAAOD,EACd,KAAK,WAAWC,EAAI,QAAS7G,CAAQ,CAE7C,CACJ,EAEO,SAAS8G,GAAgB7I,EAAG,CAC/B,IAAMqF,EAAI,IAAI,aAAarF,EAAE,CAAC,EAAE,KAAK,GAAG,EAClCsF,EAAI,IAAI,aAAatF,EAAE,CAAC,EAAE,KAAK,GAAG,EACxC,GAAIgE,GAAO,YAAYhE,CAAC,EAAG,CACvB,IAAM8I,EAAS,IAAI9E,GAAOhE,CAAC,EAC3B8I,EAAO,IAAI,EACXA,EAAO,MAAMzD,EAAGC,CAAC,CACrB,CACA,MAAO,CAAE,EAAAD,EAAG,EAAAC,CAAE,CAClB,CChsBA,IAAMyD,GAAU,CACZ,CAAE,MAAO,EAAG,WAAY,EAAG,EAC3B,CAAE,MAAO,EAAG,WAAY,EAAG,EAC3B,CAAE,MAAO,EAAG,WAAY,EAAG,EAC3B,CAAE,MAAO,GAAI,WAAY,EAAG,EAC5B,CAAE,MAAO,GAAI,WAAY,GAAI,CACjC,EACMC,GAAkB,GAElBC,GAAiB,EACjBC,GAAgB,GAChBC,GAAgB,EAEhBC,GAAW,IAEXC,GAAM,GAENC,GAAO,GACPC,GAAcC,GAAS,CAAE,IAAIC,EAAI,QAASA,EAAKD,EAAK,UAAY,MAAQC,IAAO,OAAS,OAASA,EAAG,QAAU,CAAG,EACvH,SAASC,GAAQC,EAAQC,EAAM,CAC3B,IAAMC,EAAMD,EAAK,GAAG,EAAE,EACtB,OAASD,IAAW,KAAOA,IAAW,OACjCE,IAAQ,KAAOA,IAAQ,MACxBF,IAAWE,CACnB,CACA,SAASC,GAASC,EAAM,CACpB,IAAIC,EAAI,KAAK,KAAKD,EAAM,UAAU,IAAM,GAAK,EAC7C,MAAO,KACHC,GAAKA,GAAK,GACVA,KAAO,EACPA,GAAKA,IAAM,GACXA,GAAKA,GAAK,EACVA,KAAO,EACAA,EAAI,WAEnB,CACO,SAASC,EAAIC,EAAOC,EAAU,CACjC,OAAO,OAAOD,GAAU,UAAY,OAAO,SAASA,CAAK,EAAIA,EAAQC,CACzE,CAEO,SAASC,GAAYC,EAASC,EAAI,CACrC,OAAO,KAAK,IAAKL,EAAII,EAAQ,sBAAuB,GAAI,EAAIC,EAAM,IAASL,EAAII,EAAQ,kBAAmB,CAAC,CAAC,CAChH,CACO,SAASE,GAAOC,EAAS,CAC5B,GAAM,CAAE,MAAAC,EAAO,MAAAC,CAAM,EAAIF,EAAQ,MAC3BG,EAAIH,EAAQ,QACZI,EAAUX,EAAIU,EAAE,kBAAmB,CAAC,EACpCE,EAAOZ,EAAIU,EAAE,WAAY,CAAC,EAC1BG,EAAML,EAAM,IAAIM,GAAKA,EAAE,EAAE,EACzBC,EAAQ,IAAI,WAAWP,EAAM,MAAM,EACnCQ,EAAQ,IAAI,WAAWR,EAAM,MAAM,EACnCS,EAAM,IAAI,aAAaT,EAAM,MAAM,EACrCM,EAAI,EACRN,EAAM,QAAQ,CAACjB,EAAM2B,IAAM,CACvB,IAAMC,EAAQhB,GAAYO,EAAGnB,EAAK,MAAM,EAClC6B,EAAQ,KAAK,IAAI,EAAG,KAAK,KAAKD,EAAQR,CAAO,CAAC,EACpDI,EAAMG,CAAC,EAAIJ,EACXE,EAAME,CAAC,EAAIE,EAAQ,EACnBH,EAAIC,CAAC,EAAIC,EAAQC,EACjBN,GAAKM,EAAQ,CACjB,CAAC,EACD,IAAMC,EAAU,IAAI,WAAWP,CAAC,EAC1BQ,EAAU,IAAI,WAAWR,CAAC,EAC1BS,EAAQ,IAAI,aAAaT,CAAC,EAAE,KAAK,GAAG,EACpCU,EAAQ,IAAI,aAAaV,CAAC,EAAE,KAAK,GAAG,EACpCW,EAAW,IAAI,WAAWX,CAAC,EAC3BY,EAAW,MAAM,KAAK,CAAE,OAAQZ,CAAE,EAAG,IAAM,CAAC,CAAC,EACnDN,EAAM,QAAQ,CAACjB,EAAM2B,IAAM,CACvB,IAAMS,EAAS,OAAOpC,EAAK,GAAM,UAAY,OAAOA,EAAK,GAAM,SACzDqC,EAAYtC,GAAWC,CAAI,EAAI,EAAI,EACzC,QAASsC,EAAI,EAAGA,EAAIb,EAAME,CAAC,EAAGW,IAAK,CAC/B,IAAMC,EAAIf,EAAMG,CAAC,EAAIW,EACrBR,EAAQS,CAAC,EAAIZ,EACbI,EAAQQ,CAAC,EAAID,EACbJ,EAASK,CAAC,EAAIF,EACVD,IACAJ,EAAMO,CAAC,EAAIvC,EAAK,EAAIsC,EAAIZ,EAAIC,CAAC,EAC7BM,EAAMM,CAAC,EAAIvC,EAAK,GAEhBsC,EAAI,IACJH,EAASI,EAAI,CAAC,EAAE,KAAK,CAACA,EAAGb,EAAIC,CAAC,CAAC,CAAC,EAChCQ,EAASI,CAAC,EAAE,KAAK,CAACA,EAAI,EAAGb,EAAIC,CAAC,CAAC,CAAC,EAExC,CACJ,CAAC,EACD,IAAMa,EAAQ,IAAI,IAAIlB,EAAI,IAAI,CAACmB,EAAId,IAAM,CAACc,EAAId,CAAC,CAAC,CAAC,EAC3Ce,EAAQzB,EAAM,IAAI,IAAM,CAAC,CAAC,EAAG,CAAC,CAAC,CAAC,EACtC,QAAW0B,KAAQzB,EAAO,CACtB,IAAM0B,EAAIJ,EAAM,IAAIG,EAAK,IAAI,EACvBE,EAAIL,EAAM,IAAIG,EAAK,EAAE,EAK3B,GAJIC,IAAM,QAAaC,IAAM,QAIzBD,IAAMC,GAAKpB,EAAMmB,CAAC,GAAK,EACvB,SAEJ,IAAME,EAAW5C,GAAQyC,EAAK,WAAYA,EAAK,IAAI,EAAI,EAAI,EACrDI,EAAS7C,GAAQyC,EAAK,SAAUA,EAAK,EAAE,EAAI,EAAI,EAC/CK,EAAIxB,EAAMoB,CAAC,GAAKE,EAAWrB,EAAMmB,CAAC,EAAI,EAAI,GAC1CL,EAAIf,EAAMqB,CAAC,GAAKE,EAAStB,EAAMoB,CAAC,EAAI,EAAI,GAC9CV,EAASa,CAAC,EAAE,KAAK,CAACT,EAAGlB,CAAI,CAAC,EAC1Bc,EAASI,CAAC,EAAE,KAAK,CAACS,EAAG3B,CAAI,CAAC,EAC1BqB,EAAME,CAAC,EAAEE,CAAQ,EAAE,KAAK,CAACD,EAAGE,CAAM,CAAC,EACnCL,EAAMG,CAAC,EAAEE,CAAM,EAAE,KAAK,CAACH,EAAGE,CAAQ,CAAC,CACvC,CACA,IAAMG,EAAM,IAAI,WAAW1B,EAAI,CAAC,EAChC,QAASe,EAAI,EAAGA,EAAIf,EAAGe,IACnBW,EAAIX,EAAI,CAAC,EAAIW,EAAIX,CAAC,EAAIH,EAASG,CAAC,EAAE,OAEtC,IAAMY,EAAK,IAAI,WAAWD,EAAI1B,CAAC,CAAC,EAC1B4B,EAAK,IAAI,aAAaF,EAAI1B,CAAC,CAAC,EAClC,QAASe,EAAI,EAAGA,EAAIf,EAAGe,IACnBH,EAASG,CAAC,EAAE,QAAQ,CAAC,CAACC,EAAGa,CAAC,EAAGzB,IAAM,CAC/BuB,EAAGD,EAAIX,CAAC,EAAIX,CAAC,EAAIY,EACjBY,EAAGF,EAAIX,CAAC,EAAIX,CAAC,EAAIyB,CACrB,CAAC,EAEL,MAAO,CACH,IAAA9B,EACA,MAAAE,EACA,MAAAC,EACA,IAAAC,EACA,MAAAgB,EACA,QAAAZ,EACA,QAAAC,EACA,MAAAC,EACA,MAAAC,EACA,SAAAC,EACA,IAAAe,EACA,GAAAC,EACA,GAAAC,EACA,EAAA5B,EACA,KAAAF,CACJ,CACJ,CAEA,SAASgC,GAAWC,EAAG,CACnB,GAAM,CAAE,EAAA/B,EAAG,IAAA0B,EAAK,GAAAC,CAAG,EAAII,EACjBC,EAAO,IAAI,WAAWhC,CAAC,EAAE,KAAK,EAAE,EAChCiC,EAAU,CAAC,EACjB,QAAShD,EAAI,EAAGA,EAAIe,EAAGf,IAAK,CACxB,GAAI+C,EAAK/C,CAAC,GAAK,EACX,SAEJ,IAAMiD,EAAQ,CAACjD,CAAC,EAChB+C,EAAK/C,CAAC,EAAIgD,EAAQ,OAClB,QAAWR,KAAKS,EACZ,QAASC,EAAIT,EAAID,CAAC,EAAGU,EAAIT,EAAID,EAAI,CAAC,EAAGU,IAAK,CACtC,IAAMnB,EAAIW,EAAGQ,CAAC,EACVH,EAAKhB,CAAC,EAAI,IACVgB,EAAKhB,CAAC,EAAIiB,EAAQ,OAClBC,EAAM,KAAKlB,CAAC,EAEpB,CAEJiB,EAAQ,KAAKC,CAAK,CACtB,CACA,MAAO,CAAE,KAAAF,EAAM,QAAAC,CAAQ,CAC3B,CACO,SAASG,GAAa3C,EAAS4C,EAAO,CAAC,EAAG,CAC7C,IAAI3D,EAAI4D,EAAIC,EACZ,IAAMR,EAAIvC,GAAOC,CAAO,EAClB,CAAE,EAAAO,EAAG,IAAA0B,EAAK,GAAAC,EAAI,GAAAC,EAAI,MAAAnB,EAAO,MAAAC,EAAO,MAAAT,EAAO,MAAAC,EAAO,IAAAC,EAAK,KAAAL,CAAK,EAAIiC,EAC5DnC,EAAIH,EAAQ,QACZ+C,EAAUxE,GAAQ,KAAK,IAAI,EAAG,KAAK,IAAI,EAAGkB,GAAKR,EAAK2D,EAAK,WAAa,MAAQ3D,IAAO,OAASA,EAAKkB,EAAE,QAAS,CAAC,CAAC,CAAC,CAAC,EAClH6C,EAAMvD,GAAKoD,EAAKD,EAAK,uBAAyB,MAAQC,IAAO,OAASA,EAAK1C,EAAE,oBAAqB,EAAE,EACpG8C,EAAO3D,GAASG,GAAKqD,EAAKF,EAAK,QAAU,MAAQE,IAAO,OAASA,EAAK3C,EAAE,KAAM,CAAC,CAAC,EAChF+C,EAAI,IAAI,aAAa3C,CAAC,EACtB4C,EAAI,IAAI,aAAa5C,CAAC,EACtB6C,EAAgB,CAAC,EACvB,GAAI7C,IAAM,EACN,MAAO,CAAE,cAAA6C,CAAc,EAE3B,GAAM,CAAE,KAAAb,EAAM,QAAAC,CAAQ,EAAIH,GAAWC,CAAC,EAClCe,EAAO,IACPC,EAAQ,EACZ,QAASZ,EAAI,EAAGA,EAAIR,EAAG,OAAQQ,IAC3BW,EAAO,KAAK,IAAIA,EAAMlB,EAAGO,CAAC,CAAC,EAC3BY,GAASnB,EAAGO,CAAC,EAEjBY,GAAS,EACT,IAAIC,EAAU,GACd,QAASjC,EAAI,EAAGA,EAAIf,EAAGe,IACnB,GAAI,CAAC,OAAO,MAAMN,EAAMM,CAAC,CAAC,EAAG,CACzBiC,EAAU,GACV,KACJ,CAEJ,IAAMC,EAASD,EAAUE,GAAgBnB,CAAC,EAAI,OACxCoB,EAAO,KAAK,KAAKnD,CAAC,EAAI,GAC5B,QAASe,EAAI,EAAGA,EAAIf,EAAGe,IACfkC,GAAU,CAAC,OAAO,MAAMA,EAAO,EAAElC,CAAC,CAAC,GACnC4B,EAAE5B,CAAC,EAAIkC,EAAO,EAAElC,CAAC,EACjB6B,EAAE7B,CAAC,EAAIkC,EAAO,EAAElC,CAAC,GAEZiC,GAAW,CAAC,OAAO,MAAMvC,EAAMM,CAAC,CAAC,GACtC4B,EAAE5B,CAAC,EAAIN,EAAMM,CAAC,EAAI2B,EAAK,EAAI,GAC3BE,EAAE7B,CAAC,EAAIL,EAAMK,CAAC,EAAI2B,EAAK,EAAI,KAG3BC,EAAE5B,CAAC,EAAI2B,EAAK,EAAIS,EAChBP,EAAE7B,CAAC,EAAI2B,EAAK,EAAIS,GAKxB,IAAM9C,EAAQ4B,EAAQ,IAAImB,GAAUH,IAAW,QAAaG,EAAO,MAAMrC,GAAK,CAAC,OAAO,MAAMkC,EAAO,EAAElC,CAAC,CAAC,CAAC,CAAC,EACnGsC,EAAQ,CAAC,EACXC,EAAc,GAClB,QAASvC,EAAI,EAAGA,EAAIf,EAAGe,IACdV,EAAM2B,EAAKjB,CAAC,CAAC,IACdsC,EAAM,KAAKtC,CAAC,EACZuC,IAAgBA,EAAc,CAAC,OAAO,MAAM7C,EAAMM,CAAC,CAAC,IAG5D,IAAMwC,EAAO,KAAK,IAAIR,EAAQ,EAAGD,EAAO,EAAE,EACpCU,EAASD,EAAOA,EAChBE,EAASnF,GAAMwE,EAAOA,EACtB,CAAE,MAAAY,GAAO,WAAAC,EAAW,EAAInB,EACxBoB,GAAS,KAAK,IAAIJ,EAASC,CAAM,EAAI,KAAK,IAAI,EAAGE,GAAa,CAAC,EAC/DE,GAAS,KAAK,IAAIf,CAAI,EACtBgB,GAAS,KAAK,IAAIP,CAAI,EACtBQ,GAAO,CAAChD,EAAGiD,EAAGC,EAAGC,IAAQ,CAC3B,IAAIC,EAAKD,GAAOD,EAAIA,GAChBE,EAAK,IACLA,EAAK,GAET,IAAMC,EAAKzB,EAAE5B,CAAC,EAAI4B,EAAEqB,CAAC,EACfK,EAAKzB,EAAE7B,CAAC,EAAI6B,EAAEoB,CAAC,EACfM,EAAM,KAAK,KAAKF,EAAKA,EAAKC,EAAKA,CAAE,GAAK,KACtCE,EAAKJ,GAAMG,EAAML,IAAO,EAAIK,GAC5BE,EAAKD,EAAIH,EACTK,EAAKF,EAAIF,EACf1B,EAAE5B,CAAC,EAAI4B,EAAE5B,CAAC,EAAIyD,EACd5B,EAAE7B,CAAC,EAAI6B,EAAE7B,CAAC,EAAI0D,EACd9B,EAAEqB,CAAC,EAAIrB,EAAEqB,CAAC,EAAIQ,EACd5B,EAAEoB,CAAC,EAAIpB,EAAEoB,CAAC,EAAIS,CAClB,EAGIC,GAAS,EACPC,GAAO,CAAC5D,EAAG6D,IAAW,CACxB,IAAIC,EAAQ9C,EAAE,QAAQhB,CAAC,EACnB+D,EAAM/C,EAAE,QAAQhB,CAAC,EACjBgE,EAAMrC,EAAK,EAAI,GAAM,GAAK,EAC1BsC,EAAYJ,EAChB,QAASK,EAAO,EAAGA,EAAO5G,GAAU4G,IAAQ,CACxC,IAAM7B,EAASlD,EAAM2E,CAAK,EACpBK,EAAO/E,EAAI0E,CAAK,EAChBM,GAASJ,EAAM,EAAI3B,EAAS,EAAI0B,EAAMA,GAAOI,EACnD,GAAIF,GAAaG,EAAO,CACpB,IAAM7E,EAAQ,KAAK,MAAM0E,EAAYE,CAAI,EACzC,OAAAR,GAASE,EAASI,EAAY1E,EAAQ4E,EAC/BjF,EAAM4E,CAAK,EAAIC,EAAMC,EAAMzE,CACtC,CACA0E,GAAaG,EACb,IAAMC,EAAMrD,EAAE,MAAM8C,CAAK,EAAEE,EAAM,EAAI,EAAI,CAAC,EAC1C,GAAIK,EAAI,SAAW,EACf,OAAAV,GAASE,EAASI,EACX/E,EAAM4E,CAAK,GAAKE,EAAM,EAAI3B,EAAS,EAAI,GAElD,GAAM,CAACiC,EAAMC,CAAS,EAAIF,EAAI,KAAK,MAAM1C,EAAK,EAAI0C,EAAI,MAAM,CAAC,EAK7D,GAJAJ,GAAalF,EACb+E,EAAQQ,EACRN,EAAMO,IAAc,EAAI,EAAI,GAC5BR,EAAMQ,IAAc,EAAI,EAAIpF,EAAMmF,CAAI,EAAI,EACtCL,GAAa,EACb,OAAAN,GAASE,EAASI,EACX/E,EAAM4E,CAAK,EAAIC,CAE9B,CACA,MAAO,EACX,EACMS,GAAgB,CAACxE,EAAGmD,IAAQ,CAC9B,QAAS/B,EAAIT,EAAIX,CAAC,EAAGoB,EAAIT,EAAIX,EAAI,CAAC,EAAGoB,IAAK,CACtC,IAAM6B,EAAIrC,EAAGQ,CAAC,EACV6B,EAAIjD,GACJgD,GAAKhD,EAAGiD,EAAGpC,EAAGO,CAAC,EAAG+B,CAAG,CAE7B,CACJ,EACMsB,EAAQ,WAAW,KAAKnC,CAAK,EAC7BoC,GAAOnC,EAAc,KAAK,MAAM/E,GAAOoF,EAAU,EAAI,EAC3D,QAAS+B,EAAIrC,EAAM,OAASoC,GAAO9B,GAAY+B,EAAI/B,GAAY+B,IAAK,CAChE,IAAMxB,EAAMV,EAAS,KAAK,IAAI,CAACI,GAAS8B,CAAC,EACzC,QAAStF,EAAIoF,EAAM,OAAS,EAAGpF,EAAI,EAAGA,IAAK,CACvC,IAAMmE,EAAI,KAAK,MAAM7B,EAAK,GAAKtC,EAAI,EAAE,EAC/BuF,EAAMH,EAAMpF,CAAC,EACnBoF,EAAMpF,CAAC,EAAIoF,EAAMjB,CAAC,EAClBiB,EAAMjB,CAAC,EAAIoB,CACf,CACA,QAAW5E,KAAKyE,EAAO,CACnBD,GAAcxE,EAAGmD,CAAG,EACpB,QAASrC,EAAI,EAAGA,EAAI6B,GAAO7B,IAAK,CAC5B,IAAM+C,EAAS,KAAK,IAAIf,GAASnB,EAAK,GAAKoB,GAASD,GAAO,EACrDG,EAAIW,GAAK5D,EAAG6D,CAAM,EACpBZ,GAAK,GAAKA,IAAMjD,GAAK2D,GAAS,GAC9BX,GAAKhD,EAAGiD,EAAGU,GAAQR,CAAG,CAE9B,CACJ,CACJ,CAGA,IAAM0B,EAAS1H,GAAiB4B,EAC1B+F,GAAM,CAACC,EAAGC,IAAO,KAAK,MAAMD,EAAIF,CAAM,EAAI,SAAa,KAAK,MAAMG,EAAIH,CAAM,EAAI,SACtF,QAASnE,EAAI,EAAGA,GAAK4B,EAAM,OAASpF,GAAkB,GAAIwD,IAAK,CAC3D,IAAMuE,EAAO,IAAI,IACjB,QAAWjF,KAAKsC,EAAO,CACnB,IAAM,EAAIwC,GAAIlD,EAAE5B,CAAC,EAAG6B,EAAE7B,CAAC,CAAC,EAClBkF,EAAOD,EAAK,IAAI,CAAC,EACnBC,EACAA,EAAK,KAAKlF,CAAC,EAGXiF,EAAK,IAAI,EAAG,CAACjF,CAAC,CAAC,CAEvB,CACA,QAAWA,KAAKsC,EAAO,CACnB,IAAM6C,EAAK,KAAK,MAAMvD,EAAE5B,CAAC,EAAI6E,CAAM,EAC7BO,EAAK,KAAK,MAAMvD,EAAE7B,CAAC,EAAI6E,CAAM,EACnC,QAASQ,EAAKF,EAAK,EAAGE,GAAMF,EAAK,EAAGE,IAChC,QAASC,EAAKF,EAAK,EAAGE,GAAMF,EAAK,EAAGE,IAAM,CACtC,IAAMJ,EAAOD,EAAK,IAAKI,EAAK,SAAaC,EAAK,QAAS,EACvD,GAAKJ,EAGL,QAAWjC,KAAKiC,EAAM,CAClB,GAAIjC,GAAKjD,EACL,SAEJ,IAAIuF,EAAS,GACb,QAASnE,EAAIT,EAAIX,CAAC,EAAGoB,EAAIT,EAAIX,EAAI,CAAC,EAAGoB,IACjC,GAAIR,EAAGQ,CAAC,IAAM6B,EAAG,CACbsC,EAAS,GACT,KACJ,CAEJ,GAAIA,EACA,SAEJ,IAAMlC,EAAKzB,EAAE5B,CAAC,EAAI4B,EAAEqB,CAAC,EACfK,EAAKzB,EAAE7B,CAAC,EAAI6B,EAAEoB,CAAC,EACfM,EAAM,KAAK,KAAKF,EAAKA,EAAKC,EAAKA,CAAE,EACvC,GAAIC,GAAOsB,EACP,SAEJ,IAAIpB,EACAC,GACJ,GAAIH,EAAM,KAAM,CACZ,IAAMC,EAAKpG,IAAiByH,EAAStB,IAAS,EAAIA,GAClDE,EAAKD,EAAIH,EACTK,GAAKF,EAAIF,CACb,MAEIG,EAAKrG,GAAgByH,GAAUlD,EAAK,EAAI,IACxC+B,GAAKtG,GAAgByH,GAAUlD,EAAK,EAAI,IAE5CC,EAAE5B,CAAC,EAAI4B,EAAE5B,CAAC,EAAIyD,EACd5B,EAAE7B,CAAC,EAAI6B,EAAE7B,CAAC,EAAI0D,GACd9B,EAAEqB,CAAC,EAAIrB,EAAEqB,CAAC,EAAIQ,EACd5B,EAAEoB,CAAC,EAAIpB,EAAEoB,CAAC,EAAIS,EAClB,CACJ,CAER,CACA,QAAW1D,KAAKsC,EACZkC,GAAcxE,EAAG,GAAQ,CAEjC,CAGA,QAASX,EAAI,EAAGA,EAAIF,EAAM,OAAQE,IAAK,CACnC,IAAMiB,EAAIpB,EAAMG,CAAC,EACX,EAAIF,EAAME,CAAC,EACjB,GAAI,IAAI,GAGR,SAASnB,EAAI,EAAGA,EAAIb,GAAea,IAAK,CACpC,IAAMsH,EAAK5D,EAAE,MAAMtB,EAAGA,EAAI,CAAC,EACrBmF,EAAK5D,EAAE,MAAMvB,EAAGA,EAAI,CAAC,EAC3B,QAASN,EAAI,EAAGA,EAAI,EAAI,EAAGA,IACvB4B,EAAEtB,EAAIN,CAAC,EAAI,GAAMwF,EAAGxF,CAAC,EAAI,KAAQwF,EAAGxF,EAAI,CAAC,EAAIwF,EAAGxF,EAAI,CAAC,GACrD6B,EAAEvB,EAAIN,CAAC,EAAI,GAAMyF,EAAGzF,CAAC,EAAI,KAAQyF,EAAGzF,EAAI,CAAC,EAAIyF,EAAGzF,EAAI,CAAC,EAE7D,CACA0F,GAAQ9D,EAAGC,EAAGvB,EAAG,EAAGlB,EAAIC,CAAC,CAAC,EAC9B,CACAsG,GAAe1E,EAAMC,EAASU,EAAGC,EAAGI,EAASP,CAAG,EAChD,QAASrC,EAAI,EAAGA,EAAI2B,EAAE,IAAI,OAAQ3B,IAAK,CACnC,IAAMgD,EAAS,CAAC,EAChB,QAASrC,EAAI,EAAGA,EAAIb,EAAME,CAAC,EAAGW,IAC1BqC,EAAO,KAAK,CAAE,EAAGT,EAAE1C,EAAMG,CAAC,EAAIW,CAAC,EAAG,EAAG6B,EAAE3C,EAAMG,CAAC,EAAIW,CAAC,CAAE,CAAC,EAE1D8B,EAAcd,EAAE,IAAI3B,CAAC,CAAC,EAAIgD,CAC9B,CACA,MAAO,CAAE,cAAAP,CAAc,CAC3B,CAMA,SAAS4D,GAAQ9D,EAAGC,EAAGvB,EAAGsF,EAAGxG,EAAK,CAC9ByG,GAAMjE,EAAGC,EAAGvB,EAAGsF,EAAGxG,GAAOwG,EAAI,EAAE,EAC/B,IAAME,EAAU,IAAI,aAAaF,CAAC,EAClC,QAAS5F,EAAI,EAAGA,EAAI4F,EAAG5F,IACnB8F,EAAQ9F,CAAC,EACL8F,EAAQ9F,EAAI,CAAC,EACT,KAAK,MAAM4B,EAAEtB,EAAIN,CAAC,EAAI4B,EAAEtB,EAAIN,EAAI,CAAC,EAAG6B,EAAEvB,EAAIN,CAAC,EAAI6B,EAAEvB,EAAIN,EAAI,CAAC,CAAC,EAEvE,GAAI,CAAC8F,EAAQF,EAAI,CAAC,EACd,OAEJ,IAAM5D,EAAQ8D,EAAQF,EAAI,CAAC,EACrBJ,EAAK5D,EAAE,MAAMtB,EAAGA,EAAIsF,CAAC,EACrBH,EAAK5D,EAAE,MAAMvB,EAAGA,EAAIsF,CAAC,EACvBG,EAAM,EACV,QAAS/F,EAAI,EAAGA,EAAI,EAAI4F,EAAG5F,IAAK,CAC5B,IAAM9B,EAAK8D,EAAQhC,GAAM4F,EAAI,GAC7B,KAAOG,EAAMH,EAAI,GAAKE,EAAQC,CAAG,EAAI7H,GACjC6H,IAEJ,IAAMC,EAAOF,EAAQC,CAAG,EAAID,EAAQC,EAAM,CAAC,EACrCpB,EAAIqB,EAAO,GAAK9H,EAAI4H,EAAQC,EAAM,CAAC,GAAKC,EAAO,EACrDpE,EAAEtB,EAAIN,CAAC,EAAIwF,EAAGO,EAAM,CAAC,GAAKP,EAAGO,CAAG,EAAIP,EAAGO,EAAM,CAAC,GAAKpB,EACnD9C,EAAEvB,EAAIN,CAAC,EAAIyF,EAAGM,EAAM,CAAC,GAAKN,EAAGM,CAAG,EAAIN,EAAGM,EAAM,CAAC,GAAKpB,CACvD,CACJ,CAKA,SAASkB,GAAMjE,EAAGC,EAAGvB,EAAGsF,EAAGK,EAAQ,CAC/B,IAAM1F,EAAID,EAAIsF,EAAI,EACZT,EAAKvD,EAAEtB,CAAC,EACR8E,EAAKvD,EAAEvB,CAAC,EACR4F,EAAQ,KAAK,MAAMtE,EAAErB,CAAC,EAAI4E,EAAItD,EAAEtB,CAAC,EAAI6E,CAAE,EACvCe,EAAKD,EAAQ,MAAQtE,EAAErB,CAAC,EAAI4E,GAAMe,EAAQ,EAC1CE,EAAKF,EAAQ,MAAQrE,EAAEtB,CAAC,EAAI6E,GAAMc,EAAQ,EAC1CG,EAAQ,IAAI,aAAaT,CAAC,EAC1BjF,EAAM,IAAI,aAAaiF,CAAC,EAC1BU,EAAO,GACX,QAAStG,EAAI,EAAGA,EAAI4F,EAAG5F,IAAK,CACxB,IAAMqD,EAAKzB,EAAEtB,EAAIN,CAAC,EAAImF,EAChB7B,EAAKzB,EAAEvB,EAAIN,CAAC,EAAIoF,EACtBiB,EAAMrG,CAAC,EAAIqD,EAAK8C,EAAK7C,EAAK8C,EAC1BzF,EAAIX,CAAC,EAAIsD,EAAK6C,EAAK9C,EAAK+C,EACxBE,IAASA,EAAO,KAAK,IAAI3F,EAAIX,CAAC,CAAC,EAAI,KACvC,CACA,IAAMuG,EAAYC,GAAM,CACpB,IAAIxE,EAAQ,EACZ,QAAShC,EAAI,EAAGA,EAAI4F,EAAG5F,IACnBgC,GAAS,KAAK,MAAMqE,EAAMrG,CAAC,EAAIqG,EAAMrG,EAAI,CAAC,EAAGwG,GAAK7F,EAAIX,CAAC,EAAIW,EAAIX,EAAI,CAAC,EAAE,EAE1E,OAAOgC,CACX,EACA,GAAIsE,GAAQC,EAAS,CAAC,GAAKN,EACvB,OAEJ,IAAIQ,EAAK,EACLC,EAAK,EACT,KAAOH,EAASG,CAAE,EAAIT,GAAUS,EAAK,KACjCD,EAAKC,EACLA,GAAM,EAEV,QAASC,EAAK,EAAGA,EAAK,GAAIA,IAAM,CAC5B,IAAMC,GAAOH,EAAKC,GAAM,EACpBH,EAASK,CAAG,EAAIX,EAChBQ,EAAKG,EAGLF,EAAKE,CAEb,CACA,IAAMJ,GAAKC,EAAKC,GAAM,EACtB,QAAS1G,EAAI,EAAGA,EAAI,EAAI4F,EAAG5F,IACvB4B,EAAEtB,EAAIN,CAAC,EAAImF,EAAKkB,EAAMrG,CAAC,EAAImG,EAAKK,EAAI7F,EAAIX,CAAC,EAAIoG,EAC7CvE,EAAEvB,EAAIN,CAAC,EAAIoF,EAAKiB,EAAMrG,CAAC,EAAIoG,EAAKI,EAAI7F,EAAIX,CAAC,EAAImG,CAErD,CAIA,SAASR,GAAe1E,EAAMC,EAASU,EAAGC,EAAGI,EAASP,EAAK,CACvD,GAAI,CAACO,EACD,QAAWI,KAAUnB,EACjB2F,GAAsBjF,EAAGC,EAAGQ,CAAM,EAG1C,GAAInB,EAAQ,OAAS,EACjB,OAEJ,IAAM4F,EAAO,IAAI,aAAa5F,EAAQ,MAAM,EAAE,KAAK,GAAQ,EACrD6F,EAAO,IAAI,aAAa7F,EAAQ,MAAM,EAAE,KAAK,GAAQ,EACrD8F,EAAO,IAAI,aAAa9F,EAAQ,MAAM,EAAE,KAAK,IAAS,EAC5D,QAASlB,EAAI,EAAGA,EAAI4B,EAAE,OAAQ5B,IAAK,CAC/B,IAAMX,EAAI4B,EAAKjB,CAAC,EAChB8G,EAAKzH,CAAC,EAAI,KAAK,IAAIyH,EAAKzH,CAAC,EAAGuC,EAAE5B,CAAC,CAAC,EAChC+G,EAAK1H,CAAC,EAAI,KAAK,IAAI0H,EAAK1H,CAAC,EAAGwC,EAAE7B,CAAC,CAAC,EAChCgH,EAAK3H,CAAC,EAAI,KAAK,IAAI2H,EAAK3H,CAAC,EAAGwC,EAAE7B,CAAC,CAAC,CACpC,CACA,IAAMiH,EAAQ,IAAI,aAAa/F,EAAQ,MAAM,EACzC8D,EAAI,EACR,QAAS3F,EAAI,EAAGA,EAAI6B,EAAQ,OAAQ7B,IAChC4H,EAAM5H,CAAC,EAAI2F,EAAI+B,EAAK1H,CAAC,EACrB2F,GAAKgC,EAAK3H,CAAC,EAAI0H,EAAK1H,CAAC,EAAIqC,EAE7B,QAAS1B,EAAI,EAAGA,EAAI4B,EAAE,OAAQ5B,IAAK,CAC/B,IAAMX,EAAI4B,EAAKjB,CAAC,EAChB4B,EAAE5B,CAAC,EAAI4B,EAAE5B,CAAC,EAAI8G,EAAKzH,CAAC,EACpBwC,EAAE7B,CAAC,EAAI6B,EAAE7B,CAAC,EAAIiH,EAAM5H,CAAC,CACzB,CACJ,CACA,SAASwH,GAAsBjF,EAAGC,EAAGQ,EAAQ,CACzC,GAAIA,EAAO,OAAS,EAChB,OAEJ,IAAI8C,EAAK,EACLC,EAAK,EACT,QAAWpF,KAAKqC,EACZ8C,GAAMvD,EAAE5B,CAAC,EACToF,GAAMvD,EAAE7B,CAAC,EAEbmF,GAAM9C,EAAO,OACb+C,GAAM/C,EAAO,OACb,IAAI6E,EAAM,EACNC,EAAM,EACNC,EAAM,EACV,QAAWpH,KAAKqC,EAAQ,CACpB,IAAMgB,EAAKzB,EAAE5B,CAAC,EAAImF,EACZ7B,EAAKzB,EAAE7B,CAAC,EAAIoF,EAClB8B,GAAO7D,EAAKA,EACZ8D,GAAO7D,EAAKA,EACZ8D,GAAO/D,EAAKC,CAChB,CACA,IAAM+D,EAAQ,IAAO,KAAK,MAAM,EAAID,EAAKF,EAAMC,CAAG,EAC5CG,EAAM,KAAK,IAAID,CAAK,EACpBE,EAAM,KAAK,IAAIF,CAAK,EAC1B,QAAWrH,KAAKqC,EAAQ,CACpB,IAAMgB,EAAKzB,EAAE5B,CAAC,EAAImF,EACZ7B,EAAKzB,EAAE7B,CAAC,EAAIoF,EAClBxD,EAAE5B,CAAC,EAAImF,EAAKmC,EAAMjE,EAAKkE,EAAMjE,EAC7BzB,EAAE7B,CAAC,EAAIoF,EAAKmC,EAAMlE,EAAKiE,EAAMhE,CACjC,CACJ,CChjBA,IAAIkE,GAAiB,CACnB,CACE,MAAO,OACP,MAAO,iBACP,YAAa,6FACf,EACA,CACE,MAAO,SACP,MAAO,SACP,YAAa,yNACf,CACF,EACIC,GAAuBD,GAAe,IAAKE,GAAMA,EAAE,KAAK,EAI5D,IAAIC,GAAe,MAAOC,GAAY,CACpC,IAAMC,EAAQ,YAAY,IAAI,EAE9B,MAAO,CAAE,OADMD,EAAQ,QAAQ,SAAW,SAAWE,GAAaF,CAAO,EAAI,MAAMG,GAAWH,CAAO,EACpF,SAAU,YAAY,IAAI,EAAIC,CAAM,CACvD,ECtBA,IAAIG,GAAmB,GACnBC,GAAyB,IACzBC,GAA8B,EAClC,SAASC,GAAgBC,EAAMC,EAAQ,CACrC,OAAO,KAAK,IACVD,EAAK,sBAAwBC,EAAS,IACtCD,EAAK,iBACP,CACF,CACA,SAASE,GAAiBC,EAAOC,EAAgBN,GAA6B,CAE5E,IAAMO,EADcF,EAAM,MAAM,OAAO,CAACG,EAAKC,IAAMD,EAAMC,EAAE,OAAQ,CAAC,EACpC,IAC1BC,EAAS,KAAK,IAClBL,EAAM,MAAM,OAASP,GACrBC,EACF,EACA,MAAO,CACL,sBAAuBQ,EAAY,EAAIG,EAASH,EAAY,IAC5D,kBAAmB,KAAK,IAAIP,GAA6BM,CAAa,EACtE,WAAY,EACZ,kBAAmB,EACrB,CACF,CACA,IAAIK,GAAsB,CAAE,MAAO,EAAG,OAAQ,CAAE,EAChD,SAASC,GAAeC,EAAK,CAC3B,OAAOA,EAAI,QAAU,GAAKA,EAAI,SAAW,CAC3C,CACA,SAASC,GAAeT,EAAOQ,EAAK,CAClC,IAAME,EAAQV,EAAM,MAAM,OACpBW,EAAcX,EAAM,MAAM,OAAO,CAACG,EAAKC,IAAMD,EAAMC,EAAE,OAAQ,CAAC,EAC9DQ,EAASF,EAAQ,EAAIC,EAAcD,EAAQ,EAC3CG,EAAYH,EAAQ,EAAI,KAAK,IAAIA,EAAQjB,GAAkBC,EAAsB,EAAIgB,EAAQjB,GACnG,OAAQqB,GAAO,CACb,GAAIF,GAAU,EACZ,OAAOC,EAET,IAAME,GAAYD,EAAKF,IAAWJ,EAAI,MACtC,OAAO,KAAK,IACVK,IAAcE,EAAW,GAAKP,EAAI,OAAS,GAC3Cb,EACF,CACF,CACF,CACA,IAAIqB,GAA0B,IAC1BC,GAAsB,CACxB,IAAKX,GACL,cAAe,CACjB,EACA,SAASY,GAAclB,EAAOmB,EAASF,GAAqB,CAC1D,GAAM,CAAE,IAAAT,EAAK,cAAAP,CAAc,EAAIkB,EACzBtB,EAAOE,GAAiBC,EAAOC,CAAa,EAClD,GAAIM,GAAeC,CAAG,EACpB,MAAO,CAAE,MAAOR,EAAM,MAAO,KAAAH,CAAK,EAEpC,IAAMuB,EAAQX,GAAeT,EAAOQ,CAAG,EACvC,MAAO,CACL,MAAOR,EAAM,MAAM,IAAKqB,IAAU,CAChC,GAAGA,EACH,OAAQ,KAAK,MAAMD,EAAMC,EAAK,MAAM,EAAIL,EAAuB,CACjE,EAAE,EACF,KAAM,CACJ,GAAGnB,EACH,sBAAuB,IAAMmB,GAI7B,kBAAmBrB,EACrB,CACF,CACF,CACA,SAAS2B,GAActB,EAAOmB,EAASF,GAAqB,CAC1D,GAAIV,GAAeY,EAAO,GAAG,EAAG,CAC9B,IAAMtB,EAAOE,GAAiBC,EAAOmB,EAAO,aAAa,EACzD,OAAQL,GAAOlB,GAAgBC,EAAMiB,CAAE,CACzC,CACA,OAAOL,GAAeT,EAAOmB,EAAO,GAAG,CACzC,CCvEA,IAAII,GAAiB,CACnB,CACE,MAAO,OACP,MAAO,eACP,YAAa,6FACb,IAAKC,GACL,cAAe,CACjB,EACA,CACE,MAAO,OACP,MAAO,eACP,YAAa,sFACb,IAAKA,GACL,cAAe,GACjB,EACA,CACE,MAAO,OACP,MAAO,eACP,YAAa,gEACb,IAAKA,GACL,cAAe,EACjB,EACA,CACE,MAAO,WACP,MAAO,mBACP,YAAa,gHACb,IAAK,CAAE,MAAO,GAAK,OAAQ,EAAI,EAC/B,cAAe,CACjB,CACF,EACIC,GAAuBF,GAAe,IAAKG,GAAMA,EAAE,KAAK,EAC5D,SAASC,GAAUC,EAAQ,CACzB,IAAMC,EAAQN,GAAe,KAAMG,GAAMA,EAAE,QAAUE,CAAM,EAC3D,MAAO,CACL,IAAKC,GAAO,KAAOL,GACnB,eAAgBK,GAAO,eAAiB,GAAKC,EAC/C,CACF",
6
6
  "names": ["cached", "loadFmmm", "mod", "e", "fmmmLayout", "request", "loadFmmm", "ROUTE_ID", "TIP_ANGLE", "BOW", "BOW_CAP", "TEARDROP_TILTS", "SIDES", "other", "side", "unit", "a", "b", "dx", "dy", "m", "lerp", "f", "centroidOf", "pts", "x", "y", "p", "arcLengths", "arc", "i", "polylineLength", "_a", "arcAngles", "arcAngle", "ratio", "known", "angle", "solveArcAngle", "lo", "hi", "mid", "archLength", "c", "s", "R", "theta", "arcFlat", "length", "h", "drop", "cos", "cu", "cv", "t", "tilted", "flat", "sin", "u", "v", "du", "behindFrame", "lineFlat", "u0", "v0", "dv", "Curve", "normals", "straight", "span", "last", "d", "outwardNormals", "outRef", "centroid", "n", "rx", "ry", "rm", "dot", "ref", "sign", "mapFlat", "frame", "tA", "step", "ds", "refs", "q", "nr", "ox", "oy", "FINE_STEP", "COARSE_STEP", "fitted", "make", "flatLength", "mapped", "got", "depths", "from", "_", "spanOf", "anchors", "cellKey", "gx", "gy", "Placer", "ids", "first", "count", "per", "seedX", "seedY", "backbone", "N", "sides", "k", "out", "id", "ROUTE_ID", "min", "max", "start", "ts", "free", "pieces", "members", "X", "Y", "curve", "key", "list", "occupant", "exempt", "anchorPts", "limit", "cx", "cy", "candidates", "best", "bestV", "candidate", "set", "uSide", "vSide", "seen", "comps", "queue", "fromSide", "to", "toExitSide", "reached", "prev", "far", "path", "cur", "spine", "link", "t0", "spacing", "all", "enter", "L", "hMax", "tilts", "tilt", "parent", "route", "shared", "tB", "chord", "A", "B", "single", "pick", "next", "d0", "total", "bar", "placed", "rest", "subs", "sub", "stressPlacement", "placer", "QUALITY", "UNTANGLE_PASSES", "UNTANGLE_LINKS", "UNTANGLE_PUSH", "SMOOTH_PASSES", "MAX_HOPS", "EPS", "WARM", "isBackbone", "node", "_a", "flipped", "strand", "name", "own", "xorshift", "seed", "s", "num", "value", "fallback", "drawnLength", "options", "bp", "chains", "request", "nodes", "edges", "o", "segment", "link", "ids", "n", "first", "count", "per", "k", "drawn", "steps", "chainOf", "indexOf", "seedX", "seedY", "backbone", "adjacent", "seeded", "reference", "i", "v", "index", "id", "links", "edge", "a", "b", "fromSide", "toSide", "u", "off", "nb", "wt", "w", "components", "c", "comp", "members", "queue", "e", "stressLayout", "opts", "_b", "_c", "quality", "gap", "rand", "X", "Y", "nodePositions", "dmin", "total", "anySeed", "placed", "stressPlacement", "side", "points", "loose", "looseSeeded", "dmax", "etaMax", "etaMin", "walks", "iterations", "lambda", "logMin", "logMax", "move", "j", "d", "eta", "mu", "dx", "dy", "mag", "r", "rx", "ry", "walked", "walk", "length", "chain", "idx", "dir", "remaining", "hops", "step", "toEnd", "out", "next", "enterSide", "adjacentTerms", "order", "warm", "t", "tmp", "radius", "key", "x", "y", "grid", "list", "cx", "cy", "gx", "gy", "joined", "xs", "ys", "respace", "packComponents", "m", "bulge", "lengths", "seg", "span", "target", "chord", "ux", "uy", "along", "flat", "lengthAt", "f", "lo", "hi", "it", "mid", "rotateToPrincipalAxis", "minX", "minY", "maxY", "shift", "sxx", "syy", "sxy", "angle", "cos", "sin", "LAYOUT_ENGINES", "LAYOUT_ENGINE_VALUES", "e", "layoutEngine", "request", "start", "stressLayout", "fmmmLayout", "MEAN_NODE_LENGTH", "MIN_TOTAL_GRAPH_LENGTH", "BANDAGE_MINIMUM_NODE_LENGTH", "drawnNodeLength", "opts", "length", "bandageAutoScale", "graph", "minNodeLength", "megabases", "sum", "n", "target", "PROPORTIONAL_LENGTH", "isProportional", "law", "drawnLengthFor", "count", "totalLength", "meanBp", "meanDrawn", "bp", "relative", "LAYOUT_LENGTH_PRECISION", "PROPORTIONAL_SPREAD", "layoutScaling", "spread", "drawn", "node", "drawnLengthOf", "BUBBLE_SPREADS", "PROPORTIONAL_LENGTH", "BUBBLE_SPREAD_VALUES", "s", "spreadFor", "spread", "entry", "MEAN_NODE_LENGTH"]
@@ -0,0 +1,2 @@
1
+ import{c as te,o as se,r as ft}from"./chunk-NAC3EXT4.js";import{a as Et,c as ee,d as Bt,e as Ft}from"./chunk-B2MJV7HN.js";var ye="ws",we="we",ne=["elsewhere","break","end"],Ee={missing:"not in the graph",elsewhere:"on nodes filed elsewhere",unknown:"gap, cause unknown",abridged:"abridged: steps not loaded",deleted:"deleted in this haplotype"},Fe="outside the extracted subgraph";function oe(t,e,s){if(!e&&!s)return[{bp:t}];let n=Math.min(e?.trimmed??0,t),r=Math.min(s?.trimmed??0,t-n),c=t-n-r,p=e?.kind==="break"?Math.min(e.bp,c):0;c-=p;let l=s?.kind==="break"?Math.min(s.bp,c):0;c-=l;let h=[e,s].find(f=>f?.kind==="elsewhere");return[{bp:n},{bp:p,cause:"missing"},h?.kind==="elsewhere"?{bp:c,cause:"elsewhere",chunk:h.chunk}:{bp:c,cause:"unknown"},{bp:l,cause:"missing"},{bp:r}].filter(f=>f.bp>0)}function Ct(t,e){let s=t.bp[e],n=t.chunkRefs[e];return ae(t.kindNames[t.kinds[e]],Number.isNaN(s)?void 0:s,t.trimmed[e],n<0?void 0:{refName:t.chunkRefNames[n],start:t.chunkStarts[e]})}function ae(t,e,s,n){let r=s>0?{trimmed:s}:{};return t==="elsewhere"&&n?{kind:t,chunk:n,...e===void 0?{}:{bp:e},...r}:t==="break"&&e!==void 0?{kind:t,bp:e,...n?{chunk:n}:{},...r}:t==="end"?{kind:t,...r}:void 0}function re(t){let[e,...s]=t.split(","),n,r=0,c;for(let p of s)if(p.startsWith("bp="))n=+p.slice(3);else if(p.startsWith("trimmed="))r=+p.slice(8);else if(p.startsWith("chunk=")){let l=p.lastIndexOf(":");c={refName:p.slice(6,l),start:+p.slice(l+1)}}return ae(e,n,r,c)}function Gt(t,e){return{...t?{before:t}:{},...e?{after:e}:{}}}function Te(t){let e=t[ye],s=t[we];return Gt(typeof e=="string"?re(e):void 0,typeof s=="string"?re(s):void 0)}var Pe=class{constructor(){this.kinds=[],this.bp=[],this.trimmed=[],this.chunkRefs=[],this.chunkStarts=[],this.chunkRefNames=[],this.refIndex=new Map}push(t){this.kinds.push(ne.indexOf(t.kind)),this.bp.push("bp"in t&&t.bp!==void 0?t.bp:NaN),this.trimmed.push(t.trimmed??0);let e="chunk"in t?t.chunk:void 0;if(e){let s=this.refIndex.get(e.refName);s===void 0&&(s=this.chunkRefNames.length,this.refIndex.set(e.refName,s),this.chunkRefNames.push(e.refName)),this.chunkRefs.push(s),this.chunkStarts.push(e.start)}else this.chunkRefs.push(-1),this.chunkStarts.push(NaN)}table(){return{kinds:Uint8Array.from(this.kinds),kindNames:[...ne],bp:Float64Array.from(this.bp),trimmed:Float64Array.from(this.trimmed),chunkRefs:Int32Array.from(this.chunkRefs),chunkStarts:Float64Array.from(this.chunkStarts),chunkRefNames:this.chunkRefNames}}};function Se(t,e,s){return e===0?t:`${t}:${e}-${s}`}function Lt(t,e){let s=t.names[e],n=Ft(s),r=t.starts[e],c=t.abridgedSteps?.[e]??Number.NaN,p=Number.isNaN(c)?{}:{abridged:{steps:c,bp:t.abridgedBp?.[e]??0}};return n?{name:`${n.sample}#${n.haplotype}#${n.contig}`,start:r,...n,...Gt(t.before&&Ct(t.before,e),t.after&&Ct(t.after,e)),...p}:{name:Se(s,r,t.ends[e]),start:r}}function Ae(t,e,s,n){let r=new Int32Array(s+1);for(let h of t)r[h+1]++;for(let h=0;h<s;h++)r[h+1]+=r[h];let c=r.slice(0,s),p=new Int32Array(t.length);t.forEach((h,w)=>{p[c[h]++]=e[w]});let l=new Int32Array(n.length).fill(-1);return Array.from({length:s},(h,w)=>{let f=[];for(let F=r[w];F<r[w+1];F++){let v=p[F];l[v]!==w&&(l[v]=w,f.push(n[v]))}return f})}function Wt({nodes:t,links:e,walks:s},n){let r=new Uint8Array(t.names.length),c=(l,h)=>{r[l]===0&&(r[l]=h?2:1)};for(let l=0;l<e.from.length;l++)c(e.from[l],e.strands[l]&1),c(e.to[l],e.strands[l]&2);let p=s.offsets[s.names.length]??0;for(let l=0;l<p;l++){let h=s.steps[l];c(h,s.reversed[l]),n&&n[h]++}return t.names.map((l,h)=>`${l}${r[h]===2?"-":"+"}`)}function Le({nodes:t,links:e,walks:s},n="Imported GFA"){let r=t.names.length,c=t.lengths.length,p=[];for(let o=0;o<s.names.length;o++)s.offsets[o+1]>s.offsets[o]&&p.push(o);let l=new Int32Array(r),h=Wt({nodes:t,links:e,walks:s},l),w=[];for(let o=0;o<c;o++){let k=t.refs[o];w.push({id:h[o],name:t.names[o],length:t.lengths[o],depth:Math.max(l[o],1),stable:k<0?void 0:{refName:t.refNames[k],start:t.starts[o],rank:t.ranks[o]},samples:void 0})}let f=[],F=new Array(r),v=(o,k)=>{let g=F[o];if(g){for(let x=0;x<g.length;x+=2)if(g[x]===k)return g[x+1]}},E=(o,k,g)=>{let x=F[o];x?x.push(k,g):F[o]=[k,g]},B=[],Y=0;for(let o=0;o<e.from.length;o++){let k=e.from[o],g=e.to[o];f.push({from:h[k],to:h[g],fromStrand:e.strands[o]&1?"-":"+",toStrand:e.strands[o]&2?"-":"+"});let x=v(k,g);x===void 0&&(x=Y++,E(k,g,x),E(g,k,x)),B.push(x)}let U=new Int32Array(r+1);for(let o=0;o<r;o++)U[o+1]=U[o]+(F[o]?.length??0)/2;let tt=new Int32Array(U[r]),lt=new Int32Array(U[r]);F.forEach((o,k)=>{for(let g=0;g<o.length;g+=2)tt[U[k]+g/2]=o[g],lt[U[k]+g/2]=o[g+1]});let yt=(o,k)=>{for(let g=U[o];g<U[o+1];g++)if(tt[g]===k)return lt[g];return-1},V=new Map,et=[],T=new Int32Array(s.offsets[s.names.length]??0),ht=new Int32Array(T.length),Z=0,H=new Int32Array(Y).fill(-1),X=[],M=[],dt=s.offsets[s.names.length]??0,_=new Int32Array(dt),st=new Float64Array(dt),pt=new Uint8Array(dt),nt=new Int32Array(r).fill(-1),D=[],I=[0],P=[],mt=new Map,ut=[];for(let o of p){let k=Lt(s,o),{start:g,name:x}=k,z=k.sample===void 0?s.names[o]:x,K=V.get(z);K===void 0&&(K=et.length,V.set(z,K),et.push(z),P.push(Et(z)));let rt=mt.get(x);rt===void 0&&(rt=ut.length,mt.set(x,rt),ut.push(x));let Tt=P[K],gt=s.offsets[o],St=new Array(s.offsets[o+1]-gt),a=g,d=-1;for(let S=gt;S<s.offsets[o+1];S++){let R=s.steps[S];St[S-gt]=h[R],nt[R]===-1&&(nt[R]=I.at(-1),I.push(nt[R]+l[R]),D.push(R));let O=nt[R]++;if(_[O]=K,st[O]=a,pt[O]=s.reversed[S],a+=R<c?t.lengths[R]:0,d>=0){let N=yt(d,R);N>=0&&H[N]!==o&&(H[N]=o,T[Z]=N,ht[Z++]=rt)}d=R}X.push({...k,nodeIds:St}),M.push({name:z,sample:Tt,start:g,length:a-g})}let wt=Ae(T.subarray(0,Z),ht,Y,ut);f.forEach((o,k)=>{let g=wt[B[k]];g.length>0&&(o.pathIds=g)});let C=p.length>0;return{name:n,nodes:w,edges:f,paths:C?X:void 0,anchorPaths:C?M:void 0,pathVisits:C?new se({segments:D.map(o=>t.names[o]),offsets:Int32Array.from(I),path:_.subarray(0,I.at(-1)),start:st.subarray(0,I.at(-1)),reversed:pt.subarray(0,I.at(-1)),paths:et,samples:P}):void 0,anchoredBy:w.some(o=>o.stable)?"tags":void 0}}var Dt=1,le=2,vt=4,he=[void 0,"missing","elsewhere","unknown","abridged","deleted"],de=3,ie=t=>he.indexOf(t)<<de;function pe(t,e,s){return e!==void 0&&t.includes(e)?e:t.find(n=>s.has(n))??t[0]}function Ie(t){return pe((t.paths??[]).map(e=>ft(e.name).name),t.referencePath,new Set(t.nodes.flatMap(e=>e.stable?.rank===0?[e.stable.refName]:[])))}var me=t=>{let e=t&&Bt(t);return s=>s!==void 0&&(s===t||s===e)};function Re(t){let e=new Map,s=[],n=[],r=v=>{let E=e.get(v);return E===void 0&&(E=s.length,e.set(v,E),s.push(v),n.push(0)),E},c=Ie(t),p=me(c),l=new Map;for(let v of t.nodes){let E=r(v.id);n[E]=v.length,v.stable?.rank===0&&p(v.stable.refName)&&l.set(E,v.stable.start)}let h=t.paths??[],w=new Int32Array(h.length),f=new Int32Array(h.length),F=[];return h.forEach((v,E)=>{w[E]=F.length;for(let B of v.nodeIds)F.push(r(B));f[E]=F.length}),{heads:h,from:w,to:f,steps:Int32Array.from(F),lengths:Int32Array.from(n),names:s,reference:c,stableStart:v=>l.get(v)??Number.NaN}}function $e(t,e,s){let{nodes:n,walks:r}=t,c=[];for(let f=0;f<r.names.length;f++)r.offsets[f+1]>r.offsets[f]&&c.push(f);let p=c.map(f=>Lt(r,f)),l=new Set;for(let f=0;f<n.lengths.length;f++)n.refs[f]>=0&&n.ranks[f]===0&&l.add(n.refNames[n.refs[f]]);let h=pe(p.map(f=>ft(f.name).name),e,l),w=me(h);return{heads:p,from:Int32Array.from(c,f=>r.offsets[f]),to:Int32Array.from(c,f=>r.offsets[f+1]),steps:r.steps,lengths:n.lengths,names:s?Wt(t):n.names,reference:h,stableStart:f=>f<n.lengths.length&&n.ranks[f]===0&&w(n.refNames[n.refs[f]])?n.starts[f]:Number.NaN}}function Vt(t){return t.sample??Et(t.name)}function ce(t){return t.haplotype!==void 0&&t.sample!==void 0?`${t.sample}#${t.haplotype}`:Vt(t)}var fe=class{constructor(t){this.offsets=[0],this.values=Array.from({length:t},()=>[])}get length(){return this.values[0].length}push(t,e,s,n,r){let c=this.values;c[0].push(t),c[1].push(e),c[2].push(s),c[3].push(n),r!==void 0&&c[4].push(r)}endRow(){this.offsets.push(this.length)}reorder(t,e){let s=new Uint32Array(t.length+1);t.forEach((r,c)=>{s[c+1]=s[c]+this.offsets[r+1]-this.offsets[r]});let n=e.map((r,c)=>{let p=this.values[c],l=r(this.length),h=0;for(let w of t)for(let f=this.offsets[w];f<this.offsets[w+1];f++)l[h++]=p[f];return l});return{offsets:s,columns:n}}},kt=t=>new Float64Array(t);function ze(t,e,s={}){let{heads:n,from:r,to:c,steps:p,lengths:l,names:h,reference:w,stableStart:f}="walks"in t?$e(t,s.referencePath,s.visits):Re(t),F=l.length,v=a=>a<F?l[a]:0,E=a=>ft(n[a].name).name,B=a=>n[a].start,Y=(a,d)=>(B(a)??0)-(B(d)??0),U=n.map((a,d)=>d),tt=U.filter(a=>E(a)===w).sort(Y),lt=tt[0],yt=U.filter(a=>E(a)!==w),V="walks"in t?t.skips:void 0;if(lt===void 0||yt.length===0&&!V?.names.length)return;let et=te(yt,E),T=new Float64Array(h.length).fill(Number.NaN),ht=new Float64Array(h.length),Z=new Map,H=-1/0,X=1/0,M=e&&e.end>e.start?e:void 0;for(let a of tt){let d=B(a)??0;for(let S=r[a],R=c[a];S<R;S++){let O=p[S],N=v(O);if(Number.isNaN(T[O]))T[O]=d,ht[O]=d+N,M&&(d+N<=M.start&&(H=Math.max(H,d+N)),d>=M.end&&(X=Math.min(X,d)));else{let bt=Z.get(O);bt?bt.push(d):Z.set(O,[T[O],d])}d+=N}}let dt=M===void 0||H>-1/0&&X<1/0,_=new fe(5),st=[],pt=new Map,nt=a=>{if(!a)return-1;let d=`${a.refName}:${a.start}`,S=pt.get(d);return S===void 0&&(S=st.length,pt.set(d,S),st.push(a)),S},D=s.visits?new fe(4):void 0,I=new Int32Array(0),P=new Float64Array(0),mt=a=>{let d=n[a[0]],S=[...a].sort(Y),R=S.length-1,O=0;for(let i of S)R+=c[i]-r[i]+(n[i].abridged?1:0),O+=n[i].abridged?.steps??0;R>I.length&&(I=new Int32Array(R*2),P=new Float64Array(R*2));let N=0,bt=!1,At,It,q=new Map,Pt=0;for(let i of S){let m=B(i),y=m===void 0||At===void 0?0:m-At;(m===void 0||y<0)&&(bt=!0),y<0&&n[It].abridged&&(Pt-=y);let A=Math.min(Pt,Math.max(y,0));Pt-=A;let u=y-A;u>0&&(q.set(N,oe(u,It===void 0?void 0:n[It].after,n[i].before)),I[N]=-u,P[N++]=At);let b=m??0,$=n[i].abridged;for(let j=r[i],Q=c[i];j<Q;j++){let G=p[j],W=$?$.bp-(b-(m??0))-v(G):0;W>0&&j===Q-1&&j>r[i]&&(q.set(N,[{bp:W,cause:"abridged"}]),I[N]=-W,P[N++]=b,b+=W),I[N]=G,P[N++]=b,b+=v(G)}At=m===void 0?void 0:b,It=i}let Zt=i=>i>=0&&i<N&&I[i]>=0&&!Number.isNaN(T[I[i]]),_t=i=>{let m=I[i];return P[i]+(m<0?-m:v(m))},ue=(i,m)=>{let y=i>=0?i:m,A=-1;for(let G=1;A<0&&G<N;G++)A=[y-G,y+G].find(Zt)??-1;if(A<0)return;let u=A>y==T[I[A]]>T[I[y]],b=u===(y===i),$=b?N-1:0,j=Zt($);return{stop:{contigEnds:j,shortBp:j?Math.max(0,M.start-ht[I[$]],T[I[$]]-M.end):0},lo:b?y+1:0,hi:b?N:y,backward:!u,axisStart:u?b?_t(y):P[0]:b?_t(N-1):P[y]}},Rt=0,$t=N,ot=!1,Ht=!0,Nt=-1,Xt=-1,Ut,zt,Kt=(i,m)=>{let A=q.get(i)?.[0];if(m<=0||A?.cause!=="abridged")return 0;let u=Math.min(m,A.bp);return q.set(i,A.bp>u?[{...A,bp:A.bp-u}]:[]),I[i]+=u,u},qt=i=>q.get(i)?.[0]?.cause==="abridged",ge=i=>{let m=I[i];return m<0||q.has(i)?Number.NaN:Number.isNaN(T[m])&&(qt(i-1)||qt(i+1))?f(m):T[m]},Mt=0,Jt=0;if(M&&dt){let i=-1,m=-1,y=-1/0,A=1/0;for(let u=0;u<N;u++){let b=ge(u);if(!Number.isNaN(b)){let $=b+v(I[u]);$<=M.start&&$>y&&(y=$,i=u),b>=M.end&&b<A&&(A=b,m=u)}}if(i<0||m<0){Ht=!1;let u=i>=0||m>=0?ue(i,m):void 0;u&&({lo:Rt,hi:$t,backward:ot,axisStart:Ut,stop:zt}=u)}else{Rt=Math.min(i,m)+1,$t=Math.max(i,m),ot=i>m,Nt=i,Xt=m;let u=ot?-1:1;Mt=Kt(i+u,H-y),Jt=Kt(m-u,A-X)}}let xt=d.contig??Bt(ft(d.name).name),be=bt||N===0?void 0:Ut!==void 0?{contig:xt,start:Ut,reversed:ot}:Nt<0?{contig:xt,start:P[0],reversed:!1}:Nt<Xt?{contig:xt,start:_t(Nt)+Mt,reversed:!1}:{contig:xt,start:P[Nt]-Mt,reversed:!0},at=0,Qt=0,Yt=0,it=0,L=-1,ct=0,J=Number.NaN,Ot=Number.NaN,Ne=i=>{let m=Z.get(i);if(!m||Number.isNaN(Ot))return T[i];let y=v(i),A=m[0],u=1/0;for(let b of m){let $=Math.min(Math.abs(b-Ot),Math.abs(b+y-Ot));$<u&&(A=b,u=$)}return A},[,jt,ve,ke]=_.values;for(let i=Rt;i<$t;i++){let m=ot?$t-1-(i-Rt):i,y=I[m],A=q.get(m);if(A){for(let W of ot?[...A].reverse():A)_.push(at,W.bp,Number.NaN,vt|ie(W.cause),nt(W.chunk)),at+=W.bp;L=_.length-1,ct=vt,J=Number.NaN,Yt+=-y,it=0;continue}let u=v(y),b=Ne(y),$=!Number.isNaN(b);D?.push(y,at,u,$?1:0);let j=L>=0&&!Number.isNaN(J),Q=$&&j&&it>=0&&J+(jt[L]??0)===b,G=$&&j&&it<=0&&b+u===J;!$&&L>=0&&!(ct&(Dt|vt))?jt[L]+=u:Q||G?(jt[L]+=u,Q||(J=b,ve[L]=b,ct|=le,ke[L]=ct),it=Q?1:-1):(ct=$?Dt:0,J=$?b:Number.NaN,_.push(at,u,J,ct,-1),L=_.length-1,it=0),at+=u,$?Ot=it<0?b:b+u:Qt+=u}return _.endRow(),D?.endRow(),{name:d.name,label:ce(d),sample:Vt(d),haplotype:d.haplotype,bp:at,offReferenceBp:Qt,gapBp:Yt,complete:Ht,stop:zt,axis:be,...O>0?{abridgedSteps:O}:{},...Mt+Jt>0?{estimated:!0}:{}}},ut=(a,d,S)=>{let R=M?Math.max(d,M.start):d,O=(M?Math.min(S,M.end):S)-R;_.push(R-(M?M.start:d),O,Number.NaN,vt|ie("deleted"),-1),_.endRow(),D?.endRow();let N={name:a,...Ft(a)};return{name:a,label:ce(N),sample:Vt(N),haplotype:N.haplotype,bp:0,offReferenceBp:0,gapBp:O,complete:!0,stop:void 0,axis:void 0}},wt=mt(tt),C=[...et.values()].map((a,d)=>({meta:mt(a),row:d+1})),o=new Set(et.keys());V?.names.forEach((a,d)=>{let S=ft(a).name;o.has(S)||(o.add(S),C.push({meta:ut(S,V.starts[d],V.ends[d]),row:C.length+1}))});let k=[wt,...C.map(a=>a.meta)];if(new Set(k.map(a=>a.label)).size<k.length)for(let a of k)a.label=ee(a.name)??a.label;C.sort((a,d)=>Number(d.meta.complete)-Number(a.meta.complete)||d.meta.bp-a.meta.bp||a.meta.label.localeCompare(d.meta.label));let g=[0,...C.map(a=>a.row)],{offsets:x,columns:z}=_.reorder(g,[kt,kt,kt,a=>new Uint8Array(a),a=>new Int32Array(a)]),[K,rt,Tt,gt,St]=z;return{origin:M?M.start:B(lt)??0,rows:[wt,...C.map(a=>a.meta)],offsets:x,start:K,bp:rt,referenceStart:Tt,flags:gt,chunk:St,chunks:st,visits:D&&Me(D,g,h)}}function Me(t,e,s){let{offsets:n,columns:r}=t.reorder(e,[w=>new Int32Array(w),kt,kt,w=>new Uint8Array(w)]),[c,p,l,h]=r;return{offsets:n,node:c,start:p,bp:l,onReference:h,names:s}}function xe(t,e){let s=t.flags[e],n={start:t.start[e],bp:t.bp[e],onReference:(s&Dt)!==0};if(s&vt){n.gap=!0;let r=he[s>>de&7];r&&(n.cause=r);let c=t.chunks[t.chunk[e]];c&&(n.chunk=c)}else n.referenceStart=Number.isNaN(t.referenceStart[e])?void 0:t.referenceStart[e];return s&le&&(n.reversed=!0),n}function Oe(t,e){let s=[];for(let n=t.offsets[e];n<t.offsets[e+1];n++)s.push({node:t.names[t.node[n]],start:t.start[n],bp:t.bp[n],onReference:t.onReference[n]===1});return s}function Ke(t,e){let s=t.rows.map((n,r)=>{let c=[];for(let p=t.offsets[r];p<t.offsets[r+1];p++)c.push(xe(t,p));return{...n,runs:c,visits:t.visits&&Oe(t.visits,r)}});return{origin:t.origin,unit:e,reference:s[0],rows:s.slice(1)}}export{ye as a,we as b,Ee as c,Fe as d,oe as e,re as f,Te as g,Pe as h,Lt as i,Le as j,Ie as k,ze as l,Ke as m};
2
+ //# sourceMappingURL=chunk-QATGAV57.js.map
@@ -0,0 +1,7 @@
1
+ {
2
+ "version": 3,
3
+ "sources": ["../../node_modules/.pnpm/@jbrowse+bandage-core@12.1.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-VA5U4F23.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.1.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-4FPEQQFT.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.1.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-JJJIUIE2.js"],
4
+ "sourcesContent": ["// src/gfa/walkStops.ts\nvar START_STOP_TAG = \"ws\";\nvar END_STOP_TAG = \"we\";\nvar STOP_KINDS = [\"elsewhere\", \"break\", \"end\"];\nvar GAP_CAUSE_TEXT = {\n missing: \"not in the graph\",\n elsewhere: \"on nodes filed elsewhere\",\n unknown: \"gap, cause unknown\",\n abridged: \"abridged: steps not loaded\",\n // a walk file's skip row: the haplotype jumps over the window\n deleted: \"deleted in this haplotype\"\n};\nvar OUTSIDE_TEXT = \"outside the extracted subgraph\";\nfunction gapParts(bp, after, before) {\n if (!after && !before) {\n return [{ bp }];\n }\n const left = Math.min(after?.trimmed ?? 0, bp);\n const right = Math.min(before?.trimmed ?? 0, bp - left);\n let rest = bp - left - right;\n const lead = after?.kind === \"break\" ? Math.min(after.bp, rest) : 0;\n rest -= lead;\n const trail = before?.kind === \"break\" ? Math.min(before.bp, rest) : 0;\n rest -= trail;\n const elsewhere = [after, before].find((s) => s?.kind === \"elsewhere\");\n const parts = [\n { bp: left },\n { bp: lead, cause: \"missing\" },\n elsewhere?.kind === \"elsewhere\" ? { bp: rest, cause: \"elsewhere\", chunk: elsewhere.chunk } : { bp: rest, cause: \"unknown\" },\n { bp: trail, cause: \"missing\" },\n { bp: right }\n ];\n return parts.filter((part) => part.bp > 0);\n}\nfunction stopAt(table, i) {\n const bp = table.bp[i];\n const ref = table.chunkRefs[i];\n return stopOf(\n table.kindNames[table.kinds[i]],\n Number.isNaN(bp) ? void 0 : bp,\n table.trimmed[i],\n ref < 0 ? void 0 : { refName: table.chunkRefNames[ref], start: table.chunkStarts[i] }\n );\n}\nfunction stopOf(kind, bp, trimmed, chunk) {\n const cut = trimmed > 0 ? { trimmed } : {};\n if (kind === \"elsewhere\" && chunk) {\n return { kind, chunk, ...bp === void 0 ? {} : { bp }, ...cut };\n }\n if (kind === \"break\" && bp !== void 0) {\n return { kind, bp, ...chunk ? { chunk } : {}, ...cut };\n }\n return kind === \"end\" ? { kind, ...cut } : void 0;\n}\nfunction stopTag(stop) {\n const parts = [stop.kind];\n if (\"bp\" in stop && stop.bp !== void 0) {\n parts.push(`bp=${stop.bp}`);\n }\n if (stop.trimmed) {\n parts.push(`trimmed=${stop.trimmed}`);\n }\n if (\"chunk\" in stop && stop.chunk) {\n parts.push(`chunk=${stop.chunk.refName}:${stop.chunk.start}`);\n }\n return parts.join(\",\");\n}\nfunction parseStopTag(value) {\n const [kind, ...fields] = value.split(\",\");\n let bp;\n let trimmed = 0;\n let chunk;\n for (const field of fields) {\n if (field.startsWith(\"bp=\")) {\n bp = +field.slice(3);\n } else if (field.startsWith(\"trimmed=\")) {\n trimmed = +field.slice(8);\n } else if (field.startsWith(\"chunk=\")) {\n const at = field.lastIndexOf(\":\");\n chunk = { refName: field.slice(6, at), start: +field.slice(at + 1) };\n }\n }\n return stopOf(kind, bp, trimmed, chunk);\n}\nfunction stopFields(before, after) {\n return {\n ...before ? { before } : {},\n ...after ? { after } : {}\n };\n}\nfunction walkStopFields(tags) {\n const before = tags[START_STOP_TAG];\n const after = tags[END_STOP_TAG];\n return stopFields(\n typeof before === \"string\" ? parseStopTag(before) : void 0,\n typeof after === \"string\" ? parseStopTag(after) : void 0\n );\n}\nfunction walkStopTags(walks, p) {\n const tags = [];\n for (const [tag, table] of [\n [START_STOP_TAG, walks.before],\n [END_STOP_TAG, walks.after]\n ]) {\n const stop = table && stopAt(table, p);\n if (stop) {\n tags.push(`\t${tag}:Z:${stopTag(stop)}`);\n }\n }\n return tags.join(\"\");\n}\nvar StopColumns = class {\n constructor() {\n this.kinds = [];\n this.bp = [];\n this.trimmed = [];\n this.chunkRefs = [];\n this.chunkStarts = [];\n this.chunkRefNames = [];\n this.refIndex = /* @__PURE__ */ new Map();\n }\n push(stop) {\n this.kinds.push(STOP_KINDS.indexOf(stop.kind));\n this.bp.push(\"bp\" in stop && stop.bp !== void 0 ? stop.bp : NaN);\n this.trimmed.push(stop.trimmed ?? 0);\n const chunk = \"chunk\" in stop ? stop.chunk : void 0;\n if (chunk) {\n let ref = this.refIndex.get(chunk.refName);\n if (ref === void 0) {\n ref = this.chunkRefNames.length;\n this.refIndex.set(chunk.refName, ref);\n this.chunkRefNames.push(chunk.refName);\n }\n this.chunkRefs.push(ref);\n this.chunkStarts.push(chunk.start);\n } else {\n this.chunkRefs.push(-1);\n this.chunkStarts.push(NaN);\n }\n }\n table() {\n return {\n kinds: Uint8Array.from(this.kinds),\n kindNames: [...STOP_KINDS],\n bp: Float64Array.from(this.bp),\n trimmed: Float64Array.from(this.trimmed),\n chunkRefs: Int32Array.from(this.chunkRefs),\n chunkStarts: Float64Array.from(this.chunkStarts),\n chunkRefNames: this.chunkRefNames\n };\n }\n};\n\nexport {\n START_STOP_TAG,\n END_STOP_TAG,\n GAP_CAUSE_TEXT,\n OUTSIDE_TEXT,\n gapParts,\n stopAt,\n stopTag,\n parseStopTag,\n stopFields,\n walkStopFields,\n walkStopTags,\n StopColumns\n};\n", "import {\n stopAt,\n stopFields,\n walkStopTags\n} from \"./chunk-VA5U4F23.js\";\nimport {\n PathVisits\n} from \"./chunk-BEUTROKU.js\";\nimport {\n panSNFields,\n panSNSample\n} from \"./chunk-2JL2JVZ2.js\";\n\n// src/gfa/graphTables.ts\nfunction pLineName(name, start, end) {\n return start === 0 ? name : `${name}:${start}-${end}`;\n}\nfunction tablePath(w, p) {\n const walkName = w.names[p];\n const fields = panSNFields(walkName);\n const start = w.starts[p];\n const steps = w.abridgedSteps?.[p] ?? Number.NaN;\n const abridged = Number.isNaN(steps) ? {} : { abridged: { steps, bp: w.abridgedBp?.[p] ?? 0 } };\n return fields ? {\n name: `${fields.sample}#${fields.haplotype}#${fields.contig}`,\n start,\n ...fields,\n ...stopFields(\n w.before && stopAt(w.before, p),\n w.after && stopAt(w.after, p)\n ),\n ...abridged\n } : { name: pLineName(walkName, start, w.ends[p]), start };\n}\nfunction namesByList(lists, names, listCount, pathNames) {\n const starts = new Int32Array(listCount + 1);\n for (const list of lists) {\n starts[list + 1]++;\n }\n for (let i = 0; i < listCount; i++) {\n starts[i + 1] += starts[i];\n }\n const fill = starts.slice(0, listCount);\n const grouped = new Int32Array(lists.length);\n lists.forEach((list, i) => {\n grouped[fill[list]++] = names[i];\n });\n const listed = new Int32Array(pathNames.length).fill(-1);\n return Array.from({ length: listCount }, (_, list) => {\n const out = [];\n for (let i = starts[list]; i < starts[list + 1]; i++) {\n const k = grouped[i];\n if (listed[k] !== list) {\n listed[k] = list;\n out.push(pathNames[k]);\n }\n }\n return out;\n });\n}\nfunction tableNodeIds({ nodes: n, links: l, walks: w }, traversals) {\n const canonical = new Uint8Array(n.names.length);\n const claim = (node, reversed) => {\n if (canonical[node] === 0) {\n canonical[node] = reversed ? 2 : 1;\n }\n };\n for (let i = 0; i < l.from.length; i++) {\n claim(l.from[i], l.strands[i] & 1);\n claim(l.to[i], l.strands[i] & 2);\n }\n const stepCount = w.offsets[w.names.length] ?? 0;\n for (let s = 0; s < stepCount; s++) {\n const node = w.steps[s];\n claim(node, w.reversed[s]);\n if (traversals) {\n traversals[node]++;\n }\n }\n return n.names.map(\n (segment, i) => `${segment}${canonical[i] === 2 ? \"-\" : \"+\"}`\n );\n}\nfunction graphFromTables({ nodes: n, links: l, walks: w }, name = \"Imported GFA\") {\n const count = n.names.length;\n const declared = n.lengths.length;\n const drawnWalks = [];\n for (let p = 0; p < w.names.length; p++) {\n if (w.offsets[p + 1] > w.offsets[p]) {\n drawnWalks.push(p);\n }\n }\n const traversals = new Int32Array(count);\n const ids = tableNodeIds({ nodes: n, links: l, walks: w }, traversals);\n const nodes = [];\n for (let i = 0; i < declared; i++) {\n const ref = n.refs[i];\n nodes.push({\n id: ids[i],\n name: n.names[i],\n length: n.lengths[i],\n depth: Math.max(traversals[i], 1),\n stable: ref < 0 ? void 0 : {\n refName: n.refNames[ref],\n start: n.starts[i],\n rank: n.ranks[i]\n },\n samples: void 0\n });\n }\n const edges = [];\n const neighbours = new Array(count);\n const pairList = (a, b) => {\n const near = neighbours[a];\n if (near) {\n for (let j = 0; j < near.length; j += 2) {\n if (near[j] === b) {\n return near[j + 1];\n }\n }\n }\n return void 0;\n };\n const addPair = (a, b, list) => {\n const near = neighbours[a];\n if (near) {\n near.push(b, list);\n } else {\n neighbours[a] = [b, list];\n }\n };\n const edgeLists = [];\n let lists = 0;\n for (let i = 0; i < l.from.length; i++) {\n const a = l.from[i];\n const b = l.to[i];\n edges.push({\n from: ids[a],\n to: ids[b],\n fromStrand: l.strands[i] & 1 ? \"-\" : \"+\",\n toStrand: l.strands[i] & 2 ? \"-\" : \"+\"\n });\n let list = pairList(a, b);\n if (list === void 0) {\n list = lists++;\n addPair(a, b, list);\n addPair(b, a, list);\n }\n edgeLists.push(list);\n }\n const adjacency = new Int32Array(count + 1);\n for (let a = 0; a < count; a++) {\n adjacency[a + 1] = adjacency[a] + (neighbours[a]?.length ?? 0) / 2;\n }\n const adjacentNode = new Int32Array(adjacency[count]);\n const adjacentList = new Int32Array(adjacency[count]);\n neighbours.forEach((near, a) => {\n for (let j = 0; j < near.length; j += 2) {\n adjacentNode[adjacency[a] + j / 2] = near[j];\n adjacentList[adjacency[a] + j / 2] = near[j + 1];\n }\n });\n const listOf = (a, b) => {\n for (let j = adjacency[a]; j < adjacency[a + 1]; j++) {\n if (adjacentNode[j] === b) {\n return adjacentList[j];\n }\n }\n return -1;\n };\n const nameIndex = /* @__PURE__ */ new Map();\n const pathNames = [];\n const crossedList = new Int32Array(w.offsets[w.names.length] ?? 0);\n const crossedName = new Int32Array(crossedList.length);\n let crossings = 0;\n const lastWalk = new Int32Array(lists).fill(-1);\n const paths = [];\n const anchorPaths = [];\n const totalSteps = w.offsets[w.names.length] ?? 0;\n const visitPath = new Int32Array(totalSteps);\n const visitStart = new Float64Array(totalSteps);\n const visitReversed = new Uint8Array(totalSteps);\n const fill = new Int32Array(count).fill(-1);\n const visitOrder = [];\n const blocks = [0];\n const pathSamples = [];\n const edgeNameIndex = /* @__PURE__ */ new Map();\n const edgeNames = [];\n for (const p of drawnWalks) {\n const head = tablePath(w, p);\n const { start, name: pathName } = head;\n const visitName = head.sample === void 0 ? w.names[p] : pathName;\n let named = nameIndex.get(visitName);\n if (named === void 0) {\n named = pathNames.length;\n nameIndex.set(visitName, named);\n pathNames.push(visitName);\n pathSamples.push(panSNSample(visitName));\n }\n let edgeNamed = edgeNameIndex.get(pathName);\n if (edgeNamed === void 0) {\n edgeNamed = edgeNames.length;\n edgeNameIndex.set(pathName, edgeNamed);\n edgeNames.push(pathName);\n }\n const visitSample = pathSamples[named];\n const first = w.offsets[p];\n const nodeIds = new Array(w.offsets[p + 1] - first);\n let pos = start;\n let prev = -1;\n for (let s = first; s < w.offsets[p + 1]; s++) {\n const node = w.steps[s];\n nodeIds[s - first] = ids[node];\n if (fill[node] === -1) {\n fill[node] = blocks.at(-1);\n blocks.push(fill[node] + traversals[node]);\n visitOrder.push(node);\n }\n const at = fill[node]++;\n visitPath[at] = named;\n visitStart[at] = pos;\n visitReversed[at] = w.reversed[s];\n pos += node < declared ? n.lengths[node] : 0;\n if (prev >= 0) {\n const list = listOf(prev, node);\n if (list >= 0 && lastWalk[list] !== p) {\n lastWalk[list] = p;\n crossedList[crossings] = list;\n crossedName[crossings++] = edgeNamed;\n }\n }\n prev = node;\n }\n paths.push({ ...head, nodeIds });\n anchorPaths.push({\n name: visitName,\n sample: visitSample,\n start,\n length: pos - start\n });\n }\n const listNames = namesByList(\n crossedList.subarray(0, crossings),\n crossedName,\n lists,\n edgeNames\n );\n edges.forEach((edge, i) => {\n const names = listNames[edgeLists[i]];\n if (names.length > 0) {\n edge.pathIds = names;\n }\n });\n const walked = drawnWalks.length > 0;\n return {\n name,\n nodes,\n edges,\n paths: walked ? paths : void 0,\n anchorPaths: walked ? anchorPaths : void 0,\n pathVisits: walked ? new PathVisits({\n segments: visitOrder.map((node) => n.names[node]),\n offsets: Int32Array.from(blocks),\n path: visitPath.subarray(0, blocks.at(-1)),\n start: visitStart.subarray(0, blocks.at(-1)),\n reversed: visitReversed.subarray(0, blocks.at(-1)),\n paths: pathNames,\n samples: pathSamples\n }) : void 0,\n anchoredBy: nodes.some((node) => node.stable) ? \"tags\" : void 0\n };\n}\nfunction graphTablesGFA({ nodes, links, walks }) {\n const { names } = nodes;\n const lines = [\"H\tVN:Z:1.1\"];\n for (let i = 0; i < nodes.lengths.length; i++) {\n const ref = nodes.refs[i];\n const stable = ref < 0 ? \"\" : `\tSN:Z:${nodes.refNames[ref]}\tSO:i:${nodes.starts[i]}\tSR:i:${nodes.ranks[i]}`;\n lines.push(`S\t${names[i]}\t*\tLN:i:${nodes.lengths[i]}${stable}`);\n }\n for (let i = 0; i < links.from.length; i++) {\n const strands = links.strands[i];\n lines.push(\n `L\t${names[links.from[i]]}\t${strands & 1 ? \"-\" : \"+\"}\t${names[links.to[i]]}\t${strands & 2 ? \"-\" : \"+\"}\t0M`\n );\n }\n for (let p = 0; p < walks.names.length; p++) {\n const name = walks.names[p];\n const fields = panSNFields(name);\n const start = walks.starts[p];\n const end = walks.ends[p];\n const steps = [];\n for (let s = walks.offsets[p]; s < walks.offsets[p + 1]; s++) {\n steps.push([names[walks.steps[s]], walks.reversed[s]]);\n }\n lines.push(\n fields ? `W\t${fields.sample}\t${fields.haplotype}\t${fields.contig}\t${start}\t${end}\t${steps.map(([id, rev]) => (rev ? \"<\" : \">\") + id).join(\"\")}${walkStopTags(walks, p)}` : `P\t${pLineName(name, start, end)}\t${steps.map(([id, rev]) => id + (rev ? \"-\" : \"+\")).join(\",\")}\t*`\n );\n }\n return lines.join(\"\\n\");\n}\n\nexport {\n tablePath,\n tableNodeIds,\n graphFromTables,\n graphTablesGFA\n};\n", "import {\n tableNodeIds,\n tablePath\n} from \"./chunk-4FPEQQFT.js\";\nimport {\n gapParts\n} from \"./chunk-VA5U4F23.js\";\nimport {\n pathOrigin\n} from \"./chunk-BRH73RCH.js\";\nimport {\n groupBy\n} from \"./chunk-BSOZW3FC.js\";\nimport {\n panSNContig,\n panSNFields,\n panSNHaplotype,\n panSNSample\n} from \"./chunk-2JL2JVZ2.js\";\n\n// src/layout/walkRowRuns.ts\nvar RUN_ON_REFERENCE = 1;\nvar RUN_REVERSED = 2;\nvar RUN_GAP = 4;\nvar GAP_CAUSES = [\n void 0,\n \"missing\",\n \"elsewhere\",\n \"unknown\",\n \"abridged\",\n \"deleted\"\n];\nvar CAUSE_SHIFT = 3;\nvar causeFlags = (cause) => GAP_CAUSES.indexOf(cause) << CAUSE_SHIFT;\nfunction referenceOf(names, referencePath, rankZero) {\n return referencePath !== void 0 && names.includes(referencePath) ? referencePath : names.find((n) => rankZero.has(n)) ?? names[0];\n}\nfunction referenceWalkName(graph) {\n return referenceOf(\n (graph.paths ?? []).map((p) => pathOrigin(p.name).name),\n graph.referencePath,\n new Set(\n graph.nodes.flatMap(\n (n) => n.stable?.rank === 0 ? [n.stable.refName] : []\n )\n )\n );\n}\nvar namesReference = (reference) => {\n const contig = reference && panSNContig(reference);\n return (name) => name !== void 0 && (name === reference || name === contig);\n};\nfunction graphPieces(graph) {\n const index = /* @__PURE__ */ new Map();\n const names = [];\n const lengths = [];\n const indexOf = (id) => {\n let i = index.get(id);\n if (i === void 0) {\n i = names.length;\n index.set(id, i);\n names.push(id);\n lengths.push(0);\n }\n return i;\n };\n const reference = referenceWalkName(graph);\n const onReferenceContig = namesReference(reference);\n const stable = /* @__PURE__ */ new Map();\n for (const node of graph.nodes) {\n const i = indexOf(node.id);\n lengths[i] = node.length;\n if (node.stable?.rank === 0 && onReferenceContig(node.stable.refName)) {\n stable.set(i, node.stable.start);\n }\n }\n const heads = graph.paths ?? [];\n const from = new Int32Array(heads.length);\n const to = new Int32Array(heads.length);\n const steps = [];\n heads.forEach((path, p) => {\n from[p] = steps.length;\n for (const id of path.nodeIds) {\n steps.push(indexOf(id));\n }\n to[p] = steps.length;\n });\n return {\n heads,\n from,\n to,\n steps: Int32Array.from(steps),\n lengths: Int32Array.from(lengths),\n names,\n reference,\n stableStart: (node) => stable.get(node) ?? Number.NaN\n };\n}\nfunction tablePieces(tables, referencePath, visits) {\n const { nodes: n, walks: w } = tables;\n const kept = [];\n for (let p = 0; p < w.names.length; p++) {\n if (w.offsets[p + 1] > w.offsets[p]) {\n kept.push(p);\n }\n }\n const heads = kept.map((p) => tablePath(w, p));\n const rankZero = /* @__PURE__ */ new Set();\n for (let i = 0; i < n.lengths.length; i++) {\n if (n.refs[i] >= 0 && n.ranks[i] === 0) {\n rankZero.add(n.refNames[n.refs[i]]);\n }\n }\n const reference = referenceOf(\n heads.map((h) => pathOrigin(h.name).name),\n referencePath,\n rankZero\n );\n const onReferenceContig = namesReference(reference);\n return {\n heads,\n from: Int32Array.from(kept, (p) => w.offsets[p]),\n to: Int32Array.from(kept, (p) => w.offsets[p + 1]),\n steps: w.steps,\n lengths: n.lengths,\n // a visit names its node as the Graph does, which costs a pass over the\n // steps\n names: visits ? tableNodeIds(tables) : n.names,\n reference,\n stableStart: (node) => node < n.lengths.length && n.ranks[node] === 0 && onReferenceContig(n.refNames[n.refs[node]]) ? n.starts[node] : Number.NaN\n };\n}\nfunction sampleOf(path) {\n return path.sample ?? panSNSample(path.name);\n}\nfunction labelOf(path) {\n return path.haplotype !== void 0 && path.sample !== void 0 ? `${path.sample}#${path.haplotype}` : sampleOf(path);\n}\nvar Columns = class {\n constructor(width) {\n this.offsets = [0];\n this.values = Array.from({ length: width }, () => []);\n }\n get length() {\n return this.values[0].length;\n }\n push(a, b, c, d, e) {\n const v = this.values;\n v[0].push(a);\n v[1].push(b);\n v[2].push(c);\n v[3].push(d);\n if (e !== void 0) {\n v[4].push(e);\n }\n }\n endRow() {\n this.offsets.push(this.length);\n }\n // the rows in `order`, column i in the array `make[i]` makes\n reorder(order, make) {\n const offsets = new Uint32Array(order.length + 1);\n order.forEach((row, i) => {\n offsets[i + 1] = offsets[i] + this.offsets[row + 1] - this.offsets[row];\n });\n const columns = make.map((m, c) => {\n const from = this.values[c];\n const out = m(this.length);\n let at = 0;\n for (const row of order) {\n for (let k = this.offsets[row]; k < this.offsets[row + 1]; k++) {\n out[at++] = from[k];\n }\n }\n return out;\n });\n return { offsets, columns };\n }\n};\nvar float64 = (n) => new Float64Array(n);\nfunction walkRowRuns(source, region, o = {}) {\n const {\n heads,\n from,\n to,\n steps: all,\n lengths,\n names,\n reference,\n stableStart\n } = \"walks\" in source ? tablePieces(source, o.referencePath, o.visits) : graphPieces(source);\n const declared = lengths.length;\n const lengthOf = (node) => node < declared ? lengths[node] : 0;\n const nameOf = (p) => pathOrigin(heads[p].name).name;\n const startOf = (p) => heads[p].start;\n const byStart = (a, b) => (startOf(a) ?? 0) - (startOf(b) ?? 0);\n const pieceIds = heads.map((_, p) => p);\n const referencePieces = pieceIds.filter((p) => nameOf(p) === reference).sort(byStart);\n const first = referencePieces[0];\n const others = pieceIds.filter((p) => nameOf(p) !== reference);\n const skips = \"walks\" in source ? source.skips : void 0;\n if (first === void 0 || others.length === 0 && !skips?.names.length) {\n return void 0;\n }\n const walks = groupBy(others, nameOf);\n const spanStart = new Float64Array(names.length).fill(Number.NaN);\n const spanEnd = new Float64Array(names.length);\n const revisits = /* @__PURE__ */ new Map();\n let flankEnd = -Infinity;\n let flankStart = Infinity;\n const cut = region && region.end > region.start ? region : void 0;\n for (const piece of referencePieces) {\n let pos = startOf(piece) ?? 0;\n for (let s = from[piece], stop = to[piece]; s < stop; s++) {\n const node = all[s];\n const len = lengthOf(node);\n if (!Number.isNaN(spanStart[node])) {\n const starts = revisits.get(node);\n if (starts) {\n starts.push(pos);\n } else {\n revisits.set(node, [spanStart[node], pos]);\n }\n } else {\n spanStart[node] = pos;\n spanEnd[node] = pos + len;\n if (cut) {\n if (pos + len <= cut.start) {\n flankEnd = Math.max(flankEnd, pos + len);\n }\n if (pos >= cut.end) {\n flankStart = Math.min(flankStart, pos);\n }\n }\n }\n pos += len;\n }\n }\n const flanked = cut === void 0 || flankEnd > -Infinity && flankStart < Infinity;\n const runs = new Columns(5);\n const chunks = [];\n const chunkIndex = /* @__PURE__ */ new Map();\n const chunkOf = (chunk2) => {\n if (!chunk2) {\n return -1;\n }\n const key = `${chunk2.refName}:${chunk2.start}`;\n let i = chunkIndex.get(key);\n if (i === void 0) {\n i = chunks.length;\n chunkIndex.set(key, i);\n chunks.push(chunk2);\n }\n return i;\n };\n const visits = o.visits ? new Columns(4) : void 0;\n let steps = new Int32Array(0);\n let stepStart = new Float64Array(0);\n const rowOf = (pieces) => {\n const head = heads[pieces[0]];\n const ordered = [...pieces].sort(byStart);\n let count = ordered.length - 1;\n let abridgedSteps = 0;\n for (const piece of ordered) {\n count += to[piece] - from[piece] + (heads[piece].abridged ? 1 : 0);\n abridgedSteps += heads[piece].abridged?.steps ?? 0;\n }\n if (count > steps.length) {\n steps = new Int32Array(count * 2);\n stepStart = new Float64Array(count * 2);\n }\n let length = 0;\n let unplaced = false;\n let end;\n let previous;\n const partsAt = /* @__PURE__ */ new Map();\n let owed = 0;\n for (const piece of ordered) {\n const start2 = startOf(piece);\n const jump = start2 === void 0 || end === void 0 ? 0 : start2 - end;\n if (start2 === void 0 || jump < 0) {\n unplaced = true;\n }\n if (jump < 0 && heads[previous].abridged) {\n owed -= jump;\n }\n const covered = Math.min(owed, Math.max(jump, 0));\n owed -= covered;\n const gap = jump - covered;\n if (gap > 0) {\n partsAt.set(\n length,\n gapParts(\n gap,\n previous === void 0 ? void 0 : heads[previous].after,\n heads[piece].before\n )\n );\n steps[length] = -gap;\n stepStart[length++] = end;\n }\n let pos = start2 ?? 0;\n const abridged = heads[piece].abridged;\n for (let s = from[piece], stop2 = to[piece]; s < stop2; s++) {\n const node = all[s];\n const bp3 = abridged ? abridged.bp - (pos - (start2 ?? 0)) - lengthOf(node) : 0;\n if (bp3 > 0 && s === stop2 - 1 && s > from[piece]) {\n partsAt.set(length, [{ bp: bp3, cause: \"abridged\" }]);\n steps[length] = -bp3;\n stepStart[length++] = pos;\n pos += bp3;\n }\n steps[length] = node;\n stepStart[length++] = pos;\n pos += lengthOf(node);\n }\n end = start2 === void 0 ? void 0 : pos;\n previous = piece;\n }\n const onReference = (i) => i >= 0 && i < length && steps[i] >= 0 && !Number.isNaN(spanStart[steps[i]]);\n const stepEnd = (i) => {\n const id = steps[i];\n return stepStart[i] + (id < 0 ? -id : lengthOf(id));\n };\n const partialSide = (i0, i1) => {\n const flank = i0 >= 0 ? i0 : i1;\n let near = -1;\n for (let d = 1; near < 0 && d < length; d++) {\n near = [flank - d, flank + d].find(onReference) ?? -1;\n }\n if (near < 0) {\n return void 0;\n }\n const forward = near > flank === spanStart[steps[near]] > spanStart[steps[flank]];\n const after = forward === (flank === i0);\n const last2 = after ? length - 1 : 0;\n const contigEnds = onReference(last2);\n const stop2 = {\n contigEnds,\n shortBp: contigEnds ? Math.max(\n 0,\n cut.start - spanEnd[steps[last2]],\n spanStart[steps[last2]] - cut.end\n ) : 0\n };\n return {\n stop: stop2,\n lo: after ? flank + 1 : 0,\n hi: after ? length : flank,\n backward: !forward,\n axisStart: forward ? after ? stepEnd(flank) : stepStart[0] : after ? stepEnd(length - 1) : stepStart[flank]\n };\n };\n let lo = 0;\n let hi = length;\n let backward = false;\n let complete = true;\n let flankFrom = -1;\n let flankTo = -1;\n let axisStart;\n let stop;\n const trimAbridged = (inner, bp3) => {\n const parts = partsAt.get(inner);\n const gap = parts?.[0];\n if (bp3 <= 0 || gap?.cause !== \"abridged\") {\n return 0;\n }\n const trimmed = Math.min(bp3, gap.bp);\n partsAt.set(\n inner,\n gap.bp > trimmed ? [{ ...gap, bp: gap.bp - trimmed }] : []\n );\n steps[inner] += trimmed;\n return trimmed;\n };\n const abridgedAt = (i) => partsAt.get(i)?.[0]?.cause === \"abridged\";\n const placeStart = (i) => {\n const id = steps[i];\n if (id < 0 || partsAt.has(i)) {\n return Number.NaN;\n }\n return Number.isNaN(spanStart[id]) && (abridgedAt(i - 1) || abridgedAt(i + 1)) ? stableStart(id) : spanStart[id];\n };\n let leftTrim = 0;\n let rightTrim = 0;\n if (cut && flanked) {\n let i0 = -1;\n let i1 = -1;\n let bestEnd = -Infinity;\n let bestStart = Infinity;\n for (let i = 0; i < length; i++) {\n const start2 = placeStart(i);\n if (!Number.isNaN(start2)) {\n const end2 = start2 + lengthOf(steps[i]);\n if (end2 <= cut.start && end2 > bestEnd) {\n bestEnd = end2;\n i0 = i;\n }\n if (start2 >= cut.end && start2 < bestStart) {\n bestStart = start2;\n i1 = i;\n }\n }\n }\n if (i0 < 0 || i1 < 0) {\n complete = false;\n const inside = i0 >= 0 || i1 >= 0 ? partialSide(i0, i1) : void 0;\n if (inside) {\n ;\n ({ lo, hi, backward, axisStart, stop } = inside);\n }\n } else {\n lo = Math.min(i0, i1) + 1;\n hi = Math.max(i0, i1);\n backward = i0 > i1;\n flankFrom = i0;\n flankTo = i1;\n const inward = backward ? -1 : 1;\n leftTrim = trimAbridged(i0 + inward, flankEnd - bestEnd);\n rightTrim = trimAbridged(i1 - inward, bestStart - flankStart);\n }\n }\n const contig = head.contig ?? panSNContig(pathOrigin(head.name).name);\n const axis = unplaced || length === 0 ? void 0 : axisStart !== void 0 ? { contig, start: axisStart, reversed: backward } : flankFrom < 0 ? { contig, start: stepStart[0], reversed: false } : flankFrom < flankTo ? {\n contig,\n start: stepEnd(flankFrom) + leftTrim,\n reversed: false\n } : {\n contig,\n start: stepStart[flankFrom] - leftTrim,\n reversed: true\n };\n let bp2 = 0;\n let offReferenceBp = 0;\n let gapBp = 0;\n let step = 0;\n let last = -1;\n let lastFlags = 0;\n let lastRef = Number.NaN;\n let cursor = Number.NaN;\n const placeOf = (id) => {\n const starts = revisits.get(id);\n if (!starts || Number.isNaN(cursor)) {\n return spanStart[id];\n }\n const len = lengthOf(id);\n let best = starts[0];\n let bestGap = Infinity;\n for (const start2 of starts) {\n const gap = Math.min(\n Math.abs(start2 - cursor),\n Math.abs(start2 + len - cursor)\n );\n if (gap < bestGap) {\n best = start2;\n bestGap = gap;\n }\n }\n return best;\n };\n const [, runBp, runRef, runFlags] = runs.values;\n for (let k = lo; k < hi; k++) {\n const index = backward ? hi - 1 - (k - lo) : k;\n const id = steps[index];\n const parts = partsAt.get(index);\n if (parts) {\n for (const part of backward ? [...parts].reverse() : parts) {\n runs.push(\n bp2,\n part.bp,\n Number.NaN,\n RUN_GAP | causeFlags(part.cause),\n chunkOf(part.chunk)\n );\n bp2 += part.bp;\n }\n last = runs.length - 1;\n lastFlags = RUN_GAP;\n lastRef = Number.NaN;\n gapBp += -id;\n step = 0;\n continue;\n }\n const len = lengthOf(id);\n const at = placeOf(id);\n const on = !Number.isNaN(at);\n visits?.push(id, bp2, len, on ? 1 : 0);\n const placed = last >= 0 && !Number.isNaN(lastRef);\n const forward = on && placed && step >= 0 && lastRef + (runBp[last] ?? 0) === at;\n const back = on && placed && step <= 0 && at + len === lastRef;\n if (!on && last >= 0 && !(lastFlags & (RUN_ON_REFERENCE | RUN_GAP))) {\n runBp[last] += len;\n } else if (forward || back) {\n runBp[last] += len;\n if (!forward) {\n lastRef = at;\n runRef[last] = at;\n lastFlags |= RUN_REVERSED;\n runFlags[last] = lastFlags;\n }\n step = forward ? 1 : -1;\n } else {\n lastFlags = on ? RUN_ON_REFERENCE : 0;\n lastRef = on ? at : Number.NaN;\n runs.push(bp2, len, lastRef, lastFlags, -1);\n last = runs.length - 1;\n step = 0;\n }\n bp2 += len;\n if (on) {\n cursor = step < 0 ? at : at + len;\n } else {\n offReferenceBp += len;\n }\n }\n runs.endRow();\n visits?.endRow();\n return {\n name: head.name,\n label: labelOf(head),\n sample: sampleOf(head),\n haplotype: head.haplotype,\n bp: bp2,\n offReferenceBp,\n gapBp,\n complete,\n stop,\n axis,\n ...abridgedSteps > 0 ? { abridgedSteps } : {},\n ...leftTrim + rightTrim > 0 ? { estimated: true } : {}\n };\n };\n const skipRowOf = (name, start2, end) => {\n const from2 = cut ? Math.max(start2, cut.start) : start2;\n const bp2 = (cut ? Math.min(end, cut.end) : end) - from2;\n runs.push(\n from2 - (cut ? cut.start : start2),\n bp2,\n Number.NaN,\n RUN_GAP | causeFlags(\"deleted\"),\n -1\n );\n runs.endRow();\n visits?.endRow();\n const head = { name, ...panSNFields(name) };\n return {\n name,\n label: labelOf(head),\n sample: sampleOf(head),\n haplotype: head.haplotype,\n bp: 0,\n offReferenceBp: 0,\n gapBp: bp2,\n complete: true,\n stop: void 0,\n axis: void 0\n };\n };\n const referenceRow = rowOf(referencePieces);\n const rows = [...walks.values()].map((pieces, i) => ({\n meta: rowOf(pieces),\n row: i + 1\n }));\n const drawn = new Set(walks.keys());\n skips?.names.forEach((name, k) => {\n const contig = pathOrigin(name).name;\n if (!drawn.has(contig)) {\n drawn.add(contig);\n rows.push({\n meta: skipRowOf(contig, skips.starts[k], skips.ends[k]),\n row: rows.length + 1\n });\n }\n });\n const metas = [referenceRow, ...rows.map((r) => r.meta)];\n if (new Set(metas.map((m) => m.label)).size < metas.length) {\n for (const meta of metas) {\n meta.label = panSNHaplotype(meta.name) ?? meta.label;\n }\n }\n rows.sort(\n (a, b) => Number(b.meta.complete) - Number(a.meta.complete) || b.meta.bp - a.meta.bp || a.meta.label.localeCompare(b.meta.label)\n );\n const order = [0, ...rows.map((r) => r.row)];\n const { offsets, columns } = runs.reorder(order, [\n float64,\n float64,\n float64,\n (n) => new Uint8Array(n),\n (n) => new Int32Array(n)\n ]);\n const [start, bp, referenceStart, flags, chunk] = columns;\n return {\n origin: cut ? cut.start : startOf(first) ?? 0,\n rows: [referenceRow, ...rows.map((r) => r.meta)],\n offsets,\n start,\n bp,\n referenceStart,\n flags,\n chunk,\n chunks,\n visits: visits && visitColumns(visits, order, names)\n };\n}\nfunction visitColumns(visits, order, names) {\n const { offsets, columns } = visits.reorder(order, [\n (n) => new Int32Array(n),\n float64,\n float64,\n (n) => new Uint8Array(n)\n ]);\n const [node, start, bp, onReference] = columns;\n return { offsets, node, start, bp, onReference, names };\n}\nfunction runAt(t, k) {\n const f = t.flags[k];\n const run = {\n start: t.start[k],\n bp: t.bp[k],\n onReference: (f & RUN_ON_REFERENCE) !== 0\n };\n if (f & RUN_GAP) {\n run.gap = true;\n const cause = GAP_CAUSES[f >> CAUSE_SHIFT & 7];\n if (cause) {\n run.cause = cause;\n }\n const chunk = t.chunks[t.chunk[k]];\n if (chunk) {\n run.chunk = chunk;\n }\n } else {\n run.referenceStart = Number.isNaN(t.referenceStart[k]) ? void 0 : t.referenceStart[k];\n }\n if (f & RUN_REVERSED) {\n run.reversed = true;\n }\n return run;\n}\nfunction visitsOf(v, row) {\n const out = [];\n for (let k = v.offsets[row]; k < v.offsets[row + 1]; k++) {\n out.push({\n node: v.names[v.node[k]],\n start: v.start[k],\n bp: v.bp[k],\n onReference: v.onReference[k] === 1\n });\n }\n return out;\n}\nfunction walkRowsOf(t, unit) {\n const rows = t.rows.map((meta, i) => {\n const runs = [];\n for (let k = t.offsets[i]; k < t.offsets[i + 1]; k++) {\n runs.push(runAt(t, k));\n }\n return {\n ...meta,\n runs,\n visits: t.visits && visitsOf(t.visits, i)\n };\n });\n return { origin: t.origin, unit, reference: rows[0], rows: rows.slice(1) };\n}\n\nexport {\n referenceWalkName,\n walkRowRuns,\n runAt,\n walkRowsOf\n};\n"],
5
+ "mappings": "0HACA,IAAIA,GAAiB,KACjBC,GAAe,KACfC,GAAa,CAAC,YAAa,QAAS,KAAK,EACzCC,GAAiB,CACnB,QAAS,mBACT,UAAW,2BACX,QAAS,qBACT,SAAU,6BAEV,QAAS,2BACX,EACIC,GAAe,iCACnB,SAASC,GAASC,EAAIC,EAAOC,EAAQ,CACnC,GAAI,CAACD,GAAS,CAACC,EACb,MAAO,CAAC,CAAE,GAAAF,CAAG,CAAC,EAEhB,IAAMG,EAAO,KAAK,IAAIF,GAAO,SAAW,EAAGD,CAAE,EACvCI,EAAQ,KAAK,IAAIF,GAAQ,SAAW,EAAGF,EAAKG,CAAI,EAClDE,EAAOL,EAAKG,EAAOC,EACjBE,EAAOL,GAAO,OAAS,QAAU,KAAK,IAAIA,EAAM,GAAII,CAAI,EAAI,EAClEA,GAAQC,EACR,IAAMC,EAAQL,GAAQ,OAAS,QAAU,KAAK,IAAIA,EAAO,GAAIG,CAAI,EAAI,EACrEA,GAAQE,EACR,IAAMC,EAAY,CAACP,EAAOC,CAAM,EAAE,KAAMO,GAAMA,GAAG,OAAS,WAAW,EAQrE,MAPc,CACZ,CAAE,GAAIN,CAAK,EACX,CAAE,GAAIG,EAAM,MAAO,SAAU,EAC7BE,GAAW,OAAS,YAAc,CAAE,GAAIH,EAAM,MAAO,YAAa,MAAOG,EAAU,KAAM,EAAI,CAAE,GAAIH,EAAM,MAAO,SAAU,EAC1H,CAAE,GAAIE,EAAO,MAAO,SAAU,EAC9B,CAAE,GAAIH,CAAM,CACd,EACa,OAAQM,GAASA,EAAK,GAAK,CAAC,CAC3C,CACA,SAASC,GAAOC,EAAOC,EAAG,CACxB,IAAMb,EAAKY,EAAM,GAAGC,CAAC,EACfC,EAAMF,EAAM,UAAUC,CAAC,EAC7B,OAAOE,GACLH,EAAM,UAAUA,EAAM,MAAMC,CAAC,CAAC,EAC9B,OAAO,MAAMb,CAAE,EAAI,OAASA,EAC5BY,EAAM,QAAQC,CAAC,EACfC,EAAM,EAAI,OAAS,CAAE,QAASF,EAAM,cAAcE,CAAG,EAAG,MAAOF,EAAM,YAAYC,CAAC,CAAE,CACtF,CACF,CACA,SAASE,GAAOC,EAAMhB,EAAIiB,EAASC,EAAO,CACxC,IAAMC,EAAMF,EAAU,EAAI,CAAE,QAAAA,CAAQ,EAAI,CAAC,EACzC,OAAID,IAAS,aAAeE,EACnB,CAAE,KAAAF,EAAM,MAAAE,EAAO,GAAGlB,IAAO,OAAS,CAAC,EAAI,CAAE,GAAAA,CAAG,EAAG,GAAGmB,CAAI,EAE3DH,IAAS,SAAWhB,IAAO,OACtB,CAAE,KAAAgB,EAAM,GAAAhB,EAAI,GAAGkB,EAAQ,CAAE,MAAAA,CAAM,EAAI,CAAC,EAAG,GAAGC,CAAI,EAEhDH,IAAS,MAAQ,CAAE,KAAAA,EAAM,GAAGG,CAAI,EAAI,MAC7C,CAcA,SAASC,GAAaC,EAAO,CAC3B,GAAM,CAACC,EAAM,GAAGC,CAAM,EAAIF,EAAM,MAAM,GAAG,EACrCG,EACAC,EAAU,EACVC,EACJ,QAAWC,KAASJ,EAClB,GAAII,EAAM,WAAW,KAAK,EACxBH,EAAK,CAACG,EAAM,MAAM,CAAC,UACVA,EAAM,WAAW,UAAU,EACpCF,EAAU,CAACE,EAAM,MAAM,CAAC,UACfA,EAAM,WAAW,QAAQ,EAAG,CACrC,IAAMC,EAAKD,EAAM,YAAY,GAAG,EAChCD,EAAQ,CAAE,QAASC,EAAM,MAAM,EAAGC,CAAE,EAAG,MAAO,CAACD,EAAM,MAAMC,EAAK,CAAC,CAAE,CACrE,CAEF,OAAOC,GAAOP,EAAME,EAAIC,EAASC,CAAK,CACxC,CACA,SAASI,GAAWC,EAAQC,EAAO,CACjC,MAAO,CACL,GAAGD,EAAS,CAAE,OAAAA,CAAO,EAAI,CAAC,EAC1B,GAAGC,EAAQ,CAAE,MAAAA,CAAM,EAAI,CAAC,CAC1B,CACF,CACA,SAASC,GAAeC,EAAM,CAC5B,IAAMH,EAASG,EAAKC,EAAc,EAC5BH,EAAQE,EAAKE,EAAY,EAC/B,OAAON,GACL,OAAOC,GAAW,SAAWX,GAAaW,CAAM,EAAI,OACpD,OAAOC,GAAU,SAAWZ,GAAaY,CAAK,EAAI,MACpD,CACF,CAcA,IAAIK,GAAc,KAAM,CACtB,aAAc,CACZ,KAAK,MAAQ,CAAC,EACd,KAAK,GAAK,CAAC,EACX,KAAK,QAAU,CAAC,EAChB,KAAK,UAAY,CAAC,EAClB,KAAK,YAAc,CAAC,EACpB,KAAK,cAAgB,CAAC,EACtB,KAAK,SAA2B,IAAI,GACtC,CACA,KAAKC,EAAM,CACT,KAAK,MAAM,KAAKC,GAAW,QAAQD,EAAK,IAAI,CAAC,EAC7C,KAAK,GAAG,KAAK,OAAQA,GAAQA,EAAK,KAAO,OAASA,EAAK,GAAK,GAAG,EAC/D,KAAK,QAAQ,KAAKA,EAAK,SAAW,CAAC,EACnC,IAAME,EAAQ,UAAWF,EAAOA,EAAK,MAAQ,OAC7C,GAAIE,EAAO,CACT,IAAIC,EAAM,KAAK,SAAS,IAAID,EAAM,OAAO,EACrCC,IAAQ,SACVA,EAAM,KAAK,cAAc,OACzB,KAAK,SAAS,IAAID,EAAM,QAASC,CAAG,EACpC,KAAK,cAAc,KAAKD,EAAM,OAAO,GAEvC,KAAK,UAAU,KAAKC,CAAG,EACvB,KAAK,YAAY,KAAKD,EAAM,KAAK,CACnC,MACE,KAAK,UAAU,KAAK,EAAE,EACtB,KAAK,YAAY,KAAK,GAAG,CAE7B,CACA,OAAQ,CACN,MAAO,CACL,MAAO,WAAW,KAAK,KAAK,KAAK,EACjC,UAAW,CAAC,GAAGD,EAAU,EACzB,GAAI,aAAa,KAAK,KAAK,EAAE,EAC7B,QAAS,aAAa,KAAK,KAAK,OAAO,EACvC,UAAW,WAAW,KAAK,KAAK,SAAS,EACzC,YAAa,aAAa,KAAK,KAAK,WAAW,EAC/C,cAAe,KAAK,aACtB,CACF,CACF,ECzIA,SAASG,GAAUC,EAAMC,EAAOC,EAAK,CACnC,OAAOD,IAAU,EAAID,EAAO,GAAGA,CAAI,IAAIC,CAAK,IAAIC,CAAG,EACrD,CACA,SAASC,GAAUC,EAAGC,EAAG,CACvB,IAAMC,EAAWF,EAAE,MAAMC,CAAC,EACpBE,EAASC,GAAYF,CAAQ,EAC7BL,EAAQG,EAAE,OAAOC,CAAC,EAClBI,EAAQL,EAAE,gBAAgBC,CAAC,GAAK,OAAO,IACvCK,EAAW,OAAO,MAAMD,CAAK,EAAI,CAAC,EAAI,CAAE,SAAU,CAAE,MAAAA,EAAO,GAAIL,EAAE,aAAaC,CAAC,GAAK,CAAE,CAAE,EAC9F,OAAOE,EAAS,CACd,KAAM,GAAGA,EAAO,MAAM,IAAIA,EAAO,SAAS,IAAIA,EAAO,MAAM,GAC3D,MAAAN,EACA,GAAGM,EACH,GAAGI,GACDP,EAAE,QAAUQ,GAAOR,EAAE,OAAQC,CAAC,EAC9BD,EAAE,OAASQ,GAAOR,EAAE,MAAOC,CAAC,CAC9B,EACA,GAAGK,CACL,EAAI,CAAE,KAAMX,GAAUO,EAAUL,EAAOG,EAAE,KAAKC,CAAC,CAAC,EAAG,MAAAJ,CAAM,CAC3D,CACA,SAASY,GAAYC,EAAOC,EAAOC,EAAWC,EAAW,CACvD,IAAMC,EAAS,IAAI,WAAWF,EAAY,CAAC,EAC3C,QAAWG,KAAQL,EACjBI,EAAOC,EAAO,CAAC,IAEjB,QAASC,EAAI,EAAGA,EAAIJ,EAAWI,IAC7BF,EAAOE,EAAI,CAAC,GAAKF,EAAOE,CAAC,EAE3B,IAAMC,EAAOH,EAAO,MAAM,EAAGF,CAAS,EAChCM,EAAU,IAAI,WAAWR,EAAM,MAAM,EAC3CA,EAAM,QAAQ,CAACK,EAAMC,IAAM,CACzBE,EAAQD,EAAKF,CAAI,GAAG,EAAIJ,EAAMK,CAAC,CACjC,CAAC,EACD,IAAMG,EAAS,IAAI,WAAWN,EAAU,MAAM,EAAE,KAAK,EAAE,EACvD,OAAO,MAAM,KAAK,CAAE,OAAQD,CAAU,EAAG,CAACQ,EAAGL,IAAS,CACpD,IAAMM,EAAM,CAAC,EACb,QAASL,EAAIF,EAAOC,CAAI,EAAGC,EAAIF,EAAOC,EAAO,CAAC,EAAGC,IAAK,CACpD,IAAMM,EAAIJ,EAAQF,CAAC,EACfG,EAAOG,CAAC,IAAMP,IAChBI,EAAOG,CAAC,EAAIP,EACZM,EAAI,KAAKR,EAAUS,CAAC,CAAC,EAEzB,CACA,OAAOD,CACT,CAAC,CACH,CACA,SAASE,GAAa,CAAE,MAAOC,EAAG,MAAOC,EAAG,MAAOzB,CAAE,EAAG0B,EAAY,CAClE,IAAMC,EAAY,IAAI,WAAWH,EAAE,MAAM,MAAM,EACzCI,EAAQ,CAACC,EAAMC,IAAa,CAC5BH,EAAUE,CAAI,IAAM,IACtBF,EAAUE,CAAI,EAAIC,EAAW,EAAI,EAErC,EACA,QAASd,EAAI,EAAGA,EAAIS,EAAE,KAAK,OAAQT,IACjCY,EAAMH,EAAE,KAAKT,CAAC,EAAGS,EAAE,QAAQT,CAAC,EAAI,CAAC,EACjCY,EAAMH,EAAE,GAAGT,CAAC,EAAGS,EAAE,QAAQT,CAAC,EAAI,CAAC,EAEjC,IAAMe,EAAY/B,EAAE,QAAQA,EAAE,MAAM,MAAM,GAAK,EAC/C,QAASgC,EAAI,EAAGA,EAAID,EAAWC,IAAK,CAClC,IAAMH,EAAO7B,EAAE,MAAMgC,CAAC,EACtBJ,EAAMC,EAAM7B,EAAE,SAASgC,CAAC,CAAC,EACrBN,GACFA,EAAWG,CAAI,GAEnB,CACA,OAAOL,EAAE,MAAM,IACb,CAACS,EAASjB,IAAM,GAAGiB,CAAO,GAAGN,EAAUX,CAAC,IAAM,EAAI,IAAM,GAAG,EAC7D,CACF,CACA,SAASkB,GAAgB,CAAE,MAAOV,EAAG,MAAOC,EAAG,MAAOzB,CAAE,EAAGJ,EAAO,eAAgB,CAChF,IAAMuC,EAAQX,EAAE,MAAM,OAChBY,EAAWZ,EAAE,QAAQ,OACrBa,EAAa,CAAC,EACpB,QAASpC,EAAI,EAAGA,EAAID,EAAE,MAAM,OAAQC,IAC9BD,EAAE,QAAQC,EAAI,CAAC,EAAID,EAAE,QAAQC,CAAC,GAChCoC,EAAW,KAAKpC,CAAC,EAGrB,IAAMyB,EAAa,IAAI,WAAWS,CAAK,EACjCG,EAAMf,GAAa,CAAE,MAAOC,EAAG,MAAOC,EAAG,MAAOzB,CAAE,EAAG0B,CAAU,EAC/Da,EAAQ,CAAC,EACf,QAASvB,EAAI,EAAGA,EAAIoB,EAAUpB,IAAK,CACjC,IAAMwB,EAAMhB,EAAE,KAAKR,CAAC,EACpBuB,EAAM,KAAK,CACT,GAAID,EAAItB,CAAC,EACT,KAAMQ,EAAE,MAAMR,CAAC,EACf,OAAQQ,EAAE,QAAQR,CAAC,EACnB,MAAO,KAAK,IAAIU,EAAWV,CAAC,EAAG,CAAC,EAChC,OAAQwB,EAAM,EAAI,OAAS,CACzB,QAAShB,EAAE,SAASgB,CAAG,EACvB,MAAOhB,EAAE,OAAOR,CAAC,EACjB,KAAMQ,EAAE,MAAMR,CAAC,CACjB,EACA,QAAS,MACX,CAAC,CACH,CACA,IAAMyB,EAAQ,CAAC,EACTC,EAAa,IAAI,MAAMP,CAAK,EAC5BQ,EAAW,CAACC,EAAGC,IAAM,CACzB,IAAMC,EAAOJ,EAAWE,CAAC,EACzB,GAAIE,GACF,QAASC,EAAI,EAAGA,EAAID,EAAK,OAAQC,GAAK,EACpC,GAAID,EAAKC,CAAC,IAAMF,EACd,OAAOC,EAAKC,EAAI,CAAC,EAKzB,EACMC,EAAU,CAACJ,EAAGC,EAAG9B,IAAS,CAC9B,IAAM+B,EAAOJ,EAAWE,CAAC,EACrBE,EACFA,EAAK,KAAKD,EAAG9B,CAAI,EAEjB2B,EAAWE,CAAC,EAAI,CAACC,EAAG9B,CAAI,CAE5B,EACMkC,EAAY,CAAC,EACfvC,EAAQ,EACZ,QAASM,EAAI,EAAGA,EAAIS,EAAE,KAAK,OAAQT,IAAK,CACtC,IAAM4B,EAAInB,EAAE,KAAKT,CAAC,EACZ6B,EAAIpB,EAAE,GAAGT,CAAC,EAChByB,EAAM,KAAK,CACT,KAAMH,EAAIM,CAAC,EACX,GAAIN,EAAIO,CAAC,EACT,WAAYpB,EAAE,QAAQT,CAAC,EAAI,EAAI,IAAM,IACrC,SAAUS,EAAE,QAAQT,CAAC,EAAI,EAAI,IAAM,GACrC,CAAC,EACD,IAAID,EAAO4B,EAASC,EAAGC,CAAC,EACpB9B,IAAS,SACXA,EAAOL,IACPsC,EAAQJ,EAAGC,EAAG9B,CAAI,EAClBiC,EAAQH,EAAGD,EAAG7B,CAAI,GAEpBkC,EAAU,KAAKlC,CAAI,CACrB,CACA,IAAMmC,EAAY,IAAI,WAAWf,EAAQ,CAAC,EAC1C,QAASS,EAAI,EAAGA,EAAIT,EAAOS,IACzBM,EAAUN,EAAI,CAAC,EAAIM,EAAUN,CAAC,GAAKF,EAAWE,CAAC,GAAG,QAAU,GAAK,EAEnE,IAAMO,GAAe,IAAI,WAAWD,EAAUf,CAAK,CAAC,EAC9CiB,GAAe,IAAI,WAAWF,EAAUf,CAAK,CAAC,EACpDO,EAAW,QAAQ,CAACI,EAAMF,IAAM,CAC9B,QAASG,EAAI,EAAGA,EAAID,EAAK,OAAQC,GAAK,EACpCI,GAAaD,EAAUN,CAAC,EAAIG,EAAI,CAAC,EAAID,EAAKC,CAAC,EAC3CK,GAAaF,EAAUN,CAAC,EAAIG,EAAI,CAAC,EAAID,EAAKC,EAAI,CAAC,CAEnD,CAAC,EACD,IAAMM,GAAS,CAACT,EAAGC,IAAM,CACvB,QAASE,EAAIG,EAAUN,CAAC,EAAGG,EAAIG,EAAUN,EAAI,CAAC,EAAGG,IAC/C,GAAII,GAAaJ,CAAC,IAAMF,EACtB,OAAOO,GAAaL,CAAC,EAGzB,MAAO,EACT,EACMO,EAA4B,IAAI,IAChCzC,GAAY,CAAC,EACb0C,EAAc,IAAI,WAAWvD,EAAE,QAAQA,EAAE,MAAM,MAAM,GAAK,CAAC,EAC3DwD,GAAc,IAAI,WAAWD,EAAY,MAAM,EACjDE,EAAY,EACVC,EAAW,IAAI,WAAWhD,CAAK,EAAE,KAAK,EAAE,EACxCiD,EAAQ,CAAC,EACTC,EAAc,CAAC,EACfC,GAAa7D,EAAE,QAAQA,EAAE,MAAM,MAAM,GAAK,EAC1C8D,EAAY,IAAI,WAAWD,EAAU,EACrCE,GAAa,IAAI,aAAaF,EAAU,EACxCG,GAAgB,IAAI,WAAWH,EAAU,EACzC5C,GAAO,IAAI,WAAWkB,CAAK,EAAE,KAAK,EAAE,EACpC8B,EAAa,CAAC,EACdC,EAAS,CAAC,CAAC,EACXC,EAAc,CAAC,EACfC,GAAgC,IAAI,IACpCC,GAAY,CAAC,EACnB,QAAWpE,KAAKoC,EAAY,CAC1B,IAAMiC,EAAOvE,GAAUC,EAAGC,CAAC,EACrB,CAAE,MAAAJ,EAAO,KAAM0E,CAAS,EAAID,EAC5BE,EAAYF,EAAK,SAAW,OAAStE,EAAE,MAAMC,CAAC,EAAIsE,EACpDE,EAAQnB,EAAU,IAAIkB,CAAS,EAC/BC,IAAU,SACZA,EAAQ5D,GAAU,OAClByC,EAAU,IAAIkB,EAAWC,CAAK,EAC9B5D,GAAU,KAAK2D,CAAS,EACxBL,EAAY,KAAKO,GAAYF,CAAS,CAAC,GAEzC,IAAIG,GAAYP,GAAc,IAAIG,CAAQ,EACtCI,KAAc,SAChBA,GAAYN,GAAU,OACtBD,GAAc,IAAIG,EAAUI,EAAS,EACrCN,GAAU,KAAKE,CAAQ,GAEzB,IAAMK,GAAcT,EAAYM,CAAK,EAC/BI,GAAQ7E,EAAE,QAAQC,CAAC,EACnB6E,GAAU,IAAI,MAAM9E,EAAE,QAAQC,EAAI,CAAC,EAAI4E,EAAK,EAC9CE,EAAMlF,EACNmF,EAAO,GACX,QAAShD,EAAI6C,GAAO7C,EAAIhC,EAAE,QAAQC,EAAI,CAAC,EAAG+B,IAAK,CAC7C,IAAMH,EAAO7B,EAAE,MAAMgC,CAAC,EACtB8C,GAAQ9C,EAAI6C,EAAK,EAAIvC,EAAIT,CAAI,EACzBZ,GAAKY,CAAI,IAAM,KACjBZ,GAAKY,CAAI,EAAIqC,EAAO,GAAG,EAAE,EACzBA,EAAO,KAAKjD,GAAKY,CAAI,EAAIH,EAAWG,CAAI,CAAC,EACzCoC,EAAW,KAAKpC,CAAI,GAEtB,IAAMoD,EAAKhE,GAAKY,CAAI,IAKpB,GAJAiC,EAAUmB,CAAE,EAAIR,EAChBV,GAAWkB,CAAE,EAAIF,EACjBf,GAAciB,CAAE,EAAIjF,EAAE,SAASgC,CAAC,EAChC+C,GAAOlD,EAAOO,EAAWZ,EAAE,QAAQK,CAAI,EAAI,EACvCmD,GAAQ,EAAG,CACb,IAAMjE,EAAOsC,GAAO2B,EAAMnD,CAAI,EAC1Bd,GAAQ,GAAK2C,EAAS3C,CAAI,IAAMd,IAClCyD,EAAS3C,CAAI,EAAId,EACjBsD,EAAYE,CAAS,EAAI1C,EACzByC,GAAYC,GAAW,EAAIkB,GAE/B,CACAK,EAAOnD,CACT,CACA8B,EAAM,KAAK,CAAE,GAAGW,EAAM,QAAAQ,EAAQ,CAAC,EAC/BlB,EAAY,KAAK,CACf,KAAMY,EACN,OAAQI,GACR,MAAA/E,EACA,OAAQkF,EAAMlF,CAChB,CAAC,CACH,CACA,IAAMqF,GAAYzE,GAChB8C,EAAY,SAAS,EAAGE,CAAS,EACjCD,GACA9C,EACA2D,EACF,EACA5B,EAAM,QAAQ,CAAC0C,EAAMnE,IAAM,CACzB,IAAML,EAAQuE,GAAUjC,EAAUjC,CAAC,CAAC,EAChCL,EAAM,OAAS,IACjBwE,EAAK,QAAUxE,EAEnB,CAAC,EACD,IAAMyE,EAAS/C,EAAW,OAAS,EACnC,MAAO,CACL,KAAAzC,EACA,MAAA2C,EACA,MAAAE,EACA,MAAO2C,EAASzB,EAAQ,OACxB,YAAayB,EAASxB,EAAc,OACpC,WAAYwB,EAAS,IAAIC,GAAW,CAClC,SAAUpB,EAAW,IAAKpC,GAASL,EAAE,MAAMK,CAAI,CAAC,EAChD,QAAS,WAAW,KAAKqC,CAAM,EAC/B,KAAMJ,EAAU,SAAS,EAAGI,EAAO,GAAG,EAAE,CAAC,EACzC,MAAOH,GAAW,SAAS,EAAGG,EAAO,GAAG,EAAE,CAAC,EAC3C,SAAUF,GAAc,SAAS,EAAGE,EAAO,GAAG,EAAE,CAAC,EACjD,MAAOrD,GACP,QAASsD,CACX,CAAC,EAAI,OACL,WAAY5B,EAAM,KAAMV,GAASA,EAAK,MAAM,EAAI,OAAS,MAC3D,CACF,CC1PA,IAAIyD,GAAmB,EACnBC,GAAe,EACfC,GAAU,EACVC,GAAa,CACf,OACA,UACA,YACA,UACA,WACA,SACF,EACIC,GAAc,EACdC,GAAcC,GAAUH,GAAW,QAAQG,CAAK,GAAKF,GACzD,SAASG,GAAYC,EAAOC,EAAeC,EAAU,CACnD,OAAOD,IAAkB,QAAUD,EAAM,SAASC,CAAa,EAAIA,EAAgBD,EAAM,KAAM,GAAME,EAAS,IAAI,CAAC,CAAC,GAAKF,EAAM,CAAC,CAClI,CACA,SAASG,GAAkBC,EAAO,CAChC,OAAOL,IACJK,EAAM,OAAS,CAAC,GAAG,IAAKC,GAAMC,GAAWD,EAAE,IAAI,EAAE,IAAI,EACtDD,EAAM,cACN,IAAI,IACFA,EAAM,MAAM,QACTG,GAAMA,EAAE,QAAQ,OAAS,EAAI,CAACA,EAAE,OAAO,OAAO,EAAI,CAAC,CACtD,CACF,CACF,CACF,CACA,IAAIC,GAAkBC,GAAc,CAClC,IAAMC,EAASD,GAAaE,GAAYF,CAAS,EACjD,OAAQG,GAASA,IAAS,SAAWA,IAASH,GAAaG,IAASF,EACtE,EACA,SAASG,GAAYT,EAAO,CAC1B,IAAMU,EAAwB,IAAI,IAC5Bd,EAAQ,CAAC,EACTe,EAAU,CAAC,EACXC,EAAWC,GAAO,CACtB,IAAIC,EAAIJ,EAAM,IAAIG,CAAE,EACpB,OAAIC,IAAM,SACRA,EAAIlB,EAAM,OACVc,EAAM,IAAIG,EAAIC,CAAC,EACflB,EAAM,KAAKiB,CAAE,EACbF,EAAQ,KAAK,CAAC,GAETG,CACT,EACMT,EAAYN,GAAkBC,CAAK,EACnCe,EAAoBX,GAAeC,CAAS,EAC5CW,EAAyB,IAAI,IACnC,QAAWC,KAAQjB,EAAM,MAAO,CAC9B,IAAMc,EAAIF,EAAQK,EAAK,EAAE,EACzBN,EAAQG,CAAC,EAAIG,EAAK,OACdA,EAAK,QAAQ,OAAS,GAAKF,EAAkBE,EAAK,OAAO,OAAO,GAClED,EAAO,IAAIF,EAAGG,EAAK,OAAO,KAAK,CAEnC,CACA,IAAMC,EAAQlB,EAAM,OAAS,CAAC,EACxBmB,EAAO,IAAI,WAAWD,EAAM,MAAM,EAClCE,EAAK,IAAI,WAAWF,EAAM,MAAM,EAChCG,EAAQ,CAAC,EACf,OAAAH,EAAM,QAAQ,CAACI,EAAMrB,IAAM,CACzBkB,EAAKlB,CAAC,EAAIoB,EAAM,OAChB,QAAWR,KAAMS,EAAK,QACpBD,EAAM,KAAKT,EAAQC,CAAE,CAAC,EAExBO,EAAGnB,CAAC,EAAIoB,EAAM,MAChB,CAAC,EACM,CACL,MAAAH,EACA,KAAAC,EACA,GAAAC,EACA,MAAO,WAAW,KAAKC,CAAK,EAC5B,QAAS,WAAW,KAAKV,CAAO,EAChC,MAAAf,EACA,UAAAS,EACA,YAAcY,GAASD,EAAO,IAAIC,CAAI,GAAK,OAAO,GACpD,CACF,CACA,SAASM,GAAYC,EAAQ3B,EAAe4B,EAAQ,CAClD,GAAM,CAAE,MAAO,EAAG,MAAOC,CAAE,EAAIF,EACzBG,EAAO,CAAC,EACd,QAAS1B,EAAI,EAAGA,EAAIyB,EAAE,MAAM,OAAQzB,IAC9ByB,EAAE,QAAQzB,EAAI,CAAC,EAAIyB,EAAE,QAAQzB,CAAC,GAChC0B,EAAK,KAAK1B,CAAC,EAGf,IAAMiB,EAAQS,EAAK,IAAK1B,GAAM2B,GAAUF,EAAGzB,CAAC,CAAC,EACvCH,EAA2B,IAAI,IACrC,QAASgB,EAAI,EAAGA,EAAI,EAAE,QAAQ,OAAQA,IAChC,EAAE,KAAKA,CAAC,GAAK,GAAK,EAAE,MAAMA,CAAC,IAAM,GACnChB,EAAS,IAAI,EAAE,SAAS,EAAE,KAAKgB,CAAC,CAAC,CAAC,EAGtC,IAAMT,EAAYV,GAChBuB,EAAM,IAAKW,GAAM3B,GAAW2B,EAAE,IAAI,EAAE,IAAI,EACxChC,EACAC,CACF,EACMiB,EAAoBX,GAAeC,CAAS,EAClD,MAAO,CACL,MAAAa,EACA,KAAM,WAAW,KAAKS,EAAO1B,GAAMyB,EAAE,QAAQzB,CAAC,CAAC,EAC/C,GAAI,WAAW,KAAK0B,EAAO1B,GAAMyB,EAAE,QAAQzB,EAAI,CAAC,CAAC,EACjD,MAAOyB,EAAE,MACT,QAAS,EAAE,QAGX,MAAOD,EAASK,GAAaN,CAAM,EAAI,EAAE,MACzC,UAAAnB,EACA,YAAcY,GAASA,EAAO,EAAE,QAAQ,QAAU,EAAE,MAAMA,CAAI,IAAM,GAAKF,EAAkB,EAAE,SAAS,EAAE,KAAKE,CAAI,CAAC,CAAC,EAAI,EAAE,OAAOA,CAAI,EAAI,OAAO,GACjJ,CACF,CACA,SAASc,GAAST,EAAM,CACtB,OAAOA,EAAK,QAAUU,GAAYV,EAAK,IAAI,CAC7C,CACA,SAASW,GAAQX,EAAM,CACrB,OAAOA,EAAK,YAAc,QAAUA,EAAK,SAAW,OAAS,GAAGA,EAAK,MAAM,IAAIA,EAAK,SAAS,GAAKS,GAAST,CAAI,CACjH,CACA,IAAIY,GAAU,KAAM,CAClB,YAAYC,EAAO,CACjB,KAAK,QAAU,CAAC,CAAC,EACjB,KAAK,OAAS,MAAM,KAAK,CAAE,OAAQA,CAAM,EAAG,IAAM,CAAC,CAAC,CACtD,CACA,IAAI,QAAS,CACX,OAAO,KAAK,OAAO,CAAC,EAAE,MACxB,CACA,KAAKC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG,CAClB,IAAMC,EAAI,KAAK,OACfA,EAAE,CAAC,EAAE,KAAKL,CAAC,EACXK,EAAE,CAAC,EAAE,KAAKJ,CAAC,EACXI,EAAE,CAAC,EAAE,KAAKH,CAAC,EACXG,EAAE,CAAC,EAAE,KAAKF,CAAC,EACPC,IAAM,QACRC,EAAE,CAAC,EAAE,KAAKD,CAAC,CAEf,CACA,QAAS,CACP,KAAK,QAAQ,KAAK,KAAK,MAAM,CAC/B,CAEA,QAAQE,EAAOC,EAAM,CACnB,IAAMC,EAAU,IAAI,YAAYF,EAAM,OAAS,CAAC,EAChDA,EAAM,QAAQ,CAACG,EAAK/B,IAAM,CACxB8B,EAAQ9B,EAAI,CAAC,EAAI8B,EAAQ9B,CAAC,EAAI,KAAK,QAAQ+B,EAAM,CAAC,EAAI,KAAK,QAAQA,CAAG,CACxE,CAAC,EACD,IAAMC,EAAUH,EAAK,IAAI,CAACI,EAAG,IAAM,CACjC,IAAM5B,EAAO,KAAK,OAAO,CAAC,EACpB6B,EAAMD,EAAE,KAAK,MAAM,EACrBE,EAAK,EACT,QAAWJ,KAAOH,EAChB,QAASQ,EAAI,KAAK,QAAQL,CAAG,EAAGK,EAAI,KAAK,QAAQL,EAAM,CAAC,EAAGK,IACzDF,EAAIC,GAAI,EAAI9B,EAAK+B,CAAC,EAGtB,OAAOF,CACT,CAAC,EACD,MAAO,CAAE,QAAAJ,EAAS,QAAAE,CAAQ,CAC5B,CACF,EACIK,GAAWhD,GAAM,IAAI,aAAaA,CAAC,EACvC,SAASiD,GAAYC,EAAQC,EAAQC,EAAI,CAAC,EAAG,CAC3C,GAAM,CACJ,MAAArC,EACA,KAAAC,EACA,GAAAC,EACA,MAAOoC,EACP,QAAA7C,EACA,MAAAf,EACA,UAAAS,EACA,YAAAoD,CACF,EAAI,UAAWJ,EAAS9B,GAAY8B,EAAQE,EAAE,cAAeA,EAAE,MAAM,EAAI9C,GAAY4C,CAAM,EACrFK,EAAW/C,EAAQ,OACnBgD,EAAY1C,GAASA,EAAOyC,EAAW/C,EAAQM,CAAI,EAAI,EACvD2C,EAAU3D,GAAMC,GAAWgB,EAAMjB,CAAC,EAAE,IAAI,EAAE,KAC1C4D,EAAW5D,GAAMiB,EAAMjB,CAAC,EAAE,MAC1B6D,EAAU,CAAC,EAAGzB,KAAOwB,EAAQ,CAAC,GAAK,IAAMA,EAAQxB,CAAC,GAAK,GACvD0B,EAAW7C,EAAM,IAAI,CAAC8C,EAAG/D,IAAMA,CAAC,EAChCgE,GAAkBF,EAAS,OAAQ9D,GAAM2D,EAAO3D,CAAC,IAAMI,CAAS,EAAE,KAAKyD,CAAO,EAC9EI,GAAQD,GAAgB,CAAC,EACzBE,GAASJ,EAAS,OAAQ9D,GAAM2D,EAAO3D,CAAC,IAAMI,CAAS,EACvD+D,EAAQ,UAAWf,EAASA,EAAO,MAAQ,OACjD,GAAIa,KAAU,QAAUC,GAAO,SAAW,GAAK,CAACC,GAAO,MAAM,OAC3D,OAEF,IAAMC,GAAQC,GAAQH,GAAQP,CAAM,EAC9BW,EAAY,IAAI,aAAa3E,EAAM,MAAM,EAAE,KAAK,OAAO,GAAG,EAC1D4E,GAAU,IAAI,aAAa5E,EAAM,MAAM,EACvC6E,EAA2B,IAAI,IACjCC,EAAW,KACXC,EAAa,IACXC,EAAMtB,GAAUA,EAAO,IAAMA,EAAO,MAAQA,EAAS,OAC3D,QAAWuB,KAASZ,GAAiB,CACnC,IAAIa,EAAMjB,EAAQgB,CAAK,GAAK,EAC5B,QAASE,EAAI5D,EAAK0D,CAAK,EAAGG,EAAO5D,EAAGyD,CAAK,EAAGE,EAAIC,EAAMD,IAAK,CACzD,IAAM9D,EAAOuC,EAAIuB,CAAC,EACZE,EAAMtB,EAAS1C,CAAI,EACzB,GAAK,OAAO,MAAMsD,EAAUtD,CAAI,CAAC,EAQ/BsD,EAAUtD,CAAI,EAAI6D,EAClBN,GAAQvD,CAAI,EAAI6D,EAAMG,EAClBL,IACEE,EAAMG,GAAOL,EAAI,QACnBF,EAAW,KAAK,IAAIA,EAAUI,EAAMG,CAAG,GAErCH,GAAOF,EAAI,MACbD,EAAa,KAAK,IAAIA,EAAYG,CAAG,QAfP,CAClC,IAAMI,GAAST,EAAS,IAAIxD,CAAI,EAC5BiE,GACFA,GAAO,KAAKJ,CAAG,EAEfL,EAAS,IAAIxD,EAAM,CAACsD,EAAUtD,CAAI,EAAG6D,CAAG,CAAC,CAE7C,CAYAA,GAAOG,CACT,CACF,CACA,IAAME,GAAUP,IAAQ,QAAUF,EAAW,MAAaC,EAAa,IACjES,EAAO,IAAIlD,GAAQ,CAAC,EACpBmD,GAAS,CAAC,EACVC,GAA6B,IAAI,IACjCC,GAAWC,GAAW,CAC1B,GAAI,CAACA,EACH,MAAO,GAET,IAAMC,EAAM,GAAGD,EAAO,OAAO,IAAIA,EAAO,KAAK,GACzC1E,EAAIwE,GAAW,IAAIG,CAAG,EAC1B,OAAI3E,IAAM,SACRA,EAAIuE,GAAO,OACXC,GAAW,IAAIG,EAAK3E,CAAC,EACrBuE,GAAO,KAAKG,CAAM,GAEb1E,CACT,EACMW,EAAS8B,EAAE,OAAS,IAAIrB,GAAQ,CAAC,EAAI,OACvCb,EAAQ,IAAI,WAAW,CAAC,EACxBqE,EAAY,IAAI,aAAa,CAAC,EAC5BC,GAASC,GAAW,CACxB,IAAMC,EAAO3E,EAAM0E,EAAO,CAAC,CAAC,EACtBE,EAAU,CAAC,GAAGF,CAAM,EAAE,KAAK9B,CAAO,EACpCiC,EAAQD,EAAQ,OAAS,EACzBE,EAAgB,EACpB,QAAWnB,KAASiB,EAClBC,GAAS3E,EAAGyD,CAAK,EAAI1D,EAAK0D,CAAK,GAAK3D,EAAM2D,CAAK,EAAE,SAAW,EAAI,GAChEmB,GAAiB9E,EAAM2D,CAAK,EAAE,UAAU,OAAS,EAE/CkB,EAAQ1E,EAAM,SAChBA,EAAQ,IAAI,WAAW0E,EAAQ,CAAC,EAChCL,EAAY,IAAI,aAAaK,EAAQ,CAAC,GAExC,IAAIE,EAAS,EACTC,GAAW,GACXC,GACAC,GACEC,EAA0B,IAAI,IAChCC,GAAO,EACX,QAAWzB,KAASiB,EAAS,CAC3B,IAAMS,EAAS1C,EAAQgB,CAAK,EACtB2B,EAAOD,IAAW,QAAUJ,KAAQ,OAAS,EAAII,EAASJ,IAC5DI,IAAW,QAAUC,EAAO,KAC9BN,GAAW,IAETM,EAAO,GAAKtF,EAAMkF,EAAQ,EAAE,WAC9BE,IAAQE,GAEV,IAAMC,EAAU,KAAK,IAAIH,GAAM,KAAK,IAAIE,EAAM,CAAC,CAAC,EAChDF,IAAQG,EACR,IAAMC,EAAMF,EAAOC,EACfC,EAAM,IACRL,EAAQ,IACNJ,EACAU,GACED,EACAN,KAAa,OAAS,OAASlF,EAAMkF,EAAQ,EAAE,MAC/ClF,EAAM2D,CAAK,EAAE,MACf,CACF,EACAxD,EAAM4E,CAAM,EAAI,CAACS,EACjBhB,EAAUO,GAAQ,EAAIE,IAExB,IAAIrB,EAAMyB,GAAU,EACdK,EAAW1F,EAAM2D,CAAK,EAAE,SAC9B,QAASE,EAAI5D,EAAK0D,CAAK,EAAGgC,EAAQzF,EAAGyD,CAAK,EAAGE,EAAI8B,EAAO9B,IAAK,CAC3D,IAAM9D,EAAOuC,EAAIuB,CAAC,EACZ+B,EAAMF,EAAWA,EAAS,IAAM9B,GAAOyB,GAAU,IAAM5C,EAAS1C,CAAI,EAAI,EAC1E6F,EAAM,GAAK/B,IAAM8B,EAAQ,GAAK9B,EAAI5D,EAAK0D,CAAK,IAC9CwB,EAAQ,IAAIJ,EAAQ,CAAC,CAAE,GAAIa,EAAK,MAAO,UAAW,CAAC,CAAC,EACpDzF,EAAM4E,CAAM,EAAI,CAACa,EACjBpB,EAAUO,GAAQ,EAAInB,EACtBA,GAAOgC,GAETzF,EAAM4E,CAAM,EAAIhF,EAChByE,EAAUO,GAAQ,EAAInB,EACtBA,GAAOnB,EAAS1C,CAAI,CACtB,CACAkF,GAAMI,IAAW,OAAS,OAASzB,EACnCsB,GAAWvB,CACb,CACA,IAAMkC,GAAe,GAAM,GAAK,GAAK,EAAId,GAAU5E,EAAM,CAAC,GAAK,GAAK,CAAC,OAAO,MAAMkD,EAAUlD,EAAM,CAAC,CAAC,CAAC,EAC/F2F,GAAW,GAAM,CACrB,IAAMnG,EAAKQ,EAAM,CAAC,EAClB,OAAOqE,EAAU,CAAC,GAAK7E,EAAK,EAAI,CAACA,EAAK8C,EAAS9C,CAAE,EACnD,EACMoG,GAAc,CAACC,EAAIC,IAAO,CAC9B,IAAMC,EAAQF,GAAM,EAAIA,EAAKC,EACzBE,EAAO,GACX,QAAS9E,EAAI,EAAG8E,EAAO,GAAK9E,EAAI0D,EAAQ1D,IACtC8E,EAAO,CAACD,EAAQ7E,EAAG6E,EAAQ7E,CAAC,EAAE,KAAKwE,EAAW,GAAK,GAErD,GAAIM,EAAO,EACT,OAEF,IAAMC,EAAUD,EAAOD,GAAU7C,EAAUlD,EAAMgG,CAAI,CAAC,EAAI9C,EAAUlD,EAAM+F,CAAK,CAAC,EAC1EG,EAAQD,KAAaF,IAAUF,GAC/BM,EAAQD,EAAQtB,EAAS,EAAI,EAC7BwB,EAAaV,GAAYS,CAAK,EASpC,MAAO,CACL,KATY,CACZ,WAAAC,EACA,QAASA,EAAa,KAAK,IACzB,EACA7C,EAAI,MAAQJ,GAAQnD,EAAMmG,CAAK,CAAC,EAChCjD,EAAUlD,EAAMmG,CAAK,CAAC,EAAI5C,EAAI,GAChC,EAAI,CACN,EAGE,GAAI2C,EAAQH,EAAQ,EAAI,EACxB,GAAIG,EAAQtB,EAASmB,EACrB,SAAU,CAACE,EACX,UAAWA,EAAUC,EAAQP,GAAQI,CAAK,EAAI1B,EAAU,CAAC,EAAI6B,EAAQP,GAAQf,EAAS,CAAC,EAAIP,EAAU0B,CAAK,CAC5G,CACF,EACIM,GAAK,EACLC,GAAK1B,EACL2B,GAAW,GACXC,GAAW,GACXC,GAAY,GACZC,GAAU,GACVC,GACAhD,GACEiD,GAAe,CAACC,EAAOpB,IAAQ,CAEnC,IAAMJ,EADQL,EAAQ,IAAI6B,CAAK,IACX,CAAC,EACrB,GAAIpB,GAAO,GAAKJ,GAAK,QAAU,WAC7B,MAAO,GAET,IAAMyB,EAAU,KAAK,IAAIrB,EAAKJ,EAAI,EAAE,EACpC,OAAAL,EAAQ,IACN6B,EACAxB,EAAI,GAAKyB,EAAU,CAAC,CAAE,GAAGzB,EAAK,GAAIA,EAAI,GAAKyB,CAAQ,CAAC,EAAI,CAAC,CAC3D,EACA9G,EAAM6G,CAAK,GAAKC,EACTA,CACT,EACMC,GAAc,GAAM/B,EAAQ,IAAI,CAAC,IAAI,CAAC,GAAG,QAAU,WACnDgC,GAAc,GAAM,CACxB,IAAMxH,EAAKQ,EAAM,CAAC,EAClB,OAAIR,EAAK,GAAKwF,EAAQ,IAAI,CAAC,EAClB,OAAO,IAET,OAAO,MAAM9B,EAAU1D,CAAE,CAAC,IAAMuH,GAAW,EAAI,CAAC,GAAKA,GAAW,EAAI,CAAC,GAAK3E,EAAY5C,CAAE,EAAI0D,EAAU1D,CAAE,CACjH,EACIyH,GAAW,EACXC,GAAY,EAChB,GAAI3D,GAAOO,GAAS,CAClB,IAAI+B,EAAK,GACLC,EAAK,GACLqB,EAAU,KACVC,EAAY,IAChB,QAAS3H,EAAI,EAAGA,EAAImF,EAAQnF,IAAK,CAC/B,IAAMyF,EAAS8B,GAAWvH,CAAC,EAC3B,GAAI,CAAC,OAAO,MAAMyF,CAAM,EAAG,CACzB,IAAMmC,EAAOnC,EAAS5C,EAAStC,EAAMP,CAAC,CAAC,EACnC4H,GAAQ9D,EAAI,OAAS8D,EAAOF,IAC9BA,EAAUE,EACVxB,EAAKpG,GAEHyF,GAAU3B,EAAI,KAAO2B,EAASkC,IAChCA,EAAYlC,EACZY,EAAKrG,EAET,CACF,CACA,GAAIoG,EAAK,GAAKC,EAAK,EAAG,CACpBU,GAAW,GACX,IAAMc,EAASzB,GAAM,GAAKC,GAAM,EAAIF,GAAYC,EAAIC,CAAE,EAAI,OACtDwB,IAED,CAAE,GAAAjB,GAAI,GAAAC,GAAI,SAAAC,GAAU,UAAAI,GAAW,KAAAhD,EAAK,EAAI2D,EAE7C,KAAO,CACLjB,GAAK,KAAK,IAAIR,EAAIC,CAAE,EAAI,EACxBQ,GAAK,KAAK,IAAIT,EAAIC,CAAE,EACpBS,GAAWV,EAAKC,EAChBW,GAAYZ,EACZa,GAAUZ,EACV,IAAMyB,EAAShB,GAAW,GAAK,EAC/BU,GAAWL,GAAaf,EAAK0B,EAAQlE,EAAW8D,CAAO,EACvDD,GAAYN,GAAad,EAAKyB,EAAQH,EAAY9D,CAAU,CAC9D,CACF,CACA,IAAMrE,GAASuF,EAAK,QAAUtF,GAAYL,GAAW2F,EAAK,IAAI,EAAE,IAAI,EAC9DgD,GAAO3C,IAAYD,IAAW,EAAI,OAAS+B,KAAc,OAAS,CAAE,OAAA1H,GAAQ,MAAO0H,GAAW,SAAUJ,EAAS,EAAIE,GAAY,EAAI,CAAE,OAAAxH,GAAQ,MAAOoF,EAAU,CAAC,EAAG,SAAU,EAAM,EAAIoC,GAAYC,GAAU,CAClN,OAAAzH,GACA,MAAO0G,GAAQc,EAAS,EAAIQ,GAC5B,SAAU,EACZ,EAAI,CACF,OAAAhI,GACA,MAAOoF,EAAUoC,EAAS,EAAIQ,GAC9B,SAAU,EACZ,EACIQ,GAAM,EACNC,GAAiB,EACjBC,GAAQ,EACRC,GAAO,EACPC,EAAO,GACPC,GAAY,EACZC,EAAU,OAAO,IACjBC,GAAS,OAAO,IACdC,GAAWzI,GAAO,CACtB,IAAMqE,EAAST,EAAS,IAAI5D,CAAE,EAC9B,GAAI,CAACqE,GAAU,OAAO,MAAMmE,EAAM,EAChC,OAAO9E,EAAU1D,CAAE,EAErB,IAAMoE,EAAMtB,EAAS9C,CAAE,EACnB0I,EAAOrE,EAAO,CAAC,EACfsE,EAAU,IACd,QAAWjD,KAAUrB,EAAQ,CAC3B,IAAMwB,EAAM,KAAK,IACf,KAAK,IAAIH,EAAS8C,EAAM,EACxB,KAAK,IAAI9C,EAAStB,EAAMoE,EAAM,CAChC,EACI3C,EAAM8C,IACRD,EAAOhD,EACPiD,EAAU9C,EAEd,CACA,OAAO6C,CACT,EACM,CAAC,CAAEE,GAAOC,GAAQC,EAAQ,EAAIvE,EAAK,OACzC,QAASlC,EAAIwE,GAAIxE,EAAIyE,GAAIzE,IAAK,CAC5B,IAAMxC,EAAQkH,GAAWD,GAAK,GAAKzE,EAAIwE,IAAMxE,EACvCrC,EAAKQ,EAAMX,CAAK,EAChBkJ,EAAQvD,EAAQ,IAAI3F,CAAK,EAC/B,GAAIkJ,EAAO,CACT,QAAWC,KAAQjC,GAAW,CAAC,GAAGgC,CAAK,EAAE,QAAQ,EAAIA,EACnDxE,EAAK,KACH0D,GACAe,EAAK,GACL,OAAO,IACPvK,GAAUG,GAAWoK,EAAK,KAAK,EAC/BtE,GAAQsE,EAAK,KAAK,CACpB,EACAf,IAAOe,EAAK,GAEdX,EAAO9D,EAAK,OAAS,EACrB+D,GAAY7J,GACZ8J,EAAU,OAAO,IACjBJ,IAAS,CAACnI,EACVoI,GAAO,EACP,QACF,CACA,IAAMhE,EAAMtB,EAAS9C,CAAE,EACjBoC,EAAKqG,GAAQzI,CAAE,EACfiJ,EAAK,CAAC,OAAO,MAAM7G,CAAE,EAC3BxB,GAAQ,KAAKZ,EAAIiI,GAAK7D,EAAK6E,EAAK,EAAI,CAAC,EACrC,IAAMC,EAASb,GAAQ,GAAK,CAAC,OAAO,MAAME,CAAO,EAC3C9B,EAAUwC,GAAMC,GAAUd,IAAQ,GAAKG,GAAWK,GAAMP,CAAI,GAAK,KAAOjG,EACxE+G,EAAOF,GAAMC,GAAUd,IAAQ,GAAKhG,EAAKgC,IAAQmE,EACnD,CAACU,GAAMZ,GAAQ,GAAK,EAAEC,IAAa/J,GAAmBE,KACxDmK,GAAMP,CAAI,GAAKjE,EACNqC,GAAW0C,GACpBP,GAAMP,CAAI,GAAKjE,EACVqC,IACH8B,EAAUnG,EACVyG,GAAOR,CAAI,EAAIjG,EACfkG,IAAa9J,GACbsK,GAAST,CAAI,EAAIC,IAEnBF,GAAO3B,EAAU,EAAI,KAErB6B,GAAYW,EAAK1K,GAAmB,EACpCgK,EAAUU,EAAK7G,EAAK,OAAO,IAC3BmC,EAAK,KAAK0D,GAAK7D,EAAKmE,EAASD,GAAW,EAAE,EAC1CD,EAAO9D,EAAK,OAAS,EACrB6D,GAAO,GAETH,IAAO7D,EACH6E,EACFT,GAASJ,GAAO,EAAIhG,EAAKA,EAAKgC,EAE9B8D,IAAkB9D,CAEtB,CACA,OAAAG,EAAK,OAAO,EACZ3D,GAAQ,OAAO,EACR,CACL,KAAMoE,EAAK,KACX,MAAO5D,GAAQ4D,CAAI,EACnB,OAAQ9D,GAAS8D,CAAI,EACrB,UAAWA,EAAK,UAChB,GAAIiD,GACJ,eAAAC,GACA,MAAAC,GACA,SAAAnB,GACA,KAAA7C,GACA,KAAA6D,GACA,GAAG7C,EAAgB,EAAI,CAAE,cAAAA,CAAc,EAAI,CAAC,EAC5C,GAAGsC,GAAWC,GAAY,EAAI,CAAE,UAAW,EAAK,EAAI,CAAC,CACvD,CACF,EACM0B,GAAY,CAACzJ,EAAM+F,EAAQJ,IAAQ,CACvC,IAAM+D,EAAQtF,EAAM,KAAK,IAAI2B,EAAQ3B,EAAI,KAAK,EAAI2B,EAC5CuC,GAAOlE,EAAM,KAAK,IAAIuB,EAAKvB,EAAI,GAAG,EAAIuB,GAAO+D,EACnD9E,EAAK,KACH8E,GAAStF,EAAMA,EAAI,MAAQ2B,GAC3BuC,EACA,OAAO,IACPxJ,GAAUG,GAAW,SAAS,EAC9B,EACF,EACA2F,EAAK,OAAO,EACZ3D,GAAQ,OAAO,EACf,IAAMoE,EAAO,CAAE,KAAArF,EAAM,GAAG2J,GAAY3J,CAAI,CAAE,EAC1C,MAAO,CACL,KAAAA,EACA,MAAOyB,GAAQ4D,CAAI,EACnB,OAAQ9D,GAAS8D,CAAI,EACrB,UAAWA,EAAK,UAChB,GAAI,EACJ,eAAgB,EAChB,MAAOiD,EACP,SAAU,GACV,KAAM,OACN,KAAM,MACR,CACF,EACMsB,GAAezE,GAAM1B,EAAe,EACpCoG,EAAO,CAAC,GAAGhG,GAAM,OAAO,CAAC,EAAE,IAAI,CAACuB,EAAQ9E,KAAO,CACnD,KAAM6E,GAAMC,CAAM,EAClB,IAAK9E,EAAI,CACX,EAAE,EACIwJ,EAAQ,IAAI,IAAIjG,GAAM,KAAK,CAAC,EAClCD,GAAO,MAAM,QAAQ,CAAC5D,EAAM0C,IAAM,CAChC,IAAM5C,EAASJ,GAAWM,CAAI,EAAE,KAC3B8J,EAAM,IAAIhK,CAAM,IACnBgK,EAAM,IAAIhK,CAAM,EAChB+J,EAAK,KAAK,CACR,KAAMJ,GAAU3J,EAAQ8D,EAAM,OAAOlB,CAAC,EAAGkB,EAAM,KAAKlB,CAAC,CAAC,EACtD,IAAKmH,EAAK,OAAS,CACrB,CAAC,EAEL,CAAC,EACD,IAAME,EAAQ,CAACH,GAAc,GAAGC,EAAK,IAAKG,GAAMA,EAAE,IAAI,CAAC,EACvD,GAAI,IAAI,IAAID,EAAM,IAAKxH,GAAMA,EAAE,KAAK,CAAC,EAAE,KAAOwH,EAAM,OAClD,QAAWE,KAAQF,EACjBE,EAAK,MAAQC,GAAeD,EAAK,IAAI,GAAKA,EAAK,MAGnDJ,EAAK,KACH,CAAC,EAAGhI,IAAM,OAAOA,EAAE,KAAK,QAAQ,EAAI,OAAO,EAAE,KAAK,QAAQ,GAAKA,EAAE,KAAK,GAAK,EAAE,KAAK,IAAM,EAAE,KAAK,MAAM,cAAcA,EAAE,KAAK,KAAK,CACjI,EACA,IAAMK,EAAQ,CAAC,EAAG,GAAG2H,EAAK,IAAKG,GAAMA,EAAE,GAAG,CAAC,EACrC,CAAE,QAAA5H,EAAS,QAAAE,CAAQ,EAAIsC,EAAK,QAAQ1C,EAAO,CAC/CS,GACAA,GACAA,GACChD,GAAM,IAAI,WAAWA,CAAC,EACtBA,GAAM,IAAI,WAAWA,CAAC,CACzB,CAAC,EACK,CAACwK,EAAOC,GAAIC,GAAgBC,GAAOC,EAAK,EAAIjI,EAClD,MAAO,CACL,OAAQ8B,EAAMA,EAAI,MAAQf,EAAQK,EAAK,GAAK,EAC5C,KAAM,CAACkG,GAAc,GAAGC,EAAK,IAAKG,GAAMA,EAAE,IAAI,CAAC,EAC/C,QAAA5H,EACA,MAAA+H,EACA,GAAAC,GACA,eAAAC,GACA,MAAAC,GACA,MAAAC,GACA,OAAA1F,GACA,OAAQ5D,GAAUuJ,GAAavJ,EAAQiB,EAAO9C,CAAK,CACrD,CACF,CACA,SAASoL,GAAavJ,EAAQiB,EAAO9C,EAAO,CAC1C,GAAM,CAAE,QAAAgD,EAAS,QAAAE,CAAQ,EAAIrB,EAAO,QAAQiB,EAAO,CAChDvC,GAAM,IAAI,WAAWA,CAAC,EACvBgD,GACAA,GACChD,GAAM,IAAI,WAAWA,CAAC,CACzB,CAAC,EACK,CAACc,EAAM0J,EAAOC,EAAI7D,CAAW,EAAIjE,EACvC,MAAO,CAAE,QAAAF,EAAS,KAAA3B,EAAM,MAAA0J,EAAO,GAAAC,EAAI,YAAA7D,EAAa,MAAAnH,CAAM,CACxD,CACA,SAASqL,GAAM,EAAG/H,EAAG,CACnB,IAAMgI,EAAI,EAAE,MAAMhI,CAAC,EACbiI,EAAM,CACV,MAAO,EAAE,MAAMjI,CAAC,EAChB,GAAI,EAAE,GAAGA,CAAC,EACV,aAAcgI,EAAI9L,MAAsB,CAC1C,EACA,GAAI8L,EAAI5L,GAAS,CACf6L,EAAI,IAAM,GACV,IAAMzL,EAAQH,GAAW2L,GAAK1L,GAAc,CAAC,EACzCE,IACFyL,EAAI,MAAQzL,GAEd,IAAMqL,EAAQ,EAAE,OAAO,EAAE,MAAM7H,CAAC,CAAC,EAC7B6H,IACFI,EAAI,MAAQJ,EAEhB,MACEI,EAAI,eAAiB,OAAO,MAAM,EAAE,eAAejI,CAAC,CAAC,EAAI,OAAS,EAAE,eAAeA,CAAC,EAEtF,OAAIgI,EAAI7L,KACN8L,EAAI,SAAW,IAEVA,CACT,CACA,SAASC,GAAS3I,EAAGI,EAAK,CACxB,IAAMG,EAAM,CAAC,EACb,QAASE,EAAIT,EAAE,QAAQI,CAAG,EAAGK,EAAIT,EAAE,QAAQI,EAAM,CAAC,EAAGK,IACnDF,EAAI,KAAK,CACP,KAAMP,EAAE,MAAMA,EAAE,KAAKS,CAAC,CAAC,EACvB,MAAOT,EAAE,MAAMS,CAAC,EAChB,GAAIT,EAAE,GAAGS,CAAC,EACV,YAAaT,EAAE,YAAYS,CAAC,IAAM,CACpC,CAAC,EAEH,OAAOF,CACT,CACA,SAASqI,GAAW,EAAGC,EAAM,CAC3B,IAAMjB,EAAO,EAAE,KAAK,IAAI,CAACI,EAAM3J,IAAM,CACnC,IAAMsE,EAAO,CAAC,EACd,QAASlC,EAAI,EAAE,QAAQpC,CAAC,EAAGoC,EAAI,EAAE,QAAQpC,EAAI,CAAC,EAAGoC,IAC/CkC,EAAK,KAAK6F,GAAM,EAAG/H,CAAC,CAAC,EAEvB,MAAO,CACL,GAAGuH,EACH,KAAArF,EACA,OAAQ,EAAE,QAAUgG,GAAS,EAAE,OAAQtK,CAAC,CAC1C,CACF,CAAC,EACD,MAAO,CAAE,OAAQ,EAAE,OAAQ,KAAAwK,EAAM,UAAWjB,EAAK,CAAC,EAAG,KAAMA,EAAK,MAAM,CAAC,CAAE,CAC3E",
6
+ "names": ["START_STOP_TAG", "END_STOP_TAG", "STOP_KINDS", "GAP_CAUSE_TEXT", "OUTSIDE_TEXT", "gapParts", "bp", "after", "before", "left", "right", "rest", "lead", "trail", "elsewhere", "s", "part", "stopAt", "table", "i", "ref", "stopOf", "kind", "trimmed", "chunk", "cut", "parseStopTag", "value", "kind", "fields", "bp", "trimmed", "chunk", "field", "at", "stopOf", "stopFields", "before", "after", "walkStopFields", "tags", "START_STOP_TAG", "END_STOP_TAG", "StopColumns", "stop", "STOP_KINDS", "chunk", "ref", "pLineName", "name", "start", "end", "tablePath", "w", "p", "walkName", "fields", "panSNFields", "steps", "abridged", "stopFields", "stopAt", "namesByList", "lists", "names", "listCount", "pathNames", "starts", "list", "i", "fill", "grouped", "listed", "_", "out", "k", "tableNodeIds", "n", "l", "traversals", "canonical", "claim", "node", "reversed", "stepCount", "s", "segment", "graphFromTables", "count", "declared", "drawnWalks", "ids", "nodes", "ref", "edges", "neighbours", "pairList", "a", "b", "near", "j", "addPair", "edgeLists", "adjacency", "adjacentNode", "adjacentList", "listOf", "nameIndex", "crossedList", "crossedName", "crossings", "lastWalk", "paths", "anchorPaths", "totalSteps", "visitPath", "visitStart", "visitReversed", "visitOrder", "blocks", "pathSamples", "edgeNameIndex", "edgeNames", "head", "pathName", "visitName", "named", "panSNSample", "edgeNamed", "visitSample", "first", "nodeIds", "pos", "prev", "at", "listNames", "edge", "walked", "PathVisits", "RUN_ON_REFERENCE", "RUN_REVERSED", "RUN_GAP", "GAP_CAUSES", "CAUSE_SHIFT", "causeFlags", "cause", "referenceOf", "names", "referencePath", "rankZero", "referenceWalkName", "graph", "p", "pathOrigin", "n", "namesReference", "reference", "contig", "panSNContig", "name", "graphPieces", "index", "lengths", "indexOf", "id", "i", "onReferenceContig", "stable", "node", "heads", "from", "to", "steps", "path", "tablePieces", "tables", "visits", "w", "kept", "tablePath", "h", "tableNodeIds", "sampleOf", "panSNSample", "labelOf", "Columns", "width", "a", "b", "c", "d", "e", "v", "order", "make", "offsets", "row", "columns", "m", "out", "at", "k", "float64", "walkRowRuns", "source", "region", "o", "all", "stableStart", "declared", "lengthOf", "nameOf", "startOf", "byStart", "pieceIds", "_", "referencePieces", "first", "others", "skips", "walks", "groupBy", "spanStart", "spanEnd", "revisits", "flankEnd", "flankStart", "cut", "piece", "pos", "s", "stop", "len", "starts", "flanked", "runs", "chunks", "chunkIndex", "chunkOf", "chunk2", "key", "stepStart", "rowOf", "pieces", "head", "ordered", "count", "abridgedSteps", "length", "unplaced", "end", "previous", "partsAt", "owed", "start2", "jump", "covered", "gap", "gapParts", "abridged", "stop2", "bp3", "onReference", "stepEnd", "partialSide", "i0", "i1", "flank", "near", "forward", "after", "last2", "contigEnds", "lo", "hi", "backward", "complete", "flankFrom", "flankTo", "axisStart", "trimAbridged", "inner", "trimmed", "abridgedAt", "placeStart", "leftTrim", "rightTrim", "bestEnd", "bestStart", "end2", "inside", "inward", "axis", "bp2", "offReferenceBp", "gapBp", "step", "last", "lastFlags", "lastRef", "cursor", "placeOf", "best", "bestGap", "runBp", "runRef", "runFlags", "parts", "part", "on", "placed", "back", "skipRowOf", "from2", "panSNFields", "referenceRow", "rows", "drawn", "metas", "r", "meta", "panSNHaplotype", "start", "bp", "referenceStart", "flags", "chunk", "visitColumns", "runAt", "f", "run", "visitsOf", "walkRowsOf", "unit"]
7
+ }
@@ -1,2 +1,2 @@
1
- import{l as b,m as $,n as S,p as E,q as x,r as T}from"./chunk-CZXJXNZN.js";function A(e){let{refName:n,start:t,end:r}=e??{};return typeof n=="string"&&Number.isFinite(t)&&Number.isFinite(r)&&t<r?{refName:n,start:t,end:r}:void 0}function D(e){let n=Number(e);return e!=="auto"&&Number.isFinite(n)?n:"auto"}var w=e=>e.toLocaleString("en-US"),v=({refName:e,start:n,end:t})=>`${e}:${w(n+1)}-${w(t)}`,L=e=>`Forms of ${v(e)}: `;var C={deletion:{svType:"DEL",type:"deletion",alt:"<DEL>"},insertion:{svType:"INS",type:"insertion",alt:"<INS>"},duplication:{svType:"DUP",type:"tandem_duplication",alt:"<DUP:TANDEM>"},replacement:{svType:"CPX",type:"complex_substitution",alt:"<CPX>"},inversion:{svType:"INV",type:"inversion",alt:"<INV>",consequence:"inversion"},shift:{svType:"CPX",type:"complex_structural_alteration",alt:"<CPX>",consequence:"shift"},net:{svType:"CPX",type:"complex_structural_alteration",alt:"<CPX>",consequence:"net"}},_=e=>e.lopsided??(e.delta<0?"deletion":"insertion"),P=e=>C[e.kind].consequence??(_(e)==="deletion"?"loss":"gain"),f=e=>`F${e+1}`,O="other",l=8;function F(e,n){let t=100*e/n;return t>0&&t<1?"<1%":`${Math.round(t)}%`}var d=({forms:e},n)=>e.length>n+1?Math.max(0,n):e.length,m=e=>e.reduce((n,t)=>n+t.members.length,0);function U(e,n=l){let t=d(e,n),r=e.forms.slice(t);return[...e.forms.slice(0,t).map((s,a)=>({name:f(a),label:`${F(s.members.length,e.placed)} \xB7 ${T(s,e)}`,haplotypes:s.members.length,forms:1})),...r.length>0?[{name:O,label:`other forms \xB7 ${F(m(r),e.placed)}`,haplotypes:m(r),forms:r.length}]:[]]}var N=5;function k(e){let n=e.slice(0,N).join(", "),t=e.length-N;return t>0?`${n} and ${t} more`:n}var u=e=>`${e} haplotype${e===1?"":"s"}`;function j(e,n=l){let{abridged:t,unplaced:r,forms:s}=e,a=d(e,n),i=s.slice(a);return[...i.length>0?[`${i.length} smaller forms, ${u(m(i))}, share the empty "other forms" row; maxForms sets how many forms get a row of their own`]:[],...t.length>0?[`${u(t.length)} kept an abridged walk past the forms cut's step budget, which shows as a net change over its span: ${k(t)}`]:[],...r.length>0?[`${u(r.length)} ${r.length===1?"has":"have"} no walk over the pinned window, so no form: ${k(r)}`]:[]]}function V(e,n=l){return Object.fromEntries(e.forms.slice(0,d(e,n)).map((t,r)=>[f(r),"0"]))}function q({copied:e,refStart:n,refEnd:t}){let[r,s]=e??[n,t];return{start:r,end:Math.max(s,r+1)}}var R=(e,n)=>e===n?"1":e===$||e===S?".":"0";function K(e,n=l){let{sites:t,forms:r,placed:s}=e,a=d(e,n);return t.flatMap((i,g)=>i.edge?[]:i.states.flatMap(c=>{if(c.key===b)return[];let h=r.map(o=>x(e,o,g)),y=Object.fromEntries(h.slice(0,a).map((o,p)=>[f(p),R(o,c.key)])),M=m(r.filter((o,p)=>h[p]===c.key));return Object.values(y).includes("1")?c.marks.map((o,p)=>({id:`${g}:${c.key}:${p}`,...q(o),name:E(o),description:`${M} of ${u(s)}`,...C[o.kind],consequence:P(o),mark:o,genotypes:y})):[]}))}export{A as a,D as b,v as c,L as d,l as e,U as f,j as g,V as h,K as i};
2
- //# sourceMappingURL=chunk-PTOKTIQG.js.map
1
+ import{l as b,m as $,n as S,p as E,q as x,r as T}from"./chunk-HAVM67SF.js";function A(e){let{refName:n,start:t,end:r}=e??{};return typeof n=="string"&&Number.isFinite(t)&&Number.isFinite(r)&&t<r?{refName:n,start:t,end:r}:void 0}function D(e){let n=Number(e);return e!=="auto"&&Number.isFinite(n)?n:"auto"}var w=e=>e.toLocaleString("en-US"),v=({refName:e,start:n,end:t})=>`${e}:${w(n+1)}-${w(t)}`,L=e=>`Forms of ${v(e)}: `;var C={deletion:{svType:"DEL",type:"deletion",alt:"<DEL>"},insertion:{svType:"INS",type:"insertion",alt:"<INS>"},duplication:{svType:"DUP",type:"tandem_duplication",alt:"<DUP:TANDEM>"},replacement:{svType:"CPX",type:"complex_substitution",alt:"<CPX>"},inversion:{svType:"INV",type:"inversion",alt:"<INV>",consequence:"inversion"},shift:{svType:"CPX",type:"complex_structural_alteration",alt:"<CPX>",consequence:"shift"},net:{svType:"CPX",type:"complex_structural_alteration",alt:"<CPX>",consequence:"net"}},_=e=>e.lopsided??(e.delta<0?"deletion":"insertion"),P=e=>C[e.kind].consequence??(_(e)==="deletion"?"loss":"gain"),f=e=>`F${e+1}`,O="other",l=8;function F(e,n){let t=100*e/n;return t>0&&t<1?"<1%":`${Math.round(t)}%`}var d=({forms:e},n)=>e.length>n+1?Math.max(0,n):e.length,m=e=>e.reduce((n,t)=>n+t.members.length,0);function U(e,n=l){let t=d(e,n),r=e.forms.slice(t);return[...e.forms.slice(0,t).map((s,a)=>({name:f(a),label:`${F(s.members.length,e.placed)} \xB7 ${T(s,e)}`,haplotypes:s.members.length,forms:1})),...r.length>0?[{name:O,label:`other forms \xB7 ${F(m(r),e.placed)}`,haplotypes:m(r),forms:r.length}]:[]]}var N=5;function k(e){let n=e.slice(0,N).join(", "),t=e.length-N;return t>0?`${n} and ${t} more`:n}var u=e=>`${e} haplotype${e===1?"":"s"}`;function j(e,n=l){let{abridged:t,unplaced:r,forms:s}=e,a=d(e,n),i=s.slice(a);return[...i.length>0?[`${i.length} smaller forms, ${u(m(i))}, share the empty "other forms" row; maxForms sets how many forms get a row of their own`]:[],...t.length>0?[`${u(t.length)} kept an abridged walk past the forms cut's step budget, which shows as a net change over its span: ${k(t)}`]:[],...r.length>0?[`${u(r.length)} ${r.length===1?"has":"have"} no walk over the pinned window, so no form: ${k(r)}`]:[]]}function V(e,n=l){return Object.fromEntries(e.forms.slice(0,d(e,n)).map((t,r)=>[f(r),"0"]))}function q({copied:e,refStart:n,refEnd:t}){let[r,s]=e??[n,t];return{start:r,end:Math.max(s,r+1)}}var R=(e,n)=>e===n?"1":e===$||e===S?".":"0";function K(e,n=l){let{sites:t,forms:r,placed:s}=e,a=d(e,n);return t.flatMap((i,g)=>i.edge?[]:i.states.flatMap(c=>{if(c.key===b)return[];let h=r.map(o=>x(e,o,g)),y=Object.fromEntries(h.slice(0,a).map((o,p)=>[f(p),R(o,c.key)])),M=m(r.filter((o,p)=>h[p]===c.key));return Object.values(y).includes("1")?c.marks.map((o,p)=>({id:`${g}:${c.key}:${p}`,...q(o),name:E(o),description:`${M} of ${u(s)}`,...C[o.kind],consequence:P(o),mark:o,genotypes:y})):[]}))}export{A as a,D as b,v as c,L as d,l as e,U as f,j as g,V as h,K as i};
2
+ //# sourceMappingURL=chunk-TMFUYJFG.js.map
@@ -1,2 +1,2 @@
1
1
  import{d as A}from"./chunk-ROZPEXN4.js";import{a as x,d as O}from"./chunk-3VGXCEMQ.js";import{f as I}from"./chunk-6VNDP3UB.js";function G(e){return Array.isArray(e)&&e.every(t=>typeof t=="string")}function se(e){let t=x(e).slice(1);return t.length>0?t:void 0}function M(e){return e.type==="WalkTabixSyntenyAdapter"||e.type==="RgfaTabixAdapter"&&(typeof e.walksUri=="string"&&e.walksUri!==""||I(e.walksLocation))}function oe(e){return e.type==="GbzBaseSyntenyAdapter"||M(e)}function ie(e){let{defaultHaplotypes:t}=e;return M(e)&&G(t)&&t.length>0?t:void 0}function ae(e){return x(e)[0]}function ce(e){return O(e).adapter}function ue(e,t){return e===void 0||e===t?void 0:`The graph is cut on its reference, ${e}: open it from a view of ${e}`}function i(e,t){return typeof e.get=="function"?e.get(t):e[t]}function b(e,t){return e.find(n=>n.trackId===t)}function l(e){return`${e.trackId} ${e.name??""}`}var U=new Set(["BedAdapter","BedTabixAdapter","BigBedAdapter","VcfAdapter","VcfTabixAdapter"]),R=/repeat|tandem|\bstr\b|vntr|trf|trgt|vamos|expansion|microsat/i;function Ge(e,t){let n=t?b(e,t):void 0;return n||e.filter(s=>U.has(s.adapterType)).find(s=>R.test(l(s)))}var B=/^\w+=[^;]*(;\w+=[^;]*)*$/;function H(e){let t=i(e,"name");if(!(typeof t!="string"||!B.test(t)))return Object.fromEntries(t.split(";").map(n=>{let r=n.indexOf("=");return[n.slice(0,r),n.slice(r+1)]}))}function d(e,t){let n=i(e,t);return n!==void 0?n:i(e,"INFO")?.[t]??H(e)?.[t]}var P=["RUS","MOTIFS","RU","motifs","motif","sequence","consensus"],v=["RUL","period","PERIOD","consensusSize","unit","unitLength"],j=["TRID","REPID","VARID","ID","name","id"];function h(e,t){for(let n of t){let r=d(e,n),s=String((Array.isArray(r)?r[0]:r)??"").split(",")[0].trim();if(s!==""&&s!==".")return s}}var $=/^[ACGTURYSWKMBDHVN]+$/i;function V(e){let t=Number(h(e,v));if(Number.isFinite(t)&&t>0)return Math.round(t);let n=h(e,P);return n&&$.test(n)?n.length:void 0}function m(e){return(Array.isArray(e)?e:String(e??"").split(",")).map(n=>{let r=n===""||n===null||n===void 0?NaN:Number(n);return Number.isFinite(r)?r:void 0})}function N(e){return(Array.isArray(e)?e:String(e??"").split(",")).map(n=>{let r=String(n??"").trim();return r===""||r==="."?void 0:r})}var w="<CNV:TR>";function K(e){let t=N(i(e,"ALT"));if(!t.includes(w))return;let n=m(d(e,"RN")),r=N(d(e,"RUS")),s=m(d(e,"RUL")),o=m(d(e,"RUC")),a=m(d(e,"RB")),c=0;return t.map((u,f)=>{let p=n[f]??(u===w?1:0),k=0,S=0;for(let F=0;F<p;F++,c++){let y=r[c],L=s[c]??(y&&$.test(y)?y.length:void 0),_=o[c],C=a[c]??(L&&_!==void 0?Math.round(L*_):void 0);C!==void 0&&(k+=C,S++)}return u===w&&p>0&&S===p?k:void 0})}function Y(e,t,n){let r=e?.includes("|");return(e??"").split(/[/|]/).flatMap((s,o)=>{let a=s===""?NaN:Number(s),c=a>0?t[a-1]:n;return!Number.isInteger(a)||c===void 0?[]:[{bp:c,...r?{haplotype:o+1}:{}}]})}function W(e,t,n){let r=i(e,"samples"),s={};for(let[o,a]of Object.entries(r??{})){let c=m(a.SD),u=m(a.AL).flatMap((p,k)=>p!==void 0&&p>0?[c[k]===void 0?{bp:p}:{bp:p,spanningReads:c[k]}]:[]),f=u.length>0||!t?u:Y(N(a.GT)[0],t,n);f.length>0&&(s[o]=f)}return Object.keys(s).length>0?s:void 0}function J(e,t){let n=d(e,"start"),r=d(e,"end"),s=m(d(e,"SVLEN"))[0];return t&&s!==void 0?{start:n+1,end:n+1+s}:{start:n,end:r}}function Ue(e){let t=[];for(let n of e){let r=K(n),{start:s,end:o}=J(n,r!==void 0),a=V(n);if(!(o>s)||a===void 0)continue;let c=d(n,"refName"),u=h(n,P),f=h(n,j);t.push({key:`${c}:${s}-${o}`,name:(f&&!B.test(f)?f:void 0)??(u&&u.length<=12?`(${u})n`:`${c}:${(s+1).toLocaleString("en-US")}-${o.toLocaleString("en-US")}`),refName:c,start:s,end:o,unit:a,motif:u,calls:W(n,r,o-s)})}return t.sort((n,r)=>n.start-r.start)}function T(e){let t=[];for(let n of[...e].sort((r,s)=>r.start-s.start)){let r=t.at(-1);r&&n.start<=r.end?r.end=Math.max(r.end,n.end):t.push({...n})}return t}function E(e){let t=[],n=new Map;for(let r of[...e].sort((s,o)=>s.start-o.start)){let s=`${r.refName} ${r.strand} ${r.name}`,o=n.get(s);if(o&&r.start<o.end)o.end=Math.max(o.end,r.end),o.exons=T([...o.exons,...r.exons]);else{let a={...r,exons:T(r.exons)};t.push(a),n.set(s,a)}}return t}var q=new Set(["Gff3TabixAdapter","Gff3Adapter","BedTabixAdapter","BedAdapter","GtfTabixAdapter","GtfAdapter","BigBedAdapter","NCListAdapter"]),z=/gene|refseq|gencode|ensembl|annotation/i,X=new Set(["BedTabixAdapter","BedAdapter"]);function Qe(e,t){let n=t?b(e,t):void 0;if(n)return n;let r=e.filter(s=>q.has(s.adapterType)&&!R.test(l(s)));return r.find(s=>z.test(l(s)))??r.find(s=>!X.has(s.adapterType))}var Q=/\bTEs?\b|transpos/i;function Ze(e){return e&&Q.test(l(e))?"TE":"gene"}function en(e,t){let n=e.tracks?.find(r=>A(r.configuration,"trackId")===t)?.displays[0];return n?A(n.configuration,"filter")??[]:[]}var Z=new Set(["chromosome","region","contig","supercontig","scaffold"]),ee=new Set(["exon","CDS","five_prime_UTR","three_prime_UTR","UTR"]);function D(e,t){let n=i(e,"type");typeof n=="string"&&ee.has(n)&&t.push({start:i(e,"start"),end:i(e,"end")});let r=i(e,"subfeatures");for(let s of r??[])D(s,t)}function nn(e){let t=[];for(let n of e){let r=i(n,"gene_name")??i(n,"name")??i(n,"gene")??i(n,"gene_id"),s=i(n,"start"),o=i(n,"end");if(!r||!(o>s)||Z.has(i(n,"type")))continue;let a=[];D(n,a),t.push({name:r,refName:i(n,"refName"),start:s,end:o,strand:i(n,"strand")??0,exons:a.length?T(a):[{start:s,end:o}]})}return E(t)}var g=JBrowseExports["tss-react/mui"],ne=e=>g!=null&&e in Object(g)?g[e]:Object.assign(function(){throw new Error("This JBrowse does not provide '"+e+"' from 'tss-react/mui' to plugins: GraphGenomeView was built for a different JBrowse version, so update the plugin or JBrowse")},{jbrowseHostMissing:e});var rn=ne("makeStyles"),sn=g&&g.__esModule?g.default:g;export{se as a,M as b,oe as c,ie as d,ae as e,ce as f,ue as g,U as h,Ge as i,Ue as j,q as k,Qe as l,Ze as m,en as n,nn as o,rn as p};
2
- //# sourceMappingURL=chunk-WUOXZAGN.js.map
2
+ //# sourceMappingURL=chunk-WA7FCDLQ.js.map