jbrowse-plugin-graphgenomeviewer 8.3.6 → 8.3.8

package/dist/chunks/{chunk-HICKAMKK.js.map → chunk-AZUO4NZ5.js.map}

@@ -1,6 +1,6 @@
 {
   "version": 3,
-  "sources": ["../../node_modules/.pnpm/@jbrowse+bandage-core@12.3.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-BSOZW3FC.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.3.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-HOAIOEI7.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.3.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-RJWPJCIB.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.3.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-BEUTROKU.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.3.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-BRH73RCH.js"],
+  "sources": ["../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-BSOZW3FC.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-HOAIOEI7.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-RJWPJCIB.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-BEUTROKU.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-BRH73RCH.js"],
   "sourcesContent": ["// src/util/groups.ts\nfunction pushTo(map, key, value) {\n  const list = map.get(key);\n  if (list) {\n    list.push(value);\n  } else {\n    map.set(key, [value]);\n  }\n}\nfunction addTo(map, key, value) {\n  const set = map.get(key);\n  if (set) {\n    set.add(value);\n  } else {\n    map.set(key, /* @__PURE__ */ new Set([value]));\n  }\n}\nfunction groupBy(items, keyOf) {\n  const groups = /* @__PURE__ */ new Map();\n  for (const item of items) {\n    pushTo(groups, keyOf(item), item);\n  }\n  return groups;\n}\n\nexport {\n  pushTo,\n  addTo,\n  groupBy\n};\n", "// src/util/partitionPoint.ts\nfunction partitionPoint(n, pred) {\n  let lo = 0;\n  let hi = n;\n  while (lo < hi) {\n    const mid = lo + hi >> 1;\n    if (pred(mid)) {\n      lo = mid + 1;\n    } else {\n      hi = mid;\n    }\n  }\n  return lo;\n}\n\nexport {\n  partitionPoint\n};\n", "import {\n  partitionPoint\n} from \"./chunk-HOAIOEI7.js\";\n\n// src/anchoredNodes.ts\nvar REFERENCE_RANK = 0;\nfunction isAnchored(node) {\n  return node.stable !== void 0;\n}\nfunction isBackbone(node) {\n  return node.stable?.rank === REFERENCE_RANK;\n}\nfunction isOffReference(node) {\n  return node.stable !== void 0 && node.stable.rank > REFERENCE_RANK;\n}\nfunction backboneNodes(graph) {\n  return graph.nodes.filter(isBackbone);\n}\nfunction overlapsWindow(node, window) {\n  return node.stable.start < window.end && node.stable.start + node.length > window.start;\n}\nfunction backbonePositions(backbone) {\n  const positions = {};\n  for (const node of backbone) {\n    positions[node.id] = [\n      { x: node.stable.start, y: 0 },\n      { x: node.stable.start + node.length, y: 0 }\n    ];\n  }\n  return positions;\n}\nfunction firstNodeAtOrAfter(nodes, bp) {\n  return partitionPoint(nodes.length, (i) => nodes[i].stable.start < bp);\n}\nfunction backboneSpan(backbone) {\n  let min = Infinity;\n  let max = -Infinity;\n  for (const node of backbone) {\n    min = Math.min(min, node.stable.start);\n    max = Math.max(max, node.stable.start + node.length);\n  }\n  return max - min;\n}\nfunction referenceSpan(backbone, region) {\n  return region && region.end > region.start ? region.end - region.start : backboneSpan(backbone);\n}\n\nexport {\n  REFERENCE_RANK,\n  isAnchored,\n  isBackbone,\n  isOffReference,\n  backboneNodes,\n  overlapsWindow,\n  backbonePositions,\n  firstNodeAtOrAfter,\n  backboneSpan,\n  referenceSpan\n};\n", "// src/pathVisits.ts\nvar PathVisits = class {\n  constructor(columns) {\n    this.segments = columns.segments;\n    this.offsets = columns.offsets;\n    this.path = columns.path;\n    this.start = columns.start;\n    this.reversed = columns.reversed;\n    this.paths = columns.paths;\n    this.samples = columns.samples;\n    this.slots = new Map(this.segments.map((s, i) => [s, i]));\n  }\n  static from(entries) {\n    const builder = new PathVisitsBuilder();\n    for (const [segment, visits] of entries) {\n      builder.declare(segment);\n      for (const v of visits) {\n        builder.add(segment, v.path, v.sample, v.start, v.strand === \"-\");\n      }\n    }\n    return builder.build();\n  }\n  get size() {\n    return this.segments.length;\n  }\n  // the segment's index into `segments` and `offsets`, -1 when unvisited\n  slot(segment) {\n    return this.slots.get(segment) ?? -1;\n  }\n  pathIndex(path) {\n    return this.paths.indexOf(path);\n  }\n  // the first of `slot`'s visits by path `p`, -1 for none\n  firstBy(slot, p) {\n    for (let i = this.offsets[slot]; i < this.offsets[slot + 1]; i++) {\n      if (this.path[i] === p) {\n        return i;\n      }\n    }\n    return -1;\n  }\n  // the visit of `slot` on the path first in name order, at its lowest offset\n  // there: where gfa-to-tabix places a segment the reference doesn't visit, so\n  // both place it alike whatever order the file lists its paths in\n  firstByName(slot) {\n    let best = this.offsets[slot];\n    for (let i = best + 1; i < this.offsets[slot + 1]; i++) {\n      const a = this.paths[this.path[i]];\n      const b = this.paths[this.path[best]];\n      if (a < b || a === b && this.start[i] < this.start[best]) {\n        best = i;\n      }\n    }\n    return best;\n  }\n  // Paths' steps replayed in walk order against their visits: the k-th call\n  // for one path and segment answers that path's k-th visit there, -1 past\n  // its last. A walk in pieces lists its pieces in path order, so replaying\n  // the pieces in order reads each step's own visit.\n  replay() {\n    const cursor = /* @__PURE__ */ new Map();\n    return (slot, p) => {\n      if (slot < 0 || p < 0) {\n        return -1;\n      }\n      const key = slot * this.paths.length + p;\n      const end = this.offsets[slot + 1];\n      let at = cursor.get(key) ?? this.offsets[slot];\n      while (at < end && this.path[at] !== p) {\n        at++;\n      }\n      cursor.set(key, at + 1);\n      return at < end ? at : -1;\n    };\n  }\n  // the visits of paths `keepPath` accepts, at segments `keepSegment` does\n  filter(keepPath, keepSegment = () => true) {\n    const kept = this.paths.map(keepPath);\n    const builder = new PathVisitsBuilder();\n    this.segments.forEach((segment, s) => {\n      if (!keepSegment(segment)) {\n        return;\n      }\n      const slot = builder.declare(segment);\n      for (let i = this.offsets[s]; i < this.offsets[s + 1]; i++) {\n        const p = this.path[i];\n        if (kept[p]) {\n          builder.addAt(\n            slot,\n            builder.pathOf(this.paths[p], this.samples[p]),\n            this.start[i],\n            this.reversed[i] === 1\n          );\n        }\n      }\n    });\n    return builder.build();\n  }\n  strand(i) {\n    return this.reversed[i] ? \"-\" : \"+\";\n  }\n  visit(i) {\n    const p = this.path[i];\n    return {\n      path: this.paths[p],\n      sample: this.samples[p],\n      start: this.start[i],\n      strand: this.strand(i)\n    };\n  }\n  visitsAt(slot) {\n    const out = [];\n    for (let i = this.offsets[slot]; i < this.offsets[slot + 1]; i++) {\n      out.push(this.visit(i));\n    }\n    return out;\n  }\n  get(segment) {\n    const slot = this.slot(segment);\n    return slot < 0 ? void 0 : this.visitsAt(slot);\n  }\n  has(segment) {\n    return this.slots.has(segment);\n  }\n  keys() {\n    return this.segments[Symbol.iterator]();\n  }\n  *values() {\n    for (let s = 0; s < this.segments.length; s++) {\n      yield this.visitsAt(s);\n    }\n  }\n  *entries() {\n    for (let s = 0; s < this.segments.length; s++) {\n      yield [this.segments[s], this.visitsAt(s)];\n    }\n  }\n  [Symbol.iterator]() {\n    return this.entries();\n  }\n};\nvar Column = class {\n  constructor(data) {\n    this.data = data;\n    this.length = 0;\n  }\n  push(value) {\n    if (this.length === this.data.length) {\n      const grown = new this.data.constructor(\n        this.data.length * 2\n      );\n      grown.set(this.data);\n      this.data = grown;\n    }\n    this.data[this.length++] = value;\n  }\n};\nvar PathVisitsBuilder = class {\n  constructor() {\n    this.segments = [];\n    this.slots = /* @__PURE__ */ new Map();\n    this.paths = [];\n    this.samples = [];\n    this.pathIndex = /* @__PURE__ */ new Map();\n    this.slot = new Column(new Int32Array(1024));\n    this.path = new Column(new Int32Array(1024));\n    this.start = new Column(new Float64Array(1024));\n    this.reversed = new Column(new Uint8Array(1024));\n  }\n  // a segment's place in iteration order, though it has no visits yet\n  declare(segment) {\n    let s = this.slots.get(segment);\n    if (s === void 0) {\n      s = this.segments.length;\n      this.slots.set(segment, s);\n      this.segments.push(segment);\n    }\n    return s;\n  }\n  // a path's index, so a caller adding many of its visits names it once\n  pathOf(path, sample) {\n    let p = this.pathIndex.get(path);\n    if (p === void 0) {\n      p = this.paths.length;\n      this.pathIndex.set(path, p);\n      this.paths.push(path);\n      this.samples.push(sample);\n    }\n    return p;\n  }\n  add(segment, path, sample, start, reversed) {\n    this.addAt(\n      this.declare(segment),\n      this.pathOf(path, sample),\n      start,\n      reversed\n    );\n  }\n  addAt(slot, path, start, reversed) {\n    this.slot.push(slot);\n    this.path.push(path);\n    this.start.push(start);\n    this.reversed.push(reversed ? 1 : 0);\n  }\n  build() {\n    const n = this.slot.length;\n    const segments = this.segments.length;\n    const offsets = new Int32Array(segments + 1);\n    const slot = this.slot.data;\n    for (let i = 0; i < n; i++) {\n      offsets[slot[i] + 1]++;\n    }\n    for (let s = 0; s < segments; s++) {\n      offsets[s + 1] += offsets[s];\n    }\n    const fill = offsets.slice(0, segments);\n    const path = new Int32Array(n);\n    const start = new Float64Array(n);\n    const reversed = new Uint8Array(n);\n    for (let i = 0; i < n; i++) {\n      const at = fill[slot[i]]++;\n      path[at] = this.path.data[i];\n      start[at] = this.start.data[i];\n      reversed[at] = this.reversed.data[i];\n    }\n    return new PathVisits({\n      segments: this.segments,\n      offsets,\n      path,\n      start,\n      reversed,\n      paths: this.paths,\n      samples: this.samples\n    });\n  }\n};\n\nexport {\n  PathVisits,\n  Column,\n  PathVisitsBuilder\n};\n", "import {\n  PathVisitsBuilder\n} from \"./chunk-BEUTROKU.js\";\nimport {\n  groupBy\n} from \"./chunk-BSOZW3FC.js\";\nimport {\n  REFERENCE_RANK\n} from \"./chunk-RJWPJCIB.js\";\nimport {\n  panSNSample\n} from \"./chunk-2JL2JVZ2.js\";\n\n// src/pathAnchoring.ts\nvar RANGE_SUFFIX = /:(\\d+)-\\d+$/;\nvar VG_FRAGMENT = /^([^#]*#[^#]*#[^#[]*)#(\\d+)(?:\\[(\\d+)-\\d+\\])?$/;\nvar VG_SUBRANGE = /\\[(\\d+)-\\d+\\]$/;\nfunction pathOrigin(pathName) {\n  const fragment = VG_FRAGMENT.exec(pathName);\n  if (fragment) {\n    return { name: fragment[1], start: +fragment[2] + +(fragment[3] ?? 0) };\n  }\n  const match = RANGE_SUFFIX.exec(pathName) ?? VG_SUBRANGE.exec(pathName);\n  return match ? { name: pathName.slice(0, match.index), start: +match[1] } : { name: pathName, start: 0 };\n}\nfunction surveyPaths(paths, lengthOf) {\n  const anchorPaths = [];\n  const visits = new PathVisitsBuilder();\n  for (const path of paths) {\n    const sample = panSNSample(path.name);\n    const p = visits.pathOf(path.name, sample);\n    let pos = path.start;\n    for (const step of path.steps) {\n      visits.addAt(visits.declare(step.id), p, pos, step.strand === \"-\");\n      pos += lengthOf(step.id);\n    }\n    anchorPaths.push({\n      name: path.name,\n      sample,\n      start: path.start,\n      length: pos - path.start\n    });\n  }\n  return { anchorPaths, pathVisits: visits.build() };\n}\nfunction chooseReferencePath(anchorPaths, preferred) {\n  const named = anchorPaths.find(\n    (p) => p.sample === preferred || p.name === preferred\n  );\n  return named ?? anchorPaths[0];\n}\nvar OFF_REFERENCE_RANK = 1;\nfunction anchorNode(node, visits, reference, samplesOf) {\n  const slot = visits.slot(node.name);\n  if (slot < 0 || visits.offsets[slot] === visits.offsets[slot + 1]) {\n    return node;\n  }\n  const own = visits.firstBy(slot, reference);\n  const anchor = own >= 0 ? own : visits.firstByName(slot);\n  return {\n    ...node,\n    stable: {\n      refName: visits.paths[visits.path[anchor]],\n      start: visits.start[anchor],\n      rank: own >= 0 ? REFERENCE_RANK : OFF_REFERENCE_RANK,\n      strand: visits.strand(anchor)\n    },\n    samples: samplesOf(slot)\n  };\n}\nfunction sampleSorter(visits) {\n  const sorted = [...new Set(visits.samples)].sort();\n  const rank = new Map(sorted.map((sample, i) => [sample, i]));\n  const pathRank = Int32Array.from(visits.samples, (s) => rank.get(s));\n  const seen = new Uint8Array(sorted.length);\n  const ranks = new Int32Array(sorted.length);\n  return (slot) => {\n    let n = 0;\n    for (let i = visits.offsets[slot]; i < visits.offsets[slot + 1]; i++) {\n      const r = pathRank[visits.path[i]];\n      if (seen[r] === 0) {\n        seen[r] = 1;\n        ranks[n++] = r;\n      }\n    }\n    let out;\n    if (n === sorted.length) {\n      out = sorted;\n      seen.fill(0);\n    } else if (n * 8 < sorted.length) {\n      const found = ranks.subarray(0, n);\n      found.forEach((r) => seen[r] = 0);\n      out = Array.from(found.sort(), (r) => sorted[r]);\n    } else {\n      out = [];\n      for (let r = 0; r < sorted.length; r++) {\n        if (seen[r] === 1) {\n          seen[r] = 0;\n          out.push(sorted[r]);\n        }\n      }\n    }\n    return out;\n  };\n}\nfunction anchorFromPaths(graph, preferred) {\n  const { anchorPaths, pathVisits } = graph;\n  const reference = anchorPaths && pathVisits ? chooseReferencePath(anchorPaths, preferred) : void 0;\n  if (!reference || !anchorPaths || !pathVisits) {\n    return graph;\n  }\n  const samplesOf = sampleSorter(pathVisits);\n  const referenceIndex = pathVisits.pathIndex(reference.name);\n  return {\n    ...graph,\n    nodes: graph.nodes.map(\n      (node) => anchorNode(node, pathVisits, referenceIndex, samplesOf)\n    ),\n    anchoredBy: \"paths\",\n    referencePath: reference.name\n  };\n}\nfunction anchorGraph(graph, preferred) {\n  if (graph.anchoredBy !== \"tags\") {\n    return anchorFromPaths(graph, preferred);\n  }\n  const referencePath = taggedReferencePath(graph);\n  return referencePath ? { ...graph, referencePath } : graph;\n}\nfunction taggedReferencePath(graph) {\n  const refName = graph.nodes.find((n) => n.stable?.rank === 0)?.stable?.refName;\n  return refName !== void 0 && graph.anchorPaths?.some((p) => p.name === refName) ? refName : void 0;\n}\nfunction trimOrigins(graph, kept) {\n  if (!graph.anchorPaths) {\n    return void 0;\n  }\n  const lengthOf = new Map(graph.nodes.map((n) => [n.id, n.length]));\n  const bp = (ids, end = ids.length) => {\n    let sum = 0;\n    for (let i = 0; i < end; i++) {\n      sum += lengthOf.get(ids[i]) ?? 0;\n    }\n    return sum;\n  };\n  const byOrigin = groupBy(graph.paths ?? [], (p) => pathOrigin(p.name).name);\n  return graph.anchorPaths.map((o) => {\n    const pieces = byOrigin.get(o.name);\n    const path = pieces?.length === 1 ? pieces[0] : void 0;\n    const stretch = path && kept.get(path.name);\n    return path && stretch ? {\n      ...o,\n      start: o.start + bp(path.nodeIds, stretch.first),\n      length: bp(stretch.nodeIds)\n    } : o;\n  });\n}\nfunction referenceVisitStarts(graph) {\n  const { pathVisits } = graph;\n  const cache = /* @__PURE__ */ new Map();\n  return (node) => {\n    let starts = cache.get(node.id);\n    if (!starts) {\n      starts = [];\n      const slot = pathVisits ? pathVisits.slot(node.name) : -1;\n      const p = slot >= 0 ? pathVisits.pathIndex(node.stable.refName) : -1;\n      if (p >= 0) {\n        for (let i = pathVisits.offsets[slot]; i < pathVisits.offsets[slot + 1]; i++) {\n          if (pathVisits.path[i] === p) {\n            starts.push(pathVisits.start[i]);\n          }\n        }\n      }\n      if (starts.length < 2) {\n        starts = [node.stable.start];\n      }\n      cache.set(node.id, starts);\n    }\n    return starts;\n  };\n}\n\nexport {\n  pathOrigin,\n  surveyPaths,\n  chooseReferencePath,\n  anchorFromPaths,\n  anchorGraph,\n  trimOrigins,\n  referenceVisitStarts\n};\n"],
   "mappings": "wCACA,SAASA,EAAOC,EAAKC,EAAKC,EAAO,CAC/B,IAAMC,EAAOH,EAAI,IAAIC,CAAG,EACpBE,EACFA,EAAK,KAAKD,CAAK,EAEfF,EAAI,IAAIC,EAAK,CAACC,CAAK,CAAC,CAExB,CACA,SAASE,EAAMJ,EAAKC,EAAKC,EAAO,CAC9B,IAAMG,EAAML,EAAI,IAAIC,CAAG,EACnBI,EACFA,EAAI,IAAIH,CAAK,EAEbF,EAAI,IAAIC,EAAqB,IAAI,IAAI,CAACC,CAAK,CAAC,CAAC,CAEjD,CACA,SAASI,EAAQC,EAAOC,EAAO,CAC7B,IAAMC,EAAyB,IAAI,IACnC,QAAWC,KAAQH,EACjBR,EAAOU,EAAQD,EAAME,CAAI,EAAGA,CAAI,EAElC,OAAOD,CACT,CCtBA,SAASE,EAAeC,EAAGC,EAAM,CAC/B,IAAIC,EAAK,EACLC,EAAKH,EACT,KAAOE,EAAKC,GAAI,CACd,IAAMC,EAAMF,EAAKC,GAAM,EACnBF,EAAKG,CAAG,EACVF,EAAKE,EAAM,EAEXD,EAAKC,CAET,CACA,OAAOF,CACT,CCRA,IAAIG,EAAiB,EACrB,SAASC,EAAWC,EAAM,CACxB,OAAOA,EAAK,SAAW,MACzB,CACA,SAASC,EAAWD,EAAM,CACxB,OAAOA,EAAK,QAAQ,OAASF,CAC/B,CACA,SAASI,EAAeF,EAAM,CAC5B,OAAOA,EAAK,SAAW,QAAUA,EAAK,OAAO,KAAOF,CACtD,CACA,SAASK,EAAcC,EAAO,CAC5B,OAAOA,EAAM,MAAM,OAAOH,CAAU,CACtC,CACA,SAASI,EAAeL,EAAMM,EAAQ,CACpC,OAAON,EAAK,OAAO,MAAQM,EAAO,KAAON,EAAK,OAAO,MAAQA,EAAK,OAASM,EAAO,KACpF,CACA,SAASC,EAAkBC,EAAU,CACnC,IAAMC,EAAY,CAAC,EACnB,QAAWT,KAAQQ,EACjBC,EAAUT,EAAK,EAAE,EAAI,CACnB,CAAE,EAAGA,EAAK,OAAO,MAAO,EAAG,CAAE,EAC7B,CAAE,EAAGA,EAAK,OAAO,MAAQA,EAAK,OAAQ,EAAG,CAAE,CAC7C,EAEF,OAAOS,CACT,CACA,SAASC,EAAmBC,EAAOC,EAAI,CACrC,OAAOC,EAAeF,EAAM,OAASG,GAAMH,EAAMG,CAAC,EAAE,OAAO,MAAQF,CAAE,CACvE,CACA,SAASG,EAAaP,EAAU,CAC9B,IAAIQ,EAAM,IACNC,EAAM,KACV,QAAWjB,KAAQQ,EACjBQ,EAAM,KAAK,IAAIA,EAAKhB,EAAK,OAAO,KAAK,EACrCiB,EAAM,KAAK,IAAIA,EAAKjB,EAAK,OAAO,MAAQA,EAAK,MAAM,EAErD,OAAOiB,EAAMD,CACf,CACA,SAASE,EAAcV,EAAUW,EAAQ,CACvC,OAAOA,GAAUA,EAAO,IAAMA,EAAO,MAAQA,EAAO,IAAMA,EAAO,MAAQJ,EAAaP,CAAQ,CAChG,CC5CA,IAAIY,EAAa,KAAM,CACrB,YAAYC,EAAS,CACnB,KAAK,SAAWA,EAAQ,SACxB,KAAK,QAAUA,EAAQ,QACvB,KAAK,KAAOA,EAAQ,KACpB,KAAK,MAAQA,EAAQ,MACrB,KAAK,SAAWA,EAAQ,SACxB,KAAK,MAAQA,EAAQ,MACrB,KAAK,QAAUA,EAAQ,QACvB,KAAK,MAAQ,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,EAAGC,IAAM,CAAC,EAAGA,CAAC,CAAC,CAAC,CAC1D,CACA,OAAO,KAAKC,EAAS,CACnB,IAAMC,EAAU,IAAIC,EACpB,OAAW,CAACC,EAASC,CAAM,IAAKJ,EAAS,CACvCC,EAAQ,QAAQE,CAAO,EACvB,QAAWE,KAAKD,EACdH,EAAQ,IAAIE,EAASE,EAAE,KAAMA,EAAE,OAAQA,EAAE,MAAOA,EAAE,SAAW,GAAG,CAEpE,CACA,OAAOJ,EAAQ,MAAM,CACvB,CACA,IAAI,MAAO,CACT,OAAO,KAAK,SAAS,MACvB,CAEA,KAAKE,EAAS,CACZ,OAAO,KAAK,MAAM,IAAIA,CAAO,GAAK,EACpC,CACA,UAAUG,EAAM,CACd,OAAO,KAAK,MAAM,QAAQA,CAAI,CAChC,CAEA,QAAQC,EAAMC,EAAG,CACf,QAAST,EAAI,KAAK,QAAQQ,CAAI,EAAGR,EAAI,KAAK,QAAQQ,EAAO,CAAC,EAAGR,IAC3D,GAAI,KAAK,KAAKA,CAAC,IAAMS,EACnB,OAAOT,EAGX,MAAO,EACT,CAIA,YAAYQ,EAAM,CAChB,IAAIE,EAAO,KAAK,QAAQF,CAAI,EAC5B,QAASR,EAAIU,EAAO,EAAGV,EAAI,KAAK,QAAQQ,EAAO,CAAC,EAAGR,IAAK,CACtD,IAAMW,EAAI,KAAK,MAAM,KAAK,KAAKX,CAAC,CAAC,EAC3BY,EAAI,KAAK,MAAM,KAAK,KAAKF,CAAI,CAAC,GAChCC,EAAIC,GAAKD,IAAMC,GAAK,KAAK,MAAMZ,CAAC,EAAI,KAAK,MAAMU,CAAI,KACrDA,EAAOV,EAEX,CACA,OAAOU,CACT,CAKA,QAAS,CACP,IAAMG,EAAyB,IAAI,IACnC,MAAO,CAACL,EAAMC,IAAM,CAClB,GAAID,EAAO,GAAKC,EAAI,EAClB,MAAO,GAET,IAAMK,EAAMN,EAAO,KAAK,MAAM,OAASC,EACjCM,EAAM,KAAK,QAAQP,EAAO,CAAC,EAC7BQ,EAAKH,EAAO,IAAIC,CAAG,GAAK,KAAK,QAAQN,CAAI,EAC7C,KAAOQ,EAAKD,GAAO,KAAK,KAAKC,CAAE,IAAMP,GACnCO,IAEF,OAAAH,EAAO,IAAIC,EAAKE,EAAK,CAAC,EACfA,EAAKD,EAAMC,EAAK,EACzB,CACF,CAEA,OAAOC,EAAUC,EAAc,IAAM,GAAM,CACzC,IAAMC,EAAO,KAAK,MAAM,IAAIF,CAAQ,EAC9Bf,EAAU,IAAIC,EACpB,YAAK,SAAS,QAAQ,CAACC,EAASgB,IAAM,CACpC,GAAI,CAACF,EAAYd,CAAO,EACtB,OAEF,IAAMI,EAAON,EAAQ,QAAQE,CAAO,EACpC,QAASJ,EAAI,KAAK,QAAQoB,CAAC,EAAGpB,EAAI,KAAK,QAAQoB,EAAI,CAAC,EAAGpB,IAAK,CAC1D,IAAMS,EAAI,KAAK,KAAKT,CAAC,EACjBmB,EAAKV,CAAC,GACRP,EAAQ,MACNM,EACAN,EAAQ,OAAO,KAAK,MAAMO,CAAC,EAAG,KAAK,QAAQA,CAAC,CAAC,EAC7C,KAAK,MAAMT,CAAC,EACZ,KAAK,SAASA,CAAC,IAAM,CACvB,CAEJ,CACF,CAAC,EACME,EAAQ,MAAM,CACvB,CACA,OAAOF,EAAG,CACR,OAAO,KAAK,SAASA,CAAC,EAAI,IAAM,GAClC,CACA,MAAMA,EAAG,CACP,IAAMS,EAAI,KAAK,KAAKT,CAAC,EACrB,MAAO,CACL,KAAM,KAAK,MAAMS,CAAC,EAClB,OAAQ,KAAK,QAAQA,CAAC,EACtB,MAAO,KAAK,MAAMT,CAAC,EACnB,OAAQ,KAAK,OAAOA,CAAC,CACvB,CACF,CACA,SAASQ,EAAM,CACb,IAAMa,EAAM,CAAC,EACb,QAASrB,EAAI,KAAK,QAAQQ,CAAI,EAAGR,EAAI,KAAK,QAAQQ,EAAO,CAAC,EAAGR,IAC3DqB,EAAI,KAAK,KAAK,MAAMrB,CAAC,CAAC,EAExB,OAAOqB,CACT,CACA,IAAIjB,EAAS,CACX,IAAMI,EAAO,KAAK,KAAKJ,CAAO,EAC9B,OAAOI,EAAO,EAAI,OAAS,KAAK,SAASA,CAAI,CAC/C,CACA,IAAIJ,EAAS,CACX,OAAO,KAAK,MAAM,IAAIA,CAAO,CAC/B,CACA,MAAO,CACL,OAAO,KAAK,SAAS,OAAO,QAAQ,EAAE,CACxC,CACA,CAAC,QAAS,CACR,QAASgB,EAAI,EAAGA,EAAI,KAAK,SAAS,OAAQA,IACxC,MAAM,KAAK,SAASA,CAAC,CAEzB,CACA,CAAC,SAAU,CACT,QAASA,EAAI,EAAGA,EAAI,KAAK,SAAS,OAAQA,IACxC,KAAM,CAAC,KAAK,SAASA,CAAC,EAAG,KAAK,SAASA,CAAC,CAAC,CAE7C,CACA,CAAC,OAAO,QAAQ,GAAI,CAClB,OAAO,KAAK,QAAQ,CACtB,CACF,EACIE,EAAS,KAAM,CACjB,YAAYC,EAAM,CAChB,KAAK,KAAOA,EACZ,KAAK,OAAS,CAChB,CACA,KAAKC,EAAO,CACV,GAAI,KAAK,SAAW,KAAK,KAAK,OAAQ,CACpC,IAAMC,EAAQ,IAAI,KAAK,KAAK,YAC1B,KAAK,KAAK,OAAS,CACrB,EACAA,EAAM,IAAI,KAAK,IAAI,EACnB,KAAK,KAAOA,CACd,CACA,KAAK,KAAK,KAAK,QAAQ,EAAID,CAC7B,CACF,EACIrB,EAAoB,KAAM,CAC5B,aAAc,CACZ,KAAK,SAAW,CAAC,EACjB,KAAK,MAAwB,IAAI,IACjC,KAAK,MAAQ,CAAC,EACd,KAAK,QAAU,CAAC,EAChB,KAAK,UAA4B,IAAI,IACrC,KAAK,KAAO,IAAImB,EAAO,IAAI,WAAW,IAAI,CAAC,EAC3C,KAAK,KAAO,IAAIA,EAAO,IAAI,WAAW,IAAI,CAAC,EAC3C,KAAK,MAAQ,IAAIA,EAAO,IAAI,aAAa,IAAI,CAAC,EAC9C,KAAK,SAAW,IAAIA,EAAO,IAAI,WAAW,IAAI,CAAC,CACjD,CAEA,QAAQlB,EAAS,CACf,IAAI,EAAI,KAAK,MAAM,IAAIA,CAAO,EAC9B,OAAI,IAAM,SACR,EAAI,KAAK,SAAS,OAClB,KAAK,MAAM,IAAIA,EAAS,CAAC,EACzB,KAAK,SAAS,KAAKA,CAAO,GAErB,CACT,CAEA,OAAOG,EAAMmB,EAAQ,CACnB,IAAIjB,EAAI,KAAK,UAAU,IAAIF,CAAI,EAC/B,OAAIE,IAAM,SACRA,EAAI,KAAK,MAAM,OACf,KAAK,UAAU,IAAIF,EAAME,CAAC,EAC1B,KAAK,MAAM,KAAKF,CAAI,EACpB,KAAK,QAAQ,KAAKmB,CAAM,GAEnBjB,CACT,CACA,IAAIL,EAASG,EAAMmB,EAAQC,EAAOC,EAAU,CAC1C,KAAK,MACH,KAAK,QAAQxB,CAAO,EACpB,KAAK,OAAOG,EAAMmB,CAAM,EACxBC,EACAC,CACF,CACF,CACA,MAAMpB,EAAMD,EAAMoB,EAAOC,EAAU,CACjC,KAAK,KAAK,KAAKpB,CAAI,EACnB,KAAK,KAAK,KAAKD,CAAI,EACnB,KAAK,MAAM,KAAKoB,CAAK,EACrB,KAAK,SAAS,KAAKC,EAAW,EAAI,CAAC,CACrC,CACA,OAAQ,CACN,IAAMC,EAAI,KAAK,KAAK,OACdC,EAAW,KAAK,SAAS,OACzBC,EAAU,IAAI,WAAWD,EAAW,CAAC,EACrCtB,EAAO,KAAK,KAAK,KACvB,QAAS,EAAI,EAAG,EAAIqB,EAAG,IACrBE,EAAQvB,EAAK,CAAC,EAAI,CAAC,IAErB,QAASY,EAAI,EAAGA,EAAIU,EAAUV,IAC5BW,EAAQX,EAAI,CAAC,GAAKW,EAAQX,CAAC,EAE7B,IAAMY,EAAOD,EAAQ,MAAM,EAAGD,CAAQ,EAChCvB,EAAO,IAAI,WAAWsB,CAAC,EACvBF,EAAQ,IAAI,aAAaE,CAAC,EAC1BD,EAAW,IAAI,WAAWC,CAAC,EACjC,QAAS,EAAI,EAAG,EAAIA,EAAG,IAAK,CAC1B,IAAMb,EAAKgB,EAAKxB,EAAK,CAAC,CAAC,IACvBD,EAAKS,CAAE,EAAI,KAAK,KAAK,KAAK,CAAC,EAC3BW,EAAMX,CAAE,EAAI,KAAK,MAAM,KAAK,CAAC,EAC7BY,EAASZ,CAAE,EAAI,KAAK,SAAS,KAAK,CAAC,CACrC,CACA,OAAO,IAAIlB,EAAW,CACpB,SAAU,KAAK,SACf,QAAAiC,EACA,KAAAxB,EACA,MAAAoB,EACA,SAAAC,EACA,MAAO,KAAK,MACZ,QAAS,KAAK,OAChB,CAAC,CACH,CACF,EC7NA,IAAIK,EAAe,cACfC,EAAc,iDACdC,EAAc,iBAClB,SAASC,EAAWC,EAAU,CAC5B,IAAMC,EAAWJ,EAAY,KAAKG,CAAQ,EAC1C,GAAIC,EACF,MAAO,CAAE,KAAMA,EAAS,CAAC,EAAG,MAAO,CAACA,EAAS,CAAC,GAAI,EAAEA,EAAS,CAAC,GAAK,EAAG,EAExE,IAAMC,EAAQN,EAAa,KAAKI,CAAQ,GAAKF,EAAY,KAAKE,CAAQ,EACtE,OAAOE,EAAQ,CAAE,KAAMF,EAAS,MAAM,EAAGE,EAAM,KAAK,EAAG,MAAO,CAACA,EAAM,CAAC,CAAE,EAAI,CAAE,KAAMF,EAAU,MAAO,CAAE,CACzG,CACA,SAASG,EAAYC,EAAOC,EAAU,CACpC,IAAMC,EAAc,CAAC,EACfC,EAAS,IAAIC,EACnB,QAAWC,KAAQL,EAAO,CACxB,IAAMM,EAASC,EAAYF,EAAK,IAAI,EAC9BG,EAAIL,EAAO,OAAOE,EAAK,KAAMC,CAAM,EACrCG,EAAMJ,EAAK,MACf,QAAWK,KAAQL,EAAK,MACtBF,EAAO,MAAMA,EAAO,QAAQO,EAAK,EAAE,EAAGF,EAAGC,EAAKC,EAAK,SAAW,GAAG,EACjED,GAAOR,EAASS,EAAK,EAAE,EAEzBR,EAAY,KAAK,CACf,KAAMG,EAAK,KACX,OAAAC,EACA,MAAOD,EAAK,MACZ,OAAQI,EAAMJ,EAAK,KACrB,CAAC,CACH,CACA,MAAO,CAAE,YAAAH,EAAa,WAAYC,EAAO,MAAM,CAAE,CACnD,CACA,SAASQ,EAAoBT,EAAaU,EAAW,CAInD,OAHcV,EAAY,KACvBM,GAAMA,EAAE,SAAWI,GAAaJ,EAAE,OAASI,CAC9C,GACgBV,EAAY,CAAC,CAC/B,CACA,IAAIW,EAAqB,EACzB,SAASC,EAAWC,EAAMZ,EAAQa,EAAWC,EAAW,CACtD,IAAMC,EAAOf,EAAO,KAAKY,EAAK,IAAI,EAClC,GAAIG,EAAO,GAAKf,EAAO,QAAQe,CAAI,IAAMf,EAAO,QAAQe,EAAO,CAAC,EAC9D,OAAOH,EAET,IAAMI,EAAMhB,EAAO,QAAQe,EAAMF,CAAS,EACpCI,EAASD,GAAO,EAAIA,EAAMhB,EAAO,YAAYe,CAAI,EACvD,MAAO,CACL,GAAGH,EACH,OAAQ,CACN,QAASZ,EAAO,MAAMA,EAAO,KAAKiB,CAAM,CAAC,EACzC,MAAOjB,EAAO,MAAMiB,CAAM,EAC1B,KAAMD,GAAO,EAAIE,EAAiBR,EAClC,OAAQV,EAAO,OAAOiB,CAAM,CAC9B,EACA,QAASH,EAAUC,CAAI,CACzB,CACF,CACA,SAASI,EAAanB,EAAQ,CAC5B,IAAMoB,EAAS,CAAC,GAAG,IAAI,IAAIpB,EAAO,OAAO,CAAC,EAAE,KAAK,EAC3CqB,EAAO,IAAI,IAAID,EAAO,IAAI,CAACjB,EAAQmB,IAAM,CAACnB,EAAQmB,CAAC,CAAC,CAAC,EACrDC,EAAW,WAAW,KAAKvB,EAAO,QAAUwB,GAAMH,EAAK,IAAIG,CAAC,CAAC,EAC7DC,EAAO,IAAI,WAAWL,EAAO,MAAM,EACnCM,EAAQ,IAAI,WAAWN,EAAO,MAAM,EAC1C,OAAQL,GAAS,CACf,IAAIY,EAAI,EACR,QAASL,EAAItB,EAAO,QAAQe,CAAI,EAAGO,EAAItB,EAAO,QAAQe,EAAO,CAAC,EAAGO,IAAK,CACpE,IAAMM,EAAIL,EAASvB,EAAO,KAAKsB,CAAC,CAAC,EAC7BG,EAAKG,CAAC,IAAM,IACdH,EAAKG,CAAC,EAAI,EACVF,EAAMC,GAAG,EAAIC,EAEjB,CACA,IAAIC,EACJ,GAAIF,IAAMP,EAAO,OACfS,EAAMT,EACNK,EAAK,KAAK,CAAC,UACFE,EAAI,EAAIP,EAAO,OAAQ,CAChC,IAAMU,EAAQJ,EAAM,SAAS,EAAGC,CAAC,EACjCG,EAAM,QAASF,GAAMH,EAAKG,CAAC,EAAI,CAAC,EAChCC,EAAM,MAAM,KAAKC,EAAM,KAAK,EAAIF,GAAMR,EAAOQ,CAAC,CAAC,CACjD,KAAO,CACLC,EAAM,CAAC,EACP,QAASD,EAAI,EAAGA,EAAIR,EAAO,OAAQQ,IAC7BH,EAAKG,CAAC,IAAM,IACdH,EAAKG,CAAC,EAAI,EACVC,EAAI,KAAKT,EAAOQ,CAAC,CAAC,EAGxB,CACA,OAAOC,CACT,CACF,CACA,SAASE,EAAgBC,EAAOvB,EAAW,CACzC,GAAM,CAAE,YAAAV,EAAa,WAAAkC,CAAW,EAAID,EAC9BnB,EAAYd,GAAekC,EAAazB,EAAoBT,EAAaU,CAAS,EAAI,OAC5F,GAAI,CAACI,GAAa,CAACd,GAAe,CAACkC,EACjC,OAAOD,EAET,IAAMlB,EAAYK,EAAac,CAAU,EACnCC,EAAiBD,EAAW,UAAUpB,EAAU,IAAI,EAC1D,MAAO,CACL,GAAGmB,EACH,MAAOA,EAAM,MAAM,IAChBpB,GAASD,EAAWC,EAAMqB,EAAYC,EAAgBpB,CAAS,CAClE,EACA,WAAY,QACZ,cAAeD,EAAU,IAC3B,CACF,CACA,SAASsB,EAAYH,EAAOvB,EAAW,CACrC,GAAIuB,EAAM,aAAe,OACvB,OAAOD,EAAgBC,EAAOvB,CAAS,EAEzC,IAAM2B,EAAgBC,EAAoBL,CAAK,EAC/C,OAAOI,EAAgB,CAAE,GAAGJ,EAAO,cAAAI,CAAc,EAAIJ,CACvD,CACA,SAASK,EAAoBL,EAAO,CAClC,IAAMM,EAAUN,EAAM,MAAM,KAAML,GAAMA,EAAE,QAAQ,OAAS,CAAC,GAAG,QAAQ,QACvE,OAAOW,IAAY,QAAUN,EAAM,aAAa,KAAM3B,GAAMA,EAAE,OAASiC,CAAO,EAAIA,EAAU,MAC9F,CACA,SAASC,EAAYP,EAAOQ,EAAM,CAChC,GAAI,CAACR,EAAM,YACT,OAEF,IAAMlC,EAAW,IAAI,IAAIkC,EAAM,MAAM,IAAKL,GAAM,CAACA,EAAE,GAAIA,EAAE,MAAM,CAAC,CAAC,EAC3Dc,EAAK,CAACC,EAAKC,EAAMD,EAAI,SAAW,CACpC,IAAIE,EAAM,EACV,QAAS,EAAI,EAAG,EAAID,EAAK,IACvBC,GAAO9C,EAAS,IAAI4C,EAAI,CAAC,CAAC,GAAK,EAEjC,OAAOE,CACT,EACMC,EAAWC,EAAQd,EAAM,OAAS,CAAC,EAAI3B,GAAMb,EAAWa,EAAE,IAAI,EAAE,IAAI,EAC1E,OAAO2B,EAAM,YAAY,IAAKe,GAAM,CAClC,IAAMC,EAASH,EAAS,IAAIE,EAAE,IAAI,EAC5B7C,EAAO8C,GAAQ,SAAW,EAAIA,EAAO,CAAC,EAAI,OAC1CC,EAAU/C,GAAQsC,EAAK,IAAItC,EAAK,IAAI,EAC1C,OAAOA,GAAQ+C,EAAU,CACvB,GAAGF,EACH,MAAOA,EAAE,MAAQN,EAAGvC,EAAK,QAAS+C,EAAQ,KAAK,EAC/C,OAAQR,EAAGQ,EAAQ,OAAO,CAC5B,EAAIF,CACN,CAAC,CACH,CACA,SAASG,GAAqBlB,EAAO,CACnC,GAAM,CAAE,WAAAC,CAAW,EAAID,EACjBmB,EAAwB,IAAI,IAClC,OAAQvC,GAAS,CACf,IAAIwC,EAASD,EAAM,IAAIvC,EAAK,EAAE,EAC9B,GAAI,CAACwC,EAAQ,CACXA,EAAS,CAAC,EACV,IAAMrC,EAAOkB,EAAaA,EAAW,KAAKrB,EAAK,IAAI,EAAI,GACjDP,EAAIU,GAAQ,EAAIkB,EAAW,UAAUrB,EAAK,OAAO,OAAO,EAAI,GAClE,GAAIP,GAAK,EACP,QAASiB,EAAIW,EAAW,QAAQlB,CAAI,EAAGO,EAAIW,EAAW,QAAQlB,EAAO,CAAC,EAAGO,IACnEW,EAAW,KAAKX,CAAC,IAAMjB,GACzB+C,EAAO,KAAKnB,EAAW,MAAMX,CAAC,CAAC,EAIjC8B,EAAO,OAAS,IAClBA,EAAS,CAACxC,EAAK,OAAO,KAAK,GAE7BuC,EAAM,IAAIvC,EAAK,GAAIwC,CAAM,CAC3B,CACA,OAAOA,CACT,CACF",
   "names": ["pushTo", "map", "key", "value", "list", "addTo", "set", "groupBy", "items", "keyOf", "groups", "item", "partitionPoint", "n", "pred", "lo", "hi", "mid", "REFERENCE_RANK", "isAnchored", "node", "isBackbone", "isOffReference", "backboneNodes", "graph", "overlapsWindow", "window", "backbonePositions", "backbone", "positions", "firstNodeAtOrAfter", "nodes", "bp", "partitionPoint", "i", "backboneSpan", "min", "max", "referenceSpan", "region", "PathVisits", "columns", "i", "entries", "builder", "PathVisitsBuilder", "segment", "visits", "v", "path", "slot", "p", "best", "a", "b", "cursor", "key", "end", "at", "keepPath", "keepSegment", "kept", "s", "out", "Column", "data", "value", "grown", "sample", "start", "reversed", "n", "segments", "offsets", "fill", "RANGE_SUFFIX", "VG_FRAGMENT", "VG_SUBRANGE", "pathOrigin", "pathName", "fragment", "match", "surveyPaths", "paths", "lengthOf", "anchorPaths", "visits", "PathVisitsBuilder", "path", "sample", "panSNSample", "p", "pos", "step", "chooseReferencePath", "preferred", "OFF_REFERENCE_RANK", "anchorNode", "node", "reference", "samplesOf", "slot", "own", "anchor", "REFERENCE_RANK", "sampleSorter", "sorted", "rank", "i", "pathRank", "s", "seen", "ranks", "n", "r", "out", "found", "anchorFromPaths", "graph", "pathVisits", "referenceIndex", "anchorGraph", "referencePath", "taggedReferencePath", "refName", "trimOrigins", "kept", "bp", "ids", "end", "sum", "byOrigin", "groupBy", "o", "pieces", "stretch", "referenceVisitStarts", "cache", "starts"]

package/dist/chunks/{chunk-4B3GQTHX.js → chunk-BDBFDFIM.js}

@@ -1,2 +1,2 @@
-import{i as M,l as W,p as F}from"./chunk-NFPLX56S.js";import{b as O,h as A}from"./chunk-LD6RX4AZ.js";import{K as b,Q as _,X as B}from"./chunk-DKQFTMWL.js";import{f as R}from"./chunk-NIEZKWQV.js";import{D as E,E as P,H as m,d as v,o as T,q as I,r as L,s as w,t as N,w as D,y as G,z as x}from"./chunk-5Z4VIKXZ.js";import{b as t,c as r,d as C}from"./chunk-JMBDTNUR.js";var S=[{value:0,label:"Fastest"},{value:1,label:"Fast"},{value:2,label:"Default"},{value:3,label:"Fine"},{value:4,label:"Best"}];function f({label:o,value:n,options:e,testId:s,size:d,sx:p,disabled:a,title:h,shown:g,onChange:z}){let k=R();return r(w,{size:d,sx:p,disabled:a,title:h,children:[t(D,{id:k,shrink:!0,children:o}),t(E,{labelId:k,value:n,label:o,notched:!0,displayEmpty:!0,"data-testid":s,renderValue:i=>g??e.find(H=>H.value===i)?.label??i,onChange:i=>{z(i.target.value)},children:e.map(i=>t(x,{value:i.value,disabled:i.disabled,title:i.disabled?void 0:i.description,children:t(G,{primary:i.label,secondary:i.disabled?i.description:void 0})},i.value))})]})}var u=F()({section:{marginBottom:24},group:{marginBottom:16},heading:{marginBottom:8}});function l({warn:o=!1,children:n}){return t(m,{variant:"caption",component:"div",color:o?"warning.main":"text.secondary",children:n})}function y({title:o,children:n}){let{classes:e}=u();return r("section",{className:e.group,children:[t(m,{variant:"subtitle1",className:e.heading,children:o}),n]})}function U({label:o,checked:n,onChange:e,children:s}){let{classes:d}=u();return r("div",{className:d.section,children:[t(N,{control:t(P,{checked:n,onChange:p=>{e(p.target.checked)}}),label:o}),s]})}function c({children:o,...n}){let{classes:e}=u();return r("div",{className:e.section,children:[t(f,{sx:{minWidth:200},...n}),o]})}var Y=[5e3,2e4,5e4,1e5];function $(o){return[...new Set([...Y,o])].sort((n,e)=>n-e).map(n=>({value:String(n),label:n.toLocaleString()}))}function Q({label:o,choices:n,stored:e,auto:s,testId:d,onChange:p,children:a}){return n.length>0?t(c,{label:o,value:n.some(h=>h.trackId===e)?e:"",options:[{value:"",label:`Automatic (${s?.name??"none"})`},...n.map(({trackId:h,name:g})=>({value:h,label:g}))],testId:d,onChange:p,children:a}):null}var q=C(function(n){let{model:e,onClose:s,children:d}=n,{classes:p}=u();return r(v,{open:!0,onClose:s,title:"Graph settings",children:[r(L,{children:[r(y,{title:"Subgraph",children:[d,t(c,{label:"Node limit",value:String(e.maxGraphNodes),options:$(e.maxGraphNodes),testId:"graph-node-limit-select",onChange:a=>{e.setMaxGraphNodes(Number(a))},children:t(l,{children:"The most nodes a layout draws; past it the graph is declined. Walk rows take no limit."})})]}),r(y,{title:"Drawing",children:[e.anchorPaths.length>1?t(c,{label:"Reference path",value:e.activeReferencePath??"",options:e.anchorPaths.map(({name:a})=>({value:a,label:a})),testId:"graph-reference-path-select",onChange:a=>{e.setReferencePath(a),e.recomputeLayout()},children:t(l,{children:"The path the anchored layouts place x along"})}):null,t(c,{label:"Node width",value:e.nodeWidth,options:_,testId:"graph-node-width-select",onChange:a=>{e.setNodeWidth(a)},children:t(l,{children:"Depth as width. In a cut with walks, depth is how many haplotypes carry the node."})}),t(c,{label:"Link width",value:e.linkWidth,options:B,testId:"graph-link-width-select",onChange:a=>{e.setLinkWidth(a)},children:t(l,{children:"Walks as width, so a common route reads heavy and a private one thin."})}),r(U,{label:"Draw paths",checked:e.drawPaths,onChange:a=>{e.setLayer("paths",a)},children:[t(l,{children:"Color each node by the paths through it, one lane per path"}),e.drawPaths&&!e.effectiveDrawPaths?t(l,{warn:!0,children:e.pathCount>b?`Off: ${e.pathCount.toLocaleString()} paths is past the ${b} this can tell apart`:"Off: this graph states no paths"}):null]}),t(Q,{label:"Gene track",choices:e.geneTrackChoices,stored:e.geneTrackId,auto:W(e.geneTrackChoices,""),testId:"graph-gene-track-select",onChange:a=>{e.setGeneTrackId(a)},children:t(l,{children:"Where genes on the backbone come from"})}),t(Q,{label:"Repeat track",choices:e.repeatTrackChoices,stored:e.repeatTrackId,auto:M(e.repeatTrackChoices,""),testId:"graph-repeat-track-select",onChange:a=>{e.setRepeatTrackId(a)},children:t(l,{children:"The tandem repeat annotation walk rows measure and tile by"})})]}),r(y,{title:"Force-directed layout",children:[e.hasGraph&&!e.usesLayoutEngine?t("div",{className:p.section,children:t(l,{warn:!0,children:"No effect on the current layout until Layout is Force-directed"})}):null,t(c,{label:"Engine",value:e.layoutEngine,options:O,testId:"graph-layout-engine-select",onChange:a=>{e.setLayoutEngine(a)},children:t(l,{children:"Stress keeps the reference straight, so a zoom keeps the picture; FMMM lets the whole graph settle."})}),t(c,{label:"Layout quality",value:String(e.layoutQuality),options:S.map(a=>({value:String(a.value),label:a.label})),testId:"graph-layout-quality-select",onChange:a=>{e.setLayoutQuality(Number(a))},children:t(l,{children:"The engine's iteration budget; higher is slower"})}),t(c,{label:"Bubble spread",value:e.bubbleSpread,options:A,testId:"graph-bubble-spread-select",onChange:a=>{e.setBubbleSpread(a)},children:t(l,{children:"How far the layout opens a bubble"})}),e.layoutEngine==="stress"?null:t(U,{label:"Linear layout",checked:e.linearLayout,onChange:a=>{e.setLinearLayout(a)},children:t(l,{children:"Keeps a chain of nodes on one line where it can"})})]})]}),t(I,{children:t(T,{variant:"contained",color:"primary",onClick:s,children:"Close"})})]})}),ge=q;export{f as a,ge as b};
-//# sourceMappingURL=chunk-4B3GQTHX.js.map
+import{i as M,l as W,p as F}from"./chunk-4NUDB5AY.js";import{b as O,h as A}from"./chunk-AK6XQ7XZ.js";import{K as b,Q as _,X as B}from"./chunk-FUKZO5AZ.js";import{f as R}from"./chunk-NIEZKWQV.js";import{D as E,E as P,H as m,d as v,o as T,q as I,r as L,s as w,t as N,w as D,y as G,z as x}from"./chunk-5Z4VIKXZ.js";import{b as t,c as r,d as C}from"./chunk-JMBDTNUR.js";var S=[{value:0,label:"Fastest"},{value:1,label:"Fast"},{value:2,label:"Default"},{value:3,label:"Fine"},{value:4,label:"Best"}];function f({label:o,value:n,options:e,testId:s,size:d,sx:p,disabled:a,title:h,shown:g,onChange:z}){let k=R();return r(w,{size:d,sx:p,disabled:a,title:h,children:[t(D,{id:k,shrink:!0,children:o}),t(E,{labelId:k,value:n,label:o,notched:!0,displayEmpty:!0,"data-testid":s,renderValue:i=>g??e.find(H=>H.value===i)?.label??i,onChange:i=>{z(i.target.value)},children:e.map(i=>t(x,{value:i.value,disabled:i.disabled,title:i.disabled?void 0:i.description,children:t(G,{primary:i.label,secondary:i.disabled?i.description:void 0})},i.value))})]})}var u=F()({section:{marginBottom:24},group:{marginBottom:16},heading:{marginBottom:8}});function l({warn:o=!1,children:n}){return t(m,{variant:"caption",component:"div",color:o?"warning.main":"text.secondary",children:n})}function y({title:o,children:n}){let{classes:e}=u();return r("section",{className:e.group,children:[t(m,{variant:"subtitle1",className:e.heading,children:o}),n]})}function U({label:o,checked:n,onChange:e,children:s}){let{classes:d}=u();return r("div",{className:d.section,children:[t(N,{control:t(P,{checked:n,onChange:p=>{e(p.target.checked)}}),label:o}),s]})}function c({children:o,...n}){let{classes:e}=u();return r("div",{className:e.section,children:[t(f,{sx:{minWidth:200},...n}),o]})}var Y=[5e3,2e4,5e4,1e5];function $(o){return[...new Set([...Y,o])].sort((n,e)=>n-e).map(n=>({value:String(n),label:n.toLocaleString()}))}function Q({label:o,choices:n,stored:e,auto:s,testId:d,onChange:p,children:a}){return n.length>0?t(c,{label:o,value:n.some(h=>h.trackId===e)?e:"",options:[{value:"",label:`Automatic (${s?.name??"none"})`},...n.map(({trackId:h,name:g})=>({value:h,label:g}))],testId:d,onChange:p,children:a}):null}var q=C(function(n){let{model:e,onClose:s,children:d}=n,{classes:p}=u();return r(v,{open:!0,onClose:s,title:"Graph settings",children:[r(L,{children:[r(y,{title:"Subgraph",children:[d,t(c,{label:"Node limit",value:String(e.maxGraphNodes),options:$(e.maxGraphNodes),testId:"graph-node-limit-select",onChange:a=>{e.setMaxGraphNodes(Number(a))},children:t(l,{children:"The most nodes a layout draws; past it the graph is declined. Walk rows take no limit."})})]}),r(y,{title:"Drawing",children:[e.anchorPaths.length>1?t(c,{label:"Reference path",value:e.activeReferencePath??"",options:e.anchorPaths.map(({name:a})=>({value:a,label:a})),testId:"graph-reference-path-select",onChange:a=>{e.setReferencePath(a),e.recomputeLayout()},children:t(l,{children:"The path the anchored layouts place x along"})}):null,t(c,{label:"Node width",value:e.nodeWidth,options:_,testId:"graph-node-width-select",onChange:a=>{e.setNodeWidth(a)},children:t(l,{children:"Depth as width. In a cut with walks, depth is how many haplotypes carry the node."})}),t(c,{label:"Link width",value:e.linkWidth,options:B,testId:"graph-link-width-select",onChange:a=>{e.setLinkWidth(a)},children:t(l,{children:"Walks as width, so a common route reads heavy and a private one thin."})}),r(U,{label:"Draw paths",checked:e.drawPaths,onChange:a=>{e.setLayer("paths",a)},children:[t(l,{children:"Color each node by the paths through it, one lane per path"}),e.drawPaths&&!e.effectiveDrawPaths?t(l,{warn:!0,children:e.pathCount>b?`Off: ${e.pathCount.toLocaleString()} paths is past the ${b} this can tell apart`:"Off: this graph states no paths"}):null]}),t(Q,{label:"Gene track",choices:e.geneTrackChoices,stored:e.geneTrackId,auto:W(e.geneTrackChoices,""),testId:"graph-gene-track-select",onChange:a=>{e.setGeneTrackId(a)},children:t(l,{children:"Where genes on the backbone come from"})}),t(Q,{label:"Repeat track",choices:e.repeatTrackChoices,stored:e.repeatTrackId,auto:M(e.repeatTrackChoices,""),testId:"graph-repeat-track-select",onChange:a=>{e.setRepeatTrackId(a)},children:t(l,{children:"The tandem repeat annotation walk rows measure and tile by"})})]}),r(y,{title:"Force-directed layout",children:[e.hasGraph&&!e.usesLayoutEngine?t("div",{className:p.section,children:t(l,{warn:!0,children:"No effect on the current layout until Layout is Force-directed"})}):null,t(c,{label:"Engine",value:e.layoutEngine,options:O,testId:"graph-layout-engine-select",onChange:a=>{e.setLayoutEngine(a)},children:t(l,{children:"Stress keeps the reference straight, so a zoom keeps the picture; FMMM lets the whole graph settle."})}),t(c,{label:"Layout quality",value:String(e.layoutQuality),options:S.map(a=>({value:String(a.value),label:a.label})),testId:"graph-layout-quality-select",onChange:a=>{e.setLayoutQuality(Number(a))},children:t(l,{children:"The engine's iteration budget; higher is slower"})}),t(c,{label:"Bubble spread",value:e.bubbleSpread,options:A,testId:"graph-bubble-spread-select",onChange:a=>{e.setBubbleSpread(a)},children:t(l,{children:"How far the layout opens a bubble"})}),e.layoutEngine==="stress"?null:t(U,{label:"Linear layout",checked:e.linearLayout,onChange:a=>{e.setLinearLayout(a)},children:t(l,{children:"Keeps a chain of nodes on one line where it can"})})]})]}),t(I,{children:t(T,{variant:"contained",color:"primary",onClick:s,children:"Close"})})]})}),ge=q;export{f as a,ge as b};
+//# sourceMappingURL=chunk-BDBFDFIM.js.map

package/dist/chunks/{chunk-4B3GQTHX.js.map → chunk-BDBFDFIM.js.map}

@@ -1,6 +1,6 @@
 {
   "version": 3,
-  "sources": ["../../node_modules/.pnpm/@jbrowse+bandage-core@12.3.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-K5SIJGAE.js", "../../src/GraphGenomeView/components/LabelledSelect.tsx", "../../src/GraphGenomeView/components/GraphSettingsDialog.tsx"],
+  "sources": ["../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-K5SIJGAE.js", "../../src/GraphGenomeView/components/LabelledSelect.tsx", "../../src/GraphGenomeView/components/GraphSettingsDialog.tsx"],
   "sourcesContent": ["// src/layoutQualities.ts\nvar LAYOUT_QUALITIES = [\n  { value: 0, label: \"Fastest\" },\n  { value: 1, label: \"Fast\" },\n  { value: 2, label: \"Default\" },\n  { value: 3, label: \"Fine\" },\n  { value: 4, label: \"Best\" }\n];\n\nexport {\n  LAYOUT_QUALITIES\n};\n", "import { useId } from 'react'\n\nimport {\n  FormControl,\n  InputLabel,\n  ListItemText,\n  MenuItem,\n  Select,\n} from '@mui/material'\n\nimport type { SxProps } from '@mui/material'\n\ninterface SelectOption<T extends string> {\n  value: T\n  label: string\n  // an option's tooltip, and the reason under a disabled one, whose tooltip\n  // cannot open\n  description?: string\n  disabled?: boolean\n}\n\n// One dropdown with its label tied to it, so a screen reader names the combobox\nexport default function LabelledSelect<T extends string>({\n  label,\n  value,\n  options,\n  testId,\n  size,\n  sx,\n  disabled,\n  title,\n  shown,\n  onChange,\n}: {\n  label: string\n  value: T\n  options: readonly SelectOption<T>[]\n  testId?: string\n  size?: 'small' | 'medium'\n  sx?: SxProps\n  disabled?: boolean\n  title?: string\n  // what the closed select reads, when not the picked option's label\n  shown?: string\n  onChange: (value: T) => void\n}) {\n  const labelId = useId()\n  return (\n    <FormControl size={size} sx={sx} disabled={disabled} title={title}>\n      <InputLabel id={labelId} shrink>\n        {label}\n      </InputLabel>\n      <Select\n        labelId={labelId}\n        value={value}\n        label={label}\n        notched\n        displayEmpty\n        data-testid={testId}\n        renderValue={picked =>\n          shown ?? options.find(o => o.value === picked)?.label ?? picked\n        }\n        onChange={e => {\n          onChange(e.target.value as T)\n        }}\n      >\n        {options.map(o => (\n          <MenuItem\n            key={o.value}\n            value={o.value}\n            disabled={o.disabled}\n            title={o.disabled ? undefined : o.description}\n          >\n            <ListItemText\n              primary={o.label}\n              secondary={o.disabled ? o.description : undefined}\n            />\n          </MenuItem>\n        ))}\n      </Select>\n    </FormControl>\n  )\n}\n", "import type { ReactNode } from 'react'\n\nimport { BUBBLE_SPREADS } from '@jbrowse/bandage-core/bubbleSpreads'\nimport { EDGE_WIDTHS } from '@jbrowse/bandage-core/edgeWidths'\nimport { LAYOUT_ENGINES } from '@jbrowse/bandage-core/layoutEngines'\nimport { LAYOUT_QUALITIES } from '@jbrowse/bandage-core/layoutQualities'\nimport { NODE_WIDTHS } from '@jbrowse/bandage-core/nodeWidths'\nimport { MAX_PATH_COLORS } from '@jbrowse/bandage-core/pathColors'\nimport { Dialog } from '@jbrowse/core/ui'\nimport {\n  Button,\n  DialogActions,\n  DialogContent,\n  FormControlLabel,\n  Switch,\n  Typography,\n} from '@mui/material'\nimport { observer } from 'mobx-react'\nimport { makeStyles } from 'tss-react/mui'\n\nimport LabelledSelect from './LabelledSelect'\nimport { pickGeneTrack } from '../genes/geneFeatures'\nimport { pickRepeatTrack } from '../repeats/repeatFeatures'\n\nimport type { GraphPaneModel } from '../model'\n\nconst useStyles = makeStyles()({\n  section: {\n    marginBottom: 24,\n  },\n  group: {\n    marginBottom: 16,\n  },\n  heading: {\n    marginBottom: 8,\n  },\n})\n\nfunction Caption({\n  warn = false,\n  children,\n}: {\n  warn?: boolean\n  children: ReactNode\n}) {\n  return (\n    <Typography\n      variant=\"caption\"\n      component=\"div\"\n      color={warn ? 'warning.main' : 'text.secondary'}\n    >\n      {children}\n    </Typography>\n  )\n}\n\nfunction Group({ title, children }: { title: string; children: ReactNode }) {\n  const { classes } = useStyles()\n  return (\n    <section className={classes.group}>\n      <Typography variant=\"subtitle1\" className={classes.heading}>\n        {title}\n      </Typography>\n      {children}\n    </section>\n  )\n}\n\nfunction SettingSwitch({\n  label,\n  checked,\n  onChange,\n  children,\n}: {\n  label: string\n  checked: boolean\n  onChange: (checked: boolean) => void\n  children?: ReactNode\n}) {\n  const { classes } = useStyles()\n  return (\n    <div className={classes.section}>\n      <FormControlLabel\n        control={\n          <Switch\n            checked={checked}\n            onChange={e => {\n              onChange(e.target.checked)\n            }}\n          />\n        }\n        label={label}\n      />\n      {children}\n    </div>\n  )\n}\n\n// one dropdown setting, at the dialog's width, and its caption\nfunction SettingSelect<T extends string>({\n  children,\n  ...props\n}: Omit<Parameters<typeof LabelledSelect<T>>[0], 'size' | 'sx'> & {\n  children?: ReactNode\n}) {\n  const { classes } = useStyles()\n  return (\n    <div className={classes.section}>\n      <LabelledSelect sx={{ minWidth: 200 }} {...props} />\n      {children}\n    </div>\n  )\n}\n\nconst NODE_LIMITS = [5000, 20_000, 50_000, 100_000]\n\n// the presets, with a limit a session states among them\nfunction nodeLimitOptions(current: number) {\n  return [...new Set([...NODE_LIMITS, current])]\n    .sort((a, b) => a - b)\n    .map(limit => ({ value: String(limit), label: limit.toLocaleString() }))\n}\n\ninterface NamedTrack {\n  trackId: string\n  name: string\n}\n\n// '' leaves the pick to the heuristic, so a session can go back to it\nfunction TrackPickSetting({\n  label,\n  choices,\n  stored,\n  auto,\n  testId,\n  onChange,\n  children,\n}: {\n  label: string\n  choices: NamedTrack[]\n  stored: string\n  auto: NamedTrack | undefined\n  testId: string\n  onChange: (trackId: string) => void\n  children: ReactNode\n}) {\n  return choices.length > 0 ? (\n    <SettingSelect\n      label={label}\n      value={choices.some(t => t.trackId === stored) ? stored : ''}\n      options={[\n        { value: '', label: `Automatic (${auto?.name ?? 'none'})` },\n        ...choices.map(({ trackId, name }) => ({\n          value: trackId,\n          label: name,\n        })),\n      ]}\n      testId={testId}\n      onChange={onChange}\n    >\n      {children}\n    </SettingSelect>\n  ) : null\n}\n\n// Toggles the menus already offer (halos, genes, color) stay out of here.\n// `children` is the host's own part of the subgraph group.\nconst GraphSettingsDialog = observer(function GraphSettingsDialog(props: {\n  model: GraphPaneModel\n  onClose: () => void\n  children?: ReactNode\n}) {\n  const { model, onClose, children } = props\n  const { classes } = useStyles()\n\n  return (\n    <Dialog open onClose={onClose} title=\"Graph settings\">\n      <DialogContent>\n        <Group title=\"Subgraph\">\n          {children}\n          <SettingSelect\n            label=\"Node limit\"\n            value={String(model.maxGraphNodes)}\n            options={nodeLimitOptions(model.maxGraphNodes)}\n            testId=\"graph-node-limit-select\"\n            onChange={limit => {\n              model.setMaxGraphNodes(Number(limit))\n            }}\n          >\n            <Caption>\n              The most nodes a layout draws; past it the graph is declined. Walk\n              rows take no limit.\n            </Caption>\n          </SettingSelect>\n        </Group>\n\n        <Group title=\"Drawing\">\n          {model.anchorPaths.length > 1 ? (\n            <SettingSelect\n              label=\"Reference path\"\n              value={model.activeReferencePath ?? ''}\n              options={model.anchorPaths.map(({ name }) => ({\n                value: name,\n                label: name,\n              }))}\n              testId=\"graph-reference-path-select\"\n              onChange={name => {\n                model.setReferencePath(name)\n                void model.recomputeLayout()\n              }}\n            >\n              <Caption>The path the anchored layouts place x along</Caption>\n            </SettingSelect>\n          ) : null}\n\n          <SettingSelect\n            label=\"Node width\"\n            value={model.nodeWidth}\n            options={NODE_WIDTHS}\n            testId=\"graph-node-width-select\"\n            onChange={width => {\n              model.setNodeWidth(width)\n            }}\n          >\n            <Caption>\n              Depth as width. In a cut with walks, depth is how many haplotypes\n              carry the node.\n            </Caption>\n          </SettingSelect>\n\n          <SettingSelect\n            label=\"Link width\"\n            value={model.linkWidth}\n            options={EDGE_WIDTHS}\n            testId=\"graph-link-width-select\"\n            onChange={links => {\n              model.setLinkWidth(links)\n            }}\n          >\n            <Caption>\n              Walks as width, so a common route reads heavy and a private one\n              thin.\n            </Caption>\n          </SettingSelect>\n\n          <SettingSwitch\n            label=\"Draw paths\"\n            checked={model.drawPaths}\n            onChange={draw => {\n              model.setLayer('paths', draw)\n            }}\n          >\n            <Caption>\n              Color each node by the paths through it, one lane per path\n            </Caption>\n            {model.drawPaths && !model.effectiveDrawPaths ? (\n              <Caption warn>\n                {model.pathCount > MAX_PATH_COLORS\n                  ? `Off: ${model.pathCount.toLocaleString()} paths is past the ${MAX_PATH_COLORS} this can tell apart`\n                  : 'Off: this graph states no paths'}\n              </Caption>\n            ) : null}\n          </SettingSwitch>\n\n          <TrackPickSetting\n            label=\"Gene track\"\n            choices={model.geneTrackChoices}\n            stored={model.geneTrackId}\n            auto={pickGeneTrack(model.geneTrackChoices, '')}\n            testId=\"graph-gene-track-select\"\n            onChange={trackId => {\n              model.setGeneTrackId(trackId)\n            }}\n          >\n            <Caption>Where genes on the backbone come from</Caption>\n          </TrackPickSetting>\n\n          <TrackPickSetting\n            label=\"Repeat track\"\n            choices={model.repeatTrackChoices}\n            stored={model.repeatTrackId}\n            auto={pickRepeatTrack(model.repeatTrackChoices, '')}\n            testId=\"graph-repeat-track-select\"\n            onChange={trackId => {\n              model.setRepeatTrackId(trackId)\n            }}\n          >\n            <Caption>\n              The tandem repeat annotation walk rows measure and tile by\n            </Caption>\n          </TrackPickSetting>\n        </Group>\n\n        <Group title=\"Force-directed layout\">\n          {model.hasGraph && !model.usesLayoutEngine ? (\n            <div className={classes.section}>\n              <Caption warn>\n                No effect on the current layout until Layout is Force-directed\n              </Caption>\n            </div>\n          ) : null}\n\n          <SettingSelect\n            label=\"Engine\"\n            value={model.layoutEngine}\n            options={LAYOUT_ENGINES}\n            testId=\"graph-layout-engine-select\"\n            onChange={engine => {\n              model.setLayoutEngine(engine)\n            }}\n          >\n            <Caption>\n              Stress keeps the reference straight, so a zoom keeps the picture;\n              FMMM lets the whole graph settle.\n            </Caption>\n          </SettingSelect>\n\n          <SettingSelect\n            label=\"Layout quality\"\n            value={String(model.layoutQuality)}\n            options={LAYOUT_QUALITIES.map(q => ({\n              value: String(q.value),\n              label: q.label,\n            }))}\n            testId=\"graph-layout-quality-select\"\n            onChange={quality => {\n              model.setLayoutQuality(Number(quality))\n            }}\n          >\n            <Caption>\n              The engine&apos;s iteration budget; higher is slower\n            </Caption>\n          </SettingSelect>\n\n          <SettingSelect\n            label=\"Bubble spread\"\n            value={model.bubbleSpread}\n            options={BUBBLE_SPREADS}\n            testId=\"graph-bubble-spread-select\"\n            onChange={spread => {\n              model.setBubbleSpread(spread)\n            }}\n          >\n            <Caption>How far the layout opens a bubble</Caption>\n          </SettingSelect>\n\n          {model.layoutEngine === 'stress' ? null : (\n            <SettingSwitch\n              label=\"Linear layout\"\n              checked={model.linearLayout}\n              onChange={linear => {\n                model.setLinearLayout(linear)\n              }}\n            >\n              <Caption>Keeps a chain of nodes on one line where it can</Caption>\n            </SettingSwitch>\n          )}\n        </Group>\n      </DialogContent>\n\n      <DialogActions>\n        <Button variant=\"contained\" color=\"primary\" onClick={onClose}>\n          Close\n        </Button>\n      </DialogActions>\n    </Dialog>\n  )\n})\n\nexport default GraphSettingsDialog\n"],
   "mappings": "8WACA,IAAIA,EAAmB,CACrB,CAAE,MAAO,EAAG,MAAO,SAAU,EAC7B,CAAE,MAAO,EAAG,MAAO,MAAO,EAC1B,CAAE,MAAO,EAAG,MAAO,SAAU,EAC7B,CAAE,MAAO,EAAG,MAAO,MAAO,EAC1B,CAAE,MAAO,EAAG,MAAO,MAAO,CAC5B,ECee,SAARC,EAAkD,CACvD,MAAAC,EACA,MAAAC,EACA,QAAAC,EACA,OAAAC,EACA,KAAAC,EACA,GAAAC,EACA,SAAAC,EACA,MAAAC,EACA,MAAAC,EACA,SAAAC,CACF,EAYG,CACD,IAAMC,EAAUC,EAAM,EACtB,OACEC,EAACC,EAAA,CAAY,KAAMT,EAAM,GAAIC,EAAI,SAAUC,EAAU,MAAOC,EAC1D,UAAAO,EAACC,EAAA,CAAW,GAAIL,EAAS,OAAM,GAC5B,SAAAV,EACH,EACAc,EAACE,EAAA,CACC,QAASN,EACT,MAAOT,EACP,MAAOD,EACP,QAAO,GACP,aAAY,GACZ,cAAaG,EACb,YAAac,GACXT,GAASN,EAAQ,KAAKgB,GAAKA,EAAE,QAAUD,CAAM,GAAG,OAASA,EAE3D,SAAUE,GAAK,CACbV,EAASU,EAAE,OAAO,KAAU,CAC9B,EAEC,SAAAjB,EAAQ,IAAIgB,GACXJ,EAACM,EAAA,CAEC,MAAOF,EAAE,MACT,SAAUA,EAAE,SACZ,MAAOA,EAAE,SAAW,OAAYA,EAAE,YAElC,SAAAJ,EAACO,EAAA,CACC,QAASH,EAAE,MACX,UAAWA,EAAE,SAAWA,EAAE,YAAc,OAC1C,GARKA,EAAE,KAST,CACD,EACH,GACF,CAEJ,CCxDA,IAAMI,EAAYC,EAAW,EAAE,CAC7B,QAAS,CACP,aAAc,EAChB,EACA,MAAO,CACL,aAAc,EAChB,EACA,QAAS,CACP,aAAc,CAChB,CACF,CAAC,EAED,SAASC,EAAQ,CACf,KAAAC,EAAO,GACP,SAAAC,CACF,EAGG,CACD,OACEC,EAACC,EAAA,CACC,QAAQ,UACR,UAAU,MACV,MAAOH,EAAO,eAAiB,iBAE9B,SAAAC,EACH,CAEJ,CAEA,SAASG,EAAM,CAAE,MAAAC,EAAO,SAAAJ,CAAS,EAA2C,CAC1E,GAAM,CAAE,QAAAK,CAAQ,EAAIT,EAAU,EAC9B,OACEU,EAAC,WAAQ,UAAWD,EAAQ,MAC1B,UAAAJ,EAACC,EAAA,CAAW,QAAQ,YAAY,UAAWG,EAAQ,QAChD,SAAAD,EACH,EACCJ,GACH,CAEJ,CAEA,SAASO,EAAc,CACrB,MAAAC,EACA,QAAAC,EACA,SAAAC,EACA,SAAAV,CACF,EAKG,CACD,GAAM,CAAE,QAAAK,CAAQ,EAAIT,EAAU,EAC9B,OACEU,EAAC,OAAI,UAAWD,EAAQ,QACtB,UAAAJ,EAACU,EAAA,CACC,QACEV,EAACW,EAAA,CACC,QAASH,EACT,SAAUI,GAAK,CACbH,EAASG,EAAE,OAAO,OAAO,CAC3B,EACF,EAEF,MAAOL,EACT,EACCR,GACH,CAEJ,CAGA,SAASc,EAAgC,CACvC,SAAAd,EACA,GAAGe,CACL,EAEG,CACD,GAAM,CAAE,QAAAV,CAAQ,EAAIT,EAAU,EAC9B,OACEU,EAAC,OAAI,UAAWD,EAAQ,QACtB,UAAAJ,EAACe,EAAA,CAAe,GAAI,CAAE,SAAU,GAAI,EAAI,GAAGD,EAAO,EACjDf,GACH,CAEJ,CAEA,IAAMiB,EAAc,CAAC,IAAM,IAAQ,IAAQ,GAAO,EAGlD,SAASC,EAAiBC,EAAiB,CACzC,MAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAGF,EAAaE,CAAO,CAAC,CAAC,EAC1C,KAAK,CAACC,EAAGC,IAAMD,EAAIC,CAAC,EACpB,IAAIC,IAAU,CAAE,MAAO,OAAOA,CAAK,EAAG,MAAOA,EAAM,eAAe,CAAE,EAAE,CAC3E,CAQA,SAASC,EAAiB,CACxB,MAAAf,EACA,QAAAgB,EACA,OAAAC,EACA,KAAAC,EACA,OAAAC,EACA,SAAAjB,EACA,SAAAV,CACF,EAQG,CACD,OAAOwB,EAAQ,OAAS,EACtBvB,EAACa,EAAA,CACC,MAAON,EACP,MAAOgB,EAAQ,KAAKI,GAAKA,EAAE,UAAYH,CAAM,EAAIA,EAAS,GAC1D,QAAS,CACP,CAAE,MAAO,GAAI,MAAO,cAAcC,GAAM,MAAQ,MAAM,GAAI,EAC1D,GAAGF,EAAQ,IAAI,CAAC,CAAE,QAAAK,EAAS,KAAAC,CAAK,KAAO,CACrC,MAAOD,EACP,MAAOC,CACT,EAAE,CACJ,EACA,OAAQH,EACR,SAAUjB,EAET,SAAAV,EACH,EACE,IACN,CAIA,IAAM+B,EAAsBC,EAAS,SAA6BjB,EAI/D,CACD,GAAM,CAAE,MAAAkB,EAAO,QAAAC,EAAS,SAAAlC,CAAS,EAAIe,EAC/B,CAAE,QAAAV,CAAQ,EAAIT,EAAU,EAE9B,OACEU,EAAC6B,EAAA,CAAO,KAAI,GAAC,QAASD,EAAS,MAAM,iBACnC,UAAA5B,EAAC8B,EAAA,CACC,UAAA9B,EAACH,EAAA,CAAM,MAAM,WACV,UAAAH,EACDC,EAACa,EAAA,CACC,MAAM,aACN,MAAO,OAAOmB,EAAM,aAAa,EACjC,QAASf,EAAiBe,EAAM,aAAa,EAC7C,OAAO,0BACP,SAAUX,GAAS,CACjBW,EAAM,iBAAiB,OAAOX,CAAK,CAAC,CACtC,EAEA,SAAArB,EAACH,EAAA,CAAQ,kGAGT,EACF,GACF,EAEAQ,EAACH,EAAA,CAAM,MAAM,UACV,UAAA8B,EAAM,YAAY,OAAS,EAC1BhC,EAACa,EAAA,CACC,MAAM,iBACN,MAAOmB,EAAM,qBAAuB,GACpC,QAASA,EAAM,YAAY,IAAI,CAAC,CAAE,KAAAH,CAAK,KAAO,CAC5C,MAAOA,EACP,MAAOA,CACT,EAAE,EACF,OAAO,8BACP,SAAUA,GAAQ,CAChBG,EAAM,iBAAiBH,CAAI,EACtBG,EAAM,gBAAgB,CAC7B,EAEA,SAAAhC,EAACH,EAAA,CAAQ,uDAA2C,EACtD,EACE,KAEJG,EAACa,EAAA,CACC,MAAM,aACN,MAAOmB,EAAM,UACb,QAASI,EACT,OAAO,0BACP,SAAUC,GAAS,CACjBL,EAAM,aAAaK,CAAK,CAC1B,EAEA,SAAArC,EAACH,EAAA,CAAQ,6FAGT,EACF,EAEAG,EAACa,EAAA,CACC,MAAM,aACN,MAAOmB,EAAM,UACb,QAASM,EACT,OAAO,0BACP,SAAUC,GAAS,CACjBP,EAAM,aAAaO,CAAK,CAC1B,EAEA,SAAAvC,EAACH,EAAA,CAAQ,iFAGT,EACF,EAEAQ,EAACC,EAAA,CACC,MAAM,aACN,QAAS0B,EAAM,UACf,SAAUQ,GAAQ,CAChBR,EAAM,SAAS,QAASQ,CAAI,CAC9B,EAEA,UAAAxC,EAACH,EAAA,CAAQ,sEAET,EACCmC,EAAM,WAAa,CAACA,EAAM,mBACzBhC,EAACH,EAAA,CAAQ,KAAI,GACV,SAAAmC,EAAM,UAAYS,EACf,QAAQT,EAAM,UAAU,eAAe,CAAC,sBAAsBS,CAAe,uBAC7E,kCACN,EACE,MACN,EAEAzC,EAACsB,EAAA,CACC,MAAM,aACN,QAASU,EAAM,iBACf,OAAQA,EAAM,YACd,KAAMU,EAAcV,EAAM,iBAAkB,EAAE,EAC9C,OAAO,0BACP,SAAUJ,GAAW,CACnBI,EAAM,eAAeJ,CAAO,CAC9B,EAEA,SAAA5B,EAACH,EAAA,CAAQ,iDAAqC,EAChD,EAEAG,EAACsB,EAAA,CACC,MAAM,eACN,QAASU,EAAM,mBACf,OAAQA,EAAM,cACd,KAAMW,EAAgBX,EAAM,mBAAoB,EAAE,EAClD,OAAO,4BACP,SAAUJ,GAAW,CACnBI,EAAM,iBAAiBJ,CAAO,CAChC,EAEA,SAAA5B,EAACH,EAAA,CAAQ,sEAET,EACF,GACF,EAEAQ,EAACH,EAAA,CAAM,MAAM,wBACV,UAAA8B,EAAM,UAAY,CAACA,EAAM,iBACxBhC,EAAC,OAAI,UAAWI,EAAQ,QACtB,SAAAJ,EAACH,EAAA,CAAQ,KAAI,GAAC,0EAEd,EACF,EACE,KAEJG,EAACa,EAAA,CACC,MAAM,SACN,MAAOmB,EAAM,aACb,QAASY,EACT,OAAO,6BACP,SAAUC,GAAU,CAClBb,EAAM,gBAAgBa,CAAM,CAC9B,EAEA,SAAA7C,EAACH,EAAA,CAAQ,+GAGT,EACF,EAEAG,EAACa,EAAA,CACC,MAAM,iBACN,MAAO,OAAOmB,EAAM,aAAa,EACjC,QAASc,EAAiB,IAAIC,IAAM,CAClC,MAAO,OAAOA,EAAE,KAAK,EACrB,MAAOA,EAAE,KACX,EAAE,EACF,OAAO,8BACP,SAAUC,GAAW,CACnBhB,EAAM,iBAAiB,OAAOgB,CAAO,CAAC,CACxC,EAEA,SAAAhD,EAACH,EAAA,CAAQ,2DAET,EACF,EAEAG,EAACa,EAAA,CACC,MAAM,gBACN,MAAOmB,EAAM,aACb,QAASiB,EACT,OAAO,6BACP,SAAUC,GAAU,CAClBlB,EAAM,gBAAgBkB,CAAM,CAC9B,EAEA,SAAAlD,EAACH,EAAA,CAAQ,6CAAiC,EAC5C,EAECmC,EAAM,eAAiB,SAAW,KACjChC,EAACM,EAAA,CACC,MAAM,gBACN,QAAS0B,EAAM,aACf,SAAUmB,GAAU,CAClBnB,EAAM,gBAAgBmB,CAAM,CAC9B,EAEA,SAAAnD,EAACH,EAAA,CAAQ,2DAA+C,EAC1D,GAEJ,GACF,EAEAG,EAACoD,EAAA,CACC,SAAApD,EAACqD,EAAA,CAAO,QAAQ,YAAY,MAAM,UAAU,QAASpB,EAAS,iBAE9D,EACF,GACF,CAEJ,CAAC,EAEMqB,GAAQxB",
   "names": ["LAYOUT_QUALITIES", "LabelledSelect", "label", "value", "options", "testId", "size", "sx", "disabled", "title", "shown", "onChange", "labelId", "useId", "jsxs", "FormControl", "jsx", "InputLabel", "Select", "picked", "o", "e", "MenuItem", "ListItemText", "useStyles", "makeStyles", "Caption", "warn", "children", "jsx", "Typography", "Group", "title", "classes", "jsxs", "SettingSwitch", "label", "checked", "onChange", "FormControlLabel", "Switch", "e", "SettingSelect", "props", "LabelledSelect", "NODE_LIMITS", "nodeLimitOptions", "current", "a", "b", "limit", "TrackPickSetting", "choices", "stored", "auto", "testId", "t", "trackId", "name", "GraphSettingsDialog", "observer", "model", "onClose", "Dialog", "DialogContent", "NODE_WIDTHS", "width", "EDGE_WIDTHS", "links", "draw", "MAX_PATH_COLORS", "pickGeneTrack", "pickRepeatTrack", "LAYOUT_ENGINES", "engine", "LAYOUT_QUALITIES", "q", "quality", "BUBBLE_SPREADS", "spread", "linear", "DialogActions", "Button", "GraphSettingsDialog_default"]

package/dist/chunks/{chunk-DKQFTMWL.js → chunk-FUKZO5AZ.js}

@@ -1,2 +1,2 @@
-import{a as dt,c as ht,d as yt,g as C,j as K,l as xt,q as Mt,r as $,w as bt,x as vt}from"./chunk-HICKAMKK.js";import{b as pt,c as mt}from"./chunk-L372SDUG.js";var gt=20;function be(t){let n=e=>Math.round(e*100)/100;return t.map((e,o)=>`${o?"L":"M"}${n(e.x)},${n(e.y)}`).join("")}function wt(t,n,e,o,r){let s=Math.hypot(o-n,e-t);if(s===0)return[e,o];let a=(e-t)/s,c=(o-n)/s;return[e+r*a,o+r*c]}function Y(t,n){let e=1-n,o=e*e*e,r=3*e*e*n,s=3*e*n*n,a=n*n*n;return{x:o*t.x0+r*t.cx0+s*t.cx1+a*t.x1,y:o*t.y0+r*t.cy0+s*t.cy1+a*t.y1}}function Pt(t){let n=t[Math.floor(t.length/2)];return n?Y(n,.5):void 0}function Nt(t){let n=1/0,e=1/0,o=-1/0,r=-1/0;for(let s of t)n=Math.min(n,s.x0,s.cx0,s.cx1,s.x1),o=Math.max(o,s.x0,s.cx0,s.cx1,s.x1),e=Math.min(e,s.y0,s.cy0,s.cy1,s.y1),r=Math.max(r,s.y0,s.cy0,s.cy1,s.y1);return{minX:n,minY:e,maxX:o,maxY:r}}function tn(t,n,e){let o=Y(t,n),r=Y(t,e),s=(e-n)/3,a=At(t,n),c=At(t,e);return{x0:o.x,y0:o.y,cx0:o.x+a.x*s,cy0:o.y+a.y*s,cx1:r.x-c.x*s,cy1:r.y-c.y*s,x1:r.x,y1:r.y}}function At(t,n){let e=1-n,o=3*e*e,r=6*e*n,s=3*n*n;return{x:o*(t.cx0-t.x0)+r*(t.cx1-t.cx0)+s*(t.x1-t.cx1),y:o*(t.cy0-t.y0)+r*(t.cy1-t.cy0)+s*(t.y1-t.cy1)}}var H=32;function nn(t,n,e,o){let r=[],s=0;return t.forEach((a,c)=>{let i=n[c],l=i/H,d=Y(a,0);for(let u=1;u<=H;u++){let y=Y(a,u/H);if(Math.max(d.x,y.x)+l>=e.minX&&Math.min(d.x,y.x)-l<=e.maxX&&Math.max(d.y,y.y)+l/o>=e.minY&&Math.min(d.y,y.y)-l/o<=e.maxY){let f=s+i*(u-1)/H,h=s+i*u/H,x=r.at(-1);x&&x[1]>=f?x[1]=h:r.push([f,h])}d=y}s+=i}),r}function ve(t,n,e=1,o){let r=t.map(u=>Math.hypot(u.cx0-u.x0,(u.cy0-u.y0)*e)+Math.hypot(u.cx1-u.cx0,(u.cy1-u.cy0)*e)+Math.hypot(u.x1-u.cx1,(u.y1-u.cy1)*e)),s=r.reduce((u,y)=>u+y,0),a=Math.round(s/n),c=Math.max(3,a%2?a:a+1),i=o?nn(t,r,o,e):void 0,l=0,d=[];for(let u=0;u<c;u+=2){let y=u/c*s,f=(u+1)/c*s;if(i){for(;l<i.length&&i[l][1]<y;)l++;if(l===i.length)break;if(i[l][0]>f)continue}let h=[],x=[],p=0;t.forEach((b,m)=>{let M=r[m],g=p+M;if(M>0&&g>y&&p<f){let v=Math.max(0,(y-p)/M),w=Math.min(1,(f-p)/M);h.push(tn(b,v,w)),x.push((m+v)/t.length,(m+w)/t.length)}p=g}),h.length&&d.push({curves:h,startAlong:x[0],endAlong:x.at(-1)})}return d}function ge(t,n,e,o,r){let s=t.length,a=new Array(s);for(let c=0;c<s;c++){let i=t[c],l=c/s,d=(c+1)/s,u=n+(o-n)*l,y=e+(r-e)*l,f=n+(o-n)*d,h=e+(r-e)*d;a[c]={x0:i.x0+u,y0:i.y0+y,cx0:i.cx0+u,cy0:i.cy0+y,cx1:i.cx1+f,cy1:i.cy1+h,x1:i.x1+f,y1:i.y1+h}}return a}function we(t,n,e){let o=new Array(t.length);for(let r=0;r<t.length;r++){let s=t[r];o[r]={x0:s.x0+n,y0:s.y0+e,cx0:s.cx0+n,cy0:s.cy0+e,cx1:s.cx1+n,cy1:s.cy1+e,x1:s.x1+n,y1:s.y1+e}}return o}function W(t,n){let e=t.length-1;return n==="end"?{at:t[e],inward:t[e-1]}:{at:t[0],inward:t[1]}}var en=.5,on=80;function F(t){return t.endsWith("-")?"-":"+"}function q(t){let n=(e,o)=>(o??F(e))===F(e);return{from:n(t.from,t.fromStrand)?"end":"start",to:n(t.to,t.toStrand)?"start":"end"}}function _t(t){let n=1/0,e=-1/0;for(let o of t)n=Math.min(n,o.x),e=Math.max(e,o.x);return{min:n,max:e}}function Et(t,n){return Math.max(0,n.min-t,t-n.max)}function It(t,n,e){let o=Et(t[0].x,n),r=Et(t[t.length-1].x,n);return o===r?e:o<r?"start":"end"}function rn(t,n){return{from:It(t,_t(n),"end"),to:It(n,_t(t),"start")}}var Lt=new WeakMap;function sn(t,n){let e=Lt.get(t);e||(e=new WeakMap,Lt.set(t,e));let o=e.get(n);return o||(o=rn(t,n),e.set(n,o)),o}var cn=.75,an=1.15,fn=.35,un=3*gt;function ln(t,n,e,o,r,s){let a=Math.hypot(e-t,o-n),c=a===0?1:(e-t)/a,i=a===0?0:(o-n)/a,l=0,d=1/0,u=-1/0;for(let x of r){let p=x.x-t,b=x.y-n,m=p*-i+b*c;Math.abs(m)>Math.abs(l)&&(l=m);let M=p*c+b*i;d=Math.min(d,M),u=Math.max(u,M)}let y=r.length?u-d:0,f=Math.max(Math.abs(l)*an/cn,y*fn),h=s===void 0?f:Math.min(f,s);return l<0?-h:h}function Xt({scaleX:t,scaleY:n}){return n/t}var dn=3;function J(t,n,e){let o=n.x-t.x,r=(n.y-t.y)*e,s=Math.hypot(o,r);return s===0?void 0:{x:o/s,y:r/s}}function Ae(t,n,e,o){let r=Xt(o),s=dn/Math.max(o.scaleX,1e-6),a=J(t[t.length-1],n[0],r)??J(t[0],t.at(-1),r)??J(n[0],n.at(-1),r)??{x:1,y:0},c=[];for(let i=0;i<e;i++){let l=(i-(e-1)/2)*s;c.push({x:-a.y*l,y:a.x*l/r})}return c}function Q(t,n){return t.map(e=>({x:e.x,y:e.y*n}))}function hn(t,n){for(let e of t)e.y0/=n,e.cy0/=n,e.cy1/=n,e.y1/=n;return t}function Z(t,n,e){let o=0;for(let r=1;r<t.length;r++){let s=t[r-1],a=t[r];o+=Math.hypot((a.x-s.x)*n,(a.y-s.y)*e)}return o}var yn=12,xn=40;function Ot(t,n){let e=Z(t,n,n);return Math.min(xn,Math.max(yn,e/2))/Math.max(n,Number.EPSILON)}function pn(t){return t.from!==t.to?!1:t.fromStrand&&t.toStrand&&t.fromStrand!==t.toStrand?t.fromStrand==="+"?"end":"start":!0}function Ct(t,n=!1){let e=pn(t);if(!n)return e;let o=q(t);return e===!1?o:o.from===o.to?o.from:!0}function mn(t,n){let{at:e,inward:o}=t,r=o?e.x-o.x:1,s=o?e.y-o.y:0,a=Math.hypot(r,s)||1,c=r/a,i=s/a,l=e.x,d=e.y,u=l+c*n/3,y=d+i*n/3,f=l+c*n,h=d+i*n,x=-i*n/2,p=c*n/2;return[{x0:l,y0:d,cx0:u,cy0:y,cx1:f+x,cy1:h+p,x1:f,y1:h},{x0:f,y0:h,cx0:f-x,cy0:h-p,cx1:u,cy1:y,x1:l,y1:d}]}function tt(t,n,e,o,r=[],s){let a=o.scaleX,c=Xt(o),i=s??(o.pixelRows?un:void 0);if(e===!1&&(e=sn(t,n)),c!==1)return hn(tt(Q(t,c),Q(n,c),e,{scaleX:a,scaleY:a},Q(r,c),i===void 0?void 0:i*c),c);if(typeof e=="string")return mn(W(t,e),Ot(t,a));let l=e===!0,d=e===!0?{from:"end",to:"start"}:e,u=W(t,d.from),y=W(n,d.to),f=u.at,h=y.at,x=f.x,p=f.y,b=h.x,m=h.y;if(l){let M=1,g=0;if(u.inward){let S=f.x-u.inward.x,P=f.y-u.inward.y,X=Math.hypot(S,P);X>0&&(M=S/X,g=P/X)}let v=Ot(t,a),w=-g,_=M,I=(f.x+h.x)/2+w*v,E=(f.y+h.y)/2+_*v,A=x+M*v,N=p+g*v,O=b-M*v,L=m-g*v;return[{x0:x,y0:p,cx0:A,cy0:N,cx1:A+w*v,cy1:N+_*v,x1:I,y1:E},{x0:I,y0:E,cx0:O+w*v,cy0:L+_*v,cx1:O,cy1:L,x1:b,y1:m}]}else{let M=u.inward??{x:f.x-(h.x-f.x),y:f.y-(h.y-f.y)},g=y.inward??{x:h.x-(f.x-h.x),y:h.y-(f.y-h.y)},v=Math.hypot(b-x,m-p),w=(at,it,Jt,Qt)=>{let ft=it.x-at.x,ut=it.y-at.y,lt=Math.hypot(ft,ut),Zt=lt===0?0:(Jt*ft+Qt*ut)/lt;return Math.max(0,Math.min(v*en,on,Zt*.5))},_=h.x-f.x,I=h.y-f.y,[E,A]=wt(M.x,M.y,f.x,f.y,w(M,f,_,I)),[N,O]=wt(g.x,g.y,h.x,h.y,w(g,h,-_,-I)),L=r.length?ln(x,p,b,m,r,i):0,S=v===0?1:v,P=(b-x)/S,X=(m-p)/S,T=-X*L,B=P*L,R=P*Math.abs(L),ct=X*Math.abs(L);return[{x0:x,y0:p,cx0:E+T-R,cy0:A+B-ct,cx1:N+T+R,cy1:O+B+ct,x1:b,y1:m}]}}function St(t,n){let e=t[0],o=t.at(-1);return Math.hypot(e.x-n.x,e.y-n.y)<Math.hypot(o.x-n.x,o.y-n.y)?"start":"end"}function kt(t,n,e,o){let r=W(t,o?.from??St(t,e[0])),s=W(n,o?.to??St(n,e.at(-1))),a=[r.at,...e,s.at],c=l=>{let d=a[l],u=f=>Math.hypot(f.x-d.x,f.y-d.y),y=(f,h)=>{let x=f?u(f):0,p=u(h);return x===0?{x:h.x-d.x,y:h.y-d.y}:{x:(d.x-f.x)/x*p,y:(d.y-f.y)/x*p}};if(l===0)return y(r.inward,a[1]);if(l===a.length-1){let f=y(s.inward,a[l-1]);return{x:-f.x,y:-f.y}}return{x:(a[l+1].x-a[l-1].x)/2,y:(a[l+1].y-a[l-1].y)/2}},i=[];for(let l=0;l<a.length-1;l++){let d=a[l],u=a[l+1],y=c(l),f=c(l+1);i.push({x0:d.x,y0:d.y,cx0:d.x+y.x/3,cy0:d.y+y.y/3,cx1:u.x-f.x/3,cy1:u.y-f.y/3,x1:u.x,y1:u.y})}return i}function nt(){let t=new WeakMap;return(n,e,o)=>{let r=t.get(n);if(r?.deps.length===e.length&&r.deps.every((a,c)=>Object.is(a,e[c])))return r.value;let s=o();return t.set(n,{deps:e,value:s}),s}}var Bt=11,Mn=6.2,D=4;function et(t){return t.length*Mn+D*2}function bn(t,n){return t.x0<n.x1&&t.x1>n.x0&&t.y0<n.y1&&t.y1>n.y0}function Tt(t,n){return t.x1<=0||t.x0>=n.width||t.y1<=0||t.y0>=n.height}function vn(t,n){return t.x0>=0&&t.x1<=n.width&&t.y0>=0&&t.y1<=n.height}function Rt(t,n=[]){let e=[...n];return o=>Tt(o,t)||e.some(r=>bn(r,o))?!1:(e.push(o),!0)}function Ie(t,n,e){let o=[],r=Bt+D*2,s=(c,i,l,d)=>{let u=et(i),y=!1;for(let f=0;f<=(c.stack??0);f++){let h=l+d*f*r,x={x0:c.x-u/2,x1:c.x+u/2,y0:h-Bt-D,y1:h+D};if(Tt(x,n))break;if(vn(x,n)&&(c.fits?.(x)??!0)){if(e(x))return{placed:{...c,text:i,y:h,w:u},crowded:y};y=!0}}return{placed:void 0,crowded:y}},a=(c,i)=>{let l=s(c,i,c.y,c.y>n.height/2?-1:1);return l.placed??(c.flipY===void 0||l.crowded?void 0:s(c,i,c.flipY,c.flipY<c.y?-1:1).placed)};for(let c of t){let i=a(c,c.text)??(c.fallback===void 0?void 0:a(c,c.fallback));i&&o.push(i)}return o}function $t(t){return t==="+"?"-":"+"}function Ne(t,n=new Set){let e=t.edges.map(q),o=new Map,r=(f,h,x)=>{dt(o,`${f}|${h}`,x)};t.edges.forEach((f,h)=>{r(f.from,e[h].from,h),r(f.to,e[h].to,h)});let s=f=>{let h=o.get(`${f}|end`);if(h?.length!==1)return;let x=h[0],p=t.edges[x];return p.from===f&&p.to!==f&&!n.has(f)&&!n.has(p.to)&&e[x].from==="end"&&e[x].to==="start"&&o.get(`${p.to}|start`)?.length===1?x:void 0},a=new Set,c=new Map,i=new Map;for(let f of t.nodes){let h=o.get(`${f.id}|start`),x=h?.length===1?t.edges[h[0]].from:void 0;if(c.has(f.id)||x!==void 0&&s(x)===h[0])continue;let p=[f.id];for(;;){let b=s(p.at(-1)),m=b===void 0?void 0:t.edges[b].to;if(m===void 0||c.has(m))break;a.add(b),p.push(m)}for(let b of p)c.set(b,f.id);p.length>1&&i.set(f.id,p)}for(let f of t.nodes)c.has(f.id)||c.set(f.id,f.id);let l=new Map(t.nodes.map(f=>[f.id,f])),d=[];for(let f of t.nodes){if(c.get(f.id)!==f.id)continue;let h=i.get(f.id);if(!h){d.push(f);continue}let x=h.map(m=>l.get(m)),p=x.filter(C),b=p.length?p.reduce((m,M)=>m.stable.start<=M.stable.start?m:M):x[0];d.push({id:f.id,name:f.name,length:x.reduce((m,M)=>m+M.length,0),depth:f.depth,stable:b.stable})}let u=new Set,y=[];return t.edges.forEach((f,h)=>{let x=c.get(f.from),p=c.get(f.to),b=e[h],m=`${x}|${b.from}>${p}|${b.to}`;a.has(h)||u.has(m)||(u.add(m),y.push({from:x,to:p,...b.from==="start"?{fromStrand:$t(F(x))}:{},...b.to==="end"?{toStrand:$t(F(p))}:{}}))}),{graph:{...t,nodes:d,edges:y,paths:void 0,pathVisits:void 0},runs:i}}function Xe(t,n,e){let o={...t};for(let[r,s]of n){let a=t[r];if(!a?.length)continue;delete o[r];let c=rt(a),i=c.at(-1),l=s.map(y=>Math.max(e(y),0)),d=l.reduce((y,f)=>y+f,0),u=0;s.forEach((y,f)=>{let h=d?l[f]/d*i:i/s.length,x=f===s.length-1?i:u+h;o[y]=Yt(a,c,u,x),u=x})}return o}function Ce(t,n,e){if(t.length===0)return[];let o=rt(t),r=o.at(-1);return Yt(t,o,n*r,e*r)}function Ht(t){let n=rt(t);return ot(t,n,n.at(-1)/2)}function rt(t){let n=[0];for(let e=1;e<t.length;e++)n.push(n[e-1]+Math.hypot(t[e].x-t[e-1].x,t[e].y-t[e-1].y));return n}function Wt(t,n){let e=0,o=t.length;for(;e<o;){let r=e+o>>1;t[r]<n?e=r+1:o=r}return e}function ot(t,n,e){if(e<=0)return{...t[0]};let o=Wt(n,e);if(o>=n.length)return{...t.at(-1)};let r=n[o]-n[o-1],s=r>0?(e-n[o-1])/r:0,a=t[o-1],c=t[o];return{x:a.x+(c.x-a.x)*s,y:a.y+(c.y-a.y)*s}}function Yt(t,n,e,o){let r=[ot(t,n,e)];for(let s=Wt(n,e);s<t.length&&n[s]<o;s++)n[s]>e&&r.push({...t[s]});return r.push(ot(t,n,o)),r}function $e(t,n){let e=new Set(t.nodes.filter(i=>C(i)&&K(i,n)).map(i=>i.id)),o=t.paths??[];if(e.size===0||o.length===0)return t;let r=o.map(i=>{let l=-1,d=-1;return i.nodeIds.forEach((u,y)=>{e.has(u)&&(l<0&&(l=y),d=y)}),l<0?void 0:{first:l,last:d}});if(r.every((i,l)=>i?.first===0&&i.last===o[l].nodeIds.length-1))return t;let s=new Set,a=[],c=new Map;return o.forEach((i,l)=>{let d=r[l];if(d){let u=i.nodeIds.slice(d.first,d.last+1);for(let y of u)s.add(y);a.push({...i,nodeIds:u}),c.set(i.name,{first:d.first,nodeIds:u})}}),{...t,nodes:t.nodes.filter(i=>s.has(i.id)),edges:t.edges.filter(i=>s.has(i.from)&&s.has(i.to)),paths:a,pathVisits:t.pathVisits&&gn(t.pathVisits,o,r,new Map(t.nodes.map(i=>[i.id,i.name]))),anchorPaths:bt(t,c)}}function gn(t,n,e,o){let r=t.replay(),s=new Mt;return n.forEach((a,c)=>{let i=t.pathIndex($(a.name).name),l=e[c];a.nodeIds.forEach((d,u)=>{let y=o.get(d)??d,f=r(t.slot(y),i);f>=0&&l&&u>=l.first&&u<=l.last&&s.add(y,t.paths[i],t.samples[i],t.start[f],t.reversed[f]===1)})}),s.build()}function He(t,n,e){let o=t.nodes.map(r=>{if(!C(r))return r;let s=r.stable.start,a=s+r.length,[c,i]=K(r,n)?[Math.max(s,n.start),Math.min(a,n.end)]:a<=n.start?[Math.max(s,a-e),a]:[s,Math.min(a,s+e)];return c===s&&i===a?r:{...r,length:i-c,stable:{...r.stable,start:c},unclipped:{start:s,length:r.length}}});return o.some((r,s)=>r!==t.nodes[s])?{...t,nodes:o}:t}function Ft(t){return t.nodes.some(n=>n.unclipped)?{...t,nodes:t.nodes.map(({unclipped:n,...e})=>n&&e.stable?{...e,length:n.length,stable:{...e.stable,start:n.start}}:e)}:t}var wn=1,ze=t=>`skips ${t??"the reference"} sequence (a deletion)`;function An(t,n){return n.flatMap(e=>t[e]??[])}function Gt(t,n,e,o,r,s){let a=t[n.from],c=t[n.to];if(!(!a?.length||!c?.length))return r?kt(a,c,r,s?q(n):void 0):tt(a,c,Ct(n,s),e,o?An(t,o):[])}function _n(t){let n=ht(t.nodes.filter(C),e=>e.stable.refName);for(let e of n.values())e.sort((o,r)=>o.stable.start-r.stable.start);return n}function En(t,n,e){let o=[];if(t)for(let r=xt(t,n);r<t.length;r++){let s=t[r];if(s.stable.start>=e)break;s.stable.start+s.length<=e&&o.push(s.id)}return o}function In(t,n,e,o){let{fromStrand:r,toStrand:s}=t;if(r===void 0||s===void 0)return!0;let a=r===(n.stable.strand??"+"),c=s===(e.stable.strand??"+");return o?a&&c:!a&&!c}function Ln(t,n,e,o){let r;for(let s of o(n))for(let a of o(e)){let c=s<=a,i=c?{start:s+n.length,end:a}:{start:a+e.length,end:s};In(t,n,e,c)&&(!r||Math.abs(i.end-i.start)<Math.abs(r.end-r.start))&&(r=i)}return r}var On=.01;function Sn(t,n){let e=new Map;for(let[o,r]of t){let s=r.flatMap(a=>{let c=n(a);return c.slice(1).map((i,l)=>({at:c[l],copy:i-c[l]}))});s.length&&e.set(o,s.sort((a,c)=>a.at-c.at))}return e}function Pn(t,n,e){if(!t)return!1;let o=yt(t.length,s=>t[s].at<n),r=[t[o-1],t[o]].filter(s=>s!==void 0).sort((s,a)=>Math.abs(s.at-n)-Math.abs(a.at-n))[0];return r!==void 0&&Math.abs(r.at-n)<=r.copy&&Math.abs(e-r.copy)<=r.copy*On}function je(t){let n=Ft(t),e=new Map(n.nodes.map(c=>[c.id,c])),o=_n(n),r=vt(n),s=Sn(o,r),a=[];for(let c=0;c<n.edges.length;c++){let i=n.edges[c],l=e.get(i.from),d=e.get(i.to);if(!i.foldBridge&&l!==void 0&&d!==void 0&&C(l)&&C(d)&&l.stable.refName===d.stable.refName){let u=Ln(i,l,d,r),y=l.stable.refName,f=u?u.end-u.start:0;if(u&&f>=wn&&!Pn(s.get(y),u.start,f)){let{start:h,end:x}=u;a.push({edgeIndex:c,from:i.from,to:i.to,...i.fromStrand?{fromStrand:i.fromStrand}:{},...i.toStrand?{toStrand:i.toStrand}:{},refName:y,start:h,end:x,bp:f,bypassed:En(o.get(y),h,x)})}}}return a}function Nn(t,n){let e=new Map,o=a=>{let c=a;for(;e.has(c);)c=e.get(c);return c!==a&&e.set(a,c),c},r=(a,c)=>{let[i,l]=[o(a),o(c)];return i!==l&&e.set(i,l),i!==l},s=new Set(n.map(a=>a.edgeIndex));return t.edges.forEach((a,c)=>{s.has(c)||r(a.from,a.to)}),new Set(n.filter(a=>!r(a.from,a.to)).map(a=>a.edgeIndex))}function Ue(t,n){return n?.walks.length?t.filter(e=>!n.edgeIndexes.has(e.edgeIndex)):t}var qt=new WeakMap;function Ke(t,n,e=!0){let o=qt.get(n);o||(o=new Map,qt.set(n,o));let r=o.get(e);if(!r){let s=e?new Set:Nn(t,n);r={shown:n.filter(a=>!s.has(a.edgeIndex)),bypassed:new Map(n.map(a=>[a.edgeIndex,a.bypassed])),hidden:s},o.set(e,r)}return r}var Xn=26,Cn=4e4,kn=8,Bn=8,Tn=5.7,Rn=6,$n=13,G=3,V=2;function U(t){return(t.length*Tn+Rn+G)/2}var k=($n+G)/2,Hn=U("1 bp");function z(t,n,e){return{x0:n-t,x1:n+t,y0:e-k,y1:e+k}}function oo(t,n){return{x0:6,x1:6+et(t)+G,y0:n-8-G/2,y1:n+8+G/2}}function j(t,n,e){return e<n?t:Math.min(Math.max(t,n),e)}function zt(t){return String(t).replace(/\B(?=(\d{3})+$)/g,",")}function jt(t){let[n,e]=t>=999500?[t/1e6,"Mb"]:t>=1e3?[t/1e3,"kb"]:[];return n===void 0?`${t} bp`:`${+n.toFixed(n>=100?0:1)} ${e}`}function Dt(t){return`${jt(t)} del`}function Wn(t,n,e,o){let r=t[0],s=t[t.length-1],a=(n.x-(r.x0+s.x1)/2)*e,c=(n.y-(r.y0+s.y1)/2)*o,i=Math.hypot(a,c);return i===0?{x:0,y:-1}:{x:a/i,y:c/i}}function Yn(t,n){return Math.abs(n.x)*(t.x1-t.x0)/2+Math.abs(n.y)*(t.y1-t.y0)/2}function Fn(t,n){let e=(t.x1-t.x0)/2,o=(t.y1-t.y0)/2;return Math.min(n.x===0?1/0:e/Math.abs(n.x),n.y===0?1/0:o/Math.abs(n.y))}function qn(t,n){let e=1/0,o=1/0,r=-1/0,s=-1/0;for(let a of t)for(let c of n[a]??[])e=Math.min(e,c.x),r=Math.max(r,c.x),o=Math.min(o,c.y),s=Math.max(s,c.y);return e===1/0?void 0:{minX:e,minY:o,maxX:r,maxY:s}}var Gn=nt();function Dn(t,n){return Gn(t,[n],()=>Object.entries(t).filter(([e,o])=>o.length>0&&n.has(e)).sort(([e],[o])=>n.get(o)-n.get(e)))}var Vn=nt();function zn(t,n,e,o,r,s){let{scaleX:a,scaleY:c}=e;return Vn(t,[n,r,s,a,c,o],()=>{let i=[];for(let l of[...n].sort((d,u)=>u.bp-d.bp)){let d=Gt(t,l,e,l.bypassed,r?.[l.edgeIndex],s),u=d?Pt(d):void 0;if(d&&u){let{minX:y,minY:f,maxX:h,maxY:x}=Nt(d);i.push({deletion:l,curves:d,apex:u,extent:Math.max((h-y)*a,(x-f)*c)})}}return i})}function jn({nodePositions:t,nodeLengths:n,deletions:e,deletionRoutes:o,stranded:r=!1,alleleDeletions:s,axis:a,translateX:c,translateY:i,width:l,height:d,version:u=0}){let{scaleX:y,scaleY:f}=a,h=[],x=[];for(let{deletion:m,curves:M,apex:g,extent:v}of zn(t,e,a,u,o,r))if(v>=Xn){let w=Dt(m.bp),_=U(w),I=z(_,0,0),E=g.x*y+c,A=g.y*f+i;if(E<0||E>l||A<0||A>d)continue;let N=v>=_*2/V,O=Wn(M,g,y,f),L=Yn(I,O)+Bn,S=N?E:j(E+O.x*L,_,l-_),P=N?A:j(A+O.y*L,k,d-k),X=Math.hypot(S-E,P-A),T;if(X>0){let B={x:(S-E)/X,y:(P-A)/X},R=Fn(I,B);T={arcX:E,arcY:A,labelX:S-B.x*R,labelY:P-B.y*R}}h.push({label:{key:`del:${m.edgeIndex}`,text:w,x:S,y:P,kind:"deletion",leader:T},box:z(_,S,P)})}let p=new Set,b=[...s??[]].sort((m,M)=>M.bp-m.bp);for(let m of b){let M=qn(m.nodeIds,t);if(!M)continue;let g=Math.max(M.minX*y+c,0),v=Math.min(M.maxX*y+c,l),w=Math.max(M.minY*f+i,0),_=Math.min(M.maxY*f+i,d);if(v<g||_<w)continue;let I=Math.max(v-g,_-w),E=Dt(m.bp),A=U(E);if(I>=A*2/V){for(let L of m.nodeIds)p.add(L);let N=j((g+v)/2,A,l-A),O=j((w+_)/2,k,d-k);h.push({label:{key:`alleledel:${m.nodeIds.join(",")}`,text:E,x:N,y:O,kind:"deletion"},box:z(A,N,O)})}}for(let[m,M]of Dn(t,n)){if(p.has(m))continue;let{x:g,y:v}=Ht(M),w=v*f+i;if(w+k<=0||w-k>=d)continue;let _=Z(M,y,f);if(_<Hn*2/V)continue;let I=jt(n.get(m)),E=U(I);if(_>=E*2/V){let A=g*y+c;x.push({label:{key:`node:${m}`,text:I,x:A,y:w,kind:"node"},box:z(E,A,w)})}}return{deletions:h,nodes:x}}function Un(t,n){return Math.max(kn,Math.floor(t*n/Cn))}function Vt(t,n,e=1/0){let o=[];for(let{label:r,box:s}of t){if(o.length>=e)break;n(s)&&o.push(r)}return o}function ro({reserved:t,take:n,...e}){n??=Rt(e,t);let{deletions:o,nodes:r}=jn(e);return[...Vt(o,n),...Vt(r,n,Un(e.width,e.height))]}function fo(t){let n=0;for(let e=0;e<t.length;e++)n=t.charCodeAt(e)+((n<<5)-n);return Math.abs(n%360)}function Kn(t,n){return t*360/n}var Jn=.7,Qn=.5,Zn=16;function uo(t){return t>0&&t<=Zn}function te(t,n){return`hsl(${Kn(t,n)}, ${Jn*100}%, ${Qn*100}%)`}function lo(t,n){return`hsl(0, 0%, ${n>1?25+45*t/(n-1):45}%)`}function ne(t){let n=$(t).name.split("#"),e=n.join("#");if(n.length>=3&&pt(n[0])){let o=n.slice(2).join("#");return[o,o,e]}return[n[0],n.slice(0,2).join("#"),e]}function ee(t,n){let{start:e}=$(t);return n.map(o=>`${o} @${zt(e)}`)}function ho(t,n){let e=new Map;t.forEach((d,u)=>{e.has(d.name)||e.set(d.name,u)});let o=[...e].map(([d,u])=>({name:d,i:u})),r=o.map(d=>ne(d.name)),s=d=>o.map((u,y)=>r[y][d]),a=d=>o.map((u,y)=>ee(u.name,r[y])[d]),c=[s(0),s(1),a(0),s(2),a(1),a(2)],l=c.find(d=>new Set(d).size===o.length)??c.at(-1);return o.map(({name:d,i:u},y)=>({name:d,label:l[y],color:n?.[u]??te(u,t.length)}))}function yo(t){let n=new Map;return new Map([...t].sort((e,o)=>e.label.localeCompare(o.label)).map(e=>{let o=(n.get(e.label)??0)+1;return n.set(e.label,o),[e.name,o>1?`${e.label} (${o})`:e.label]}))}var mo=[{value:"depth",label:"By depth",description:"Thicker the more paths carry a node, on the square root of its depth against the mean. A graph with one depth everywhere draws uniform."},{value:"frequency",label:"By frequency",description:"As wide as the share of haplotypes that pass a node, or its AF tag: full width at 100%, half at 50%, and wider where a haplotype passes it more than once."},{value:"uniform",label:"Uniform",description:"Every node the same thickness."}],oe=.3,st=3,re=.05;function se(t){let n=0,e=0;for(let o of t.nodes)n+=o.depth*o.length,e+=o.length;return e>0?n/e:0}function ce(t){return t.sample===void 0?mt(t.name)??t.name:`${t.sample}#${t.haplotype??0}`}function ae(t){return new Set((t.paths??[]).map(ce)).size}function ie(t,n){return t.frequency??(n>0?t.depth/n:void 0)}function fe(t,n){return n==="depth"?se(t):n==="frequency"?ae(t):0}function Ut(t){return Math.min(st,Math.max(re,t))}function ue(t,n){let e=ie(t,n);return e===void 0?1:Ut(e)}function Mo(t){return[1,.5,.1].map(n=>({label:`${n*100}%`,widthPx:t*Ut(n)}))}function le(t,n){return!(n>0)||!(t.depth>0)?1:Math.min(st,Math.max(oe,Math.sqrt(t.depth/n)))}function de(t,n,e,o){return n*(e==="depth"?le(t,o):e==="frequency"?ue(t,o):1)}function he(t,n){return t*(n==="uniform"?1:st)}var ye=4;function xe(t,n){return Math.max(t/n,ye)}function bo(t,n,e,o,r=0){let s=t?fe(t,o):0,a=c=>r>0?xe(c,r)*r/2:c/2;return{maxHalfWidthPx:a(he(e,o)),halfWidthPx:c=>{let i=n?.get(c);return a(i?de(i,e,o,s):e)}}}var go=[{value:"uniform",label:"Uniform",description:"Every link the same thickness."},{value:"walks",label:"By walks",description:"Thicker the more walks take a link, on the square root of its count against the busiest link in the cut. A graph without walks draws uniform."}],Kt=.5,pe=4;function wo(t){let n=0;for(let e of t.edges)n=Math.max(n,e.pathIds?.length??0);return n}function Ao(t,n,e){return e==="uniform"||n===0?1:Kt+(pe-Kt)*Math.sqrt(t/n)}export{gt as a,be as b,Nt as c,ve as d,ge as e,we as f,F as g,q as h,Xt as i,Ae as j,Z as k,nt as l,Bt as m,Mn as n,D as o,et as p,Rt as q,Ie as r,Ne as s,Xe as t,Ce as u,$e as v,He as w,ze as x,Gt as y,je as z,Ue as A,Ke as B,oo as C,zt as D,jt as E,ro as F,fo as G,Kn as H,Jn as I,Qn as J,Zn as K,uo as L,te as M,lo as N,ho as O,yo as P,mo as Q,se as R,fe as S,Mo as T,de as U,xe as V,bo as W,go as X,wo as Y,Ao as Z};
-//# sourceMappingURL=chunk-DKQFTMWL.js.map
+import{a as dt,c as ht,d as yt,g as C,j as K,l as xt,q as Mt,r as $,w as bt,x as vt}from"./chunk-AZUO4NZ5.js";import{b as pt,c as mt}from"./chunk-JKW2OX73.js";var gt=20;function be(t){let n=e=>Math.round(e*100)/100;return t.map((e,o)=>`${o?"L":"M"}${n(e.x)},${n(e.y)}`).join("")}function wt(t,n,e,o,r){let s=Math.hypot(o-n,e-t);if(s===0)return[e,o];let a=(e-t)/s,c=(o-n)/s;return[e+r*a,o+r*c]}function Y(t,n){let e=1-n,o=e*e*e,r=3*e*e*n,s=3*e*n*n,a=n*n*n;return{x:o*t.x0+r*t.cx0+s*t.cx1+a*t.x1,y:o*t.y0+r*t.cy0+s*t.cy1+a*t.y1}}function Pt(t){let n=t[Math.floor(t.length/2)];return n?Y(n,.5):void 0}function Nt(t){let n=1/0,e=1/0,o=-1/0,r=-1/0;for(let s of t)n=Math.min(n,s.x0,s.cx0,s.cx1,s.x1),o=Math.max(o,s.x0,s.cx0,s.cx1,s.x1),e=Math.min(e,s.y0,s.cy0,s.cy1,s.y1),r=Math.max(r,s.y0,s.cy0,s.cy1,s.y1);return{minX:n,minY:e,maxX:o,maxY:r}}function tn(t,n,e){let o=Y(t,n),r=Y(t,e),s=(e-n)/3,a=At(t,n),c=At(t,e);return{x0:o.x,y0:o.y,cx0:o.x+a.x*s,cy0:o.y+a.y*s,cx1:r.x-c.x*s,cy1:r.y-c.y*s,x1:r.x,y1:r.y}}function At(t,n){let e=1-n,o=3*e*e,r=6*e*n,s=3*n*n;return{x:o*(t.cx0-t.x0)+r*(t.cx1-t.cx0)+s*(t.x1-t.cx1),y:o*(t.cy0-t.y0)+r*(t.cy1-t.cy0)+s*(t.y1-t.cy1)}}var H=32;function nn(t,n,e,o){let r=[],s=0;return t.forEach((a,c)=>{let i=n[c],l=i/H,d=Y(a,0);for(let u=1;u<=H;u++){let y=Y(a,u/H);if(Math.max(d.x,y.x)+l>=e.minX&&Math.min(d.x,y.x)-l<=e.maxX&&Math.max(d.y,y.y)+l/o>=e.minY&&Math.min(d.y,y.y)-l/o<=e.maxY){let f=s+i*(u-1)/H,h=s+i*u/H,x=r.at(-1);x&&x[1]>=f?x[1]=h:r.push([f,h])}d=y}s+=i}),r}function ve(t,n,e=1,o){let r=t.map(u=>Math.hypot(u.cx0-u.x0,(u.cy0-u.y0)*e)+Math.hypot(u.cx1-u.cx0,(u.cy1-u.cy0)*e)+Math.hypot(u.x1-u.cx1,(u.y1-u.cy1)*e)),s=r.reduce((u,y)=>u+y,0),a=Math.round(s/n),c=Math.max(3,a%2?a:a+1),i=o?nn(t,r,o,e):void 0,l=0,d=[];for(let u=0;u<c;u+=2){let y=u/c*s,f=(u+1)/c*s;if(i){for(;l<i.length&&i[l][1]<y;)l++;if(l===i.length)break;if(i[l][0]>f)continue}let h=[],x=[],p=0;t.forEach((b,m)=>{let M=r[m],g=p+M;if(M>0&&g>y&&p<f){let v=Math.max(0,(y-p)/M),w=Math.min(1,(f-p)/M);h.push(tn(b,v,w)),x.push((m+v)/t.length,(m+w)/t.length)}p=g}),h.length&&d.push({curves:h,startAlong:x[0],endAlong:x.at(-1)})}return d}function ge(t,n,e,o,r){let s=t.length,a=new Array(s);for(let c=0;c<s;c++){let i=t[c],l=c/s,d=(c+1)/s,u=n+(o-n)*l,y=e+(r-e)*l,f=n+(o-n)*d,h=e+(r-e)*d;a[c]={x0:i.x0+u,y0:i.y0+y,cx0:i.cx0+u,cy0:i.cy0+y,cx1:i.cx1+f,cy1:i.cy1+h,x1:i.x1+f,y1:i.y1+h}}return a}function we(t,n,e){let o=new Array(t.length);for(let r=0;r<t.length;r++){let s=t[r];o[r]={x0:s.x0+n,y0:s.y0+e,cx0:s.cx0+n,cy0:s.cy0+e,cx1:s.cx1+n,cy1:s.cy1+e,x1:s.x1+n,y1:s.y1+e}}return o}function W(t,n){let e=t.length-1;return n==="end"?{at:t[e],inward:t[e-1]}:{at:t[0],inward:t[1]}}var en=.5,on=80;function F(t){return t.endsWith("-")?"-":"+"}function q(t){let n=(e,o)=>(o??F(e))===F(e);return{from:n(t.from,t.fromStrand)?"end":"start",to:n(t.to,t.toStrand)?"start":"end"}}function _t(t){let n=1/0,e=-1/0;for(let o of t)n=Math.min(n,o.x),e=Math.max(e,o.x);return{min:n,max:e}}function Et(t,n){return Math.max(0,n.min-t,t-n.max)}function It(t,n,e){let o=Et(t[0].x,n),r=Et(t[t.length-1].x,n);return o===r?e:o<r?"start":"end"}function rn(t,n){return{from:It(t,_t(n),"end"),to:It(n,_t(t),"start")}}var Lt=new WeakMap;function sn(t,n){let e=Lt.get(t);e||(e=new WeakMap,Lt.set(t,e));let o=e.get(n);return o||(o=rn(t,n),e.set(n,o)),o}var cn=.75,an=1.15,fn=.35,un=3*gt;function ln(t,n,e,o,r,s){let a=Math.hypot(e-t,o-n),c=a===0?1:(e-t)/a,i=a===0?0:(o-n)/a,l=0,d=1/0,u=-1/0;for(let x of r){let p=x.x-t,b=x.y-n,m=p*-i+b*c;Math.abs(m)>Math.abs(l)&&(l=m);let M=p*c+b*i;d=Math.min(d,M),u=Math.max(u,M)}let y=r.length?u-d:0,f=Math.max(Math.abs(l)*an/cn,y*fn),h=s===void 0?f:Math.min(f,s);return l<0?-h:h}function Xt({scaleX:t,scaleY:n}){return n/t}var dn=3;function J(t,n,e){let o=n.x-t.x,r=(n.y-t.y)*e,s=Math.hypot(o,r);return s===0?void 0:{x:o/s,y:r/s}}function Ae(t,n,e,o){let r=Xt(o),s=dn/Math.max(o.scaleX,1e-6),a=J(t[t.length-1],n[0],r)??J(t[0],t.at(-1),r)??J(n[0],n.at(-1),r)??{x:1,y:0},c=[];for(let i=0;i<e;i++){let l=(i-(e-1)/2)*s;c.push({x:-a.y*l,y:a.x*l/r})}return c}function Q(t,n){return t.map(e=>({x:e.x,y:e.y*n}))}function hn(t,n){for(let e of t)e.y0/=n,e.cy0/=n,e.cy1/=n,e.y1/=n;return t}function Z(t,n,e){let o=0;for(let r=1;r<t.length;r++){let s=t[r-1],a=t[r];o+=Math.hypot((a.x-s.x)*n,(a.y-s.y)*e)}return o}var yn=12,xn=40;function Ot(t,n){let e=Z(t,n,n);return Math.min(xn,Math.max(yn,e/2))/Math.max(n,Number.EPSILON)}function pn(t){return t.from!==t.to?!1:t.fromStrand&&t.toStrand&&t.fromStrand!==t.toStrand?t.fromStrand==="+"?"end":"start":!0}function Ct(t,n=!1){let e=pn(t);if(!n)return e;let o=q(t);return e===!1?o:o.from===o.to?o.from:!0}function mn(t,n){let{at:e,inward:o}=t,r=o?e.x-o.x:1,s=o?e.y-o.y:0,a=Math.hypot(r,s)||1,c=r/a,i=s/a,l=e.x,d=e.y,u=l+c*n/3,y=d+i*n/3,f=l+c*n,h=d+i*n,x=-i*n/2,p=c*n/2;return[{x0:l,y0:d,cx0:u,cy0:y,cx1:f+x,cy1:h+p,x1:f,y1:h},{x0:f,y0:h,cx0:f-x,cy0:h-p,cx1:u,cy1:y,x1:l,y1:d}]}function tt(t,n,e,o,r=[],s){let a=o.scaleX,c=Xt(o),i=s??(o.pixelRows?un:void 0);if(e===!1&&(e=sn(t,n)),c!==1)return hn(tt(Q(t,c),Q(n,c),e,{scaleX:a,scaleY:a},Q(r,c),i===void 0?void 0:i*c),c);if(typeof e=="string")return mn(W(t,e),Ot(t,a));let l=e===!0,d=e===!0?{from:"end",to:"start"}:e,u=W(t,d.from),y=W(n,d.to),f=u.at,h=y.at,x=f.x,p=f.y,b=h.x,m=h.y;if(l){let M=1,g=0;if(u.inward){let S=f.x-u.inward.x,P=f.y-u.inward.y,X=Math.hypot(S,P);X>0&&(M=S/X,g=P/X)}let v=Ot(t,a),w=-g,_=M,I=(f.x+h.x)/2+w*v,E=(f.y+h.y)/2+_*v,A=x+M*v,N=p+g*v,O=b-M*v,L=m-g*v;return[{x0:x,y0:p,cx0:A,cy0:N,cx1:A+w*v,cy1:N+_*v,x1:I,y1:E},{x0:I,y0:E,cx0:O+w*v,cy0:L+_*v,cx1:O,cy1:L,x1:b,y1:m}]}else{let M=u.inward??{x:f.x-(h.x-f.x),y:f.y-(h.y-f.y)},g=y.inward??{x:h.x-(f.x-h.x),y:h.y-(f.y-h.y)},v=Math.hypot(b-x,m-p),w=(at,it,Jt,Qt)=>{let ft=it.x-at.x,ut=it.y-at.y,lt=Math.hypot(ft,ut),Zt=lt===0?0:(Jt*ft+Qt*ut)/lt;return Math.max(0,Math.min(v*en,on,Zt*.5))},_=h.x-f.x,I=h.y-f.y,[E,A]=wt(M.x,M.y,f.x,f.y,w(M,f,_,I)),[N,O]=wt(g.x,g.y,h.x,h.y,w(g,h,-_,-I)),L=r.length?ln(x,p,b,m,r,i):0,S=v===0?1:v,P=(b-x)/S,X=(m-p)/S,T=-X*L,B=P*L,R=P*Math.abs(L),ct=X*Math.abs(L);return[{x0:x,y0:p,cx0:E+T-R,cy0:A+B-ct,cx1:N+T+R,cy1:O+B+ct,x1:b,y1:m}]}}function St(t,n){let e=t[0],o=t.at(-1);return Math.hypot(e.x-n.x,e.y-n.y)<Math.hypot(o.x-n.x,o.y-n.y)?"start":"end"}function kt(t,n,e,o){let r=W(t,o?.from??St(t,e[0])),s=W(n,o?.to??St(n,e.at(-1))),a=[r.at,...e,s.at],c=l=>{let d=a[l],u=f=>Math.hypot(f.x-d.x,f.y-d.y),y=(f,h)=>{let x=f?u(f):0,p=u(h);return x===0?{x:h.x-d.x,y:h.y-d.y}:{x:(d.x-f.x)/x*p,y:(d.y-f.y)/x*p}};if(l===0)return y(r.inward,a[1]);if(l===a.length-1){let f=y(s.inward,a[l-1]);return{x:-f.x,y:-f.y}}return{x:(a[l+1].x-a[l-1].x)/2,y:(a[l+1].y-a[l-1].y)/2}},i=[];for(let l=0;l<a.length-1;l++){let d=a[l],u=a[l+1],y=c(l),f=c(l+1);i.push({x0:d.x,y0:d.y,cx0:d.x+y.x/3,cy0:d.y+y.y/3,cx1:u.x-f.x/3,cy1:u.y-f.y/3,x1:u.x,y1:u.y})}return i}function nt(){let t=new WeakMap;return(n,e,o)=>{let r=t.get(n);if(r?.deps.length===e.length&&r.deps.every((a,c)=>Object.is(a,e[c])))return r.value;let s=o();return t.set(n,{deps:e,value:s}),s}}var Bt=11,Mn=6.2,D=4;function et(t){return t.length*Mn+D*2}function bn(t,n){return t.x0<n.x1&&t.x1>n.x0&&t.y0<n.y1&&t.y1>n.y0}function Tt(t,n){return t.x1<=0||t.x0>=n.width||t.y1<=0||t.y0>=n.height}function vn(t,n){return t.x0>=0&&t.x1<=n.width&&t.y0>=0&&t.y1<=n.height}function Rt(t,n=[]){let e=[...n];return o=>Tt(o,t)||e.some(r=>bn(r,o))?!1:(e.push(o),!0)}function Ie(t,n,e){let o=[],r=Bt+D*2,s=(c,i,l,d)=>{let u=et(i),y=!1;for(let f=0;f<=(c.stack??0);f++){let h=l+d*f*r,x={x0:c.x-u/2,x1:c.x+u/2,y0:h-Bt-D,y1:h+D};if(Tt(x,n))break;if(vn(x,n)&&(c.fits?.(x)??!0)){if(e(x))return{placed:{...c,text:i,y:h,w:u},crowded:y};y=!0}}return{placed:void 0,crowded:y}},a=(c,i)=>{let l=s(c,i,c.y,c.y>n.height/2?-1:1);return l.placed??(c.flipY===void 0||l.crowded?void 0:s(c,i,c.flipY,c.flipY<c.y?-1:1).placed)};for(let c of t){let i=a(c,c.text)??(c.fallback===void 0?void 0:a(c,c.fallback));i&&o.push(i)}return o}function $t(t){return t==="+"?"-":"+"}function Ne(t,n=new Set){let e=t.edges.map(q),o=new Map,r=(f,h,x)=>{dt(o,`${f}|${h}`,x)};t.edges.forEach((f,h)=>{r(f.from,e[h].from,h),r(f.to,e[h].to,h)});let s=f=>{let h=o.get(`${f}|end`);if(h?.length!==1)return;let x=h[0],p=t.edges[x];return p.from===f&&p.to!==f&&!n.has(f)&&!n.has(p.to)&&e[x].from==="end"&&e[x].to==="start"&&o.get(`${p.to}|start`)?.length===1?x:void 0},a=new Set,c=new Map,i=new Map;for(let f of t.nodes){let h=o.get(`${f.id}|start`),x=h?.length===1?t.edges[h[0]].from:void 0;if(c.has(f.id)||x!==void 0&&s(x)===h[0])continue;let p=[f.id];for(;;){let b=s(p.at(-1)),m=b===void 0?void 0:t.edges[b].to;if(m===void 0||c.has(m))break;a.add(b),p.push(m)}for(let b of p)c.set(b,f.id);p.length>1&&i.set(f.id,p)}for(let f of t.nodes)c.has(f.id)||c.set(f.id,f.id);let l=new Map(t.nodes.map(f=>[f.id,f])),d=[];for(let f of t.nodes){if(c.get(f.id)!==f.id)continue;let h=i.get(f.id);if(!h){d.push(f);continue}let x=h.map(m=>l.get(m)),p=x.filter(C),b=p.length?p.reduce((m,M)=>m.stable.start<=M.stable.start?m:M):x[0];d.push({id:f.id,name:f.name,length:x.reduce((m,M)=>m+M.length,0),depth:f.depth,stable:b.stable})}let u=new Set,y=[];return t.edges.forEach((f,h)=>{let x=c.get(f.from),p=c.get(f.to),b=e[h],m=`${x}|${b.from}>${p}|${b.to}`;a.has(h)||u.has(m)||(u.add(m),y.push({from:x,to:p,...b.from==="start"?{fromStrand:$t(F(x))}:{},...b.to==="end"?{toStrand:$t(F(p))}:{}}))}),{graph:{...t,nodes:d,edges:y,paths:void 0,pathVisits:void 0},runs:i}}function Xe(t,n,e){let o={...t};for(let[r,s]of n){let a=t[r];if(!a?.length)continue;delete o[r];let c=rt(a),i=c.at(-1),l=s.map(y=>Math.max(e(y),0)),d=l.reduce((y,f)=>y+f,0),u=0;s.forEach((y,f)=>{let h=d?l[f]/d*i:i/s.length,x=f===s.length-1?i:u+h;o[y]=Yt(a,c,u,x),u=x})}return o}function Ce(t,n,e){if(t.length===0)return[];let o=rt(t),r=o.at(-1);return Yt(t,o,n*r,e*r)}function Ht(t){let n=rt(t);return ot(t,n,n.at(-1)/2)}function rt(t){let n=[0];for(let e=1;e<t.length;e++)n.push(n[e-1]+Math.hypot(t[e].x-t[e-1].x,t[e].y-t[e-1].y));return n}function Wt(t,n){let e=0,o=t.length;for(;e<o;){let r=e+o>>1;t[r]<n?e=r+1:o=r}return e}function ot(t,n,e){if(e<=0)return{...t[0]};let o=Wt(n,e);if(o>=n.length)return{...t.at(-1)};let r=n[o]-n[o-1],s=r>0?(e-n[o-1])/r:0,a=t[o-1],c=t[o];return{x:a.x+(c.x-a.x)*s,y:a.y+(c.y-a.y)*s}}function Yt(t,n,e,o){let r=[ot(t,n,e)];for(let s=Wt(n,e);s<t.length&&n[s]<o;s++)n[s]>e&&r.push({...t[s]});return r.push(ot(t,n,o)),r}function $e(t,n){let e=new Set(t.nodes.filter(i=>C(i)&&K(i,n)).map(i=>i.id)),o=t.paths??[];if(e.size===0||o.length===0)return t;let r=o.map(i=>{let l=-1,d=-1;return i.nodeIds.forEach((u,y)=>{e.has(u)&&(l<0&&(l=y),d=y)}),l<0?void 0:{first:l,last:d}});if(r.every((i,l)=>i?.first===0&&i.last===o[l].nodeIds.length-1))return t;let s=new Set,a=[],c=new Map;return o.forEach((i,l)=>{let d=r[l];if(d){let u=i.nodeIds.slice(d.first,d.last+1);for(let y of u)s.add(y);a.push({...i,nodeIds:u}),c.set(i.name,{first:d.first,nodeIds:u})}}),{...t,nodes:t.nodes.filter(i=>s.has(i.id)),edges:t.edges.filter(i=>s.has(i.from)&&s.has(i.to)),paths:a,pathVisits:t.pathVisits&&gn(t.pathVisits,o,r,new Map(t.nodes.map(i=>[i.id,i.name]))),anchorPaths:bt(t,c)}}function gn(t,n,e,o){let r=t.replay(),s=new Mt;return n.forEach((a,c)=>{let i=t.pathIndex($(a.name).name),l=e[c];a.nodeIds.forEach((d,u)=>{let y=o.get(d)??d,f=r(t.slot(y),i);f>=0&&l&&u>=l.first&&u<=l.last&&s.add(y,t.paths[i],t.samples[i],t.start[f],t.reversed[f]===1)})}),s.build()}function He(t,n,e){let o=t.nodes.map(r=>{if(!C(r))return r;let s=r.stable.start,a=s+r.length,[c,i]=K(r,n)?[Math.max(s,n.start),Math.min(a,n.end)]:a<=n.start?[Math.max(s,a-e),a]:[s,Math.min(a,s+e)];return c===s&&i===a?r:{...r,length:i-c,stable:{...r.stable,start:c},unclipped:{start:s,length:r.length}}});return o.some((r,s)=>r!==t.nodes[s])?{...t,nodes:o}:t}function Ft(t){return t.nodes.some(n=>n.unclipped)?{...t,nodes:t.nodes.map(({unclipped:n,...e})=>n&&e.stable?{...e,length:n.length,stable:{...e.stable,start:n.start}}:e)}:t}var wn=1,ze=t=>`skips ${t??"the reference"} sequence (a deletion)`;function An(t,n){return n.flatMap(e=>t[e]??[])}function Gt(t,n,e,o,r,s){let a=t[n.from],c=t[n.to];if(!(!a?.length||!c?.length))return r?kt(a,c,r,s?q(n):void 0):tt(a,c,Ct(n,s),e,o?An(t,o):[])}function _n(t){let n=ht(t.nodes.filter(C),e=>e.stable.refName);for(let e of n.values())e.sort((o,r)=>o.stable.start-r.stable.start);return n}function En(t,n,e){let o=[];if(t)for(let r=xt(t,n);r<t.length;r++){let s=t[r];if(s.stable.start>=e)break;s.stable.start+s.length<=e&&o.push(s.id)}return o}function In(t,n,e,o){let{fromStrand:r,toStrand:s}=t;if(r===void 0||s===void 0)return!0;let a=r===(n.stable.strand??"+"),c=s===(e.stable.strand??"+");return o?a&&c:!a&&!c}function Ln(t,n,e,o){let r;for(let s of o(n))for(let a of o(e)){let c=s<=a,i=c?{start:s+n.length,end:a}:{start:a+e.length,end:s};In(t,n,e,c)&&(!r||Math.abs(i.end-i.start)<Math.abs(r.end-r.start))&&(r=i)}return r}var On=.01;function Sn(t,n){let e=new Map;for(let[o,r]of t){let s=r.flatMap(a=>{let c=n(a);return c.slice(1).map((i,l)=>({at:c[l],copy:i-c[l]}))});s.length&&e.set(o,s.sort((a,c)=>a.at-c.at))}return e}function Pn(t,n,e){if(!t)return!1;let o=yt(t.length,s=>t[s].at<n),r=[t[o-1],t[o]].filter(s=>s!==void 0).sort((s,a)=>Math.abs(s.at-n)-Math.abs(a.at-n))[0];return r!==void 0&&Math.abs(r.at-n)<=r.copy&&Math.abs(e-r.copy)<=r.copy*On}function je(t){let n=Ft(t),e=new Map(n.nodes.map(c=>[c.id,c])),o=_n(n),r=vt(n),s=Sn(o,r),a=[];for(let c=0;c<n.edges.length;c++){let i=n.edges[c],l=e.get(i.from),d=e.get(i.to);if(!i.foldBridge&&l!==void 0&&d!==void 0&&C(l)&&C(d)&&l.stable.refName===d.stable.refName){let u=Ln(i,l,d,r),y=l.stable.refName,f=u?u.end-u.start:0;if(u&&f>=wn&&!Pn(s.get(y),u.start,f)){let{start:h,end:x}=u;a.push({edgeIndex:c,from:i.from,to:i.to,...i.fromStrand?{fromStrand:i.fromStrand}:{},...i.toStrand?{toStrand:i.toStrand}:{},refName:y,start:h,end:x,bp:f,bypassed:En(o.get(y),h,x)})}}}return a}function Nn(t,n){let e=new Map,o=a=>{let c=a;for(;e.has(c);)c=e.get(c);return c!==a&&e.set(a,c),c},r=(a,c)=>{let[i,l]=[o(a),o(c)];return i!==l&&e.set(i,l),i!==l},s=new Set(n.map(a=>a.edgeIndex));return t.edges.forEach((a,c)=>{s.has(c)||r(a.from,a.to)}),new Set(n.filter(a=>!r(a.from,a.to)).map(a=>a.edgeIndex))}function Ue(t,n){return n?.walks.length?t.filter(e=>!n.edgeIndexes.has(e.edgeIndex)):t}var qt=new WeakMap;function Ke(t,n,e=!0){let o=qt.get(n);o||(o=new Map,qt.set(n,o));let r=o.get(e);if(!r){let s=e?new Set:Nn(t,n);r={shown:n.filter(a=>!s.has(a.edgeIndex)),bypassed:new Map(n.map(a=>[a.edgeIndex,a.bypassed])),hidden:s},o.set(e,r)}return r}var Xn=26,Cn=4e4,kn=8,Bn=8,Tn=5.7,Rn=6,$n=13,G=3,V=2;function U(t){return(t.length*Tn+Rn+G)/2}var k=($n+G)/2,Hn=U("1 bp");function z(t,n,e){return{x0:n-t,x1:n+t,y0:e-k,y1:e+k}}function oo(t,n){return{x0:6,x1:6+et(t)+G,y0:n-8-G/2,y1:n+8+G/2}}function j(t,n,e){return e<n?t:Math.min(Math.max(t,n),e)}function zt(t){return String(t).replace(/\B(?=(\d{3})+$)/g,",")}function jt(t){let[n,e]=t>=999500?[t/1e6,"Mb"]:t>=1e3?[t/1e3,"kb"]:[];return n===void 0?`${t} bp`:`${+n.toFixed(n>=100?0:1)} ${e}`}function Dt(t){return`${jt(t)} del`}function Wn(t,n,e,o){let r=t[0],s=t[t.length-1],a=(n.x-(r.x0+s.x1)/2)*e,c=(n.y-(r.y0+s.y1)/2)*o,i=Math.hypot(a,c);return i===0?{x:0,y:-1}:{x:a/i,y:c/i}}function Yn(t,n){return Math.abs(n.x)*(t.x1-t.x0)/2+Math.abs(n.y)*(t.y1-t.y0)/2}function Fn(t,n){let e=(t.x1-t.x0)/2,o=(t.y1-t.y0)/2;return Math.min(n.x===0?1/0:e/Math.abs(n.x),n.y===0?1/0:o/Math.abs(n.y))}function qn(t,n){let e=1/0,o=1/0,r=-1/0,s=-1/0;for(let a of t)for(let c of n[a]??[])e=Math.min(e,c.x),r=Math.max(r,c.x),o=Math.min(o,c.y),s=Math.max(s,c.y);return e===1/0?void 0:{minX:e,minY:o,maxX:r,maxY:s}}var Gn=nt();function Dn(t,n){return Gn(t,[n],()=>Object.entries(t).filter(([e,o])=>o.length>0&&n.has(e)).sort(([e],[o])=>n.get(o)-n.get(e)))}var Vn=nt();function zn(t,n,e,o,r,s){let{scaleX:a,scaleY:c}=e;return Vn(t,[n,r,s,a,c,o],()=>{let i=[];for(let l of[...n].sort((d,u)=>u.bp-d.bp)){let d=Gt(t,l,e,l.bypassed,r?.[l.edgeIndex],s),u=d?Pt(d):void 0;if(d&&u){let{minX:y,minY:f,maxX:h,maxY:x}=Nt(d);i.push({deletion:l,curves:d,apex:u,extent:Math.max((h-y)*a,(x-f)*c)})}}return i})}function jn({nodePositions:t,nodeLengths:n,deletions:e,deletionRoutes:o,stranded:r=!1,alleleDeletions:s,axis:a,translateX:c,translateY:i,width:l,height:d,version:u=0}){let{scaleX:y,scaleY:f}=a,h=[],x=[];for(let{deletion:m,curves:M,apex:g,extent:v}of zn(t,e,a,u,o,r))if(v>=Xn){let w=Dt(m.bp),_=U(w),I=z(_,0,0),E=g.x*y+c,A=g.y*f+i;if(E<0||E>l||A<0||A>d)continue;let N=v>=_*2/V,O=Wn(M,g,y,f),L=Yn(I,O)+Bn,S=N?E:j(E+O.x*L,_,l-_),P=N?A:j(A+O.y*L,k,d-k),X=Math.hypot(S-E,P-A),T;if(X>0){let B={x:(S-E)/X,y:(P-A)/X},R=Fn(I,B);T={arcX:E,arcY:A,labelX:S-B.x*R,labelY:P-B.y*R}}h.push({label:{key:`del:${m.edgeIndex}`,text:w,x:S,y:P,kind:"deletion",leader:T},box:z(_,S,P)})}let p=new Set,b=[...s??[]].sort((m,M)=>M.bp-m.bp);for(let m of b){let M=qn(m.nodeIds,t);if(!M)continue;let g=Math.max(M.minX*y+c,0),v=Math.min(M.maxX*y+c,l),w=Math.max(M.minY*f+i,0),_=Math.min(M.maxY*f+i,d);if(v<g||_<w)continue;let I=Math.max(v-g,_-w),E=Dt(m.bp),A=U(E);if(I>=A*2/V){for(let L of m.nodeIds)p.add(L);let N=j((g+v)/2,A,l-A),O=j((w+_)/2,k,d-k);h.push({label:{key:`alleledel:${m.nodeIds.join(",")}`,text:E,x:N,y:O,kind:"deletion"},box:z(A,N,O)})}}for(let[m,M]of Dn(t,n)){if(p.has(m))continue;let{x:g,y:v}=Ht(M),w=v*f+i;if(w+k<=0||w-k>=d)continue;let _=Z(M,y,f);if(_<Hn*2/V)continue;let I=jt(n.get(m)),E=U(I);if(_>=E*2/V){let A=g*y+c;x.push({label:{key:`node:${m}`,text:I,x:A,y:w,kind:"node"},box:z(E,A,w)})}}return{deletions:h,nodes:x}}function Un(t,n){return Math.max(kn,Math.floor(t*n/Cn))}function Vt(t,n,e=1/0){let o=[];for(let{label:r,box:s}of t){if(o.length>=e)break;n(s)&&o.push(r)}return o}function ro({reserved:t,take:n,...e}){n??=Rt(e,t);let{deletions:o,nodes:r}=jn(e);return[...Vt(o,n),...Vt(r,n,Un(e.width,e.height))]}function fo(t){let n=0;for(let e=0;e<t.length;e++)n=t.charCodeAt(e)+((n<<5)-n);return Math.abs(n%360)}function Kn(t,n){return t*360/n}var Jn=.7,Qn=.5,Zn=16;function uo(t){return t>0&&t<=Zn}function te(t,n){return`hsl(${Kn(t,n)}, ${Jn*100}%, ${Qn*100}%)`}function lo(t,n){return`hsl(0, 0%, ${n>1?25+45*t/(n-1):45}%)`}function ne(t){let n=$(t).name.split("#"),e=n.join("#");if(n.length>=3&&pt(n[0])){let o=n.slice(2).join("#");return[o,o,e]}return[n[0],n.slice(0,2).join("#"),e]}function ee(t,n){let{start:e}=$(t);return n.map(o=>`${o} @${zt(e)}`)}function ho(t,n){let e=new Map;t.forEach((d,u)=>{e.has(d.name)||e.set(d.name,u)});let o=[...e].map(([d,u])=>({name:d,i:u})),r=o.map(d=>ne(d.name)),s=d=>o.map((u,y)=>r[y][d]),a=d=>o.map((u,y)=>ee(u.name,r[y])[d]),c=[s(0),s(1),a(0),s(2),a(1),a(2)],l=c.find(d=>new Set(d).size===o.length)??c.at(-1);return o.map(({name:d,i:u},y)=>({name:d,label:l[y],color:n?.[u]??te(u,t.length)}))}function yo(t){let n=new Map;return new Map([...t].sort((e,o)=>e.label.localeCompare(o.label)).map(e=>{let o=(n.get(e.label)??0)+1;return n.set(e.label,o),[e.name,o>1?`${e.label} (${o})`:e.label]}))}var mo=[{value:"depth",label:"By depth",description:"Thicker the more paths carry a node, on the square root of its depth against the mean. A graph with one depth everywhere draws uniform."},{value:"frequency",label:"By frequency",description:"As wide as the share of haplotypes that pass a node, or its AF tag: full width at 100%, half at 50%, and wider where a haplotype passes it more than once."},{value:"uniform",label:"Uniform",description:"Every node the same thickness."}],oe=.3,st=3,re=.05;function se(t){let n=0,e=0;for(let o of t.nodes)n+=o.depth*o.length,e+=o.length;return e>0?n/e:0}function ce(t){return t.sample===void 0?mt(t.name)??t.name:`${t.sample}#${t.haplotype??0}`}function ae(t){return new Set((t.paths??[]).map(ce)).size}function ie(t,n){return t.frequency??(n>0?t.depth/n:void 0)}function fe(t,n){return n==="depth"?se(t):n==="frequency"?ae(t):0}function Ut(t){return Math.min(st,Math.max(re,t))}function ue(t,n){let e=ie(t,n);return e===void 0?1:Ut(e)}function Mo(t){return[1,.5,.1].map(n=>({label:`${n*100}%`,widthPx:t*Ut(n)}))}function le(t,n){return!(n>0)||!(t.depth>0)?1:Math.min(st,Math.max(oe,Math.sqrt(t.depth/n)))}function de(t,n,e,o){return n*(e==="depth"?le(t,o):e==="frequency"?ue(t,o):1)}function he(t,n){return t*(n==="uniform"?1:st)}var ye=4;function xe(t,n){return Math.max(t/n,ye)}function bo(t,n,e,o,r=0){let s=t?fe(t,o):0,a=c=>r>0?xe(c,r)*r/2:c/2;return{maxHalfWidthPx:a(he(e,o)),halfWidthPx:c=>{let i=n?.get(c);return a(i?de(i,e,o,s):e)}}}var go=[{value:"uniform",label:"Uniform",description:"Every link the same thickness."},{value:"walks",label:"By walks",description:"Thicker the more walks take a link, on the square root of its count against the busiest link in the cut. A graph without walks draws uniform."}],Kt=.5,pe=4;function wo(t){let n=0;for(let e of t.edges)n=Math.max(n,e.pathIds?.length??0);return n}function Ao(t,n,e){return e==="uniform"||n===0?1:Kt+(pe-Kt)*Math.sqrt(t/n)}export{gt as a,be as b,Nt as c,ve as d,ge as e,we as f,F as g,q as h,Xt as i,Ae as j,Z as k,nt as l,Bt as m,Mn as n,D as o,et as p,Rt as q,Ie as r,Ne as s,Xe as t,Ce as u,$e as v,He as w,ze as x,Gt as y,je as z,Ue as A,Ke as B,oo as C,zt as D,jt as E,ro as F,fo as G,Kn as H,Jn as I,Qn as J,Zn as K,uo as L,te as M,lo as N,ho as O,yo as P,mo as Q,se as R,fe as S,Mo as T,de as U,xe as V,bo as W,go as X,wo as Y,Ao as Z};
+//# sourceMappingURL=chunk-FUKZO5AZ.js.map

package/dist/chunks/{chunk-DKQFTMWL.js.map → chunk-FUKZO5AZ.js.map}

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

package/dist/chunks/{chunk-KVZIGTH3.js → chunk-HPEC3JDC.js}

@@ -1,2 +1,2 @@
-import{a as B}from"./chunk-SYKOZDP6.js";import{h as b,i as o,k as f,z as m}from"./chunk-DAF7EWRF.js";import{h as u}from"./chunk-L372SDUG.js";var O={steps:"walkStepBudget",bytes:"walkByteBudget"},y=64,k=class{constructor(e,t){this.file=e;this.adapter=t;this.reader=new f(e)}async haplotypeNames(e={}){let{haplotypes:t}=await this.reader.header(e);return t.length>0?t:void 0}budgets(){return{stepBudget:this.adapter.getConf("walkStepBudget"),byteBudget:this.adapter.getConf("walkByteBudget"),budgetNames:O}}async subgraph(e,t,{signal:i,haplotypes:d,walkRows:s,expand:r,expandSamples:n}){let g=this.budgets(),p=o(d?.map(a=>u(this.adapter,a)),e),l=s&&p&&(d?.length??0)<=y?p:void 0,c=s&&n?.length&&n.length<=y?o(n.map(a=>u(this.adapter,a)),e):void 0,h=r?.length?a=>r.includes(a):void 0,{graph:w,kept:A,fragments:S,skips:x}=await this.reader.cut(e,t,{...g,stepBudget:s?1/0:g.stepBudget,signal:i,keep:p,...l||c||h?{expand:a=>!!l?.(a)||!!c?.(a)||!!h?.(a)}:{}});return B(w.tables(A,S,x),t,s)}async referenceNodes(e,t,i){let d=[];await m(this.file,e,await this.reader.queryStart(t.start,{...i,refName:e,end:t.end}),t.end,{signal:i.signal,lineCallback:r=>{let n=r.split("	");n[3]==="ref"&&d.push(n)}});let s=new Set;return b(d).filter(r=>r.refName!==e||r.end<=t.start||r.start>=t.end||s.has(r.id)?!1:(s.add(r.id),!0))}};export{k as a};
-//# sourceMappingURL=chunk-KVZIGTH3.js.map
+import{a as B}from"./chunk-NB7ZUDO4.js";import{h as b,i as o,k as f,z as m}from"./chunk-44DOTJB7.js";import{h as u}from"./chunk-JKW2OX73.js";var O={steps:"walkStepBudget",bytes:"walkByteBudget"},y=64,k=class{constructor(e,t){this.file=e;this.adapter=t;this.reader=new f(e)}async haplotypeNames(e={}){let{haplotypes:t}=await this.reader.header(e);return t.length>0?t:void 0}budgets(){return{stepBudget:this.adapter.getConf("walkStepBudget"),byteBudget:this.adapter.getConf("walkByteBudget"),budgetNames:O}}async subgraph(e,t,{signal:i,haplotypes:d,walkRows:s,expand:r,expandSamples:n}){let g=this.budgets(),p=o(d?.map(a=>u(this.adapter,a)),e),l=s&&p&&(d?.length??0)<=y?p:void 0,c=s&&n?.length&&n.length<=y?o(n.map(a=>u(this.adapter,a)),e):void 0,h=r?.length?a=>r.includes(a):void 0,{graph:w,kept:A,fragments:S,skips:x}=await this.reader.cut(e,t,{...g,stepBudget:s?1/0:g.stepBudget,signal:i,keep:p,...l||c||h?{expand:a=>!!l?.(a)||!!c?.(a)||!!h?.(a)}:{}});return B(w.tables(A,S,x),t,s)}async referenceNodes(e,t,i){let d=[];await m(this.file,e,await this.reader.queryStart(t.start,{...i,refName:e,end:t.end}),t.end,{signal:i.signal,lineCallback:r=>{let n=r.split("	");n[3]==="ref"&&d.push(n)}});let s=new Set;return b(d).filter(r=>r.refName!==e||r.end<=t.start||r.start>=t.end||s.has(r.id)?!1:(s.add(r.id),!0))}};export{k as a};
+//# sourceMappingURL=chunk-HPEC3JDC.js.map