jbrowse-plugin-graphgenomeviewer 8.3.7 → 8.3.8

package/dist/chunks/{chunk-HVDE2ZKA.js.map → chunk-4NUDB5AY.js.map}

@@ -1,6 +1,6 @@
 {
   "version": 3,
-  "sources": ["../../src/graphTrackConfig.ts", "../../src/GraphGenomeView/trackFeatures.ts", "../../src/GraphGenomeView/repeats/repeatFeatures.ts", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.4.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-EQDQ7P4Y.js", "../../src/GraphGenomeView/genes/geneFeatures.ts", "host:tss-react/mui"],
+  "sources": ["../../src/graphTrackConfig.ts", "../../src/GraphGenomeView/trackFeatures.ts", "../../src/GraphGenomeView/repeats/repeatFeatures.ts", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-EQDQ7P4Y.js", "../../src/GraphGenomeView/genes/geneFeatures.ts", "host:tss-react/mui"],
   "sourcesContent": ["import {\n  getConfAssemblyNamesOrNone,\n  toTrackConfigEntry,\n} from '@jbrowse/core/util/tracks'\n\nimport { snapshotNamesFile } from './locationName.ts'\n\nimport type { AnyTrackConfig } from '@jbrowse/core/configuration'\n\nfunction isStringArray(value: unknown): value is string[] {\n  return Array.isArray(value) && value.every(item => typeof item === 'string')\n}\n\n// The assemblies the track names after its reference, which is what core's\n// MultiWaySyntenyDisplay opens a lane-declaring source on.\nexport function trackLanes(track: AnyTrackConfig) {\n  const lanes = getConfAssemblyNamesOrNone(track).slice(1)\n  return lanes.length > 0 ? lanes : undefined\n}\n\n// Whether a track names a walk file, by the `walksUri` shorthand as written\n// or the location it expands to: an rGFA track may, and a\n// WalkTabixSyntenyAdapter one does\nexport function walkIndexed(adapterConfig: Record<string, unknown>) {\n  return (\n    adapterConfig.type === 'WalkTabixSyntenyAdapter' ||\n    (adapterConfig.type === 'RgfaTabixAdapter' &&\n      ((typeof adapterConfig.walksUri === 'string' &&\n        adapterConfig.walksUri !== '') ||\n        snapshotNamesFile(adapterConfig.walksLocation)))\n  )\n}\n\n// Whether a track's cut reads `haplotypes`: a GBZ cut does, and so does an\n// rGFA one with a walk file\nexport function cutsByHaplotype(adapterConfig: Record<string, unknown>) {\n  return (\n    adapterConfig.type === 'GbzBaseSyntenyAdapter' || walkIndexed(adapterConfig)\n  )\n}\n\n// The haplotypes a walk-indexed track's config names to cut for until the\n// user picks others\nexport function configHaplotypes(adapterConfig: Record<string, unknown>) {\n  const { defaultHaplotypes } = adapterConfig\n  return walkIndexed(adapterConfig) &&\n    isStringArray(defaultHaplotypes) &&\n    defaultHaplotypes.length > 0\n    ? defaultHaplotypes\n    : undefined\n}\n\n// A graph is cut on the first assembly its track names, the rule\n// GbzBaseSyntenyAdapter states for its anchor. Every other assembly the track\n// names holds its sequence as rank>0 alleles off that reference's backbone, so\n// a window on one has no reference coordinates to frame the cut by.\nexport function graphReferenceAssembly(track: AnyTrackConfig) {\n  return getConfAssemblyNamesOrNone(track)[0]\n}\n\n// A track's adapter config, from a live node or a session's frozen entry\nexport function trackAdapterSnapshot(track: AnyTrackConfig) {\n  return toTrackConfigEntry(track).adapter as Record<string, unknown>\n}\n\nexport function offReferenceProblem(\n  referenceAssembly: string | undefined,\n  assemblyName: string,\n) {\n  return referenceAssembly === undefined || referenceAssembly === assemblyName\n    ? undefined\n    : `The graph is cut on its reference, ${referenceAssembly}: open it from a view of ${referenceAssembly}`\n}\n", "import type { Feature } from '@jbrowse/core/util'\n\nexport type FeatureLike = Feature | Record<string, unknown>\n\nexport function ownField(f: FeatureLike, name: string): unknown {\n  return typeof (f as Feature).get === 'function'\n    ? (f as Feature).get(name)\n    : (f as Record<string, unknown>)[name]\n}\n\nexport interface TrackChoice {\n  trackId: string\n  name?: string\n  adapterType: string\n}\n\nexport function namedTrack<T extends TrackChoice>(tracks: T[], named: string) {\n  return tracks.find(t => t.trackId === named)\n}\n\n// what a track-name hint such as /repeat|tandem/ is matched against\nexport function trackLabel(t: TrackChoice) {\n  return `${t.trackId} ${t.name ?? ''}`\n}\n", "import { namedTrack, ownField, trackLabel } from '../trackFeatures'\n\nimport type { FeatureLike, TrackChoice } from '../trackFeatures'\n\nexport interface RepeatCall {\n  bp: number\n  // TRGT's `SD`. Zero means the allele is a copy of the one the reads did\n  // support, so its length states nothing about a second haplotype; absent\n  // where the genotyper writes no such field.\n  spanningReads?: number\n  // the PanSN haplotype a phased genotype puts this allele on\n  haplotype?: number\n}\n\n// A tandem repeat array as the walk rows need it: its span on the reference,\n// which is what the bars measure between, and its unit length, which is what\n// they tile by. Read off whatever repeat annotation the session has, since the\n// tools all state the same two facts under different names: VCF 4.5's\n// `<CNV:TR>` allele gives `RUL` and `RUS` (one entry per repeat sequence,\n// grouped by `RN`), UCSC simpleRepeat and TRF give `period` and the consensus\n// `sequence`, TRGT gives `MOTIFS` and `TRID`, ExpansionHunter `RU` and `REPID`,\n// HipSTR and GangSTR `PERIOD`, vamos its `motifs`. A VCF record's INFO is\n// searched as well as its top level, and a list's first entry is the unit the\n// bars tile by: for a compound array that is the first repeat sequence, which\n// is the expanding one at every such locus in the common catalogues.\nexport interface RepeatArray {\n  key: string\n  name: string\n  refName: string\n  start: number\n  end: number\n  unit: number\n  motif?: string\n  // Each sample's genotyped alleles, from a genotyper's per-sample `AL`\n  // (TRGT) or a genotype over VCF 4.5 <CNV:TR> alleles; absent from a\n  // catalogue.\n  calls?: Record<string, RepeatCall[]>\n}\n\nexport const REPEAT_ADAPTER_TYPES = new Set([\n  'BedAdapter',\n  'BedTabixAdapter',\n  'BigBedAdapter',\n  'VcfAdapter',\n  'VcfTabixAdapter',\n])\n\nexport const REPEAT_TRACK_HINT =\n  /repeat|tandem|\\bstr\\b|vntr|trf|trgt|vamos|expansion|microsat/i\n\nexport function pickRepeatTrack<T extends TrackChoice>(\n  tracks: T[],\n  named: string,\n) {\n  const chosen = named ? namedTrack(tracks, named) : undefined\n  if (chosen) {\n    return chosen\n  }\n  const candidates = tracks.filter(t => REPEAT_ADAPTER_TYPES.has(t.adapterType))\n  return candidates.find(t => REPEAT_TRACK_HINT.test(trackLabel(t)))\n}\n\n// A TRGT repeat catalogue is a BED whose name column packs the record:\n// `ID=HTT;MOTIFS=CAG,CCG;STRUC=(CAG)nCAACAG(CCG)n`. Read as fields when it\n// has that shape.\nconst PACKED_NAME = /^\\w+=[^;]*(;\\w+=[^;]*)*$/\n\nfunction packedName(f: FeatureLike) {\n  const name = ownField(f, 'name')\n  if (typeof name !== 'string' || !PACKED_NAME.test(name)) {\n    return undefined\n  }\n  return Object.fromEntries(\n    name.split(';').map(pair => {\n      const i = pair.indexOf('=')\n      return [pair.slice(0, i), pair.slice(i + 1)]\n    }),\n  )\n}\n\n// A field at the feature's top level, in a VCF record's INFO, or in a packed\n// name column, in that order.\nfunction field(f: FeatureLike, name: string): unknown {\n  const top = ownField(f, name)\n  if (top !== undefined) {\n    return top\n  }\n  const info = ownField(f, 'INFO') as Record<string, unknown> | undefined\n  return info?.[name] ?? packedName(f)?.[name]\n}\n\nconst MOTIF_FIELDS = [\n  'RUS',\n  'MOTIFS',\n  'RU',\n  'motifs',\n  'motif',\n  'sequence',\n  'consensus',\n]\nconst PERIOD_FIELDS = [\n  'RUL',\n  'period',\n  'PERIOD',\n  'consensusSize',\n  'unit',\n  'unitLength',\n]\nconst NAME_FIELDS = ['TRID', 'REPID', 'VARID', 'ID', 'name', 'id']\n\n// The first entry of a list-valued field, whether it arrived parsed or as\n// the comma-joined text a VCF INFO or a BED column holds; VCF's missing \".\"\n// counts as absent.\nfunction first(f: FeatureLike, names: string[]) {\n  for (const name of names) {\n    const value = field(f, name)\n    const one = String((Array.isArray(value) ? value[0] : value) ?? '')\n      .split(',')[0]!\n      .trim()\n    if (one !== '' && one !== '.') {\n      return one\n    }\n  }\n  return undefined\n}\n\nconst IUPAC = /^[ACGTURYSWKMBDHVN]+$/i\n\n// The unit in bp: a stated period, else the length of the first motif.\nexport function repeatUnitOf(f: FeatureLike) {\n  const period = Number(first(f, PERIOD_FIELDS))\n  if (Number.isFinite(period) && period > 0) {\n    return Math.round(period)\n  }\n  const motif = first(f, MOTIF_FIELDS)\n  return motif && IUPAC.test(motif) ? motif.length : undefined\n}\n\n// A per-sample list field, parsed or as the comma-joined text a VCF column\n// holds. A missing entry stays missing: read as 0, an absent `SD` would make\n// every allele of every genotyper that writes no such field unspanned.\nfunction numbers(value: unknown) {\n  const raw: unknown[] = Array.isArray(value)\n    ? value\n    : String(value ?? '').split(',')\n  return raw.map(one => {\n    const n =\n      one === '' || one === null || one === undefined ? NaN : Number(one)\n    return Number.isFinite(n) ? n : undefined\n  })\n}\n\nfunction strings(value: unknown) {\n  const raw: unknown[] = Array.isArray(value)\n    ? value\n    : String(value ?? '').split(',')\n  return raw.map(one => {\n    const text = String(one ?? '').trim()\n    return text === '' || text === '.' ? undefined : text\n  })\n}\n\nconst TANDEM_REPEAT = '<CNV:TR>'\n\n// Each ALT allele's length, off VCF 4.5's flattened list-of-lists: RN says how\n// many RUS/RUL/RUC/RB entries each allele takes, and the allele's bases are\n// its runs' RB, or unit length times count where RB is missing. An allele that\n// is not <CNV:TR>, or has a run stating neither, has none.\nfunction tandemAlleleBp(f: FeatureLike) {\n  const alts = strings(ownField(f, 'ALT'))\n  if (!alts.includes(TANDEM_REPEAT)) {\n    return undefined\n  }\n  const rn = numbers(field(f, 'RN'))\n  const rus = strings(field(f, 'RUS'))\n  const rul = numbers(field(f, 'RUL'))\n  const ruc = numbers(field(f, 'RUC'))\n  const rb = numbers(field(f, 'RB'))\n  let k = 0\n  return alts.map((alt, i) => {\n    const n = rn[i] ?? (alt === TANDEM_REPEAT ? 1 : 0)\n    let bp = 0\n    let known = 0\n    for (let j = 0; j < n; j++, k++) {\n      const motif = rus[k]\n      const unitLength =\n        rul[k] ?? (motif && IUPAC.test(motif) ? motif.length : undefined)\n      const count = ruc[k]\n      const runBp =\n        rb[k] ??\n        (unitLength && count !== undefined\n          ? Math.round(unitLength * count)\n          : undefined)\n      if (runBp !== undefined) {\n        bp += runBp\n        known++\n      }\n    }\n    return alt === TANDEM_REPEAT && n > 0 && known === n ? bp : undefined\n  })\n}\n\n// A sample's alleles through its genotype: 0 is the reference's, an index\n// past it the ALT allele's. A phased genotype's k-th allele is PanSN\n// haplotype k, the order vg deconstruct writes an assembly's haplotypes in.\nfunction genotyped(\n  gt: string | undefined,\n  alleleBp: (number | undefined)[],\n  referenceBp: number,\n) {\n  const phased = gt?.includes('|')\n  return (gt ?? '').split(/[/|]/).flatMap((index, k): RepeatCall[] => {\n    const i = index === '' ? NaN : Number(index)\n    const bp = i > 0 ? alleleBp[i - 1] : referenceBp\n    if (!Number.isInteger(i) || bp === undefined) {\n      return []\n    }\n    return [{ bp, ...(phased ? { haplotype: k + 1 } : {}) }]\n  })\n}\n\nfunction callsOf(\n  f: FeatureLike,\n  alleleBp: (number | undefined)[] | undefined,\n  referenceBp: number,\n) {\n  const samples = ownField(f, 'samples') as\n    Record<string, Record<string, unknown>> | undefined\n  const called: Record<string, RepeatCall[]> = {}\n  for (const [sample, fields] of Object.entries(samples ?? {})) {\n    const reads = numbers(fields.SD)\n    const lengths = numbers(fields.AL).flatMap((bp, i) =>\n      bp !== undefined && bp > 0\n        ? [reads[i] === undefined ? { bp } : { bp, spanningReads: reads[i] }]\n        : [],\n    )\n    const calls =\n      lengths.length > 0 || !alleleBp\n        ? lengths\n        : genotyped(strings(fields.GT)[0], alleleBp, referenceBp)\n    if (calls.length > 0) {\n      called[sample] = calls\n    }\n  }\n  return Object.keys(called).length > 0 ? called : undefined\n}\n\n// A <CNV:TR> record's POS is the base before the array and SVLEN the\n// reference allele's length, while a VCF feature starts at that padding base.\nfunction spanOf(f: FeatureLike, tandem: boolean) {\n  const start = field(f, 'start') as number\n  const end = field(f, 'end') as number\n  const svlen = numbers(field(f, 'SVLEN'))[0]\n  return tandem && svlen !== undefined\n    ? { start: start + 1, end: start + 1 + svlen }\n    : { start, end }\n}\n\nexport function repeatArraysFrom(features: FeatureLike[]): RepeatArray[] {\n  const arrays: RepeatArray[] = []\n  for (const f of features) {\n    const alleleBp = tandemAlleleBp(f)\n    const { start, end } = spanOf(f, alleleBp !== undefined)\n    const unit = repeatUnitOf(f)\n    if (!(end > start) || unit === undefined) {\n      continue\n    }\n    const refName = field(f, 'refName') as string\n    const motif = first(f, MOTIF_FIELDS)\n    const stated = first(f, NAME_FIELDS)\n    arrays.push({\n      key: `${refName}:${start}-${end}`,\n      name:\n        (stated && !PACKED_NAME.test(stated) ? stated : undefined) ??\n        (motif && motif.length <= 12\n          ? `(${motif})n`\n          : `${refName}:${(start + 1).toLocaleString('en-US')}-${end.toLocaleString('en-US')}`),\n      refName,\n      start,\n      end,\n      unit,\n      motif,\n      calls: callsOf(f, alleleBp, end - start),\n    })\n  }\n  return arrays.sort((a, b) => a.start - b.start)\n}\n", "// src/genes/geneFiles.ts\nvar GENE_TYPE = /(gene|gene_segment|RNA|transcript)$/i;\nvar isGene = (type) => GENE_TYPE.test(type) || type === \"CDS\" || type === \"exon\";\nfunction mergedIntervals(intervals) {\n  const out = [];\n  for (const iv of [...intervals].sort((a, b) => a.start - b.start)) {\n    const last = out.at(-1);\n    if (last && iv.start <= last.end) {\n      last.end = Math.max(last.end, iv.end);\n    } else {\n      out.push({ ...iv });\n    }\n  }\n  return out;\n}\nfunction strandOf(s) {\n  return s === \"+\" ? 1 : s === \"-\" ? -1 : 0;\n}\nfunction unescape(value) {\n  try {\n    return decodeURIComponent(value);\n  } catch {\n    return value;\n  }\n}\nfunction attributes(column) {\n  const out = /* @__PURE__ */ new Map();\n  for (const pair of column.split(\";\")) {\n    const eq = pair.indexOf(\"=\");\n    if (eq > 0) {\n      out.set(pair.slice(0, eq).trim(), unescape(pair.slice(eq + 1).trim()));\n    }\n  }\n  return out;\n}\nfunction gff3Row(line) {\n  const cols = line.split(\"\t\");\n  const start = Number(cols[3]);\n  const end = Number(cols[4]);\n  if (cols.length < 9 || !Number.isInteger(start) || !Number.isInteger(end)) {\n    return void 0;\n  }\n  return {\n    refName: cols[0],\n    type: cols[2],\n    start: start - 1,\n    end,\n    strand: strandOf(cols[6]),\n    attrs: attributes(cols[8])\n  };\n}\nfunction genesFromGff3Lines(lines) {\n  const rows = [];\n  for (const line of lines) {\n    if (line.startsWith(\"##FASTA\")) {\n      break;\n    }\n    const row = line.startsWith(\"#\") ? void 0 : gff3Row(line);\n    if (row) {\n      rows.push(row);\n    }\n  }\n  const parentOf = /* @__PURE__ */ new Map();\n  for (const { attrs } of rows) {\n    const id = attrs.get(\"ID\");\n    const parent = attrs.get(\"Parent\")?.split(\",\")[0];\n    if (id && parent) {\n      parentOf.set(id, parent);\n    }\n  }\n  const rootOf = (row) => {\n    let id = row.attrs.get(\"Parent\")?.split(\",\")[0] ?? row.attrs.get(\"ID\");\n    if (!id) {\n      return row.attrs.get(\"gene_id\");\n    }\n    const seen = /* @__PURE__ */ new Set();\n    while (id && parentOf.has(id) && !seen.has(id)) {\n      seen.add(id);\n      id = parentOf.get(id);\n    }\n    return id;\n  };\n  const groups = /* @__PURE__ */ new Map();\n  rows.forEach((row, i) => {\n    const root = rootOf(row) ?? `#${i}`;\n    const key = `${row.refName}\t${root}`;\n    const group = groups.get(key) ?? groups.set(key, { rows: [] }).get(key);\n    group.rows.push(row);\n    if (!row.attrs.has(\"Parent\") && !group.top) {\n      group.top = row;\n    }\n  });\n  const genes = [];\n  for (const [key, { top, rows: rows2 }] of groups) {\n    if (top && !isGene(top.type)) {\n      continue;\n    }\n    const first = top ?? rows2[0];\n    const start = top?.start ?? Math.min(...rows2.map((r) => r.start));\n    const end = top?.end ?? Math.max(...rows2.map((r) => r.end));\n    const a = first.attrs;\n    const spans = (type) => rows2.filter((r) => r.type === type).map((r) => ({ start: r.start, end: r.end }));\n    const exons = spans(\"exon\");\n    const coding = spans(\"CDS\");\n    const transcribed = rows2.some(\n      (r) => r !== top && r.type !== \"exon\" && r.type !== \"CDS\"\n    );\n    genes.push({\n      name: a.get(\"Name\") ?? a.get(\"gene_name\") ?? a.get(\"gene\") ?? a.get(\"gene_id\") ?? key.split(\"\t\")[1],\n      refName: first.refName,\n      start,\n      end,\n      strand: first.strand,\n      // A range read holds only the rows over its window, so a gene with\n      // transcripts but no exon or CDS there is intronic in it. Only a gene\n      // with no transcripts, as a bacterium's gene and CDS, is one exon.\n      exons: exons.length ? mergedIntervals(exons) : transcribed ? mergedIntervals(coding) : [{ start, end }]\n    });\n  }\n  return genes;\n}\nfunction mergeOverlappingByName(genes) {\n  const out = [];\n  const open = /* @__PURE__ */ new Map();\n  for (const g of [...genes].sort((a, b) => a.start - b.start)) {\n    const key = `${g.refName}\t${g.strand}\t${g.name}`;\n    const last = open.get(key);\n    if (last && g.start < last.end) {\n      last.end = Math.max(last.end, g.end);\n      last.exons = mergedIntervals([...last.exons, ...g.exons]);\n    } else {\n      const gene = { ...g, exons: mergedIntervals(g.exons) };\n      out.push(gene);\n      open.set(key, gene);\n    }\n  }\n  return out;\n}\nvar BED_HEADER = /^(#|track\\s|browser\\s)/;\nfunction genesFromBed(text) {\n  const rows = [];\n  for (const line of text.split(\"\\n\")) {\n    const cols = line.replace(/\\r$/, \"\").split(\"\t\");\n    const start = Number(cols[1]);\n    const end = Number(cols[2]);\n    if (BED_HEADER.test(line) || cols.length < 3 || !Number.isInteger(start) || !(end > start)) {\n      continue;\n    }\n    const refName = cols[0];\n    const name = cols[3] && cols[3] !== \".\" ? cols[3] : `${refName}:${start + 1}-${end}`;\n    const sizes = cols[10]?.split(\",\").filter((s) => s !== \"\").map(Number);\n    const starts = cols[11]?.split(\",\").filter((s) => s !== \"\").map(Number);\n    const blocks = sizes?.length && sizes.length === starts?.length ? sizes.map((size, i) => ({\n      start: start + starts[i],\n      end: start + starts[i] + size\n    })) : [{ start, end }];\n    rows.push({\n      name,\n      refName,\n      start,\n      end,\n      strand: strandOf(cols[5]),\n      exons: blocks\n    });\n  }\n  return mergeOverlappingByName(rows);\n}\nfunction sniffedFormat(text) {\n  const first = text.split(\"\\n\", 1e3).find((l) => l.trim() !== \"\" && !BED_HEADER.test(l));\n  const cols = first?.split(\"\t\") ?? [];\n  return /^\\d+$/.test(cols[1] ?? \"\") && /^\\d+$/.test(cols[2] ?? \"\") ? \"bed\" : \"gff3\";\n}\nfunction genesFromText(text, format = sniffedFormat(text)) {\n  return format === \"bed\" ? genesFromBed(text) : genesFromGff3Lines(text.split(/\\r?\\n/));\n}\n\nexport {\n  mergedIntervals,\n  genesFromGff3Lines,\n  mergeOverlappingByName,\n  genesFromBed,\n  genesFromText\n};\n", "import {\n  mergeOverlappingByName,\n  mergedIntervals,\n} from '@jbrowse/bandage-core/genes/geneFiles'\nimport { readConfObject } from '@jbrowse/core/configuration'\n\nimport { REPEAT_TRACK_HINT } from '../repeats/repeatFeatures'\nimport { namedTrack, ownField, trackLabel } from '../trackFeatures'\n\nimport type { FeatureLike, TrackChoice } from '../trackFeatures'\nimport type { GeneModel } from '@jbrowse/bandage-core/genes/genePins'\nimport type { AnyConfigurationModel } from '@jbrowse/core/configuration'\n\n// The adapters whose tracks hold gene models, in the order the session's\n// tracks are searched when no track is named.\nexport const GENE_ADAPTER_TYPES = new Set([\n  'Gff3TabixAdapter',\n  'Gff3Adapter',\n  'BedTabixAdapter',\n  'BedAdapter',\n  'GtfTabixAdapter',\n  'GtfAdapter',\n  'BigBedAdapter',\n  'NCListAdapter',\n])\n\nconst GENE_TRACK_HINT = /gene|refseq|gencode|ensembl|annotation/i\n\n// A BED track is as often peaks or repeats as genes, so one counts only where\n// its name says it is annotation\nconst BED_ADAPTER_TYPES = new Set(['BedTabixAdapter', 'BedAdapter'])\n\n// Which of the session's tracks to read genes from: the named one while the\n// assembly has it (a saved pick can name a track since removed), else the\n// first gene-bearing track on the assembly whose name says it is annotation,\n// else the first non-BED gene-bearing track. A track whose name says repeats is\n// never picked unnamed, as \"RepeatMasker annotation\" would be.\nexport function pickGeneTrack<T extends TrackChoice>(\n  tracks: T[],\n  named: string,\n) {\n  const chosen = named ? namedTrack(tracks, named) : undefined\n  if (chosen) {\n    return chosen\n  }\n  const candidates = tracks.filter(\n    t =>\n      GENE_ADAPTER_TYPES.has(t.adapterType) &&\n      !REPEAT_TRACK_HINT.test(trackLabel(t)),\n  )\n  return (\n    candidates.find(t => GENE_TRACK_HINT.test(trackLabel(t))) ??\n    candidates.find(t => !BED_ADAPTER_TYPES.has(t.adapterType))\n  )\n}\n\nconst TE_TRACK_HINT = /\\bTEs?\\b|transpos/i\n\n// What a walk row's boxes are, for the key: TEs where the annotation track's\n// name says so, else genes\nexport function annotationNoun(track: TrackChoice | undefined) {\n  return track && TE_TRACK_HINT.test(trackLabel(track)) ? 'TE' : 'gene'\n}\n\ninterface LaneView {\n  tracks?: readonly {\n    configuration: AnyConfigurationModel\n    displays: readonly { configuration: AnyConfigurationModel }[]\n  }[]\n}\n\n// The `filter` of the gene track's lane in the view the graph is drawn in, so\n// the chips name what the lane draws. None where the view shows no such lane,\n// or has no tracks, as a graph genome view of its own.\nexport function laneFilters(view: object, trackId: string | undefined) {\n  const lane = (view as LaneView).tracks?.find(\n    t => readConfObject(t.configuration, 'trackId') === trackId,\n  )?.displays[0]\n  return lane\n    ? ((readConfObject(lane.configuration, 'filter') as string[] | undefined) ??\n        [])\n    : []\n}\n\n// Records spanning a whole sequence, the types the GFF3 adapter declines to\n// widen a fetch for. RefSeq opens every molecule with a `region` named\n// ANONYMOUS.\nconst WHOLE_SEQUENCE_TYPES = new Set([\n  'chromosome',\n  'region',\n  'contig',\n  'supercontig',\n  'scaffold',\n])\n\n// JBrowse's BED parser splits a coding BED12 block into CDS and UTR parts and\n// keeps `exon` for non-coding ones, so all of them are exon\nconst EXON_PARTS = new Set([\n  'exon',\n  'CDS',\n  'five_prime_UTR',\n  'three_prime_UTR',\n  'UTR',\n])\n\nfunction exonsOf(f: FeatureLike, into: { start: number; end: number }[]) {\n  const type = ownField(f, 'type')\n  if (typeof type === 'string' && EXON_PARTS.has(type)) {\n    into.push({\n      start: ownField(f, 'start') as number,\n      end: ownField(f, 'end') as number,\n    })\n  }\n  const children = ownField(f, 'subfeatures') as FeatureLike[] | undefined\n  for (const child of children ?? []) {\n    exonsOf(child, into)\n  }\n}\n\n// Genes from a track's features: every top-level feature but a whole-sequence\n// record, named by the first of gene_name, name, gene and gene_id it carries,\n// with the exons found anywhere under it merged. A feature with no exons is one exon,\n// its whole span. A BED track gives one feature per transcript, so a name's\n// overlapping features merge, while its copies down the contig stay apart.\n// UCSC's ncbiRefSeq.gff gene records carry their symbol only as gene_id. A\n// feature with none of those names is left out: its raw ID, RefSeq's\n// `id-NC_000913.3:1978503..1979270`, only restates where it is.\nexport function geneModelsFrom(features: FeatureLike[]): GeneModel[] {\n  const genes: GeneModel[] = []\n  for (const f of features) {\n    const name =\n      (ownField(f, 'gene_name') as string | undefined) ??\n      (ownField(f, 'name') as string | undefined) ??\n      (ownField(f, 'gene') as string | undefined) ??\n      (ownField(f, 'gene_id') as string | undefined)\n    const start = ownField(f, 'start') as number\n    const end = ownField(f, 'end') as number\n    if (\n      !name ||\n      !(end > start) ||\n      WHOLE_SEQUENCE_TYPES.has(ownField(f, 'type') as string)\n    ) {\n      continue\n    }\n    const exons: { start: number; end: number }[] = []\n    exonsOf(f, exons)\n    genes.push({\n      name,\n      refName: ownField(f, 'refName') as string,\n      start,\n      end,\n      strand: (ownField(f, 'strand') as number | undefined) ?? 0,\n      exons: exons.length ? mergedIntervals(exons) : [{ start, end }],\n    })\n  }\n  return mergeOverlappingByName(genes)\n}\n", "const host = JBrowseExports[\"tss-react/mui\"]\nconst read = name =>\n  host != null && name in Object(host)\n    ? host[name]\n    : Object.assign(\n        function () {\n          throw new Error(\n            \"This JBrowse does not provide '\" + name + \"' from '\" + \"tss-react/mui\" + \"' to plugins: GraphGenomeView was built for a different JBrowse version, so update the plugin or JBrowse\",\n          )\n        },\n        { jbrowseHostMissing: name },\n      )\nexport const cx = /* @__PURE__ */ read(\"cx\")\nexport const keyframes = /* @__PURE__ */ read(\"keyframes\")\nexport const makeStyles = /* @__PURE__ */ read(\"makeStyles\")\nexport default host && host.__esModule ? host.default : host"],
   "mappings": "+HASA,SAASA,EAAcC,EAAmC,CACxD,OAAO,MAAM,QAAQA,CAAK,GAAKA,EAAM,MAAMC,GAAQ,OAAOA,GAAS,QAAQ,CAC7E,CAIO,SAASC,GAAWC,EAAuB,CAChD,IAAMC,EAAQC,EAA2BF,CAAK,EAAE,MAAM,CAAC,EACvD,OAAOC,EAAM,OAAS,EAAIA,EAAQ,MACpC,CAKO,SAASE,EAAYC,EAAwC,CAClE,OACEA,EAAc,OAAS,2BACtBA,EAAc,OAAS,qBACpB,OAAOA,EAAc,UAAa,UAClCA,EAAc,WAAa,IAC3BC,EAAkBD,EAAc,aAAa,EAErD,CAIO,SAASE,GAAgBF,EAAwC,CACtE,OACEA,EAAc,OAAS,yBAA2BD,EAAYC,CAAa,CAE/E,CAIO,SAASG,GAAiBH,EAAwC,CACvE,GAAM,CAAE,kBAAAI,CAAkB,EAAIJ,EAC9B,OAAOD,EAAYC,CAAa,GAC9BR,EAAcY,CAAiB,GAC/BA,EAAkB,OAAS,EACzBA,EACA,MACN,CAMO,SAASC,GAAuBT,EAAuB,CAC5D,OAAOE,EAA2BF,CAAK,EAAE,CAAC,CAC5C,CAGO,SAASU,GAAqBV,EAAuB,CAC1D,OAAOW,EAAmBX,CAAK,EAAE,OACnC,CAEO,SAASY,GACdC,EACAC,EACA,CACA,OAAOD,IAAsB,QAAaA,IAAsBC,EAC5D,OACA,sCAAsCD,CAAiB,4BAA4BA,CAAiB,EAC1G,CCpEO,SAASE,EAASC,EAAgBC,EAAuB,CAC9D,OAAO,OAAQD,EAAc,KAAQ,WAChCA,EAAc,IAAIC,CAAI,EACtBD,EAA8BC,CAAI,CACzC,CAQO,SAASC,EAAkCC,EAAaC,EAAe,CAC5E,OAAOD,EAAO,KAAKE,GAAKA,EAAE,UAAYD,CAAK,CAC7C,CAGO,SAASE,EAAWD,EAAgB,CACzC,MAAO,GAAGA,EAAE,OAAO,IAAIA,EAAE,MAAQ,EAAE,EACrC,CCgBO,IAAME,EAAuB,IAAI,IAAI,CAC1C,aACA,kBACA,gBACA,aACA,iBACF,CAAC,EAEYC,EACX,gEAEK,SAASC,GACdC,EACAC,EACA,CACA,IAAMC,EAASD,EAAQE,EAAWH,EAAQC,CAAK,EAAI,OACnD,OAAIC,GAGeF,EAAO,OAAOI,GAAKP,EAAqB,IAAIO,EAAE,WAAW,CAAC,EAC3D,KAAKA,GAAKN,EAAkB,KAAKO,EAAWD,CAAC,CAAC,CAAC,CACnE,CAKA,IAAME,EAAc,2BAEpB,SAASC,EAAWC,EAAgB,CAClC,IAAMC,EAAOC,EAASF,EAAG,MAAM,EAC/B,GAAI,SAAOC,GAAS,UAAY,CAACH,EAAY,KAAKG,CAAI,GAGtD,OAAO,OAAO,YACZA,EAAK,MAAM,GAAG,EAAE,IAAIE,GAAQ,CAC1B,IAAMC,EAAID,EAAK,QAAQ,GAAG,EAC1B,MAAO,CAACA,EAAK,MAAM,EAAGC,CAAC,EAAGD,EAAK,MAAMC,EAAI,CAAC,CAAC,CAC7C,CAAC,CACH,CACF,CAIA,SAASC,EAAML,EAAgBC,EAAuB,CACpD,IAAMK,EAAMJ,EAASF,EAAGC,CAAI,EAC5B,OAAIK,IAAQ,OACHA,EAEIJ,EAASF,EAAG,MAAM,IACjBC,CAAI,GAAKF,EAAWC,CAAC,IAAIC,CAAI,CAC7C,CAEA,IAAMM,EAAe,CACnB,MACA,SACA,KACA,SACA,QACA,WACA,WACF,EACMC,EAAgB,CACpB,MACA,SACA,SACA,gBACA,OACA,YACF,EACMC,EAAc,CAAC,OAAQ,QAAS,QAAS,KAAM,OAAQ,IAAI,EAKjE,SAASC,EAAMV,EAAgBW,EAAiB,CAC9C,QAAWV,KAAQU,EAAO,CACxB,IAAMC,EAAQP,EAAML,EAAGC,CAAI,EACrBY,EAAM,QAAQ,MAAM,QAAQD,CAAK,EAAIA,EAAM,CAAC,EAAIA,IAAU,EAAE,EAC/D,MAAM,GAAG,EAAE,CAAC,EACZ,KAAK,EACR,GAAIC,IAAQ,IAAMA,IAAQ,IACxB,OAAOA,CAEX,CAEF,CAEA,IAAMC,EAAQ,yBAGP,SAASC,EAAaf,EAAgB,CAC3C,IAAMgB,EAAS,OAAON,EAAMV,EAAGQ,CAAa,CAAC,EAC7C,GAAI,OAAO,SAASQ,CAAM,GAAKA,EAAS,EACtC,OAAO,KAAK,MAAMA,CAAM,EAE1B,IAAMC,EAAQP,EAAMV,EAAGO,CAAY,EACnC,OAAOU,GAASH,EAAM,KAAKG,CAAK,EAAIA,EAAM,OAAS,MACrD,CAKA,SAASC,EAAQN,EAAgB,CAI/B,OAHuB,MAAM,QAAQA,CAAK,EACtCA,EACA,OAAOA,GAAS,EAAE,EAAE,MAAM,GAAG,GACtB,IAAIC,GAAO,CACpB,IAAMM,EACJN,IAAQ,IAAMA,IAAQ,MAAQA,IAAQ,OAAY,IAAM,OAAOA,CAAG,EACpE,OAAO,OAAO,SAASM,CAAC,EAAIA,EAAI,MAClC,CAAC,CACH,CAEA,SAASC,EAAQR,EAAgB,CAI/B,OAHuB,MAAM,QAAQA,CAAK,EACtCA,EACA,OAAOA,GAAS,EAAE,EAAE,MAAM,GAAG,GACtB,IAAIC,GAAO,CACpB,IAAMQ,EAAO,OAAOR,GAAO,EAAE,EAAE,KAAK,EACpC,OAAOQ,IAAS,IAAMA,IAAS,IAAM,OAAYA,CACnD,CAAC,CACH,CAEA,IAAMC,EAAgB,WAMtB,SAASC,EAAevB,EAAgB,CACtC,IAAMwB,EAAOJ,EAAQlB,EAASF,EAAG,KAAK,CAAC,EACvC,GAAI,CAACwB,EAAK,SAASF,CAAa,EAC9B,OAEF,IAAMG,EAAKP,EAAQb,EAAML,EAAG,IAAI,CAAC,EAC3B0B,EAAMN,EAAQf,EAAML,EAAG,KAAK,CAAC,EAC7B2B,EAAMT,EAAQb,EAAML,EAAG,KAAK,CAAC,EAC7B4B,EAAMV,EAAQb,EAAML,EAAG,KAAK,CAAC,EAC7B6B,EAAKX,EAAQb,EAAML,EAAG,IAAI,CAAC,EAC7B8B,EAAI,EACR,OAAON,EAAK,IAAI,CAACO,EAAK3B,IAAM,CAC1B,IAAMe,EAAIM,EAAGrB,CAAC,IAAM2B,IAAQT,EAAgB,EAAI,GAC5CU,EAAK,EACLC,EAAQ,EACZ,QAASC,EAAI,EAAGA,EAAIf,EAAGe,IAAKJ,IAAK,CAC/B,IAAMb,EAAQS,EAAII,CAAC,EACbK,EACJR,EAAIG,CAAC,IAAMb,GAASH,EAAM,KAAKG,CAAK,EAAIA,EAAM,OAAS,QACnDmB,EAAQR,EAAIE,CAAC,EACbO,EACJR,EAAGC,CAAC,IACHK,GAAcC,IAAU,OACrB,KAAK,MAAMD,EAAaC,CAAK,EAC7B,QACFC,IAAU,SACZL,GAAMK,EACNJ,IAEJ,CACA,OAAOF,IAAQT,GAAiBH,EAAI,GAAKc,IAAUd,EAAIa,EAAK,MAC9D,CAAC,CACH,CAKA,SAASM,EACPC,EACAC,EACAC,EACA,CACA,IAAMC,EAASH,GAAI,SAAS,GAAG,EAC/B,OAAQA,GAAM,IAAI,MAAM,MAAM,EAAE,QAAQ,CAACI,EAAOb,IAAoB,CAClE,IAAM1B,EAAIuC,IAAU,GAAK,IAAM,OAAOA,CAAK,EACrCX,EAAK5B,EAAI,EAAIoC,EAASpC,EAAI,CAAC,EAAIqC,EACrC,MAAI,CAAC,OAAO,UAAUrC,CAAC,GAAK4B,IAAO,OAC1B,CAAC,EAEH,CAAC,CAAE,GAAAA,EAAI,GAAIU,EAAS,CAAE,UAAWZ,EAAI,CAAE,EAAI,CAAC,CAAG,CAAC,CACzD,CAAC,CACH,CAEA,SAASc,EACP5C,EACAwC,EACAC,EACA,CACA,IAAMI,EAAU3C,EAASF,EAAG,SAAS,EAE/B8C,EAAuC,CAAC,EAC9C,OAAW,CAACC,EAAQC,CAAM,IAAK,OAAO,QAAQH,GAAW,CAAC,CAAC,EAAG,CAC5D,IAAMI,EAAQ/B,EAAQ8B,EAAO,EAAE,EACzBE,EAAUhC,EAAQ8B,EAAO,EAAE,EAAE,QAAQ,CAAChB,EAAI5B,IAC9C4B,IAAO,QAAaA,EAAK,EACrB,CAACiB,EAAM7C,CAAC,IAAM,OAAY,CAAE,GAAA4B,CAAG,EAAI,CAAE,GAAAA,EAAI,cAAeiB,EAAM7C,CAAC,CAAE,CAAC,EAClE,CAAC,CACP,EACM+C,EACJD,EAAQ,OAAS,GAAK,CAACV,EACnBU,EACAZ,EAAUlB,EAAQ4B,EAAO,EAAE,EAAE,CAAC,EAAGR,EAAUC,CAAW,EACxDU,EAAM,OAAS,IACjBL,EAAOC,CAAM,EAAII,EAErB,CACA,OAAO,OAAO,KAAKL,CAAM,EAAE,OAAS,EAAIA,EAAS,MACnD,CAIA,SAASM,EAAOpD,EAAgBqD,EAAiB,CAC/C,IAAMC,EAAQjD,EAAML,EAAG,OAAO,EACxBuD,EAAMlD,EAAML,EAAG,KAAK,EACpBwD,EAAQtC,EAAQb,EAAML,EAAG,OAAO,CAAC,EAAE,CAAC,EAC1C,OAAOqD,GAAUG,IAAU,OACvB,CAAE,MAAOF,EAAQ,EAAG,IAAKA,EAAQ,EAAIE,CAAM,EAC3C,CAAE,MAAAF,EAAO,IAAAC,CAAI,CACnB,CAEO,SAASE,GAAiBC,EAAwC,CACvE,IAAMC,EAAwB,CAAC,EAC/B,QAAW3D,KAAK0D,EAAU,CACxB,IAAMlB,EAAWjB,EAAevB,CAAC,EAC3B,CAAE,MAAAsD,EAAO,IAAAC,CAAI,EAAIH,EAAOpD,EAAGwC,IAAa,MAAS,EACjDoB,EAAO7C,EAAaf,CAAC,EAC3B,GAAI,EAAEuD,EAAMD,IAAUM,IAAS,OAC7B,SAEF,IAAMC,EAAUxD,EAAML,EAAG,SAAS,EAC5BiB,EAAQP,EAAMV,EAAGO,CAAY,EAC7BuD,EAASpD,EAAMV,EAAGS,CAAW,EACnCkD,EAAO,KAAK,CACV,IAAK,GAAGE,CAAO,IAAIP,CAAK,IAAIC,CAAG,GAC/B,MACGO,GAAU,CAAChE,EAAY,KAAKgE,CAAM,EAAIA,EAAS,UAC/C7C,GAASA,EAAM,QAAU,GACtB,IAAIA,CAAK,KACT,GAAG4C,CAAO,KAAKP,EAAQ,GAAG,eAAe,OAAO,CAAC,IAAIC,EAAI,eAAe,OAAO,CAAC,IACtF,QAAAM,EACA,MAAAP,EACA,IAAAC,EACA,KAAAK,EACA,MAAA3C,EACA,MAAO2B,EAAQ5C,EAAGwC,EAAUe,EAAMD,CAAK,CACzC,CAAC,CACH,CACA,OAAOK,EAAO,KAAK,CAACI,EAAGC,IAAMD,EAAE,MAAQC,EAAE,KAAK,CAChD,CC3RA,SAASC,EAAgBC,EAAW,CAClC,IAAMC,EAAM,CAAC,EACb,QAAWC,IAAM,CAAC,GAAGF,CAAS,EAAE,KAAK,CAACG,EAAGC,IAAMD,EAAE,MAAQC,EAAE,KAAK,EAAG,CACjE,IAAMC,EAAOJ,EAAI,GAAG,EAAE,EAClBI,GAAQH,EAAG,OAASG,EAAK,IAC3BA,EAAK,IAAM,KAAK,IAAIA,EAAK,IAAKH,EAAG,GAAG,EAEpCD,EAAI,KAAK,CAAE,GAAGC,CAAG,CAAC,CAEtB,CACA,OAAOD,CACT,CA2GA,SAASK,EAAuBC,EAAO,CACrC,IAAMC,EAAM,CAAC,EACPC,EAAuB,IAAI,IACjC,QAAWC,IAAK,CAAC,GAAGH,CAAK,EAAE,KAAK,CAACI,EAAGC,IAAMD,EAAE,MAAQC,EAAE,KAAK,EAAG,CAC5D,IAAMC,EAAM,GAAGH,EAAE,OAAO,IAAIA,EAAE,MAAM,IAAIA,EAAE,IAAI,GACxCI,EAAOL,EAAK,IAAII,CAAG,EACzB,GAAIC,GAAQJ,EAAE,MAAQI,EAAK,IACzBA,EAAK,IAAM,KAAK,IAAIA,EAAK,IAAKJ,EAAE,GAAG,EACnCI,EAAK,MAAQC,EAAgB,CAAC,GAAGD,EAAK,MAAO,GAAGJ,EAAE,KAAK,CAAC,MACnD,CACL,IAAMM,EAAO,CAAE,GAAGN,EAAG,MAAOK,EAAgBL,EAAE,KAAK,CAAE,EACrDF,EAAI,KAAKQ,CAAI,EACbP,EAAK,IAAII,EAAKG,CAAI,CACpB,CACF,CACA,OAAOR,CACT,CC1HO,IAAMS,EAAqB,IAAI,IAAI,CACxC,mBACA,cACA,kBACA,aACA,kBACA,aACA,gBACA,eACF,CAAC,EAEKC,EAAkB,0CAIlBC,EAAoB,IAAI,IAAI,CAAC,kBAAmB,YAAY,CAAC,EAO5D,SAASC,GACdC,EACAC,EACA,CACA,IAAMC,EAASD,EAAQE,EAAWH,EAAQC,CAAK,EAAI,OACnD,GAAIC,EACF,OAAOA,EAET,IAAME,EAAaJ,EAAO,OACxBK,GACET,EAAmB,IAAIS,EAAE,WAAW,GACpC,CAACC,EAAkB,KAAKC,EAAWF,CAAC,CAAC,CACzC,EACA,OACED,EAAW,KAAKC,GAAKR,EAAgB,KAAKU,EAAWF,CAAC,CAAC,CAAC,GACxDD,EAAW,KAAKC,GAAK,CAACP,EAAkB,IAAIO,EAAE,WAAW,CAAC,CAE9D,CAEA,IAAMG,EAAgB,qBAIf,SAASC,GAAeC,EAAgC,CAC7D,OAAOA,GAASF,EAAc,KAAKD,EAAWG,CAAK,CAAC,EAAI,KAAO,MACjE,CAYO,SAASC,GAAYC,EAAcC,EAA6B,CACrE,IAAMC,EAAQF,EAAkB,QAAQ,KACtCP,GAAKU,EAAeV,EAAE,cAAe,SAAS,IAAMQ,CACtD,GAAG,SAAS,CAAC,EACb,OAAOC,EACDC,EAAeD,EAAK,cAAe,QAAQ,GAC3C,CAAC,EACH,CAAC,CACP,CAKA,IAAME,EAAuB,IAAI,IAAI,CACnC,aACA,SACA,SACA,cACA,UACF,CAAC,EAIKC,GAAa,IAAI,IAAI,CACzB,OACA,MACA,iBACA,kBACA,KACF,CAAC,EAED,SAASC,EAAQC,EAAgBC,EAAwC,CACvE,IAAMC,EAAOC,EAASH,EAAG,MAAM,EAC3B,OAAOE,GAAS,UAAYJ,GAAW,IAAII,CAAI,GACjDD,EAAK,KAAK,CACR,MAAOE,EAASH,EAAG,OAAO,EAC1B,IAAKG,EAASH,EAAG,KAAK,CACxB,CAAC,EAEH,IAAMI,EAAWD,EAASH,EAAG,aAAa,EAC1C,QAAWK,KAASD,GAAY,CAAC,EAC/BL,EAAQM,EAAOJ,CAAI,CAEvB,CAUO,SAASK,GAAeC,EAAsC,CACnE,IAAMC,EAAqB,CAAC,EAC5B,QAAWR,KAAKO,EAAU,CACxB,IAAME,EACHN,EAASH,EAAG,WAAW,GACvBG,EAASH,EAAG,MAAM,GAClBG,EAASH,EAAG,MAAM,GAClBG,EAASH,EAAG,SAAS,EAClBU,EAAQP,EAASH,EAAG,OAAO,EAC3BW,EAAMR,EAASH,EAAG,KAAK,EAC7B,GACE,CAACS,GACD,EAAEE,EAAMD,IACRb,EAAqB,IAAIM,EAASH,EAAG,MAAM,CAAW,EAEtD,SAEF,IAAMY,EAA0C,CAAC,EACjDb,EAAQC,EAAGY,CAAK,EAChBJ,EAAM,KAAK,CACT,KAAAC,EACA,QAASN,EAASH,EAAG,SAAS,EAC9B,MAAAU,EACA,IAAAC,EACA,OAASR,EAASH,EAAG,QAAQ,GAA4B,EACzD,MAAOY,EAAM,OAASC,EAAgBD,CAAK,EAAI,CAAC,CAAE,MAAAF,EAAO,IAAAC,CAAI,CAAC,CAChE,CAAC,CACH,CACA,OAAOG,EAAuBN,CAAK,CACrC,CC5JA,IAAMO,EAAO,eAAe,eAAe,EACrCC,GAAOC,GACXF,GAAQ,MAAQE,KAAQ,OAAOF,CAAI,EAC/BA,EAAKE,CAAI,EACT,OAAO,OACL,UAAY,CACV,MAAM,IAAI,MACR,kCAAoCA,EAAO,+HAC7C,CACF,EACA,CAAE,mBAAoBA,CAAK,CAC7B,EAGC,IAAMC,GAA6BC,GAAK,YAAY,EACpDC,GAAQC,GAAQA,EAAK,WAAaA,EAAK,QAAUA",
   "names": ["isStringArray", "value", "item", "trackLanes", "track", "lanes", "getConfAssemblyNamesOrNone", "walkIndexed", "adapterConfig", "snapshotNamesFile", "cutsByHaplotype", "configHaplotypes", "defaultHaplotypes", "graphReferenceAssembly", "trackAdapterSnapshot", "toTrackConfigEntry", "offReferenceProblem", "referenceAssembly", "assemblyName", "ownField", "f", "name", "namedTrack", "tracks", "named", "t", "trackLabel", "REPEAT_ADAPTER_TYPES", "REPEAT_TRACK_HINT", "pickRepeatTrack", "tracks", "named", "chosen", "namedTrack", "t", "trackLabel", "PACKED_NAME", "packedName", "f", "name", "ownField", "pair", "i", "field", "top", "MOTIF_FIELDS", "PERIOD_FIELDS", "NAME_FIELDS", "first", "names", "value", "one", "IUPAC", "repeatUnitOf", "period", "motif", "numbers", "n", "strings", "text", "TANDEM_REPEAT", "tandemAlleleBp", "alts", "rn", "rus", "rul", "ruc", "rb", "k", "alt", "bp", "known", "j", "unitLength", "count", "runBp", "genotyped", "gt", "alleleBp", "referenceBp", "phased", "index", "callsOf", "samples", "called", "sample", "fields", "reads", "lengths", "calls", "spanOf", "tandem", "start", "end", "svlen", "repeatArraysFrom", "features", "arrays", "unit", "refName", "stated", "a", "b", "mergedIntervals", "intervals", "out", "iv", "a", "b", "last", "mergeOverlappingByName", "genes", "out", "open", "g", "a", "b", "key", "last", "mergedIntervals", "gene", "GENE_ADAPTER_TYPES", "GENE_TRACK_HINT", "BED_ADAPTER_TYPES", "pickGeneTrack", "tracks", "named", "chosen", "namedTrack", "candidates", "t", "REPEAT_TRACK_HINT", "trackLabel", "TE_TRACK_HINT", "annotationNoun", "track", "laneFilters", "view", "trackId", "lane", "readConfObject", "WHOLE_SEQUENCE_TYPES", "EXON_PARTS", "exonsOf", "f", "into", "type", "ownField", "children", "child", "geneModelsFrom", "features", "genes", "name", "start", "end", "exons", "mergedIntervals", "mergeOverlappingByName", "host", "read", "name", "makeStyles", "read", "mui_default", "host"]

package/dist/chunks/{chunk-47KLT4FL.js → chunk-7CZC4GOZ.js}

@@ -1,4 +1,4 @@
-import{a as Z,b as $,f as L,h as M}from"./chunk-UOWS2HEQ.js";import{b as O,g as G,p as T}from"./chunk-PVRRW4PM.js";import{a as y,b as I,c as C,d as v}from"./chunk-3M3UH5JQ.js";var q=new Map([["hg38","GRCh38"],["hg19","GRCh37"],["hs1","CHM13"],["t2t-chm13","CHM13"],["chm13v2","CHM13"]]);function F(t){return q.get(t.toLowerCase())}function z(t){let s=t.includes("#")?y(t):void 0;return s===void 0||I(s)?void 0:s}function P(t){return C(t)??y(t)}function _(t){let s=new Set((t.anchorPaths??[]).map(n=>n.name));for(let n of t.nodes)n.stable&&s.add(n.stable.refName);let e=new Map;for(let n of s){let r=z(n);r!==void 0&&O(e,r,P(n))}return e}function B(t,s){let e=new Set(t.map(f=>z(f.refName))),[n]=e;if(e.size!==1||n===void 0)return{contigs:t,prefixes:[],named:!1};let r=new Set(t.map(f=>P(f.refName))),i=[...s.get(n)??[]].every(f=>r.has(f)),a=new Set(t.map(f=>C(f.refName))),[o]=a;return{contigs:t,prefixes:[...i?[n]:[],...a.size===1&&o?[o]:[]],named:!0}}function U(t){let s=new Map;for(let n of t.nodes)if(G(n)){let{refName:r,start:i}=n.stable,a=i+n.length,o=s.get(r);o?(o.start=Math.min(o.start,i),o.end=Math.max(o.end,a)):s.set(r,{refName:r,contig:v(r),start:i,end:a})}let e=[...s.values()];return e.length?B(e,_(t)):void 0}function de(t,s){let e=U(t),n=s?v(s.refName):e?.contigs.length===1?e.contigs[0].contig:void 0,r=e?.named?y(e.contigs[0].refName):void 0;return n&&(r?`${r} ${n}`:n)}function H(t,s){let e=a=>[a.name,...a.aliases??[]],n=a=>o=>e(o).some(f=>f.toLowerCase()===a.toLowerCase()),r=[...t?.prefixes??[]].reverse(),i=t?.prefixes.find(a=>!a.includes("#"))?.toLowerCase();for(let a of r){let o=s.find(n(a));if(o)return o}return i===void 0?void 0:s.find(a=>e(a).some(o=>F(o)?.toLowerCase()===i))}function pe(t,s){let e=_(t);return t.anchorPaths?.find(n=>H(B([{refName:n.name,contig:v(n.name),start:n.start,end:n.start+n.length}],e),[s]))}function D(t){let s=t.replace(/^chr/i,""),e=s?/^(M|MT)$/i.test(s)?["M","MT"]:[s]:[];return[...new Set([t,...e.flatMap(n=>[n,`chr${n}`])])]}function K(t,s={}){let e=new Set(t),n=new Map;for(let r of e){let i=v(r),a=s[i];for(let o of new Set([...D(i),...a?[a]:[]]))n.set(o,n.has(o)?void 0:r)}return r=>e.has(r)?r:n.get(r)}function me(t,s,e){let n=K(s.contigs.map(r=>r.refName),e);return t.flatMap(r=>{let i=n(r.refName);return i===void 0?[]:[i===r.refName?r:{...r,refName:i}]})}var Q=62,R=60,j=9,k=48,J=57,V=/^(?:LN:i|SN:Z|SO:i|SR:i):/,X=/^[PEOUFG]\t/,W=t=>t.endsWith("\r")?t.slice(0,-1):t;function Y(){return{nodes:new T(new Int32Array(65536)),reversed:new T(new Uint8Array(65536))}}var ee=class{constructor(){this.names=[],this.byName=new Map,this.byNumber=new Map}has(t){return this.byName.has(t)}add(t){let s=this.names.length;this.byName.set(t,s),this.names.push(t);let e=+t;return Number.isSafeInteger(e)&&String(e)===t&&this.byNumber.set(e,s),s}of(t){return this.byName.get(t)??this.add(t)}ofNumber(t){return this.byNumber.get(t)}};function te(t){let[,s,e="*",...n]=t.split("	");if(!s||/^\d+$/.test(e))return;let r=e==="*"?0:e.length,i,a,o;for(let u of n){if(!V.test(u))return;let c=u.slice(5),p=u.slice(0,2);p==="LN"?r=+c:p==="SN"?i=c:p==="SO"?a=+c:o=+c}return{name:s,length:r,stable:i!==void 0&&a!==void 0&&o!==void 0?{refName:i,start:a,rank:o}:void 0}}function se(t,s,e,n){let r=0,i=-1,a=0,o=!0,f=c=>{if(i>=0&&c>i){let p=o&&c-i<16&&(c-i===1||t.charCodeAt(i)!==k)?e.ofNumber(a):void 0;n.nodes.push(p??e.of(t.slice(i,c))),n.reversed.push(r)}},u=s;for(;u<t.length;u++){let c=t.charCodeAt(u);if(c===Q||c===R)f(u),r=c===R?1:0,i=u+1,a=0,o=!0;else{if(c===j)break;o&&c>=k&&c<=J?a=a*10+c-k:o=!1}}return f(u),u}function ne(t){let s=[],e=0;for(;s.length<6;){let f=t.indexOf("	",e);if(f===-1)return;s.push(t.slice(e,f)),e=f+1}let[,n,r,i,a,o]=s;return n&&r&&i&&a&&o&&e<t.length?{sample:n,haplotype:r,contig:i,start:a,end:o,body:e}:void 0}function Ne(t){let s=t.split(`
+import{a as Z,b as $,f as L,h as M}from"./chunk-YRAIRXY6.js";import{b as O,g as G,p as T}from"./chunk-AZUO4NZ5.js";import{a as y,b as I,c as C,d as v}from"./chunk-JKW2OX73.js";var q=new Map([["hg38","GRCh38"],["hg19","GRCh37"],["hs1","CHM13"],["t2t-chm13","CHM13"],["chm13v2","CHM13"]]);function F(t){return q.get(t.toLowerCase())}function z(t){let s=t.includes("#")?y(t):void 0;return s===void 0||I(s)?void 0:s}function P(t){return C(t)??y(t)}function _(t){let s=new Set((t.anchorPaths??[]).map(n=>n.name));for(let n of t.nodes)n.stable&&s.add(n.stable.refName);let e=new Map;for(let n of s){let r=z(n);r!==void 0&&O(e,r,P(n))}return e}function B(t,s){let e=new Set(t.map(f=>z(f.refName))),[n]=e;if(e.size!==1||n===void 0)return{contigs:t,prefixes:[],named:!1};let r=new Set(t.map(f=>P(f.refName))),i=[...s.get(n)??[]].every(f=>r.has(f)),a=new Set(t.map(f=>C(f.refName))),[o]=a;return{contigs:t,prefixes:[...i?[n]:[],...a.size===1&&o?[o]:[]],named:!0}}function U(t){let s=new Map;for(let n of t.nodes)if(G(n)){let{refName:r,start:i}=n.stable,a=i+n.length,o=s.get(r);o?(o.start=Math.min(o.start,i),o.end=Math.max(o.end,a)):s.set(r,{refName:r,contig:v(r),start:i,end:a})}let e=[...s.values()];return e.length?B(e,_(t)):void 0}function de(t,s){let e=U(t),n=s?v(s.refName):e?.contigs.length===1?e.contigs[0].contig:void 0,r=e?.named?y(e.contigs[0].refName):void 0;return n&&(r?`${r} ${n}`:n)}function H(t,s){let e=a=>[a.name,...a.aliases??[]],n=a=>o=>e(o).some(f=>f.toLowerCase()===a.toLowerCase()),r=[...t?.prefixes??[]].reverse(),i=t?.prefixes.find(a=>!a.includes("#"))?.toLowerCase();for(let a of r){let o=s.find(n(a));if(o)return o}return i===void 0?void 0:s.find(a=>e(a).some(o=>F(o)?.toLowerCase()===i))}function pe(t,s){let e=_(t);return t.anchorPaths?.find(n=>H(B([{refName:n.name,contig:v(n.name),start:n.start,end:n.start+n.length}],e),[s]))}function D(t){let s=t.replace(/^chr/i,""),e=s?/^(M|MT)$/i.test(s)?["M","MT"]:[s]:[];return[...new Set([t,...e.flatMap(n=>[n,`chr${n}`])])]}function K(t,s={}){let e=new Set(t),n=new Map;for(let r of e){let i=v(r),a=s[i];for(let o of new Set([...D(i),...a?[a]:[]]))n.set(o,n.has(o)?void 0:r)}return r=>e.has(r)?r:n.get(r)}function me(t,s,e){let n=K(s.contigs.map(r=>r.refName),e);return t.flatMap(r=>{let i=n(r.refName);return i===void 0?[]:[i===r.refName?r:{...r,refName:i}]})}var Q=62,R=60,j=9,k=48,J=57,V=/^(?:LN:i|SN:Z|SO:i|SR:i):/,X=/^[PEOUFG]\t/,W=t=>t.endsWith("\r")?t.slice(0,-1):t;function Y(){return{nodes:new T(new Int32Array(65536)),reversed:new T(new Uint8Array(65536))}}var ee=class{constructor(){this.names=[],this.byName=new Map,this.byNumber=new Map}has(t){return this.byName.has(t)}add(t){let s=this.names.length;this.byName.set(t,s),this.names.push(t);let e=+t;return Number.isSafeInteger(e)&&String(e)===t&&this.byNumber.set(e,s),s}of(t){return this.byName.get(t)??this.add(t)}ofNumber(t){return this.byNumber.get(t)}};function te(t){let[,s,e="*",...n]=t.split("	");if(!s||/^\d+$/.test(e))return;let r=e==="*"?0:e.length,i,a,o;for(let u of n){if(!V.test(u))return;let c=u.slice(5),p=u.slice(0,2);p==="LN"?r=+c:p==="SN"?i=c:p==="SO"?a=+c:o=+c}return{name:s,length:r,stable:i!==void 0&&a!==void 0&&o!==void 0?{refName:i,start:a,rank:o}:void 0}}function se(t,s,e,n){let r=0,i=-1,a=0,o=!0,f=c=>{if(i>=0&&c>i){let p=o&&c-i<16&&(c-i===1||t.charCodeAt(i)!==k)?e.ofNumber(a):void 0;n.nodes.push(p??e.of(t.slice(i,c))),n.reversed.push(r)}},u=s;for(;u<t.length;u++){let c=t.charCodeAt(u);if(c===Q||c===R)f(u),r=c===R?1:0,i=u+1,a=0,o=!0;else{if(c===j)break;o&&c>=k&&c<=J?a=a*10+c-k:o=!1}}return f(u),u}function ne(t){let s=[],e=0;for(;s.length<6;){let f=t.indexOf("	",e);if(f===-1)return;s.push(t.slice(e,f)),e=f+1}let[,n,r,i,a,o]=s;return n&&r&&i&&a&&o&&e<t.length?{sample:n,haplotype:r,contig:i,start:a,end:o,body:e}:void 0}function Ne(t){let s=t.split(`
 `),e=new ee,n=[],r=[],i=[],a=[],o=[],f=new Map;for(let d of s){if(X.test(d))return;if(d.startsWith("S	")){let l=te(W(d));if(!l||e.has(l.name))return;e.add(l.name),n.push(l.length);let h=-1;l.stable&&(h=f.get(l.stable.refName)??o.length,h===o.length&&(o.push(l.stable.refName),f.set(l.stable.refName,h))),r.push(h),i.push(l.stable?.start??0),a.push(l.stable?.rank??0)}}let u=[],c=[],p=[],b=[],x=[],E=[],S=[0],g=Y(),w=new M,A=new M;for(let d of s)if(d.startsWith("L	")){let[,l,h,N,m]=W(d).split("	");l&&N&&m&&(u.push(e.of(l)),c.push(e.of(N)),p.push((h==="-"?1:0)|(m==="-"?2:0)))}else if(d.startsWith("W	")){let l=W(d),h=ne(l);if(h){b.push(`${h.sample}#${h.haplotype}#${h.contig}`),x.push(h.start==="*"?0:+h.start),E.push(h.end==="*"?-1:+h.end);let N=se(l,h.body,e,g),m=re(l,N);if(m===void 0||(m.before&&w.push(m.before),m.after&&A.push(m.after),g.nodes.length===S.at(-1)))return;S.push(g.nodes.length)}}if(![w.kinds.length,A.kinds.length].some(d=>d>0&&d<b.length))return{nodes:{names:e.names,lengths:Int32Array.from(n),refs:Int32Array.from(r),starts:Float64Array.from(i),ranks:Int32Array.from(a),refNames:o},links:{from:Int32Array.from(u),to:Int32Array.from(c),strands:Uint8Array.from(p)},walks:{names:b,starts:Float64Array.from(x),ends:Float64Array.from(E),offsets:Int32Array.from(S),steps:g.nodes.data.slice(0,g.nodes.length),reversed:g.reversed.data.slice(0,g.reversed.length),...oe(b.length,w,A)}}}function re(t,s){let e={};for(let n of s<t.length?t.slice(s+1).split("	"):[]){let r=n.slice(5);if(n.startsWith(`${Z}:Z:`)){if(e.before=L(r),!e.before)return}else if(n.startsWith(`${$}:Z:`)&&(e.after=L(r),!e.after))return}return e}function oe(t,s,e){return{...s.kinds.length===t&&t>0?{before:s.table()}:{},...e.kinds.length===t&&t>0?{after:e.table()}:{}}}var ae=/([><])([^><]+)/g;function ie(t){if(!t.startsWith(">")&&!t.startsWith("<"))return;let s=[];for(let[,e,n]of t.matchAll(ae))s.push({name:n,strand:e===">"?"+":"-"});return s}function fe(t){let s=t.trimEnd(),e=s.split("	");if(e.length<12||s.startsWith("#"))return;let n=ie(e[5]);if(!n)return;let r,i=!1;for(let a=12;a<e.length;a++){let o=e[a];o.startsWith("cs:Z:")?r=o.slice(5):o==="tp:A:S"&&(i=!0)}return{name:e[0],queryLength:+e[1],queryStart:+e[2],queryEnd:+e[3],strand:e[4]==="-"?"-":"+",path:n,pathLength:+e[6],pathStart:+e[7],pathEnd:+e[8],matches:+e[9],blockLength:+e[10],mappingQuality:+e[11],secondary:i,...r===void 0?{}:{cs:r}}}function we(t){let s=[];for(let e of t.split(`
 `)){let n=fe(e);n&&s.push(n)}return s}var ce=/:(\d+)|=([A-Za-z]+)|\*[a-zA-Z]([a-zA-Z])|\+([A-Za-z]+)|-([A-Za-z]+)|~[a-z]{2}(\d+)[a-z]{2}/g;function Ae(t){let s=[];for(let e of t.matchAll(ce))e[1]!==void 0?s.push({op:"match",length:+e[1]}):e[2]!==void 0?s.push({op:"match",length:e[2].length}):e[3]!==void 0?s.push({op:"substitution",seq:e[3].toUpperCase()}):e[4]!==void 0?s.push({op:"insertion",seq:e[4].toUpperCase()}):e[5]!==void 0?s.push({op:"deletion",length:e[5].length}):e[6]!==void 0&&s.push({op:"match",length:+e[6]});return s}export{F as a,U as b,de as c,H as d,pe as e,me as f,Ne as g,fe as h,we as i,Ae as j};
-//# sourceMappingURL=chunk-47KLT4FL.js.map
+//# sourceMappingURL=chunk-7CZC4GOZ.js.map

package/dist/chunks/{chunk-47KLT4FL.js.map → chunk-7CZC4GOZ.js.map}

@@ -1,6 +1,6 @@
 {
   "version": 3,
-  "sources": ["../../node_modules/.pnpm/@jbrowse+bandage-core@12.4.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-5ORP7EFJ.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.4.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-JQVS4DRW.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.4.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-5OJZV6YT.js"],
+  "sources": ["../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-5ORP7EFJ.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-JQVS4DRW.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-5OJZV6YT.js"],
   "sourcesContent": ["import {\n  addTo\n} from \"./chunk-BSOZW3FC.js\";\nimport {\n  isBackbone\n} from \"./chunk-RJWPJCIB.js\";\nimport {\n  isGenericSample,\n  panSNContig,\n  panSNHaplotype,\n  panSNSample\n} from \"./chunk-2JL2JVZ2.js\";\n\n// src/reference.ts\nvar WELL_KNOWN_SAMPLES = /* @__PURE__ */ new Map([\n  [\"hg38\", \"GRCh38\"],\n  [\"hg19\", \"GRCh37\"],\n  [\"hs1\", \"CHM13\"],\n  [\"t2t-chm13\", \"CHM13\"],\n  [\"chm13v2\", \"CHM13\"]\n]);\nfunction wellKnownSample(assemblyName) {\n  return WELL_KNOWN_SAMPLES.get(assemblyName.toLowerCase());\n}\nfunction sampleOf(refName) {\n  const sample = refName.includes(\"#\") ? panSNSample(refName) : void 0;\n  return sample === void 0 || isGenericSample(sample) ? void 0 : sample;\n}\nfunction haplotypeOf(refName) {\n  return panSNHaplotype(refName) ?? panSNSample(refName);\n}\nfunction graphHaplotypes(graph) {\n  const refNames = new Set((graph.anchorPaths ?? []).map((p) => p.name));\n  for (const node of graph.nodes) {\n    if (node.stable) {\n      refNames.add(node.stable.refName);\n    }\n  }\n  const bySample = /* @__PURE__ */ new Map();\n  for (const refName of refNames) {\n    const sample = sampleOf(refName);\n    if (sample !== void 0) {\n      addTo(bySample, sample, haplotypeOf(refName));\n    }\n  }\n  return bySample;\n}\nfunction backboneFrom(contigs, haplotypes) {\n  const samples = new Set(contigs.map((c) => sampleOf(c.refName)));\n  const [sample] = samples;\n  if (samples.size !== 1 || sample === void 0) {\n    return { contigs, prefixes: [], named: false };\n  }\n  const own = new Set(contigs.map((c) => haplotypeOf(c.refName)));\n  const unique = [...haplotypes.get(sample) ?? []].every((h) => own.has(h));\n  const shared = new Set(contigs.map((c) => panSNHaplotype(c.refName)));\n  const [haplotype] = shared;\n  return {\n    contigs,\n    prefixes: [\n      ...unique ? [sample] : [],\n      ...shared.size === 1 && haplotype ? [haplotype] : []\n    ],\n    named: true\n  };\n}\nfunction graphBackbone(graph) {\n  const spans = /* @__PURE__ */ new Map();\n  for (const node of graph.nodes) {\n    if (isBackbone(node)) {\n      const { refName, start } = node.stable;\n      const end = start + node.length;\n      const span = spans.get(refName);\n      if (span) {\n        span.start = Math.min(span.start, start);\n        span.end = Math.max(span.end, end);\n      } else {\n        spans.set(refName, {\n          refName,\n          contig: panSNContig(refName),\n          start,\n          end\n        });\n      }\n    }\n  }\n  const contigs = [...spans.values()];\n  return contigs.length ? backboneFrom(contigs, graphHaplotypes(graph)) : void 0;\n}\nfunction referenceLabel(graph, region) {\n  const backbone = graphBackbone(graph);\n  const contig = region ? panSNContig(region.refName) : backbone?.contigs.length === 1 ? backbone.contigs[0].contig : void 0;\n  const sample = backbone?.named ? panSNSample(backbone.contigs[0].refName) : void 0;\n  return contig && (sample ? `${sample} ${contig}` : contig);\n}\nfunction backboneAssembly(backbone, assemblies) {\n  const names = (a) => [a.name, ...a.aliases ?? []];\n  const naming = (prefix) => (a) => names(a).some((n) => n.toLowerCase() === prefix.toLowerCase());\n  const prefixes = [...backbone?.prefixes ?? []].reverse();\n  const sample = backbone?.prefixes.find((p) => !p.includes(\"#\"))?.toLowerCase();\n  for (const prefix of prefixes) {\n    const assembly = assemblies.find(naming(prefix));\n    if (assembly) {\n      return assembly;\n    }\n  }\n  return sample === void 0 ? void 0 : assemblies.find(\n    (a) => names(a).some((n) => wellKnownSample(n)?.toLowerCase() === sample)\n  );\n}\nfunction assemblyWalk(graph, assembly) {\n  const haplotypes = graphHaplotypes(graph);\n  return graph.anchorPaths?.find(\n    (walk) => backboneAssembly(\n      backboneFrom(\n        [\n          {\n            refName: walk.name,\n            contig: panSNContig(walk.name),\n            start: walk.start,\n            end: walk.start + walk.length\n          }\n        ],\n        haplotypes\n      ),\n      [assembly]\n    )\n  );\n}\nfunction contigNames(contig) {\n  const bare = contig.replace(/^chr/i, \"\");\n  const forms = !bare ? [] : /^(M|MT)$/i.test(bare) ? [\"M\", \"MT\"] : [bare];\n  return [.../* @__PURE__ */ new Set([contig, ...forms.flatMap((f) => [f, `chr${f}`])])];\n}\nfunction refNameBinding(refNames, aliases = {}) {\n  const exact = new Set(refNames);\n  const byName = /* @__PURE__ */ new Map();\n  for (const refName of exact) {\n    const contig = panSNContig(refName);\n    const alias = aliases[contig];\n    for (const name of /* @__PURE__ */ new Set([\n      ...contigNames(contig),\n      ...alias ? [alias] : []\n    ])) {\n      byName.set(name, byName.has(name) ? void 0 : refName);\n    }\n  }\n  return (name) => exact.has(name) ? name : byName.get(name);\n}\nfunction featuresOnBackbone(features, backbone, aliases) {\n  const bind = refNameBinding(\n    backbone.contigs.map((c) => c.refName),\n    aliases\n  );\n  return features.flatMap((f) => {\n    const refName = bind(f.refName);\n    return refName === void 0 ? [] : [refName === f.refName ? f : { ...f, refName }];\n  });\n}\n\nexport {\n  WELL_KNOWN_SAMPLES,\n  wellKnownSample,\n  graphBackbone,\n  referenceLabel,\n  backboneAssembly,\n  assemblyWalk,\n  contigNames,\n  refNameBinding,\n  featuresOnBackbone\n};\n", "import {\n  END_STOP_TAG,\n  START_STOP_TAG,\n  StopColumns,\n  parseStopTag\n} from \"./chunk-VA5U4F23.js\";\nimport {\n  Column\n} from \"./chunk-BEUTROKU.js\";\n\n// src/gfa/gfaTables.ts\nvar GT = 62;\nvar LT = 60;\nvar TAB = 9;\nvar ZERO = 48;\nvar NINE = 57;\nvar TABLE_TAG = /^(?:LN:i|SN:Z|SO:i|SR:i):/;\nvar UNTABLED_RECORD = /^[PEOUFG]\\t/;\nvar trimCR = (line) => line.endsWith(\"\\r\") ? line.slice(0, -1) : line;\nfunction stepColumns() {\n  return {\n    nodes: new Column(new Int32Array(1 << 16)),\n    reversed: new Column(new Uint8Array(1 << 16))\n  };\n}\nvar SegmentIndex = class {\n  constructor() {\n    this.names = [];\n    this.byName = /* @__PURE__ */ new Map();\n    // ids that are plain decimal, so a walk step finds its segment without\n    // slicing a string out of the body\n    this.byNumber = /* @__PURE__ */ new Map();\n  }\n  has(name) {\n    return this.byName.has(name);\n  }\n  add(name) {\n    const i = this.names.length;\n    this.byName.set(name, i);\n    this.names.push(name);\n    const n = +name;\n    if (Number.isSafeInteger(n) && String(n) === name) {\n      this.byNumber.set(n, i);\n    }\n    return i;\n  }\n  of(name) {\n    return this.byName.get(name) ?? this.add(name);\n  }\n  ofNumber(n) {\n    return this.byNumber.get(n);\n  }\n};\nfunction readSegment(line) {\n  const [, name, sequence = \"*\", ...tags] = line.split(\"\t\");\n  if (!name || /^\\d+$/.test(sequence)) {\n    return void 0;\n  }\n  let length = sequence === \"*\" ? 0 : sequence.length;\n  let refName;\n  let start;\n  let rank;\n  for (const tag of tags) {\n    if (!TABLE_TAG.test(tag)) {\n      return void 0;\n    }\n    const value = tag.slice(5);\n    const key = tag.slice(0, 2);\n    if (key === \"LN\") {\n      length = +value;\n    } else if (key === \"SN\") {\n      refName = value;\n    } else if (key === \"SO\") {\n      start = +value;\n    } else {\n      rank = +value;\n    }\n  }\n  const stable = refName !== void 0 && start !== void 0 && rank !== void 0 ? { refName, start, rank } : void 0;\n  return { name, length, stable };\n}\nfunction readWalkBody(line, from, segments, steps) {\n  let reversed = 0;\n  let start = -1;\n  let value = 0;\n  let decimal = true;\n  const finish = (end) => {\n    if (start >= 0 && end > start) {\n      const node = decimal && end - start < 16 && (end - start === 1 || line.charCodeAt(start) !== ZERO) ? segments.ofNumber(value) : void 0;\n      steps.nodes.push(node ?? segments.of(line.slice(start, end)));\n      steps.reversed.push(reversed);\n    }\n  };\n  let i = from;\n  for (; i < line.length; i++) {\n    const ch = line.charCodeAt(i);\n    if (ch === GT || ch === LT) {\n      finish(i);\n      reversed = ch === LT ? 1 : 0;\n      start = i + 1;\n      value = 0;\n      decimal = true;\n    } else if (ch === TAB) {\n      break;\n    } else if (decimal && ch >= ZERO && ch <= NINE) {\n      value = value * 10 + ch - ZERO;\n    } else {\n      decimal = false;\n    }\n  }\n  finish(i);\n  return i;\n}\nfunction walkFields(line) {\n  const fields = [];\n  let at = 0;\n  while (fields.length < 6) {\n    const tab = line.indexOf(\"\t\", at);\n    if (tab === -1) {\n      return void 0;\n    }\n    fields.push(line.slice(at, tab));\n    at = tab + 1;\n  }\n  const [, sample, haplotype, contig, start, end] = fields;\n  return sample && haplotype && contig && start && end && at < line.length ? { sample, haplotype, contig, start, end, body: at } : void 0;\n}\nfunction gfaTables(text) {\n  const lines = text.split(\"\\n\");\n  const segments = new SegmentIndex();\n  const lengths = [];\n  const refs = [];\n  const starts = [];\n  const ranks = [];\n  const refNames = [];\n  const refIndex = /* @__PURE__ */ new Map();\n  for (const raw of lines) {\n    if (UNTABLED_RECORD.test(raw)) {\n      return void 0;\n    }\n    if (raw.startsWith(\"S\t\")) {\n      const s = readSegment(trimCR(raw));\n      if (!s || segments.has(s.name)) {\n        return void 0;\n      }\n      segments.add(s.name);\n      lengths.push(s.length);\n      let ref = -1;\n      if (s.stable) {\n        ref = refIndex.get(s.stable.refName) ?? refNames.length;\n        if (ref === refNames.length) {\n          refNames.push(s.stable.refName);\n          refIndex.set(s.stable.refName, ref);\n        }\n      }\n      refs.push(ref);\n      starts.push(s.stable?.start ?? 0);\n      ranks.push(s.stable?.rank ?? 0);\n    }\n  }\n  const from = [];\n  const to = [];\n  const strands = [];\n  const names = [];\n  const walkStarts = [];\n  const walkEnds = [];\n  const offsets = [0];\n  const steps = stepColumns();\n  const before = new StopColumns();\n  const after = new StopColumns();\n  for (const raw of lines) {\n    if (raw.startsWith(\"L\t\")) {\n      const [, source, strand1, target, strand2] = trimCR(raw).split(\"\t\");\n      if (source && target && strand2) {\n        from.push(segments.of(source));\n        to.push(segments.of(target));\n        strands.push((strand1 === \"-\" ? 1 : 0) | (strand2 === \"-\" ? 2 : 0));\n      }\n    } else if (raw.startsWith(\"W\t\")) {\n      const line = trimCR(raw);\n      const w = walkFields(line);\n      if (w) {\n        names.push(`${w.sample}#${w.haplotype}#${w.contig}`);\n        walkStarts.push(w.start === \"*\" ? 0 : +w.start);\n        walkEnds.push(w.end === \"*\" ? -1 : +w.end);\n        const end = readWalkBody(line, w.body, segments, steps);\n        const tags = walkTags(line, end);\n        if (tags === void 0) {\n          return void 0;\n        }\n        if (tags.before) {\n          before.push(tags.before);\n        }\n        if (tags.after) {\n          after.push(tags.after);\n        }\n        if (steps.nodes.length === offsets.at(-1)) {\n          return void 0;\n        }\n        offsets.push(steps.nodes.length);\n      }\n    }\n  }\n  if ([before.kinds.length, after.kinds.length].some(\n    (n) => n > 0 && n < names.length\n  )) {\n    return void 0;\n  }\n  return {\n    nodes: {\n      names: segments.names,\n      lengths: Int32Array.from(lengths),\n      refs: Int32Array.from(refs),\n      starts: Float64Array.from(starts),\n      ranks: Int32Array.from(ranks),\n      refNames\n    },\n    links: {\n      from: Int32Array.from(from),\n      to: Int32Array.from(to),\n      strands: Uint8Array.from(strands)\n    },\n    walks: {\n      names,\n      starts: Float64Array.from(walkStarts),\n      ends: Float64Array.from(walkEnds),\n      offsets: Int32Array.from(offsets),\n      steps: steps.nodes.data.slice(0, steps.nodes.length),\n      reversed: steps.reversed.data.slice(0, steps.reversed.length),\n      ...stopColumns(names.length, before, after)\n    }\n  };\n}\nfunction walkTags(line, from) {\n  const out = {};\n  for (const tag of from < line.length ? line.slice(from + 1).split(\"\t\") : []) {\n    const value = tag.slice(5);\n    if (tag.startsWith(`${START_STOP_TAG}:Z:`)) {\n      out.before = parseStopTag(value);\n      if (!out.before) {\n        return void 0;\n      }\n    } else if (tag.startsWith(`${END_STOP_TAG}:Z:`)) {\n      out.after = parseStopTag(value);\n      if (!out.after) {\n        return void 0;\n      }\n    }\n  }\n  return out;\n}\nfunction stopColumns(walks, before, after) {\n  return {\n    ...before.kinds.length === walks && walks > 0 ? { before: before.table() } : {},\n    ...after.kinds.length === walks && walks > 0 ? { after: after.table() } : {}\n  };\n}\n\nexport {\n  gfaTables\n};\n", "// src/gaf/parseGaf.ts\nvar STEP = /([><])([^><]+)/g;\nfunction parseGafPath(column) {\n  if (!column.startsWith(\">\") && !column.startsWith(\"<\")) {\n    return void 0;\n  }\n  const steps = [];\n  for (const [, arrow, name] of column.matchAll(STEP)) {\n    steps.push({ name, strand: arrow === \">\" ? \"+\" : \"-\" });\n  }\n  return steps;\n}\nfunction parseGafLine(text) {\n  const line = text.trimEnd();\n  const columns = line.split(\"\t\");\n  if (columns.length < 12 || line.startsWith(\"#\")) {\n    return void 0;\n  }\n  const path = parseGafPath(columns[5]);\n  if (!path) {\n    return void 0;\n  }\n  let cs;\n  let secondary = false;\n  for (let i = 12; i < columns.length; i++) {\n    const tag = columns[i];\n    if (tag.startsWith(\"cs:Z:\")) {\n      cs = tag.slice(5);\n    } else if (tag === \"tp:A:S\") {\n      secondary = true;\n    }\n  }\n  return {\n    name: columns[0],\n    queryLength: +columns[1],\n    queryStart: +columns[2],\n    queryEnd: +columns[3],\n    strand: columns[4] === \"-\" ? \"-\" : \"+\",\n    path,\n    pathLength: +columns[6],\n    pathStart: +columns[7],\n    pathEnd: +columns[8],\n    matches: +columns[9],\n    blockLength: +columns[10],\n    mappingQuality: +columns[11],\n    secondary,\n    ...cs === void 0 ? {} : { cs }\n  };\n}\nfunction parseGaf(text) {\n  const records = [];\n  for (const line of text.split(\"\\n\")) {\n    const record = parseGafLine(line);\n    if (record) {\n      records.push(record);\n    }\n  }\n  return records;\n}\nvar CS_OP = /:(\\d+)|=([A-Za-z]+)|\\*[a-zA-Z]([a-zA-Z])|\\+([A-Za-z]+)|-([A-Za-z]+)|~[a-z]{2}(\\d+)[a-z]{2}/g;\nfunction parseCs(cs) {\n  const ops = [];\n  for (const m of cs.matchAll(CS_OP)) {\n    if (m[1] !== void 0) {\n      ops.push({ op: \"match\", length: +m[1] });\n    } else if (m[2] !== void 0) {\n      ops.push({ op: \"match\", length: m[2].length });\n    } else if (m[3] !== void 0) {\n      ops.push({ op: \"substitution\", seq: m[3].toUpperCase() });\n    } else if (m[4] !== void 0) {\n      ops.push({ op: \"insertion\", seq: m[4].toUpperCase() });\n    } else if (m[5] !== void 0) {\n      ops.push({ op: \"deletion\", length: m[5].length });\n    } else if (m[6] !== void 0) {\n      ops.push({ op: \"match\", length: +m[6] });\n    }\n  }\n  return ops;\n}\n\nexport {\n  parseGafPath,\n  parseGafLine,\n  parseGaf,\n  parseCs\n};\n"],
   "mappings": "gLAcA,IAAIA,EAAqC,IAAI,IAAI,CAC/C,CAAC,OAAQ,QAAQ,EACjB,CAAC,OAAQ,QAAQ,EACjB,CAAC,MAAO,OAAO,EACf,CAAC,YAAa,OAAO,EACrB,CAAC,UAAW,OAAO,CACrB,CAAC,EACD,SAASC,EAAgBC,EAAc,CACrC,OAAOF,EAAmB,IAAIE,EAAa,YAAY,CAAC,CAC1D,CACA,SAASC,EAASC,EAAS,CACzB,IAAMC,EAASD,EAAQ,SAAS,GAAG,EAAIE,EAAYF,CAAO,EAAI,OAC9D,OAAOC,IAAW,QAAUE,EAAgBF,CAAM,EAAI,OAASA,CACjE,CACA,SAASG,EAAYJ,EAAS,CAC5B,OAAOK,EAAeL,CAAO,GAAKE,EAAYF,CAAO,CACvD,CACA,SAASM,EAAgBC,EAAO,CAC9B,IAAMC,EAAW,IAAI,KAAKD,EAAM,aAAe,CAAC,GAAG,IAAKE,GAAMA,EAAE,IAAI,CAAC,EACrE,QAAWC,KAAQH,EAAM,MACnBG,EAAK,QACPF,EAAS,IAAIE,EAAK,OAAO,OAAO,EAGpC,IAAMC,EAA2B,IAAI,IACrC,QAAWX,KAAWQ,EAAU,CAC9B,IAAMP,EAASF,EAASC,CAAO,EAC3BC,IAAW,QACbW,EAAMD,EAAUV,EAAQG,EAAYJ,CAAO,CAAC,CAEhD,CACA,OAAOW,CACT,CACA,SAASE,EAAaC,EAASC,EAAY,CACzC,IAAMC,EAAU,IAAI,IAAIF,EAAQ,IAAKG,GAAMlB,EAASkB,EAAE,OAAO,CAAC,CAAC,EACzD,CAAChB,CAAM,EAAIe,EACjB,GAAIA,EAAQ,OAAS,GAAKf,IAAW,OACnC,MAAO,CAAE,QAAAa,EAAS,SAAU,CAAC,EAAG,MAAO,EAAM,EAE/C,IAAMI,EAAM,IAAI,IAAIJ,EAAQ,IAAKG,GAAMb,EAAYa,EAAE,OAAO,CAAC,CAAC,EACxDE,EAAS,CAAC,GAAGJ,EAAW,IAAId,CAAM,GAAK,CAAC,CAAC,EAAE,MAAOmB,GAAMF,EAAI,IAAIE,CAAC,CAAC,EAClEC,EAAS,IAAI,IAAIP,EAAQ,IAAKG,GAAMZ,EAAeY,EAAE,OAAO,CAAC,CAAC,EAC9D,CAACK,CAAS,EAAID,EACpB,MAAO,CACL,QAAAP,EACA,SAAU,CACR,GAAGK,EAAS,CAAClB,CAAM,EAAI,CAAC,EACxB,GAAGoB,EAAO,OAAS,GAAKC,EAAY,CAACA,CAAS,EAAI,CAAC,CACrD,EACA,MAAO,EACT,CACF,CACA,SAASC,EAAchB,EAAO,CAC5B,IAAMiB,EAAwB,IAAI,IAClC,QAAWd,KAAQH,EAAM,MACvB,GAAIkB,EAAWf,CAAI,EAAG,CACpB,GAAM,CAAE,QAAAV,EAAS,MAAA0B,CAAM,EAAIhB,EAAK,OAC1BiB,EAAMD,EAAQhB,EAAK,OACnBkB,EAAOJ,EAAM,IAAIxB,CAAO,EAC1B4B,GACFA,EAAK,MAAQ,KAAK,IAAIA,EAAK,MAAOF,CAAK,EACvCE,EAAK,IAAM,KAAK,IAAIA,EAAK,IAAKD,CAAG,GAEjCH,EAAM,IAAIxB,EAAS,CACjB,QAAAA,EACA,OAAQ6B,EAAY7B,CAAO,EAC3B,MAAA0B,EACA,IAAAC,CACF,CAAC,CAEL,CAEF,IAAMb,EAAU,CAAC,GAAGU,EAAM,OAAO,CAAC,EAClC,OAAOV,EAAQ,OAASD,EAAaC,EAASR,EAAgBC,CAAK,CAAC,EAAI,MAC1E,CACA,SAASuB,GAAevB,EAAOwB,EAAQ,CACrC,IAAMC,EAAWT,EAAchB,CAAK,EAC9B0B,EAASF,EAASF,EAAYE,EAAO,OAAO,EAAIC,GAAU,QAAQ,SAAW,EAAIA,EAAS,QAAQ,CAAC,EAAE,OAAS,OAC9G/B,EAAS+B,GAAU,MAAQ9B,EAAY8B,EAAS,QAAQ,CAAC,EAAE,OAAO,EAAI,OAC5E,OAAOC,IAAWhC,EAAS,GAAGA,CAAM,IAAIgC,CAAM,GAAKA,EACrD,CACA,SAASC,EAAiBF,EAAUG,EAAY,CAC9C,IAAMC,EAAS,GAAM,CAAC,EAAE,KAAM,GAAG,EAAE,SAAW,CAAC,CAAC,EAC1CC,EAAUC,GAAYC,GAAMH,EAAMG,CAAC,EAAE,KAAMC,GAAMA,EAAE,YAAY,IAAMF,EAAO,YAAY,CAAC,EACzFG,EAAW,CAAC,GAAGT,GAAU,UAAY,CAAC,CAAC,EAAE,QAAQ,EACjD/B,EAAS+B,GAAU,SAAS,KAAMvB,GAAM,CAACA,EAAE,SAAS,GAAG,CAAC,GAAG,YAAY,EAC7E,QAAW6B,KAAUG,EAAU,CAC7B,IAAMC,EAAWP,EAAW,KAAKE,EAAOC,CAAM,CAAC,EAC/C,GAAII,EACF,OAAOA,CAEX,CACA,OAAOzC,IAAW,OAAS,OAASkC,EAAW,KAC5C,GAAMC,EAAM,CAAC,EAAE,KAAMI,GAAM3C,EAAgB2C,CAAC,GAAG,YAAY,IAAMvC,CAAM,CAC1E,CACF,CACA,SAAS0C,GAAapC,EAAOmC,EAAU,CACrC,IAAM3B,EAAaT,EAAgBC,CAAK,EACxC,OAAOA,EAAM,aAAa,KACvBqC,GAASV,EACRrB,EACE,CACE,CACE,QAAS+B,EAAK,KACd,OAAQf,EAAYe,EAAK,IAAI,EAC7B,MAAOA,EAAK,MACZ,IAAKA,EAAK,MAAQA,EAAK,MACzB,CACF,EACA7B,CACF,EACA,CAAC2B,CAAQ,CACX,CACF,CACF,CACA,SAASG,EAAYZ,EAAQ,CAC3B,IAAMa,EAAOb,EAAO,QAAQ,QAAS,EAAE,EACjCc,EAASD,EAAY,YAAY,KAAKA,CAAI,EAAI,CAAC,IAAK,IAAI,EAAI,CAACA,CAAI,EAAjD,CAAC,EACvB,MAAO,CAAC,GAAmB,IAAI,IAAI,CAACb,EAAQ,GAAGc,EAAM,QAASC,GAAM,CAACA,EAAG,MAAMA,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CACvF,CACA,SAASC,EAAezC,EAAU0C,EAAU,CAAC,EAAG,CAC9C,IAAMC,EAAQ,IAAI,IAAI3C,CAAQ,EACxB4C,EAAyB,IAAI,IACnC,QAAWpD,KAAWmD,EAAO,CAC3B,IAAMlB,EAASJ,EAAY7B,CAAO,EAC5BqD,EAAQH,EAAQjB,CAAM,EAC5B,QAAWqB,KAAwB,IAAI,IAAI,CACzC,GAAGT,EAAYZ,CAAM,EACrB,GAAGoB,EAAQ,CAACA,CAAK,EAAI,CAAC,CACxB,CAAC,EACCD,EAAO,IAAIE,EAAMF,EAAO,IAAIE,CAAI,EAAI,OAAStD,CAAO,CAExD,CACA,OAAQsD,GAASH,EAAM,IAAIG,CAAI,EAAIA,EAAOF,EAAO,IAAIE,CAAI,CAC3D,CACA,SAASC,GAAmBC,EAAUxB,EAAUkB,EAAS,CACvD,IAAMO,EAAOR,EACXjB,EAAS,QAAQ,IAAKf,GAAMA,EAAE,OAAO,EACrCiC,CACF,EACA,OAAOM,EAAS,QAASR,GAAM,CAC7B,IAAMhD,EAAUyD,EAAKT,EAAE,OAAO,EAC9B,OAAOhD,IAAY,OAAS,CAAC,EAAI,CAACA,IAAYgD,EAAE,QAAUA,EAAI,CAAE,GAAGA,EAAG,QAAAhD,CAAQ,CAAC,CACjF,CAAC,CACH,CCnJA,IAAI0D,EAAK,GACLC,EAAK,GACLC,EAAM,EACNC,EAAO,GACPC,EAAO,GACPC,EAAY,4BACZC,EAAkB,cAClBC,EAAUC,GAASA,EAAK,SAAS,IAAI,EAAIA,EAAK,MAAM,EAAG,EAAE,EAAIA,EACjE,SAASC,GAAc,CACrB,MAAO,CACL,MAAO,IAAIC,EAAO,IAAI,WAAW,KAAO,CAAC,EACzC,SAAU,IAAIA,EAAO,IAAI,WAAW,KAAO,CAAC,CAC9C,CACF,CACA,IAAIC,GAAe,KAAM,CACvB,aAAc,CACZ,KAAK,MAAQ,CAAC,EACd,KAAK,OAAyB,IAAI,IAGlC,KAAK,SAA2B,IAAI,GACtC,CACA,IAAIC,EAAM,CACR,OAAO,KAAK,OAAO,IAAIA,CAAI,CAC7B,CACA,IAAIA,EAAM,CACR,IAAMC,EAAI,KAAK,MAAM,OACrB,KAAK,OAAO,IAAID,EAAMC,CAAC,EACvB,KAAK,MAAM,KAAKD,CAAI,EACpB,IAAME,EAAI,CAACF,EACX,OAAI,OAAO,cAAcE,CAAC,GAAK,OAAOA,CAAC,IAAMF,GAC3C,KAAK,SAAS,IAAIE,EAAGD,CAAC,EAEjBA,CACT,CACA,GAAGD,EAAM,CACP,OAAO,KAAK,OAAO,IAAIA,CAAI,GAAK,KAAK,IAAIA,CAAI,CAC/C,CACA,SAASE,EAAG,CACV,OAAO,KAAK,SAAS,IAAIA,CAAC,CAC5B,CACF,EACA,SAASC,GAAYP,EAAM,CACzB,GAAM,CAAC,CAAEI,EAAMI,EAAW,IAAK,GAAGC,CAAI,EAAIT,EAAK,MAAM,GAAG,EACxD,GAAI,CAACI,GAAQ,QAAQ,KAAKI,CAAQ,EAChC,OAEF,IAAIE,EAASF,IAAa,IAAM,EAAIA,EAAS,OACzCG,EACAC,EACAC,EACJ,QAAWC,KAAOL,EAAM,CACtB,GAAI,CAACZ,EAAU,KAAKiB,CAAG,EACrB,OAEF,IAAMC,EAAQD,EAAI,MAAM,CAAC,EACnBE,EAAMF,EAAI,MAAM,EAAG,CAAC,EACtBE,IAAQ,KACVN,EAAS,CAACK,EACDC,IAAQ,KACjBL,EAAUI,EACDC,IAAQ,KACjBJ,EAAQ,CAACG,EAETF,EAAO,CAACE,CAEZ,CAEA,MAAO,CAAE,KAAAX,EAAM,OAAAM,EAAQ,OADRC,IAAY,QAAUC,IAAU,QAAUC,IAAS,OAAS,CAAE,QAAAF,EAAS,MAAAC,EAAO,KAAAC,CAAK,EAAI,MACxE,CAChC,CACA,SAASI,GAAajB,EAAMkB,EAAMC,EAAUC,EAAO,CACjD,IAAIC,EAAW,EACXT,EAAQ,GACRG,EAAQ,EACRO,EAAU,GACRC,EAAUC,GAAQ,CACtB,GAAIZ,GAAS,GAAKY,EAAMZ,EAAO,CAC7B,IAAMa,EAAOH,GAAWE,EAAMZ,EAAQ,KAAOY,EAAMZ,IAAU,GAAKZ,EAAK,WAAWY,CAAK,IAAMjB,GAAQwB,EAAS,SAASJ,CAAK,EAAI,OAChIK,EAAM,MAAM,KAAKK,GAAQN,EAAS,GAAGnB,EAAK,MAAMY,EAAOY,CAAG,CAAC,CAAC,EAC5DJ,EAAM,SAAS,KAAKC,CAAQ,CAC9B,CACF,EACIhB,EAAIa,EACR,KAAOb,EAAIL,EAAK,OAAQK,IAAK,CAC3B,IAAMqB,EAAK1B,EAAK,WAAWK,CAAC,EAC5B,GAAIqB,IAAOlC,GAAMkC,IAAOjC,EACtB8B,EAAOlB,CAAC,EACRgB,EAAWK,IAAOjC,EAAK,EAAI,EAC3BmB,EAAQP,EAAI,EACZU,EAAQ,EACRO,EAAU,OACL,IAAII,IAAOhC,EAChB,MACS4B,GAAWI,GAAM/B,GAAQ+B,GAAM9B,EACxCmB,EAAQA,EAAQ,GAAKW,EAAK/B,EAE1B2B,EAAU,GAEd,CACA,OAAAC,EAAOlB,CAAC,EACDA,CACT,CACA,SAASsB,GAAW3B,EAAM,CACxB,IAAM4B,EAAS,CAAC,EACZC,EAAK,EACT,KAAOD,EAAO,OAAS,GAAG,CACxB,IAAME,EAAM9B,EAAK,QAAQ,IAAK6B,CAAE,EAChC,GAAIC,IAAQ,GACV,OAEFF,EAAO,KAAK5B,EAAK,MAAM6B,EAAIC,CAAG,CAAC,EAC/BD,EAAKC,EAAM,CACb,CACA,GAAM,CAAC,CAAEC,EAAQC,EAAWC,EAAQrB,EAAOY,CAAG,EAAII,EAClD,OAAOG,GAAUC,GAAaC,GAAUrB,GAASY,GAAOK,EAAK7B,EAAK,OAAS,CAAE,OAAA+B,EAAQ,UAAAC,EAAW,OAAAC,EAAQ,MAAArB,EAAO,IAAAY,EAAK,KAAMK,CAAG,EAAI,MACnI,CACA,SAASK,GAAUC,EAAM,CACvB,IAAMC,EAAQD,EAAK,MAAM;AAAA,CAAI,EACvBhB,EAAW,IAAIhB,GACfkC,EAAU,CAAC,EACXC,EAAO,CAAC,EACRC,EAAS,CAAC,EACVC,EAAQ,CAAC,EACTC,EAAW,CAAC,EACZC,EAA2B,IAAI,IACrC,QAAWC,KAAOP,EAAO,CACvB,GAAItC,EAAgB,KAAK6C,CAAG,EAC1B,OAEF,GAAIA,EAAI,WAAW,IAAI,EAAG,CACxB,IAAMC,EAAIrC,GAAYR,EAAO4C,CAAG,CAAC,EACjC,GAAI,CAACC,GAAKzB,EAAS,IAAIyB,EAAE,IAAI,EAC3B,OAEFzB,EAAS,IAAIyB,EAAE,IAAI,EACnBP,EAAQ,KAAKO,EAAE,MAAM,EACrB,IAAIC,EAAM,GACND,EAAE,SACJC,EAAMH,EAAS,IAAIE,EAAE,OAAO,OAAO,GAAKH,EAAS,OAC7CI,IAAQJ,EAAS,SACnBA,EAAS,KAAKG,EAAE,OAAO,OAAO,EAC9BF,EAAS,IAAIE,EAAE,OAAO,QAASC,CAAG,IAGtCP,EAAK,KAAKO,CAAG,EACbN,EAAO,KAAKK,EAAE,QAAQ,OAAS,CAAC,EAChCJ,EAAM,KAAKI,EAAE,QAAQ,MAAQ,CAAC,CAChC,CACF,CACA,IAAM1B,EAAO,CAAC,EACR4B,EAAK,CAAC,EACNC,EAAU,CAAC,EACXC,EAAQ,CAAC,EACTC,EAAa,CAAC,EACdC,EAAW,CAAC,EACZC,EAAU,CAAC,CAAC,EACZ/B,EAAQnB,EAAY,EACpBmD,EAAS,IAAIC,EACbC,EAAQ,IAAID,EAClB,QAAWV,KAAOP,EAChB,GAAIO,EAAI,WAAW,IAAI,EAAG,CACxB,GAAM,CAAC,CAAEY,EAAQC,EAASC,EAAQC,CAAO,EAAI3D,EAAO4C,CAAG,EAAE,MAAM,GAAG,EAC9DY,GAAUE,GAAUC,IACtBxC,EAAK,KAAKC,EAAS,GAAGoC,CAAM,CAAC,EAC7BT,EAAG,KAAK3B,EAAS,GAAGsC,CAAM,CAAC,EAC3BV,EAAQ,MAAMS,IAAY,IAAM,EAAI,IAAME,IAAY,IAAM,EAAI,EAAE,EAEtE,SAAWf,EAAI,WAAW,IAAI,EAAG,CAC/B,IAAM3C,EAAOD,EAAO4C,CAAG,EACjBgB,EAAIhC,GAAW3B,CAAI,EACzB,GAAI2D,EAAG,CACLX,EAAM,KAAK,GAAGW,EAAE,MAAM,IAAIA,EAAE,SAAS,IAAIA,EAAE,MAAM,EAAE,EACnDV,EAAW,KAAKU,EAAE,QAAU,IAAM,EAAI,CAACA,EAAE,KAAK,EAC9CT,EAAS,KAAKS,EAAE,MAAQ,IAAM,GAAK,CAACA,EAAE,GAAG,EACzC,IAAMnC,EAAMP,GAAajB,EAAM2D,EAAE,KAAMxC,EAAUC,CAAK,EAChDX,EAAOmD,GAAS5D,EAAMwB,CAAG,EAU/B,GATIf,IAAS,SAGTA,EAAK,QACP2C,EAAO,KAAK3C,EAAK,MAAM,EAErBA,EAAK,OACP6C,EAAM,KAAK7C,EAAK,KAAK,EAEnBW,EAAM,MAAM,SAAW+B,EAAQ,GAAG,EAAE,GACtC,OAEFA,EAAQ,KAAK/B,EAAM,MAAM,MAAM,CACjC,CACF,CAEF,GAAI,EAACgC,EAAO,MAAM,OAAQE,EAAM,MAAM,MAAM,EAAE,KAC3ChD,GAAMA,EAAI,GAAKA,EAAI0C,EAAM,MAC5B,EAGA,MAAO,CACL,MAAO,CACL,MAAO7B,EAAS,MAChB,QAAS,WAAW,KAAKkB,CAAO,EAChC,KAAM,WAAW,KAAKC,CAAI,EAC1B,OAAQ,aAAa,KAAKC,CAAM,EAChC,MAAO,WAAW,KAAKC,CAAK,EAC5B,SAAAC,CACF,EACA,MAAO,CACL,KAAM,WAAW,KAAKvB,CAAI,EAC1B,GAAI,WAAW,KAAK4B,CAAE,EACtB,QAAS,WAAW,KAAKC,CAAO,CAClC,EACA,MAAO,CACL,MAAAC,EACA,OAAQ,aAAa,KAAKC,CAAU,EACpC,KAAM,aAAa,KAAKC,CAAQ,EAChC,QAAS,WAAW,KAAKC,CAAO,EAChC,MAAO/B,EAAM,MAAM,KAAK,MAAM,EAAGA,EAAM,MAAM,MAAM,EACnD,SAAUA,EAAM,SAAS,KAAK,MAAM,EAAGA,EAAM,SAAS,MAAM,EAC5D,GAAGyC,GAAYb,EAAM,OAAQI,EAAQE,CAAK,CAC5C,CACF,CACF,CACA,SAASM,GAAS5D,EAAMkB,EAAM,CAC5B,IAAM4C,EAAM,CAAC,EACb,QAAWhD,KAAOI,EAAOlB,EAAK,OAASA,EAAK,MAAMkB,EAAO,CAAC,EAAE,MAAM,GAAG,EAAI,CAAC,EAAG,CAC3E,IAAMH,EAAQD,EAAI,MAAM,CAAC,EACzB,GAAIA,EAAI,WAAW,GAAGiD,CAAc,KAAK,GAEvC,GADAD,EAAI,OAASE,EAAajD,CAAK,EAC3B,CAAC+C,EAAI,OACP,eAEOhD,EAAI,WAAW,GAAGmD,CAAY,KAAK,IAC5CH,EAAI,MAAQE,EAAajD,CAAK,EAC1B,CAAC+C,EAAI,OACP,MAGN,CACA,OAAOA,CACT,CACA,SAASD,GAAYK,EAAOd,EAAQE,EAAO,CACzC,MAAO,CACL,GAAGF,EAAO,MAAM,SAAWc,GAASA,EAAQ,EAAI,CAAE,OAAQd,EAAO,MAAM,CAAE,EAAI,CAAC,EAC9E,GAAGE,EAAM,MAAM,SAAWY,GAASA,EAAQ,EAAI,CAAE,MAAOZ,EAAM,MAAM,CAAE,EAAI,CAAC,CAC7E,CACF,CC/PA,IAAIa,GAAO,kBACX,SAASC,GAAaC,EAAQ,CAC5B,GAAI,CAACA,EAAO,WAAW,GAAG,GAAK,CAACA,EAAO,WAAW,GAAG,EACnD,OAEF,IAAMC,EAAQ,CAAC,EACf,OAAW,CAAC,CAAEC,EAAOC,CAAI,IAAKH,EAAO,SAASF,EAAI,EAChDG,EAAM,KAAK,CAAE,KAAAE,EAAM,OAAQD,IAAU,IAAM,IAAM,GAAI,CAAC,EAExD,OAAOD,CACT,CACA,SAASG,GAAaC,EAAM,CAC1B,IAAMC,EAAOD,EAAK,QAAQ,EACpBE,EAAUD,EAAK,MAAM,GAAG,EAC9B,GAAIC,EAAQ,OAAS,IAAMD,EAAK,WAAW,GAAG,EAC5C,OAEF,IAAME,EAAOT,GAAaQ,EAAQ,CAAC,CAAC,EACpC,GAAI,CAACC,EACH,OAEF,IAAIC,EACAC,EAAY,GAChB,QAASC,EAAI,GAAIA,EAAIJ,EAAQ,OAAQI,IAAK,CACxC,IAAMC,EAAML,EAAQI,CAAC,EACjBC,EAAI,WAAW,OAAO,EACxBH,EAAKG,EAAI,MAAM,CAAC,EACPA,IAAQ,WACjBF,EAAY,GAEhB,CACA,MAAO,CACL,KAAMH,EAAQ,CAAC,EACf,YAAa,CAACA,EAAQ,CAAC,EACvB,WAAY,CAACA,EAAQ,CAAC,EACtB,SAAU,CAACA,EAAQ,CAAC,EACpB,OAAQA,EAAQ,CAAC,IAAM,IAAM,IAAM,IACnC,KAAAC,EACA,WAAY,CAACD,EAAQ,CAAC,EACtB,UAAW,CAACA,EAAQ,CAAC,EACrB,QAAS,CAACA,EAAQ,CAAC,EACnB,QAAS,CAACA,EAAQ,CAAC,EACnB,YAAa,CAACA,EAAQ,EAAE,EACxB,eAAgB,CAACA,EAAQ,EAAE,EAC3B,UAAAG,EACA,GAAGD,IAAO,OAAS,CAAC,EAAI,CAAE,GAAAA,CAAG,CAC/B,CACF,CACA,SAASI,GAASR,EAAM,CACtB,IAAMS,EAAU,CAAC,EACjB,QAAWR,KAAQD,EAAK,MAAM;AAAA,CAAI,EAAG,CACnC,IAAMU,EAASX,GAAaE,CAAI,EAC5BS,GACFD,EAAQ,KAAKC,CAAM,CAEvB,CACA,OAAOD,CACT,CACA,IAAIE,GAAQ,8FACZ,SAASC,GAAQR,EAAI,CACnB,IAAMS,EAAM,CAAC,EACb,QAAWC,KAAKV,EAAG,SAASO,EAAK,EAC3BG,EAAE,CAAC,IAAM,OACXD,EAAI,KAAK,CAAE,GAAI,QAAS,OAAQ,CAACC,EAAE,CAAC,CAAE,CAAC,EAC9BA,EAAE,CAAC,IAAM,OAClBD,EAAI,KAAK,CAAE,GAAI,QAAS,OAAQC,EAAE,CAAC,EAAE,MAAO,CAAC,EACpCA,EAAE,CAAC,IAAM,OAClBD,EAAI,KAAK,CAAE,GAAI,eAAgB,IAAKC,EAAE,CAAC,EAAE,YAAY,CAAE,CAAC,EAC/CA,EAAE,CAAC,IAAM,OAClBD,EAAI,KAAK,CAAE,GAAI,YAAa,IAAKC,EAAE,CAAC,EAAE,YAAY,CAAE,CAAC,EAC5CA,EAAE,CAAC,IAAM,OAClBD,EAAI,KAAK,CAAE,GAAI,WAAY,OAAQC,EAAE,CAAC,EAAE,MAAO,CAAC,EACvCA,EAAE,CAAC,IAAM,QAClBD,EAAI,KAAK,CAAE,GAAI,QAAS,OAAQ,CAACC,EAAE,CAAC,CAAE,CAAC,EAG3C,OAAOD,CACT",
   "names": ["WELL_KNOWN_SAMPLES", "wellKnownSample", "assemblyName", "sampleOf", "refName", "sample", "panSNSample", "isGenericSample", "haplotypeOf", "panSNHaplotype", "graphHaplotypes", "graph", "refNames", "p", "node", "bySample", "addTo", "backboneFrom", "contigs", "haplotypes", "samples", "c", "own", "unique", "h", "shared", "haplotype", "graphBackbone", "spans", "isBackbone", "start", "end", "span", "panSNContig", "referenceLabel", "region", "backbone", "contig", "backboneAssembly", "assemblies", "names", "naming", "prefix", "a", "n", "prefixes", "assembly", "assemblyWalk", "walk", "contigNames", "bare", "forms", "f", "refNameBinding", "aliases", "exact", "byName", "alias", "name", "featuresOnBackbone", "features", "bind", "GT", "LT", "TAB", "ZERO", "NINE", "TABLE_TAG", "UNTABLED_RECORD", "trimCR", "line", "stepColumns", "Column", "SegmentIndex", "name", "i", "n", "readSegment", "sequence", "tags", "length", "refName", "start", "rank", "tag", "value", "key", "readWalkBody", "from", "segments", "steps", "reversed", "decimal", "finish", "end", "node", "ch", "walkFields", "fields", "at", "tab", "sample", "haplotype", "contig", "gfaTables", "text", "lines", "lengths", "refs", "starts", "ranks", "refNames", "refIndex", "raw", "s", "ref", "to", "strands", "names", "walkStarts", "walkEnds", "offsets", "before", "StopColumns", "after", "source", "strand1", "target", "strand2", "w", "walkTags", "stopColumns", "out", "START_STOP_TAG", "parseStopTag", "END_STOP_TAG", "walks", "STEP", "parseGafPath", "column", "steps", "arrow", "name", "parseGafLine", "text", "line", "columns", "path", "cs", "secondary", "i", "tag", "parseGaf", "records", "record", "CS_OP", "parseCs", "ops", "m"]

package/dist/chunks/{chunk-6NR64IXK.js → chunk-AK6XQ7XZ.js}

@@ -1,2 +1,2 @@
 var tt;function ut(){return tt??(tt=import("./bandage-layout-UZEOCKMS.js").then(o=>o.default()).catch(o=>{throw tt=void 0,o})),tt}async function dt(o){return(await ut()).computeLayout(o.graph,o.options)}var Bt="\0deletion:";var kt=25*Math.PI/180,Pt=.25,St=150,nn=[0,-.35,.35,-.7,.7,-1.05,1.05,-1.4,1.4],pt=[0,1];function _t(o){return o?0:1}function lt(o,t){let n=t.x-o.x,e=t.y-o.y,s=Math.hypot(n,e)||1;return{x:n/s,y:e/s}}function gt(o,t,n){return{x:o.x+(t.x-o.x)*n,y:o.y+(t.y-o.y)*n}}function Dt(o){let t=0,n=0;for(let e of o)t+=e.x,n+=e.y;return{x:t/o.length,y:n/o.length}}function Gt(o){let t=new Float64Array(o.length);for(let n=1;n<o.length;n++)t[n]=t[n-1]+Math.hypot(o[n].x-o[n-1].x,o[n].y-o[n-1].y);return t}function Ut(o){var t;return(t=Gt(o)[o.length-1])!==null&&t!==void 0?t:0}var at=new Map;function en(o){let t=at.get(o);if(t!==void 0)return t;let n=on(o);return at.size>1e4&&at.clear(),at.set(o,n),n}function on(o){let t=1e-6,n=2*Math.PI-1e-6;for(let e=0;e<60;e++){let s=(t+n)/2;s/(2*Math.sin(s/2))<o?t=s:n=s}return(t+n)/2}function sn(o,t){if(o<1e-9)return Math.PI*t;let n=(o*o/4+t*t)/(2*t),e=2*Math.asin(Math.min(1,o/(2*n)));return n*(t>n?2*Math.PI-e:e)}function mt(o,t,n,e){let s=t-2*n,i=o<1e-9?2*Math.PI:en(s/o),r=s/i,l=Math.cos(i/2),d=o/2,c=e+n-r*l;return{at:a=>{if(a<=n)return{u:0,v:e+a};if(a>=t-n)return{u:o,v:e+t-a};let h=(a-n)/r-i/2;return{u:d+r*Math.sin(h),v:c+r*Math.cos(h)}},apex:e+n+r*(1-l),length:t}}function It(o,t,n){if(!n)return o;let e=Math.cos(n),s=Math.sin(n);return{...o,at:i=>{let{u:r,v:l}=o.at(i),d=r-t/2;return{u:t/2+d*e-l*s,v:d*s+l*e}}}}function rn(o){for(let t=0;t<=32;t++)if(o.at(o.length*t/32).v<-1e-6)return!0;return!1}function Ot(o,t,n,e,s){return{at:i=>({u:o+n*i,v:t+e*i}),apex:t+Math.max(0,e)*s,length:s}}var ot=class{constructor(t,n,e=!1){var s;this.pts=t,this.normals=n,this.straight=e,this.arc=Gt(t),this.total=(s=this.arc[t.length-1])!==null&&s!==void 0?s:0}segment(t){let{arc:n}=this,e=1,s=n.length-1;for(;e<s;){let i=e+s>>1;n[i]<t?e=i+1:s=i}return e}fraction(t,n){let e=this.arc[t]-this.arc[t-1];return e>0?(n-this.arc[t-1])/e:0}pointAt(t){let{pts:n}=this,e=n.length-1;if(e===0)return{...n[0]};if(t<=0){let i=lt(n[0],n[1]);return{x:n[0].x+i.x*t,y:n[0].y+i.y*t}}if(t>=this.total){let i=lt(n[e-1],n[e]),r=t-this.total;return{x:n[e].x+i.x*r,y:n[e].y+i.y*r}}let s=this.segment(t);return gt(n[s-1],n[s],this.fraction(s,t))}normalAt(t){let{normals:n}=this;if(n.length===1||t<=0)return n[0];if(t>=this.total)return n[n.length-1];let e=this.segment(t),{x:s,y:i}=gt(n[e-1],n[e],this.fraction(e,t)),r=Math.hypot(s,i)||1;return{x:s/r,y:i/r}}};function an(o,t){let n=Dt(o);return o.map((e,s)=>{let i=lt(o[Math.max(0,s-1)],o[Math.min(o.length-1,s+1)]),r={x:-i.y,y:i.x},l=e.x-n.x,d=e.y-n.y,c=Math.hypot(l,d),a=r.x*l+r.y*d,h=t[s],f=c>1e-9&&Math.abs(a)>.3*c?Math.sign(a):Math.sign(r.x*h.x+r.y*h.y)||1;return{x:r.x*f,y:r.y*f}})}function xt(o,t,n,e,s){let i=Math.min(s,Math.max(e.length/24,.5)),r=[],l=[];for(let d=0;d<=e.length+1e-9;d+=i){let{u:c,v:a}=e.at(Math.min(d,e.length)),h=o.pointAt(t+c),f=o.normalAt(t+c),u=f.x*n,g=f.y*n;r.push({x:h.x+u*a,y:h.y+g*a}),l.push({x:u,y:g})}return{pts:r,refs:l}}var Ft=5,cn=10.5/2;function yt(o,t,n,e,s,i){let r=s,l=xt(o,t,n,e(r),i);if(o.straight)return l;for(let d=0;d<6;d++){let c=Ut(l.pts);if(!(c>0)||Math.abs(c/s-1)<.001)break;r*=s/c,l=xt(o,t,n,e(r),i)}return l}function ct(o,t){return Array.from({length:t},(n,e)=>o+e*15/2)}function Tt(o){if(o.length===0)return 1/0;let t=1/0,n=-1/0;for(let e of o)t=Math.min(t,e.point.x),n=Math.max(n,e.point.x);return n-t}function Rt(o,t){return o*73856093^t*19349663}var ht=class{constructor(t){this.c=t,this.grid=new Map;let{ids:n,first:e,count:s,per:i,seedX:r,seedY:l,backbone:d}=t,c=n.length;this.points=Array.from({length:c},()=>{}),this.params=Array.from({length:c},()=>{}),this.curves=Array.from({length:c},()=>{}),this.links=t.links.map((f,u)=>f.map(g=>g.filter(([M])=>M!==u))),this.route=n.map(f=>f.startsWith(Bt));let a=1/0,h=-1/0;for(let f=0;f<c;f++){let u=e[f];!d[u]||Number.isNaN(r[u])||(a=Math.min(a,r[u]),h=Math.max(h,r[u]+i[f]*(s[f]-1)))}this.backbone=new ot([{x:a,y:0},{x:h,y:0}],[{x:0,y:1},{x:0,y:1}],!0),this.backboneCentroid={x:(a+h)/2,y:0};for(let f=0;f<c;f++){let u=e[f];if(!d[u]||Number.isNaN(r[u]))continue;let g=[],M=[];for(let b=0;b<s[f];b++){let U=r[u]+b*i[f];g.push({x:U,y:l[u]}),M.push(U-a)}this.points[f]=g,this.params[f]=M,this.curves[f]=this.backbone,this.occupy(g,this.backbone)}}static hasBackbone(t){for(let n=0;n<t.ids.length;n++){let e=t.first[n];if(t.backbone[e]&&!Number.isNaN(t.seedX[e]))return!0}return!1}run(){let t=[];for(let e=0;e<this.points.length;e++)this.points[e]||t.push(e);let n=this.componentsOf(t).map(e=>({members:e,anchors:this.anchorsOf(e)})).filter(e=>e.anchors.length).map(e=>({members:e.members,span:Tt(e.anchors),drawn:e.members.reduce((s,i)=>s+this.drawn(i),0),feet:e.anchors.map(s=>`${s.point.x},${s.point.y}`).sort().join(" ")})).sort((e,s)=>e.span-s.span||(e.feet===s.feet?s.drawn-e.drawn:e.drawn-s.drawn));for(let e of n)this.placePiece(e.members,this.backboneCentroid)}write(t,n){let{first:e}=this.c;this.points.forEach((s,i)=>{s?.forEach((r,l)=>{t[e[i]+l]=r.x,n[e[i]+l]=r.y})})}drawn(t){return this.c.per[t]*(this.c.count[t]-1)}endIndex(t,n){return n?this.c.count[t]-1:0}occupy(t,n){for(let e of t){let s=Rt(Math.floor(e.x/10.5),Math.floor(e.y/10.5)),i=this.grid.get(s),r={x:e.x,y:e.y,curve:n};i?i.push(r):this.grid.set(s,[r])}}violations(t,n,e,s){var i;let r=0;for(let l of t){if(e.some(a=>Math.hypot(l.x-a.x,l.y-a.y)<15))continue;let d=Math.floor(l.x/10.5),c=Math.floor(l.y/10.5);for(let a=d-1;a<=d+1;a++)for(let h=c-1;h<=c+1;h++)for(let f of(i=this.grid.get(Rt(a,h)))!==null&&i!==void 0?i:[])if(f.curve!==n&&Math.hypot(l.x-f.x,l.y-f.y)<10.5&&(r++,r>=s))return r}return r}choose(t,n,e){let s,i=1/0;for(let r of t){let l=this.violations(r(cn).pts,n,e,i);if(l===0)return r(Ft);l<i&&(i=l,s=r)}return s(Ft)}anchorsOf(t){let n=new Set(t),e=[];for(let s of t)for(let i of pt)for(let[r,l]of this.links[s][i]){let d=this.points[r];if(n.has(r)||!d)continue;let c=this.endIndex(r,l);e.push({u:s,uSide:i,v:r,vSide:l,point:d[c],curve:this.curves[r],t:this.params[r][c]})}return e}componentsOf(t){let n=new Set(t),e=new Set,s=[];for(let i of t){if(e.has(i))continue;let r=[i];e.add(i);for(let l of r)for(let d of pt)for(let[c]of this.links[l][d])n.has(c)&&!e.has(c)&&(e.add(c),r.push(c));s.push(r)}return s}spinePath(t,n,e,s,i){let r=new Set(t),l=(u,g)=>u*2+g,d=(u,g)=>u===s&&_t(g)===i,c=new Map([[l(n,e),-1]]),a=[[n,e]],h=[n,e];for(let[u,g]of a){if(h=[u,g],s!==void 0&&d(u,g))break;for(let[M,b]of this.links[u][_t(g)])!r.has(M)||c.has(l(M,b))||(c.set(l(M,b),l(u,g)),a.push([M,b]))}if(s!==void 0&&!d(h[0],h[1]))return;let f=[];for(let u=l(h[0],h[1]);u!==-1;u=c.get(u))f.push({k:u>>1,enter:u&1});return f.reverse()}loosePath(t,n,e){let s=new Set(t),i=new Map([[n,-1]]),r=new Map([[n,0]]),l=[n];for(let c of l){if(c===e)break;for(let a of pt)for(let[h,f]of this.links[c][a])!s.has(h)||i.has(h)||(i.set(h,c),r.set(h,f),l.push(h))}let d=[];for(let c=e;c!==-1;c=i.get(c))d.push({k:c,enter:r.get(c)});return d.reverse()}spineLength(t){let{link:n}=this.c;return t.reduce((e,{k:s})=>e+this.drawn(s)+n,n)}layAlong(t,n,e,s){let{count:i,per:r,link:l}=this.c,d=e,c=[];for(let{k:a,enter:h}of t){let f=s??r[a],u=[],g=[];for(let M=0;M<i[a];M++)u.push(n.pointAt(d+M*f)),g.push(d+M*f);h===1&&(u.reverse(),g.reverse()),this.points[a]=u,this.params[a]=g,this.curves[a]=n,c.push(...u),d+=f*(i[a]-1)+l}return c}arcCandidates(t,n,e,s,i){let r=(i-s)/2-1e-6,l=i>2*s?nn:[0],d=[];for(let c of ct(0,8))for(let a of l)for(let h=0;h<=16;h++){let f=r*h/16,u=It(mt(s,i,f,c),s,a);h<16&&u.apex<12||rn(u)||d.push(g=>yt(t,n,e,M=>It(mt(s,M,Math.min(f,(M-s)/2-1e-6),c),s,a),i,g))}return d}placePiece(t,n){var e;let{count:s,link:i}=this.c,r=this.anchorsOf(t);if(r.length===0)return;let l=t.every(x=>this.route[x]),d=r.every(x=>x.curve===r[0].curve)?r[0].curve:void 0,c,a,h,f;if(d)r.sort((x,T)=>x.t-T.t),c=d,a=r[0].t,h=r[r.length-1].t,f=c===this.backbone&&l?-1:1;else{r.sort((q,Q)=>q.point.x-Q.point.x||q.point.y-Q.point.y);let x=r[0].point,T=r[r.length-1].point,W=Math.hypot(T.x-x.x,T.y-x.y),B=W>1e-9?lt(x,T):{x:1,y:0},D={x:-B.y,y:B.x},H=gt(x,T,.5);f=r.some(q=>q.curve===this.backbone)?(l?-1:1)*(Math.sign(D.y)||1):(H.x-n.x)*D.x+(H.y-n.y)*D.y>=0?1:-1,c=new ot([x,T],[D,D],!0),a=0,h=W}let u=r[0],g=r[r.length-1],M=h-a,b=r.length===1||u.u===g.u&&u.uSide===g.uSide&&M<1e-9,U=[u.point,g.point],v=x=>this.choose(x,d,U),N,y,L=i,w;if(b){N=this.spinePath(t,u.u,u.uSide);let x=this.spineLength(N),T=u.vSide?Math.max(0,s[u.v]-2):Math.min(1,s[u.v]-1),B=(u.t>=this.params[u.v][T]?1:-1)*Math.cos(kt),D=Math.sin(kt);y=v(ct(0,12).map(H=>q=>yt(c,a,f,Q=>Ot(0,H,B,D,Q),x,q)))}else{N=(e=this.spinePath(t,u.u,u.uSide,g.u,g.uSide))!==null&&e!==void 0?e:this.loosePath(t,u.u,g.u);let x=this.spineLength(N);if(l){let T=Math.max(12,Math.min(Pt*M,St));y=v(ct(T,12).map(B=>D=>xt(c,a,f,mt(M,sn(M,B),0,0),D)));let W=Ut(y.pts);w=Math.max(.001,(W-2*i)/(s[N[0].k]-1))}else if(x>M+1e-6)y=v(this.arcCandidates(c,a,f,M,x));else{let T=x-2*i,W=Math.max(12,Math.min(Pt*(M-T),St));y=v(ct(W,12).map(B=>D=>yt(c,a,f,H=>Ot(M/2-H/2,B,1,0,H),T,D))),L=0}}let E=new ot(y.pts,an(y.pts,y.refs)),O=this.layAlong(N,E,L,w);this.occupy(O,E);let _=Dt(O),R=t.filter(x=>!this.points[x]),F=this.componentsOf(R).map(x=>({members:x,span:Tt(this.anchorsOf(x))})).sort((x,T)=>x.span-T.span);for(let x of F)this.placePiece(x.members,_)}};function Mt(o){let t=new Float64Array(o.n).fill(NaN),n=new Float64Array(o.n).fill(NaN);if(ht.hasBackbone(o)){let e=new ht(o);e.run(),e.write(t,n)}return{X:t,Y:n}}var ln=[{walks:2,iterations:15},{walks:4,iterations:30},{walks:8,iterations:60},{walks:12,iterations:90},{walks:16,iterations:120}],hn=20,fn=3,wt=.3,un=2,dn=200,pn=.1,mn=.5,yn=o=>{var t;return((t=o.stable)===null||t===void 0?void 0:t.rank)===0};function Ht(o,t){let n=t.at(-1);return(o==="+"||o==="-")&&(n==="+"||n==="-")&&o!==n}function gn(o){let t=Math.imul(o,2654435761)>>>0||1;return()=>(t^=t<<13,t>>>=0,t^=t>>>17,t^=t<<5,t>>>=0,t/4294967296)}function z(o,t){return typeof o=="number"&&Number.isFinite(o)?o:t}function Nt(o,t){return Math.max(z(o.nodeLengthPerMegabase,1e3)*t/1e6,z(o.minimumNodeLength,1))}function Ct(o){let{nodes:t,edges:n}=o.graph,e=o.options,s=z(e.nodeSegmentLength,1),i=z(e.edgeLength,1),r=t.map(w=>w.id),l=new Int32Array(t.length),d=new Int32Array(t.length),c=new Float64Array(t.length),a=0;t.forEach((w,E)=>{let O=Nt(e,w.length),_=Math.max(1,Math.ceil(O/s));l[E]=a,d[E]=_+1,c[E]=O/_,a+=_+1});let h=new Int32Array(a),f=new Int32Array(a),u=new Float64Array(a).fill(NaN),g=new Float64Array(a).fill(NaN),M=new Uint8Array(a),b=Array.from({length:a},()=>[]);t.forEach((w,E)=>{let O=typeof w.x=="number"&&typeof w.y=="number",_=yn(w)?1:0;for(let R=0;R<d[E];R++){let F=l[E]+R;h[F]=E,f[F]=R,M[F]=_,O&&(u[F]=w.x+R*c[E],g[F]=w.y),R>0&&(b[F-1].push([F,c[E]]),b[F].push([F-1,c[E]]))}});let U=new Map(r.map((w,E)=>[w,E])),v=t.map(()=>[[],[]]);for(let w of n){let E=U.get(w.from),O=U.get(w.to);if(E===void 0||O===void 0||E===O&&d[E]<=2)continue;let _=Ht(w.fromStrand,w.from)?0:1,R=Ht(w.toStrand,w.to)?1:0,F=l[E]+(_?d[E]-1:0),x=l[O]+(R?d[O]-1:0);b[F].push([x,i]),b[x].push([F,i]),v[E][_].push([O,R]),v[O][R].push([E,_])}let N=new Int32Array(a+1);for(let w=0;w<a;w++)N[w+1]=N[w]+b[w].length;let y=new Int32Array(N[a]),L=new Float64Array(N[a]);for(let w=0;w<a;w++)b[w].forEach(([E,O],_)=>{y[N[w]+_]=E,L[N[w]+_]=O});return{ids:r,first:l,count:d,per:c,links:v,chainOf:h,indexOf:f,seedX:u,seedY:g,backbone:M,off:N,nb:y,wt:L,n:a,link:i}}function xn(o){let{n:t,off:n,nb:e}=o,s=new Int32Array(t).fill(-1),i=[];for(let r=0;r<t;r++){if(s[r]>=0)continue;let l=[r];s[r]=i.length;for(let d of l)for(let c=n[d];c<n[d+1];c++){let a=e[c];s[a]<0&&(s[a]=i.length,l.push(a))}i.push(l)}return{comp:s,members:i}}function At(o,t={}){var n,e,s;let i=Ct(o),{n:r,off:l,nb:d,wt:c,seedX:a,seedY:h,first:f,count:u,per:g,link:M}=i,b=o.options,U=ln[Math.max(0,Math.min(4,z((n=t.quality)!==null&&n!==void 0?n:b.quality,2)))],v=z((e=t.componentSeparation)!==null&&e!==void 0?e:b.componentSeparation,15),N=gn(z((s=t.seed)!==null&&s!==void 0?s:b.seed,1)),y=new Float64Array(r),L=new Float64Array(r),w={};if(r===0)return{nodePositions:w};let{comp:E,members:O}=xn(i),_=1/0,R=0;for(let p=0;p<d.length;p++)_=Math.min(_,c[p]),R+=c[p];R/=2;let F=!1;for(let p=0;p<r;p++)if(!Number.isNaN(a[p])){F=!0;break}let x=F?Mt(i):void 0,T=Math.sqrt(r)*20;for(let p=0;p<r;p++)x&&!Number.isNaN(x.X[p])?(y[p]=x.X[p],L[p]=x.Y[p]):F&&!Number.isNaN(a[p])?(y[p]=a[p]+N()-.5,L[p]=h[p]+N()-.5):(y[p]=N()*T,L[p]=N()*T);let W=O.map(p=>x!==void 0&&p.every(A=>!Number.isNaN(x.X[A]))),B=[],D=!0;for(let p=0;p<r;p++)W[E[p]]||(B.push(p),D&&(D=!Number.isNaN(a[p])));let H=Math.max(R/4,_*10),q=H*H,Q=pn*_*_,{walks:Jt,iterations:rt}=U,Qt=Math.log(q/Q)/Math.max(1,rt-1),bt=Math.log(_),Zt=Math.log(H),Lt=(p,A,m,k)=>{let S=k/(m*m);S>1&&(S=1);let P=y[p]-y[A],I=L[p]-L[A],V=Math.sqrt(P*P+I*I)||1e-9,G=S*(V-m)/(2*V),j=G*P,C=G*I;y[p]=y[p]-j,L[p]=L[p]-C,y[A]=y[A]+j,L[A]=L[A]+C},et=0,Yt=(p,A)=>{let m=i.chainOf[p],k=i.indexOf[p],S=N()<.5?-1:1,P=A;for(let I=0;I<dn;I++){let V=u[m],G=g[m],j=(S>0?V-1-k:k)*G;if(P<=j){let J=Math.round(P/G);return et=A-P+J*G,f[m]+k+S*J}P-=j;let C=i.links[m][S>0?1:0];if(C.length===0)return et=A-P,f[m]+(S>0?V-1:0);let[Y,$]=C[Math.floor(N()*C.length)];if(P-=M,m=Y,S=$===0?1:-1,k=$===0?0:u[Y]-1,P<=0)return et=A-P,f[m]+k}return-1},Et=(p,A)=>{for(let m=l[p];m<l[p+1];m++){let k=d[m];k>p&&Lt(p,k,c[m],A)}},Z=Int32Array.from(B),Xt=D?Math.floor(mn*rt):0;for(let p=B.length?Xt:rt;p<rt;p++){let A=q*Math.exp(-Qt*p);for(let m=Z.length-1;m>0;m--){let k=Math.floor(N()*(m+1)),S=Z[m];Z[m]=Z[k],Z[k]=S}for(let m of Z){Et(m,A);for(let k=0;k<Jt;k++){let S=Math.exp(bt+N()*(Zt-bt)),P=Yt(m,S);P>=0&&P!==m&&et>0&&Lt(m,P,et,A)}}}let K=fn*M,tn=(p,A)=>Math.floor(p/K)*73856093^Math.floor(A/K)*19349663;for(let p=0;p<(B.length?hn:0);p++){let A=new Map;for(let m of B){let k=tn(y[m],L[m]),S=A.get(k);S?S.push(m):A.set(k,[m])}for(let m of B){let k=Math.floor(y[m]/K),S=Math.floor(L[m]/K);for(let P=k-1;P<=k+1;P++)for(let I=S-1;I<=S+1;I++){let V=A.get(P*73856093^I*19349663);if(V)for(let G of V){if(G<=m)continue;let j=!1;for(let X=l[m];X<l[m+1];X++)if(d[X]===G){j=!0;break}if(j)continue;let C=y[m]-y[G],Y=L[m]-L[G],$=Math.sqrt(C*C+Y*Y);if($>=K)continue;let J,it;if($>1e-6){let X=wt*(K-$)/(2*$);J=X*C,it=X*Y}else J=wt*K*(N()-.5),it=wt*K*(N()-.5);y[m]=y[m]+J,L[m]=L[m]+it,y[G]=y[G]-J,L[G]=L[G]-it}}}for(let m of B)Et(m,1/0)}for(let p=0;p<u.length;p++){let A=f[p],m=u[p];if(!(m<3)){for(let k=0;k<un;k++){let S=y.slice(A,A+m),P=L.slice(A,A+m);for(let I=1;I+1<m;I++)y[A+I]=.5*S[I]+.25*(S[I-1]+S[I+1]),L[A+I]=.5*P[I]+.25*(P[I-1]+P[I+1])}Mn(y,L,A,m,g[p])}}Nn(E,O,y,L,F,v);for(let p=0;p<i.ids.length;p++){let A=[];for(let m=0;m<u[p];m++)A.push({x:y[f[p]+m],y:L[f[p]+m]});w[i.ids[p]]=A}return{nodePositions:w}}function Mn(o,t,n,e,s){wn(o,t,n,e,s*(e-1));let i=new Float64Array(e);for(let a=1;a<e;a++)i[a]=i[a-1]+Math.hypot(o[n+a]-o[n+a-1],t[n+a]-t[n+a-1]);if(!i[e-1])return;let r=i[e-1],l=o.slice(n,n+e),d=t.slice(n,n+e),c=1;for(let a=1;a+1<e;a++){let h=r*a/(e-1);for(;c<e-1&&i[c]<h;)c++;let f=i[c]-i[c-1],u=f>0?(h-i[c-1])/f:0;o[n+a]=l[c-1]+(l[c]-l[c-1])*u,t[n+a]=d[c-1]+(d[c]-d[c-1])*u}}function wn(o,t,n,e,s){let i=n+e-1,r=o[n],l=t[n],d=Math.hypot(o[i]-r,t[i]-l),c=d>1e-9?(o[i]-r)/d:1,a=d>1e-9?(t[i]-l)/d:0,h=new Float64Array(e),f=new Float64Array(e),u=!0;for(let v=0;v<e;v++){let N=o[n+v]-r,y=t[n+v]-l;h[v]=N*c+y*a,f[v]=y*c-N*a,u&&(u=Math.abs(f[v])<1e-6)}let g=v=>{let N=0;for(let y=1;y<e;y++)N+=Math.hypot(h[y]-h[y-1],v*(f[y]-f[y-1]));return N};if(u||g(1)>=s)return;let M=1,b=2;for(;g(b)<s&&b<1e6;)M=b,b*=2;for(let v=0;v<40;v++){let N=(M+b)/2;g(N)<s?M=N:b=N}let U=(M+b)/2;for(let v=1;v+1<e;v++)o[n+v]=r+h[v]*c-U*f[v]*a,t[n+v]=l+h[v]*a+U*f[v]*c}function Nn(o,t,n,e,s,i){if(!s)for(let h of t)An(n,e,h);if(t.length<2)return;let r=new Float64Array(t.length).fill(1/0),l=new Float64Array(t.length).fill(1/0),d=new Float64Array(t.length).fill(-1/0);for(let h=0;h<n.length;h++){let f=o[h];r[f]=Math.min(r[f],n[h]),l[f]=Math.min(l[f],e[h]),d[f]=Math.max(d[f],e[h])}let c=new Float64Array(t.length),a=0;for(let h=0;h<t.length;h++)c[h]=a-l[h],a+=d[h]-l[h]+i;for(let h=0;h<n.length;h++){let f=o[h];n[h]=n[h]-r[f],e[h]=e[h]+c[f]}}function An(o,t,n){if(n.length<3)return;let e=0,s=0;for(let h of n)e+=o[h],s+=t[h];e/=n.length,s/=n.length;let i=0,r=0,l=0;for(let h of n){let f=o[h]-e,u=t[h]-s;i+=f*f,r+=u*u,l+=f*u}let d=-.5*Math.atan2(2*l,i-r),c=Math.cos(d),a=Math.sin(d);for(let h of n){let f=o[h]-e,u=t[h]-s;o[h]=e+c*f-a*u,t[h]=s+a*f+c*u}}var Wt=[{value:"fmmm",label:"Bandage (FMMM)",description:"Bandage's force-directed layout: OGDF's fast multipole multilevel method, compiled to wasm."},{value:"stress",label:"Stress",description:"Plain JS: the reference drawn straight and each variant placed against it, an allele as a lens, a repeat loop as a ring, a deletion as an arch; stress by stochastic gradient descent for components with no reference."}],vn=Wt.map(o=>o.value);var bn=async o=>{let t=performance.now();return{result:o.options.engine==="stress"?At(o):await dt(o),duration:performance.now()-t}};var st=40,Kt=500,ft=5;function Ln(o,t){return Math.max(o.nodeLengthPerMegabase*t/1e6,o.minimumNodeLength)}function Vt(o,t=ft){let e=o.nodes.reduce((i,r)=>i+r.length,0)/1e6,s=Math.max(o.nodes.length*st,Kt);return{nodeLengthPerMegabase:e>0?s/e:1e4,minimumNodeLength:Math.max(ft,t),edgeLength:5,nodeSegmentLength:20}}var nt={power:1,effect:1};function jt(o){return o.power===1&&o.effect===1}function zt(o,t){let n=o.nodes.length,e=o.nodes.reduce((r,l)=>r+l.length,0),s=n>0?e/n:0,i=n>0?Math.max(n*st,Kt)/n:st;return r=>{if(s<=0)return i;let l=(r/s)**t.power;return Math.max(i*((l-1)*t.effect+1),ft)}}var qt=1e3,$t={law:nt,minNodeLength:0};function Qn(o,t=$t){let{law:n,minNodeLength:e}=t,s=Vt(o,e);if(jt(n))return{nodes:o.nodes,opts:s};let i=zt(o,n);return{nodes:o.nodes.map(r=>({...r,length:Math.round(i(r.length)*qt)})),opts:{...s,nodeLengthPerMegabase:1e6/qt,minimumNodeLength:ft}}}function Zn(o,t=$t){if(jt(t.law)){let n=Vt(o,t.minNodeLength);return e=>Ln(n,e)}return zt(o,t.law)}var vt=[{value:"auto",label:"Proportional",description:"Bandage's own scale: a node draws proportional to its length, so a 1 bp allele is a speck.",law:nt,minNodeFactor:0},{value:"open",label:"Open bubbles",description:"Give every allele a drawn length, so a bubble reads as two arms rather than a knot.",law:nt,minNodeFactor:2.5},{value:"wide",label:"Wide bubbles",description:"As open, spread further. Best on a window of a dozen bubbles.",law:nt,minNodeFactor:10},{value:"compress",label:"Compress lengths",description:"Pull the longest and shortest nodes towards the graph\u2019s mean, so a cut spanning kb and bp fits one pane.",law:{power:.5,effect:.5},minNodeFactor:0}],En=vt.map(o=>o.value);function kn(o){let t=vt.find(n=>n.value===o);return{law:t?.law??nt,minNodeLength:(t?.minNodeFactor??0)*st}}export{Bt as a,Wt as b,vn as c,bn as d,Ln as e,Qn as f,Zn as g,vt as h,En as i,kn as j};
-//# sourceMappingURL=chunk-6NR64IXK.js.map
+//# sourceMappingURL=chunk-AK6XQ7XZ.js.map

package/dist/chunks/{chunk-6NR64IXK.js.map → chunk-AK6XQ7XZ.js.map}

@@ -1,6 +1,6 @@
 {
   "version": 3,
-  "sources": ["../../node_modules/.pnpm/@jbrowse+graph-fmmm-layout@1.0.2/node_modules/@jbrowse/graph-fmmm-layout/esm/loadFmmm.js", "../../node_modules/.pnpm/@jbrowse+graph-fmmm-layout@1.0.2/node_modules/@jbrowse/graph-fmmm-layout/esm/fmmmLayout.js", "../../node_modules/.pnpm/@jbrowse+graph-stress-layout@1.0.0/node_modules/@jbrowse/graph-stress-layout/esm/stressPlacement.js", "../../node_modules/.pnpm/@jbrowse+graph-stress-layout@1.0.0/node_modules/@jbrowse/graph-stress-layout/esm/stressEngine.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.4.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-CO6RGQAD.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.4.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-34BOZKIE.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.4.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-HKYXWZQS.js"],
+  "sources": ["../../node_modules/.pnpm/@jbrowse+graph-fmmm-layout@1.0.2/node_modules/@jbrowse/graph-fmmm-layout/esm/loadFmmm.js", "../../node_modules/.pnpm/@jbrowse+graph-fmmm-layout@1.0.2/node_modules/@jbrowse/graph-fmmm-layout/esm/fmmmLayout.js", "../../node_modules/.pnpm/@jbrowse+graph-stress-layout@1.0.0/node_modules/@jbrowse/graph-stress-layout/esm/stressPlacement.js", "../../node_modules/.pnpm/@jbrowse+graph-stress-layout@1.0.0/node_modules/@jbrowse/graph-stress-layout/esm/stressEngine.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-CO6RGQAD.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-34BOZKIE.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-HKYXWZQS.js"],
   "sourcesContent": ["let cached;\nexport function loadFmmm() {\n    cached !== null && cached !== void 0 ? cached : (cached = import('./bandage-layout.js')\n        .then(mod => mod.default())\n        .catch((e) => {\n        cached = undefined;\n        throw e;\n    }));\n    return cached;\n}\n", "import { loadFmmm } from \"./loadFmmm.js\";\nexport async function fmmmLayout(request) {\n    const engine = await loadFmmm();\n    return engine.computeLayout(request.graph, request.options);\n}\n", "// A node whose id starts with this is a deletion's route rather than sequence,\n// placed as an arch over the backbone.\nexport const ROUTE_ID = '\\u0000deletion:';\n// Where the stress engine starts an anchored graph. The backbone lies straight\n// along x at drawn length (its seeds). Every other node belongs to a piece: a\n// connected set of unplaced nodes, anchored where its links meet chains already\n// placed. A piece whose anchors sit on one placed curve is drawn in that\n// curve's frame (arc length along it, depth out of it): two anchors give a\n// spine along a circular arc of the piece's drawn length, a lens when it fits\n// its gap and a teardrop when longer, pushed out (legs, then a dropped chord,\n// then a tilt) until it clears what is drawn; a spine shorter than its gap is\n// a straight bar under it, hung deeper the wider the gap so its links leave\n// the lane; one anchor gives a straight tip. Anchors on\n// different curves use the chord between them. What a spine leaves unplaced\n// becomes pieces anchored on it, so nesting recurses. Deletion routes arch\n// above the backbone. Components with no backbone stay NaN for the engine's\n// random start.\nconst MIN_DEPTH = 12;\nconst LANE_GAP = 15;\nconst CLEAR = LANE_GAP * 0.7;\nconst TIP_ANGLE = (25 * Math.PI) / 180;\n// how deep a deletion arch rises, or a short bar hangs, per unit of its gap\nconst BOW = 0.25;\nconst BOW_CAP = 150;\n// a teardrop beside another leans away from it rather than dropping\nconst TEARDROP_TILTS = [0, -0.35, 0.35, -0.7, 0.7, -1.05, 1.05, -1.4, 1.4];\nconst SIDES = [0, 1];\nfunction other(side) {\n    return side ? 0 : 1;\n}\nfunction unit(a, b) {\n    const dx = b.x - a.x;\n    const dy = b.y - a.y;\n    const m = Math.hypot(dx, dy) || 1;\n    return { x: dx / m, y: dy / m };\n}\nfunction lerp(a, b, f) {\n    return { x: a.x + (b.x - a.x) * f, y: a.y + (b.y - a.y) * f };\n}\nfunction centroidOf(pts) {\n    let x = 0;\n    let y = 0;\n    for (const p of pts) {\n        x += p.x;\n        y += p.y;\n    }\n    return { x: x / pts.length, y: y / pts.length };\n}\nfunction arcLengths(pts) {\n    const arc = new Float64Array(pts.length);\n    for (let i = 1; i < pts.length; i++) {\n        arc[i] =\n            arc[i - 1] +\n                Math.hypot(pts[i].x - pts[i - 1].x, pts[i].y - pts[i - 1].y);\n    }\n    return arc;\n}\nfunction polylineLength(pts) {\n    var _a;\n    return (_a = arcLengths(pts)[pts.length - 1]) !== null && _a !== void 0 ? _a : 0;\n}\n// arc angle theta in (0, 2pi) with L/c = theta / (2 sin(theta/2)); a piece's\n// candidates ask for a handful of ratios hundreds of times\nconst arcAngles = new Map();\nfunction arcAngle(ratio) {\n    const known = arcAngles.get(ratio);\n    if (known !== undefined) {\n        return known;\n    }\n    const angle = solveArcAngle(ratio);\n    if (arcAngles.size > 10000) {\n        arcAngles.clear();\n    }\n    arcAngles.set(ratio, angle);\n    return angle;\n}\nfunction solveArcAngle(ratio) {\n    let lo = 1e-6;\n    let hi = 2 * Math.PI - 1e-6;\n    for (let i = 0; i < 60; i++) {\n        const mid = (lo + hi) / 2;\n        if (mid / (2 * Math.sin(mid / 2)) < ratio) {\n            lo = mid;\n        }\n        else {\n            hi = mid;\n        }\n    }\n    return (lo + hi) / 2;\n}\n// arc length of the circular arc with chord c and sagitta s\nfunction archLength(c, s) {\n    if (c < 1e-9) {\n        return Math.PI * s;\n    }\n    const R = ((c * c) / 4 + s * s) / (2 * s);\n    const theta = 2 * Math.asin(Math.min(1, c / (2 * R)));\n    return R * (s > R ? 2 * Math.PI - theta : theta);\n}\n// from (0, drop) to (c, drop) in `length`: legs of h along v joined by a\n// circular arc\nfunction arcFlat(c, length, h, drop) {\n    const arc = length - 2 * h;\n    const theta = c < 1e-9 ? 2 * Math.PI : arcAngle(arc / c);\n    const R = arc / theta;\n    const cos = Math.cos(theta / 2);\n    const cu = c / 2;\n    const cv = drop + h - R * cos;\n    return {\n        at: t => {\n            if (t <= h) {\n                return { u: 0, v: drop + t };\n            }\n            if (t >= length - h) {\n                return { u: c, v: drop + length - t };\n            }\n            const a = (t - h) / R - theta / 2;\n            return { u: cu + R * Math.sin(a), v: cv + R * Math.cos(a) };\n        },\n        apex: drop + h + R * (1 - cos),\n        length,\n    };\n}\n// The flat curve rotated about its chord's midpoint, which moves its feet\n// off the anchors by (c/2) sin(angle): one up, one down. A shear that kept\n// the feet swung a deep loop across its neighbours and raised link crossings\n// by half on the KIV-2 eight-haplotype cut.\nfunction tilted(flat, c, angle) {\n    if (!angle) {\n        return flat;\n    }\n    const cos = Math.cos(angle);\n    const sin = Math.sin(angle);\n    return {\n        ...flat,\n        at: t => {\n            const { u, v } = flat.at(t);\n            const du = u - c / 2;\n            return { u: c / 2 + du * cos - v * sin, v: du * sin + v * cos };\n        },\n    };\n}\n// whether any of the flat curve lies behind its frame: a loop's top poking\n// up through the reference line, which read as a glitch on every walk panel\nfunction behindFrame(flat) {\n    for (let i = 0; i <= 32; i++) {\n        if (flat.at((flat.length * i) / 32).v < -1e-6) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction lineFlat(u0, v0, du, dv, length) {\n    return {\n        at: t => ({ u: u0 + du * t, v: v0 + dv * t }),\n        apex: v0 + Math.max(0, dv) * length,\n        length,\n    };\n}\n// A placed curve: dense samples with cumulative arc length and outward normals.\nclass Curve {\n    constructor(pts, normals, straight = false) {\n        var _a;\n        this.pts = pts;\n        this.normals = normals;\n        this.straight = straight;\n        this.arc = arcLengths(pts);\n        this.total = (_a = this.arc[pts.length - 1]) !== null && _a !== void 0 ? _a : 0;\n    }\n    segment(t) {\n        const { arc } = this;\n        let lo = 1;\n        let hi = arc.length - 1;\n        while (lo < hi) {\n            const mid = (lo + hi) >> 1;\n            if (arc[mid] < t) {\n                lo = mid + 1;\n            }\n            else {\n                hi = mid;\n            }\n        }\n        return lo;\n    }\n    fraction(i, t) {\n        const span = this.arc[i] - this.arc[i - 1];\n        return span > 0 ? (t - this.arc[i - 1]) / span : 0;\n    }\n    pointAt(t) {\n        const { pts } = this;\n        const last = pts.length - 1;\n        if (last === 0) {\n            return { ...pts[0] };\n        }\n        if (t <= 0) {\n            const d = unit(pts[0], pts[1]);\n            return { x: pts[0].x + d.x * t, y: pts[0].y + d.y * t };\n        }\n        if (t >= this.total) {\n            const d = unit(pts[last - 1], pts[last]);\n            const r = t - this.total;\n            return { x: pts[last].x + d.x * r, y: pts[last].y + d.y * r };\n        }\n        const i = this.segment(t);\n        return lerp(pts[i - 1], pts[i], this.fraction(i, t));\n    }\n    normalAt(t) {\n        const { normals } = this;\n        if (normals.length === 1 || t <= 0) {\n            return normals[0];\n        }\n        if (t >= this.total) {\n            return normals[normals.length - 1];\n        }\n        const i = this.segment(t);\n        const { x, y } = lerp(normals[i - 1], normals[i], this.fraction(i, t));\n        const m = Math.hypot(x, y) || 1;\n        return { x: x / m, y: y / m };\n    }\n}\n// A polyline's outward normals: the perpendicular pointing away from its\n// centroid where the shape is fat enough to say, else the frame's own outward.\nfunction outwardNormals(pts, outRef) {\n    const centroid = centroidOf(pts);\n    return pts.map((p, i) => {\n        const t = unit(pts[Math.max(0, i - 1)], pts[Math.min(pts.length - 1, i + 1)]);\n        const n = { x: -t.y, y: t.x };\n        const rx = p.x - centroid.x;\n        const ry = p.y - centroid.y;\n        const rm = Math.hypot(rx, ry);\n        const dot = n.x * rx + n.y * ry;\n        const ref = outRef[i];\n        const sign = rm > 1e-9 && Math.abs(dot) > 0.3 * rm\n            ? Math.sign(dot)\n            : Math.sign(n.x * ref.x + n.y * ref.y) || 1;\n        return { x: n.x * sign, y: n.y * sign };\n    });\n}\n// the flat curve carried into the frame from arc length tA, outward by sign,\n// sampled every `step` at most\nfunction mapFlat(frame, tA, sign, flat, step) {\n    const ds = Math.min(step, Math.max(flat.length / 24, 0.5));\n    const pts = [];\n    const refs = [];\n    for (let t = 0; t <= flat.length + 1e-9; t += ds) {\n        const { u, v } = flat.at(Math.min(t, flat.length));\n        const q = frame.pointAt(tA + u);\n        const nr = frame.normalAt(tA + u);\n        const ox = nr.x * sign;\n        const oy = nr.y * sign;\n        pts.push({ x: q.x + ox * v, y: q.y + oy * v });\n        refs.push({ x: ox, y: oy });\n    }\n    return { pts, refs };\n}\nconst FINE_STEP = 5;\nconst COARSE_STEP = CLEAR / 2;\n// the flat curve whose image in a curved frame has the asked length, within\n// a tenth of a percent or six tries\nfunction fitted(frame, tA, sign, make, length, step) {\n    let flatLength = length;\n    let mapped = mapFlat(frame, tA, sign, make(flatLength), step);\n    if (frame.straight) {\n        return mapped;\n    }\n    for (let i = 0; i < 6; i++) {\n        const got = polylineLength(mapped.pts);\n        if (!(got > 0) || Math.abs(got / length - 1) < 1e-3) {\n            break;\n        }\n        flatLength *= length / got;\n        mapped = mapFlat(frame, tA, sign, make(flatLength), step);\n    }\n    return mapped;\n}\nfunction depths(from, n) {\n    return Array.from({ length: n }, (_, i) => from + (i * LANE_GAP) / 2);\n}\nfunction spanOf(anchors) {\n    if (anchors.length === 0) {\n        return Infinity;\n    }\n    let lo = Infinity;\n    let hi = -Infinity;\n    for (const a of anchors) {\n        lo = Math.min(lo, a.point.x);\n        hi = Math.max(hi, a.point.x);\n    }\n    return hi - lo;\n}\nfunction cellKey(gx, gy) {\n    return (gx * 73856093) ^ (gy * 19349663);\n}\nclass Placer {\n    constructor(c) {\n        this.c = c;\n        this.grid = new Map();\n        const { ids, first, count, per, seedX, seedY, backbone } = c;\n        const N = ids.length;\n        this.points = Array.from({ length: N }, () => undefined);\n        this.params = Array.from({ length: N }, () => undefined);\n        this.curves = Array.from({ length: N }, () => undefined);\n        this.links = c.links.map((sides, k) => sides.map(out => out.filter(([v]) => v !== k)));\n        this.route = ids.map(id => id.startsWith(ROUTE_ID));\n        let min = Infinity;\n        let max = -Infinity;\n        for (let k = 0; k < N; k++) {\n            const start = first[k];\n            if (!backbone[start] || Number.isNaN(seedX[start])) {\n                continue;\n            }\n            min = Math.min(min, seedX[start]);\n            max = Math.max(max, seedX[start] + per[k] * (count[k] - 1));\n        }\n        this.backbone = new Curve([\n            { x: min, y: 0 },\n            { x: max, y: 0 },\n        ], [\n            { x: 0, y: 1 },\n            { x: 0, y: 1 },\n        ], true);\n        this.backboneCentroid = { x: (min + max) / 2, y: 0 };\n        for (let k = 0; k < N; k++) {\n            const start = first[k];\n            if (!backbone[start] || Number.isNaN(seedX[start])) {\n                continue;\n            }\n            const pts = [];\n            const ts = [];\n            for (let i = 0; i < count[k]; i++) {\n                const x = seedX[start] + i * per[k];\n                pts.push({ x, y: seedY[start] });\n                ts.push(x - min);\n            }\n            this.points[k] = pts;\n            this.params[k] = ts;\n            this.curves[k] = this.backbone;\n            this.occupy(pts, this.backbone);\n        }\n    }\n    static hasBackbone(c) {\n        for (let k = 0; k < c.ids.length; k++) {\n            const start = c.first[k];\n            if (c.backbone[start] && !Number.isNaN(c.seedX[start])) {\n                return true;\n            }\n        }\n        return false;\n    }\n    run() {\n        const free = [];\n        for (let k = 0; k < this.points.length; k++) {\n            if (!this.points[k]) {\n                free.push(k);\n            }\n        }\n        // Narrow pieces first, short before long, except that pieces on the same\n        // feet go longest first so an inner loop nests inside the outer one rather\n        // than crossing it. A wide loop whose foot lies inside a narrower loop's\n        // disc still drives its leg through it; making the narrow loop yield and\n        // re-place after the wide one freed it but re-placed it as a hairpin on\n        // long legs, 243/411/13 to 229/459/21 link-node/link-link/node-node\n        // crossings on the KIV-2 eight-haplotype cut at twice the time, and\n        // leaning the re-placed loop by shear at 0.1-0.4 rad gave 310/480/25.\n        const pieces = this.componentsOf(free)\n            .map(members => ({ members, anchors: this.anchorsOf(members) }))\n            .filter(p => p.anchors.length)\n            .map(p => ({\n            members: p.members,\n            span: spanOf(p.anchors),\n            drawn: p.members.reduce((s, k) => s + this.drawn(k), 0),\n            feet: p.anchors\n                .map(a => `${a.point.x},${a.point.y}`)\n                .sort()\n                .join(' '),\n        }))\n            .sort((a, b) => a.span - b.span ||\n            (a.feet === b.feet ? b.drawn - a.drawn : a.drawn - b.drawn));\n        for (const p of pieces) {\n            this.placePiece(p.members, this.backboneCentroid);\n        }\n    }\n    write(X, Y) {\n        const { first } = this.c;\n        this.points.forEach((pts, k) => {\n            pts === null || pts === void 0 ? void 0 : pts.forEach((p, i) => {\n                X[first[k] + i] = p.x;\n                Y[first[k] + i] = p.y;\n            });\n        });\n    }\n    drawn(k) {\n        return this.c.per[k] * (this.c.count[k] - 1);\n    }\n    endIndex(k, side) {\n        return side ? this.c.count[k] - 1 : 0;\n    }\n    occupy(pts, curve) {\n        for (const p of pts) {\n            const key = cellKey(Math.floor(p.x / CLEAR), Math.floor(p.y / CLEAR));\n            const list = this.grid.get(key);\n            const occupant = { x: p.x, y: p.y, curve };\n            if (list) {\n                list.push(occupant);\n            }\n            else {\n                this.grid.set(key, [occupant]);\n            }\n        }\n    }\n    // placed points within CLEAR of the candidate, off the exempt curve and\n    // beyond a lane of the anchors, up to `limit`. Exempting two lanes let\n    // teardrops off adjacent anchors cross at the neck: 3 node crossings on the\n    // HPRC KIV-2 cut against 1, and 2 on MHC class II against 0.\n    violations(pts, exempt, anchorPts, limit) {\n        var _a;\n        let n = 0;\n        for (const p of pts) {\n            if (anchorPts.some(a => Math.hypot(p.x - a.x, p.y - a.y) < LANE_GAP)) {\n                continue;\n            }\n            const cx = Math.floor(p.x / CLEAR);\n            const cy = Math.floor(p.y / CLEAR);\n            for (let gx = cx - 1; gx <= cx + 1; gx++) {\n                for (let gy = cy - 1; gy <= cy + 1; gy++) {\n                    for (const q of (_a = this.grid.get(cellKey(gx, gy))) !== null && _a !== void 0 ? _a : []) {\n                        if (q.curve !== exempt &&\n                            Math.hypot(p.x - q.x, p.y - q.y) < CLEAR) {\n                            n++;\n                            if (n >= limit) {\n                                return n;\n                            }\n                        }\n                    }\n                }\n            }\n        }\n        return n;\n    }\n    // The first candidate that clears what is drawn, else the least crowded.\n    // Exempting only the feet of pieces at the same anchor, or adding\n    // candidates with legs splayed a lane or more out from the anchors, moved\n    // no count that mattered on the HPRC cuts.\n    choose(candidates, exempt, anchorPts) {\n        let best;\n        let bestV = Infinity;\n        for (const candidate of candidates) {\n            const v = this.violations(candidate(COARSE_STEP).pts, exempt, anchorPts, bestV);\n            if (v === 0) {\n                return candidate(FINE_STEP);\n            }\n            if (v < bestV) {\n                bestV = v;\n                best = candidate;\n            }\n        }\n        return best(FINE_STEP);\n    }\n    anchorsOf(members) {\n        const set = new Set(members);\n        const out = [];\n        for (const u of members) {\n            for (const uSide of SIDES) {\n                for (const [v, vSide] of this.links[u][uSide]) {\n                    const pts = this.points[v];\n                    if (set.has(v) || !pts) {\n                        continue;\n                    }\n                    const i = this.endIndex(v, vSide);\n                    out.push({\n                        u,\n                        uSide,\n                        v,\n                        vSide,\n                        point: pts[i],\n                        curve: this.curves[v],\n                        t: this.params[v][i],\n                    });\n                }\n            }\n        }\n        return out;\n    }\n    componentsOf(members) {\n        const set = new Set(members);\n        const seen = new Set();\n        const comps = [];\n        for (const s of members) {\n            if (seen.has(s)) {\n                continue;\n            }\n            const queue = [s];\n            seen.add(s);\n            for (const u of queue) {\n                for (const side of SIDES) {\n                    for (const [v] of this.links[u][side]) {\n                        if (set.has(v) && !seen.has(v)) {\n                            seen.add(v);\n                            queue.push(v);\n                        }\n                    }\n                }\n            }\n            comps.push(queue);\n        }\n        return comps;\n    }\n    // side-consistent BFS over (node, entered side) within the piece; without a\n    // target, the path to the farthest state\n    spinePath(members, from, fromSide, to, toExitSide) {\n        const set = new Set(members);\n        const key = (k, s) => k * 2 + s;\n        const reached = (k, s) => k === to && other(s) === toExitSide;\n        const prev = new Map([[key(from, fromSide), -1]]);\n        const queue = [[from, fromSide]];\n        let far = [from, fromSide];\n        for (const [k, s] of queue) {\n            far = [k, s];\n            if (to !== undefined && reached(k, s)) {\n                break;\n            }\n            for (const [v, t] of this.links[k][other(s)]) {\n                if (!set.has(v) || prev.has(key(v, t))) {\n                    continue;\n                }\n                prev.set(key(v, t), key(k, s));\n                queue.push([v, t]);\n            }\n        }\n        if (to !== undefined && !reached(far[0], far[1])) {\n            return undefined;\n        }\n        const path = [];\n        for (let cur = key(far[0], far[1]); cur !== -1; cur = prev.get(cur)) {\n            path.push({ k: cur >> 1, enter: (cur & 1) });\n        }\n        return path.reverse();\n    }\n    loosePath(members, from, to) {\n        const set = new Set(members);\n        const prev = new Map([[from, -1]]);\n        const side = new Map([[from, 0]]);\n        const queue = [from];\n        for (const k of queue) {\n            if (k === to) {\n                break;\n            }\n            for (const s of SIDES) {\n                for (const [v, t] of this.links[k][s]) {\n                    if (!set.has(v) || prev.has(v)) {\n                        continue;\n                    }\n                    prev.set(v, k);\n                    side.set(v, t);\n                    queue.push(v);\n                }\n            }\n        }\n        const path = [];\n        for (let cur = to; cur !== -1; cur = prev.get(cur)) {\n            path.push({ k: cur, enter: side.get(cur) });\n        }\n        return path.reverse();\n    }\n    spineLength(spine) {\n        const { link } = this.c;\n        return spine.reduce((s, { k }) => s + this.drawn(k) + link, link);\n    }\n    // the spine's chains along the curve from arc length t0, at their own\n    // spacing unless one is given\n    layAlong(spine, curve, t0, spacing) {\n        const { count, per, link } = this.c;\n        let t = t0;\n        const all = [];\n        for (const { k, enter } of spine) {\n            const step = spacing !== null && spacing !== void 0 ? spacing : per[k];\n            const pts = [];\n            const ts = [];\n            for (let i = 0; i < count[k]; i++) {\n                pts.push(curve.pointAt(t + i * step));\n                ts.push(t + i * step);\n            }\n            if (enter === 1) {\n                pts.reverse();\n                ts.reverse();\n            }\n            this.points[k] = pts;\n            this.params[k] = ts;\n            this.curves[k] = curve;\n            all.push(...pts);\n            t += step * (count[k] - 1) + link;\n        }\n        return all;\n    }\n    arcCandidates(frame, tA, sign, c, L) {\n        const hMax = (L - c) / 2 - 1e-6;\n        const tilts = L > 2 * c ? TEARDROP_TILTS : [0];\n        const candidates = [];\n        for (const drop of depths(0, 8)) {\n            for (const tilt of tilts) {\n                for (let i = 0; i <= 16; i++) {\n                    const h = (hMax * i) / 16;\n                    const flat = tilted(arcFlat(c, L, h, drop), c, tilt);\n                    if ((i < 16 && flat.apex < MIN_DEPTH) || behindFrame(flat)) {\n                        continue;\n                    }\n                    candidates.push(step => fitted(frame, tA, sign, length => tilted(arcFlat(c, length, Math.min(h, (length - c) / 2 - 1e-6), drop), c, tilt), L, step));\n                }\n            }\n        }\n        return candidates;\n    }\n    placePiece(members, parent) {\n        var _a;\n        const { count, link } = this.c;\n        const anchors = this.anchorsOf(members);\n        if (anchors.length === 0) {\n            return;\n        }\n        const route = members.every(k => this.route[k]);\n        const shared = anchors.every(a => a.curve === anchors[0].curve)\n            ? anchors[0].curve\n            : undefined;\n        let frame;\n        let tA;\n        let tB;\n        let sign;\n        if (shared) {\n            anchors.sort((a, b) => a.t - b.t);\n            frame = shared;\n            tA = anchors[0].t;\n            tB = anchors[anchors.length - 1].t;\n            sign = frame === this.backbone && route ? -1 : 1;\n        }\n        else {\n            // A piece between curves hangs on the chord, and its links stay long.\n            // Relaxing just these pieces over their links with the rest held\n            // stretched the junction nodes across the gap instead: on the KIV-2\n            // eight-haplotype cut, chain length error 0.3% to 57% and node\n            // crossings 22 to 48. Hanging the piece on the curve with most anchors\n            // more than doubled that cut's link crossings.\n            anchors.sort((a, b) => a.point.x - b.point.x || a.point.y - b.point.y);\n            const a = anchors[0].point;\n            const b = anchors[anchors.length - 1].point;\n            const chord = Math.hypot(b.x - a.x, b.y - a.y);\n            const u = chord > 1e-9 ? unit(a, b) : { x: 1, y: 0 };\n            const n = { x: -u.y, y: u.x };\n            const mid = lerp(a, b, 0.5);\n            sign = anchors.some(x => x.curve === this.backbone)\n                ? (route ? -1 : 1) * (Math.sign(n.y) || 1)\n                : (mid.x - parent.x) * n.x + (mid.y - parent.y) * n.y >= 0\n                    ? 1\n                    : -1;\n            frame = new Curve([a, b], [n, n], true);\n            tA = 0;\n            tB = chord;\n        }\n        const A = anchors[0];\n        const B = anchors[anchors.length - 1];\n        const c = tB - tA;\n        const single = anchors.length === 1 || (A.u === B.u && A.uSide === B.uSide && c < 1e-9);\n        const anchorPts = [A.point, B.point];\n        const pick = (candidates) => this.choose(candidates, shared, anchorPts);\n        let spine;\n        let mapped;\n        let start = link;\n        let spacing;\n        if (single) {\n            spine = this.spinePath(members, A.u, A.uSide);\n            const L = this.spineLength(spine);\n            const next = A.vSide\n                ? Math.max(0, count[A.v] - 2)\n                : Math.min(1, count[A.v] - 1);\n            const dirU = A.t >= this.params[A.v][next] ? 1 : -1;\n            const du = dirU * Math.cos(TIP_ANGLE);\n            const dv = Math.sin(TIP_ANGLE);\n            mapped = pick(depths(0, 12).map(drop => (step) => fitted(frame, tA, sign, length => lineFlat(0, drop, du, dv, length), L, step)));\n        }\n        else {\n            spine =\n                (_a = this.spinePath(members, A.u, A.uSide, B.u, B.uSide)) !== null && _a !== void 0 ? _a : this.loosePath(members, A.u, B.u);\n            const L = this.spineLength(spine);\n            if (route) {\n                const d0 = Math.max(MIN_DEPTH, Math.min(BOW * c, BOW_CAP));\n                mapped = pick(depths(d0, 12).map(d => (step) => mapFlat(frame, tA, sign, arcFlat(c, archLength(c, d), 0, 0), step)));\n                const total = polylineLength(mapped.pts);\n                spacing = Math.max(1e-3, (total - 2 * link) / (count[spine[0].k] - 1));\n            }\n            else if (L > c + 1e-6) {\n                mapped = pick(this.arcCandidates(frame, tA, sign, c, L));\n            }\n            else {\n                const bar = L - 2 * link;\n                const d0 = Math.max(MIN_DEPTH, Math.min(BOW * (c - bar), BOW_CAP));\n                mapped = pick(depths(d0, 12).map(d => (step) => fitted(frame, tA, sign, length => lineFlat(c / 2 - length / 2, d, 1, 0, length), bar, step)));\n                start = 0;\n            }\n        }\n        const curve = new Curve(mapped.pts, outwardNormals(mapped.pts, mapped.refs));\n        const placed = this.layAlong(spine, curve, start, spacing);\n        this.occupy(placed, curve);\n        const centroid = centroidOf(placed);\n        const rest = members.filter(k => !this.points[k]);\n        const subs = this.componentsOf(rest)\n            .map(m => ({ members: m, span: spanOf(this.anchorsOf(m)) }))\n            .sort((a, b) => a.span - b.span);\n        for (const sub of subs) {\n            this.placePiece(sub.members, centroid);\n        }\n    }\n}\n// Initial positions per point, NaN where the placement reached nothing.\nexport function stressPlacement(c) {\n    const X = new Float64Array(c.n).fill(NaN);\n    const Y = new Float64Array(c.n).fill(NaN);\n    if (Placer.hasBackbone(c)) {\n        const placer = new Placer(c);\n        placer.run();\n        placer.write(X, Y);\n    }\n    return { X, Y };\n}\n", "import { stressPlacement } from \"./stressPlacement.js\";\n// A layout taking the Bandage engine's request: each node is the chain of\n// points FMMM would build, and the result is a polyline per node.\n//\n// A component with a seeded backbone is drawn by stressPlacement: the\n// backbone straight along x, every other node hung off it. The rest is a\n// stress layout by stochastic gradient descent (Zheng, Pawar & Goodman 2019)\n// with target distances from random walks, after odgi's path-guided SGD:\n// every point starts a few walks of log-uniform length each iteration, and\n// how far a walk got is how far apart its ends should sit, so a repeat's loop\n// draws as a ring of its own circumference. Stress has no repulsion, so a\n// final pass pushes apart points that are close but not joined.\n//\n// Running the schedule on a placed component twists its loops, since a walk\n// from a loop's leg runs on along the backbone and pulls the leg to lie along\n// it: 32 node crossings on HPRC MHC class II against the placement's 4.\n// walks per point and iterations by the quality the request names\nconst QUALITY = [\n    { walks: 2, iterations: 15 },\n    { walks: 4, iterations: 30 },\n    { walks: 8, iterations: 60 },\n    { walks: 12, iterations: 90 },\n    { walks: 16, iterations: 120 },\n];\nconst UNTANGLE_PASSES = 20;\n// the untangle radius, in link lengths\nconst UNTANGLE_LINKS = 3;\nconst UNTANGLE_PUSH = 0.3;\nconst SMOOTH_PASSES = 2;\n// a 20-link cap balls a 3k-node graph up\nconst MAX_HOPS = 200;\n// the step size the schedule ends on, as a share of the smallest pair's\nconst EPS = 0.1;\n// the share of the schedule a seeded component skips\nconst WARM = 0.5;\nconst isBackbone = (node) => { var _a; return ((_a = node.stable) === null || _a === void 0 ? void 0 : _a.rank) === 0; };\nfunction flipped(strand, name) {\n    const own = name.at(-1);\n    return ((strand === '+' || strand === '-') &&\n        (own === '+' || own === '-') &&\n        strand !== own);\n}\nfunction xorshift(seed) {\n    let s = Math.imul(seed, 2654435761) >>> 0 || 1;\n    return () => {\n        s ^= s << 13;\n        s >>>= 0;\n        s ^= s >>> 17;\n        s ^= s << 5;\n        s >>>= 0;\n        return s / 4294967296;\n    };\n}\nexport function num(value, fallback) {\n    return typeof value === 'number' && Number.isFinite(value) ? value : fallback;\n}\n// A node's drawn length, in layout units, from its bp\nexport function drawnLength(options, bp) {\n    return Math.max((num(options.nodeLengthPerMegabase, 1000) * bp) / 1000000, num(options.minimumNodeLength, 1));\n}\nexport function chains(request) {\n    const { nodes, edges } = request.graph;\n    const o = request.options;\n    const segment = num(o.nodeSegmentLength, 1);\n    const link = num(o.edgeLength, 1);\n    const ids = nodes.map(n => n.id);\n    const first = new Int32Array(nodes.length);\n    const count = new Int32Array(nodes.length);\n    const per = new Float64Array(nodes.length);\n    let n = 0;\n    nodes.forEach((node, k) => {\n        const drawn = drawnLength(o, node.length);\n        const steps = Math.max(1, Math.ceil(drawn / segment));\n        first[k] = n;\n        count[k] = steps + 1;\n        per[k] = drawn / steps;\n        n += steps + 1;\n    });\n    const chainOf = new Int32Array(n);\n    const indexOf = new Int32Array(n);\n    const seedX = new Float64Array(n).fill(NaN);\n    const seedY = new Float64Array(n).fill(NaN);\n    const backbone = new Uint8Array(n);\n    const adjacent = Array.from({ length: n }, () => []);\n    nodes.forEach((node, k) => {\n        const seeded = typeof node.x === 'number' && typeof node.y === 'number';\n        const reference = isBackbone(node) ? 1 : 0;\n        for (let i = 0; i < count[k]; i++) {\n            const v = first[k] + i;\n            chainOf[v] = k;\n            indexOf[v] = i;\n            backbone[v] = reference;\n            if (seeded) {\n                seedX[v] = node.x + i * per[k];\n                seedY[v] = node.y;\n            }\n            if (i > 0) {\n                adjacent[v - 1].push([v, per[k]]);\n                adjacent[v].push([v - 1, per[k]]);\n            }\n        }\n    });\n    const index = new Map(ids.map((id, k) => [id, k]));\n    const links = nodes.map(() => [[], []]);\n    for (const edge of edges) {\n        const a = index.get(edge.from);\n        const b = index.get(edge.to);\n        if (a === undefined || b === undefined) {\n            continue;\n        }\n        // a self link on a chain of one step has nowhere to go, as in FMMM\n        if (a === b && count[a] <= 2) {\n            continue;\n        }\n        const fromSide = flipped(edge.fromStrand, edge.from) ? 0 : 1;\n        const toSide = flipped(edge.toStrand, edge.to) ? 1 : 0;\n        const u = first[a] + (fromSide ? count[a] - 1 : 0);\n        const v = first[b] + (toSide ? count[b] - 1 : 0);\n        adjacent[u].push([v, link]);\n        adjacent[v].push([u, link]);\n        links[a][fromSide].push([b, toSide]);\n        links[b][toSide].push([a, fromSide]);\n    }\n    const off = new Int32Array(n + 1);\n    for (let i = 0; i < n; i++) {\n        off[i + 1] = off[i] + adjacent[i].length;\n    }\n    const nb = new Int32Array(off[n]);\n    const wt = new Float64Array(off[n]);\n    for (let i = 0; i < n; i++) {\n        adjacent[i].forEach(([v, w], k) => {\n            nb[off[i] + k] = v;\n            wt[off[i] + k] = w;\n        });\n    }\n    return {\n        ids,\n        first,\n        count,\n        per,\n        links,\n        chainOf,\n        indexOf,\n        seedX,\n        seedY,\n        backbone,\n        off,\n        nb,\n        wt,\n        n,\n        link,\n    };\n}\n// each point's connected component, and the points of each component\nfunction components(c) {\n    const { n, off, nb } = c;\n    const comp = new Int32Array(n).fill(-1);\n    const members = [];\n    for (let s = 0; s < n; s++) {\n        if (comp[s] >= 0) {\n            continue;\n        }\n        const queue = [s];\n        comp[s] = members.length;\n        for (const u of queue) {\n            for (let e = off[u]; e < off[u + 1]; e++) {\n                const v = nb[e];\n                if (comp[v] < 0) {\n                    comp[v] = members.length;\n                    queue.push(v);\n                }\n            }\n        }\n        members.push(queue);\n    }\n    return { comp, members };\n}\nexport function stressLayout(request, opts = {}) {\n    var _a, _b, _c;\n    const c = chains(request);\n    const { n, off, nb, wt, seedX, seedY, first, count, per, link } = c;\n    const o = request.options;\n    const quality = QUALITY[Math.max(0, Math.min(4, num((_a = opts.quality) !== null && _a !== void 0 ? _a : o.quality, 2)))];\n    const gap = num((_b = opts.componentSeparation) !== null && _b !== void 0 ? _b : o.componentSeparation, 15);\n    const rand = xorshift(num((_c = opts.seed) !== null && _c !== void 0 ? _c : o.seed, 1));\n    const X = new Float64Array(n);\n    const Y = new Float64Array(n);\n    const nodePositions = {};\n    if (n === 0) {\n        return { nodePositions };\n    }\n    const { comp, members } = components(c);\n    let dmin = Infinity;\n    let total = 0;\n    for (let e = 0; e < nb.length; e++) {\n        dmin = Math.min(dmin, wt[e]);\n        total += wt[e];\n    }\n    total /= 2;\n    let anySeed = false;\n    for (let i = 0; i < n; i++) {\n        if (!Number.isNaN(seedX[i])) {\n            anySeed = true;\n            break;\n        }\n    }\n    const placed = anySeed ? stressPlacement(c) : undefined;\n    const side = Math.sqrt(n) * 20;\n    for (let i = 0; i < n; i++) {\n        if (placed && !Number.isNaN(placed.X[i])) {\n            X[i] = placed.X[i];\n            Y[i] = placed.Y[i];\n        }\n        else if (anySeed && !Number.isNaN(seedX[i])) {\n            X[i] = seedX[i] + rand() - 0.5;\n            Y[i] = seedY[i] + rand() - 0.5;\n        }\n        else {\n            X[i] = rand() * side;\n            Y[i] = rand() * side;\n        }\n    }\n    // the points the schedule moves: those of components the placement did not\n    // draw whole, in index order so the schedule runs as it would alone\n    const drawn = members.map(points => placed !== undefined && points.every(i => !Number.isNaN(placed.X[i])));\n    const loose = [];\n    let looseSeeded = true;\n    for (let i = 0; i < n; i++) {\n        if (!drawn[comp[i]]) {\n            loose.push(i);\n            looseSeeded && (looseSeeded = !Number.isNaN(seedX[i]));\n        }\n    }\n    const dmax = Math.max(total / 4, dmin * 10);\n    const etaMax = dmax * dmax;\n    const etaMin = EPS * dmin * dmin;\n    const { walks, iterations } = quality;\n    const lambda = Math.log(etaMax / etaMin) / Math.max(1, iterations - 1);\n    const logMin = Math.log(dmin);\n    const logMax = Math.log(dmax);\n    const move = (i, j, d, eta) => {\n        let mu = eta / (d * d);\n        if (mu > 1) {\n            mu = 1;\n        }\n        const dx = X[i] - X[j];\n        const dy = Y[i] - Y[j];\n        const mag = Math.sqrt(dx * dx + dy * dy) || 1e-9;\n        const r = (mu * (mag - d)) / (2 * mag);\n        const rx = r * dx;\n        const ry = r * dy;\n        X[i] = X[i] - rx;\n        Y[i] = Y[i] - ry;\n        X[j] = X[j] + rx;\n        Y[j] = Y[j] + ry;\n    };\n    // The end of a walk of up to `length` from point i, with how far it got in\n    // `walked`: a walk stops short at a free chain end.\n    let walked = 0;\n    const walk = (i, length) => {\n        let chain = c.chainOf[i];\n        let idx = c.indexOf[i];\n        let dir = rand() < 0.5 ? -1 : 1;\n        let remaining = length;\n        for (let hops = 0; hops < MAX_HOPS; hops++) {\n            const points = count[chain];\n            const step = per[chain];\n            const toEnd = (dir > 0 ? points - 1 - idx : idx) * step;\n            if (remaining <= toEnd) {\n                const steps = Math.round(remaining / step);\n                walked = length - remaining + steps * step;\n                return first[chain] + idx + dir * steps;\n            }\n            remaining -= toEnd;\n            const out = c.links[chain][dir > 0 ? 1 : 0];\n            if (out.length === 0) {\n                walked = length - remaining;\n                return first[chain] + (dir > 0 ? points - 1 : 0);\n            }\n            const [next, enterSide] = out[Math.floor(rand() * out.length)];\n            remaining -= link;\n            chain = next;\n            dir = enterSide === 0 ? 1 : -1;\n            idx = enterSide === 0 ? 0 : count[next] - 1;\n            if (remaining <= 0) {\n                walked = length - remaining;\n                return first[chain] + idx;\n            }\n        }\n        return -1;\n    };\n    const adjacentTerms = (i, eta) => {\n        for (let e = off[i]; e < off[i + 1]; e++) {\n            const j = nb[e];\n            if (j > i) {\n                move(i, j, wt[e], eta);\n            }\n        }\n    };\n    const order = Int32Array.from(loose);\n    const warm = looseSeeded ? Math.floor(WARM * iterations) : 0;\n    for (let t = loose.length ? warm : iterations; t < iterations; t++) {\n        const eta = etaMax * Math.exp(-lambda * t);\n        for (let k = order.length - 1; k > 0; k--) {\n            const r = Math.floor(rand() * (k + 1));\n            const tmp = order[k];\n            order[k] = order[r];\n            order[r] = tmp;\n        }\n        for (const i of order) {\n            adjacentTerms(i, eta);\n            for (let w = 0; w < walks; w++) {\n                const length = Math.exp(logMin + rand() * (logMax - logMin));\n                const j = walk(i, length);\n                if (j >= 0 && j !== i && walked > 0) {\n                    move(i, j, walked, eta);\n                }\n            }\n        }\n    }\n    // untangle: points closer than the radius and not joined push apart, then\n    // a sweep over the links pulls each back towards its length\n    const radius = UNTANGLE_LINKS * link;\n    const key = (x, y) => (Math.floor(x / radius) * 73856093) ^ (Math.floor(y / radius) * 19349663);\n    for (let u = 0; u < (loose.length ? UNTANGLE_PASSES : 0); u++) {\n        const grid = new Map();\n        for (const i of loose) {\n            const k = key(X[i], Y[i]);\n            const list = grid.get(k);\n            if (list) {\n                list.push(i);\n            }\n            else {\n                grid.set(k, [i]);\n            }\n        }\n        for (const i of loose) {\n            const cx = Math.floor(X[i] / radius);\n            const cy = Math.floor(Y[i] / radius);\n            for (let gx = cx - 1; gx <= cx + 1; gx++) {\n                for (let gy = cy - 1; gy <= cy + 1; gy++) {\n                    const list = grid.get((gx * 73856093) ^ (gy * 19349663));\n                    if (!list) {\n                        continue;\n                    }\n                    for (const j of list) {\n                        if (j <= i) {\n                            continue;\n                        }\n                        let joined = false;\n                        for (let e = off[i]; e < off[i + 1]; e++) {\n                            if (nb[e] === j) {\n                                joined = true;\n                                break;\n                            }\n                        }\n                        if (joined) {\n                            continue;\n                        }\n                        const dx = X[i] - X[j];\n                        const dy = Y[i] - Y[j];\n                        const mag = Math.sqrt(dx * dx + dy * dy);\n                        if (mag >= radius) {\n                            continue;\n                        }\n                        let rx;\n                        let ry;\n                        if (mag > 1e-6) {\n                            const r = (UNTANGLE_PUSH * (radius - mag)) / (2 * mag);\n                            rx = r * dx;\n                            ry = r * dy;\n                        }\n                        else {\n                            rx = UNTANGLE_PUSH * radius * (rand() - 0.5);\n                            ry = UNTANGLE_PUSH * radius * (rand() - 0.5);\n                        }\n                        X[i] = X[i] + rx;\n                        Y[i] = Y[i] + ry;\n                        X[j] = X[j] - rx;\n                        Y[j] = Y[j] - ry;\n                    }\n                }\n            }\n        }\n        for (const i of loose) {\n            adjacentTerms(i, Infinity);\n        }\n    }\n    // each chain's interior points smoothed, so a node reads as one curve, then\n    // spaced evenly along it at its drawn length\n    for (let k = 0; k < count.length; k++) {\n        const a = first[k];\n        const m = count[k];\n        if (m < 3) {\n            continue;\n        }\n        for (let s = 0; s < SMOOTH_PASSES; s++) {\n            const xs = X.slice(a, a + m);\n            const ys = Y.slice(a, a + m);\n            for (let i = 1; i + 1 < m; i++) {\n                X[a + i] = 0.5 * xs[i] + 0.25 * (xs[i - 1] + xs[i + 1]);\n                Y[a + i] = 0.5 * ys[i] + 0.25 * (ys[i - 1] + ys[i + 1]);\n            }\n        }\n        respace(X, Y, a, m, per[k]);\n    }\n    packComponents(comp, members, X, Y, anySeed, gap);\n    for (let k = 0; k < c.ids.length; k++) {\n        const points = [];\n        for (let i = 0; i < count[k]; i++) {\n            points.push({ x: X[first[k] + i], y: Y[first[k] + i] });\n        }\n        nodePositions[c.ids[k]] = points;\n    }\n    return { nodePositions };\n}\n// Points a to a+m-1 moved to equal spacing along their polyline. Smoothing\n// shortens a curve, so the interior first bulges out from the chord between\n// the ends until the length is back, and the points then take their full\n// spacing. The ends stay, since extending them along their tangents ran a\n// node past its anchors and through the links there.\nfunction respace(X, Y, a, m, per) {\n    bulge(X, Y, a, m, per * (m - 1));\n    const lengths = new Float64Array(m);\n    for (let i = 1; i < m; i++) {\n        lengths[i] =\n            lengths[i - 1] +\n                Math.hypot(X[a + i] - X[a + i - 1], Y[a + i] - Y[a + i - 1]);\n    }\n    if (!lengths[m - 1]) {\n        return;\n    }\n    const total = lengths[m - 1];\n    const xs = X.slice(a, a + m);\n    const ys = Y.slice(a, a + m);\n    let seg = 1;\n    for (let i = 1; i + 1 < m; i++) {\n        const s = (total * i) / (m - 1);\n        while (seg < m - 1 && lengths[seg] < s) {\n            seg++;\n        }\n        const span = lengths[seg] - lengths[seg - 1];\n        const t = span > 0 ? (s - lengths[seg - 1]) / span : 0;\n        X[a + i] = xs[seg - 1] + (xs[seg] - xs[seg - 1]) * t;\n        Y[a + i] = ys[seg - 1] + (ys[seg] - ys[seg - 1]) * t;\n    }\n}\n// Interior points a+1 to a+m-2 pushed out from the chord between the ends,\n// their offsets from it scaled by one factor, until the polyline is `target`\n// long. A chain lying along its chord has nothing to push and keeps its\n// length.\nfunction bulge(X, Y, a, m, target) {\n    const b = a + m - 1;\n    const cx = X[a];\n    const cy = Y[a];\n    const chord = Math.hypot(X[b] - cx, Y[b] - cy);\n    const ux = chord > 1e-9 ? (X[b] - cx) / chord : 1;\n    const uy = chord > 1e-9 ? (Y[b] - cy) / chord : 0;\n    const along = new Float64Array(m);\n    const off = new Float64Array(m);\n    let flat = true;\n    for (let i = 0; i < m; i++) {\n        const dx = X[a + i] - cx;\n        const dy = Y[a + i] - cy;\n        along[i] = dx * ux + dy * uy;\n        off[i] = dy * ux - dx * uy;\n        flat && (flat = Math.abs(off[i]) < 1e-6);\n    }\n    const lengthAt = (f) => {\n        let total = 0;\n        for (let i = 1; i < m; i++) {\n            total += Math.hypot(along[i] - along[i - 1], f * (off[i] - off[i - 1]));\n        }\n        return total;\n    };\n    if (flat || lengthAt(1) >= target) {\n        return;\n    }\n    let lo = 1;\n    let hi = 2;\n    while (lengthAt(hi) < target && hi < 1e6) {\n        lo = hi;\n        hi *= 2;\n    }\n    for (let it = 0; it < 40; it++) {\n        const mid = (lo + hi) / 2;\n        if (lengthAt(mid) < target) {\n            lo = mid;\n        }\n        else {\n            hi = mid;\n        }\n    }\n    const f = (lo + hi) / 2;\n    for (let i = 1; i + 1 < m; i++) {\n        X[a + i] = cx + along[i] * ux - f * off[i] * uy;\n        Y[a + i] = cy + along[i] * uy + f * off[i] * ux;\n    }\n}\n// Components stacked top to bottom, left aligned, `gap` apart. A component\n// with no seeds is turned so its long axis runs along x; a seeded one keeps\n// the frame its seeds stated.\nfunction packComponents(comp, members, X, Y, anySeed, gap) {\n    if (!anySeed) {\n        for (const points of members) {\n            rotateToPrincipalAxis(X, Y, points);\n        }\n    }\n    if (members.length < 2) {\n        return;\n    }\n    const minX = new Float64Array(members.length).fill(Infinity);\n    const minY = new Float64Array(members.length).fill(Infinity);\n    const maxY = new Float64Array(members.length).fill(-Infinity);\n    for (let i = 0; i < X.length; i++) {\n        const k = comp[i];\n        minX[k] = Math.min(minX[k], X[i]);\n        minY[k] = Math.min(minY[k], Y[i]);\n        maxY[k] = Math.max(maxY[k], Y[i]);\n    }\n    const shift = new Float64Array(members.length);\n    let y = 0;\n    for (let k = 0; k < members.length; k++) {\n        shift[k] = y - minY[k];\n        y += maxY[k] - minY[k] + gap;\n    }\n    for (let i = 0; i < X.length; i++) {\n        const k = comp[i];\n        X[i] = X[i] - minX[k];\n        Y[i] = Y[i] + shift[k];\n    }\n}\nfunction rotateToPrincipalAxis(X, Y, points) {\n    if (points.length < 3) {\n        return;\n    }\n    let cx = 0;\n    let cy = 0;\n    for (const i of points) {\n        cx += X[i];\n        cy += Y[i];\n    }\n    cx /= points.length;\n    cy /= points.length;\n    let sxx = 0;\n    let syy = 0;\n    let sxy = 0;\n    for (const i of points) {\n        const dx = X[i] - cx;\n        const dy = Y[i] - cy;\n        sxx += dx * dx;\n        syy += dy * dy;\n        sxy += dx * dy;\n    }\n    const angle = -0.5 * Math.atan2(2 * sxy, sxx - syy);\n    const cos = Math.cos(angle);\n    const sin = Math.sin(angle);\n    for (const i of points) {\n        const dx = X[i] - cx;\n        const dy = Y[i] - cy;\n        X[i] = cx + cos * dx - sin * dy;\n        Y[i] = cy + sin * dx + cos * dy;\n    }\n}\n", "// src/layoutEngines.ts\nimport { fmmmLayout } from \"@jbrowse/graph-fmmm-layout\";\nimport { stressLayout } from \"@jbrowse/graph-stress-layout\";\nvar LAYOUT_ENGINES = [\n  {\n    value: \"fmmm\",\n    label: \"Bandage (FMMM)\",\n    description: \"Bandage's force-directed layout: OGDF's fast multipole multilevel method, compiled to wasm.\"\n  },\n  {\n    value: \"stress\",\n    label: \"Stress\",\n    description: \"Plain JS: the reference drawn straight and each variant placed against it, an allele as a lens, a repeat loop as a ring, a deletion as an arch; stress by stochastic gradient descent for components with no reference.\"\n  }\n];\nvar LAYOUT_ENGINE_VALUES = LAYOUT_ENGINES.map((e) => e.value);\nfunction isLayoutEngineKind(value) {\n  return LAYOUT_ENGINE_VALUES.includes(value);\n}\nvar layoutEngine = async (request) => {\n  const start = performance.now();\n  const result = request.options.engine === \"stress\" ? stressLayout(request) : await fmmmLayout(request);\n  return { result, duration: performance.now() - start };\n};\n\nexport {\n  LAYOUT_ENGINES,\n  LAYOUT_ENGINE_VALUES,\n  isLayoutEngineKind,\n  layoutEngine\n};\n", "// src/layout/drawnScale.ts\nvar MEAN_NODE_LENGTH = 40;\nvar MIN_TOTAL_GRAPH_LENGTH = 500;\nvar BANDAGE_MINIMUM_NODE_LENGTH = 5;\nfunction drawnNodeLength(opts, length) {\n  return Math.max(\n    opts.nodeLengthPerMegabase * length / 1e6,\n    opts.minimumNodeLength\n  );\n}\nfunction bandageAutoScale(graph, minNodeLength = BANDAGE_MINIMUM_NODE_LENGTH) {\n  const totalLength = graph.nodes.reduce((sum, n) => sum + n.length, 0);\n  const megabases = totalLength / 1e6;\n  const target = Math.max(\n    graph.nodes.length * MEAN_NODE_LENGTH,\n    MIN_TOTAL_GRAPH_LENGTH\n  );\n  return {\n    nodeLengthPerMegabase: megabases > 0 ? target / megabases : 1e4,\n    minimumNodeLength: Math.max(BANDAGE_MINIMUM_NODE_LENGTH, minNodeLength),\n    edgeLength: 5,\n    nodeSegmentLength: 20\n  };\n}\nvar PROPORTIONAL_LENGTH = { power: 1, effect: 1 };\nfunction isProportional(law) {\n  return law.power === 1 && law.effect === 1;\n}\nfunction drawnLengthFor(graph, law) {\n  const count = graph.nodes.length;\n  const totalLength = graph.nodes.reduce((sum, n) => sum + n.length, 0);\n  const meanBp = count > 0 ? totalLength / count : 0;\n  const meanDrawn = count > 0 ? Math.max(count * MEAN_NODE_LENGTH, MIN_TOTAL_GRAPH_LENGTH) / count : MEAN_NODE_LENGTH;\n  return (bp) => {\n    if (meanBp <= 0) {\n      return meanDrawn;\n    }\n    const relative = (bp / meanBp) ** law.power;\n    return Math.max(\n      meanDrawn * ((relative - 1) * law.effect + 1),\n      BANDAGE_MINIMUM_NODE_LENGTH\n    );\n  };\n}\nvar LAYOUT_LENGTH_PRECISION = 1e3;\nvar PROPORTIONAL_SPREAD = {\n  law: PROPORTIONAL_LENGTH,\n  minNodeLength: 0\n};\nfunction layoutScaling(graph, spread = PROPORTIONAL_SPREAD) {\n  const { law, minNodeLength } = spread;\n  const opts = bandageAutoScale(graph, minNodeLength);\n  if (isProportional(law)) {\n    return { nodes: graph.nodes, opts };\n  }\n  const drawn = drawnLengthFor(graph, law);\n  return {\n    nodes: graph.nodes.map((node) => ({\n      ...node,\n      length: Math.round(drawn(node.length) * LAYOUT_LENGTH_PRECISION)\n    })),\n    opts: {\n      ...opts,\n      nodeLengthPerMegabase: 1e6 / LAYOUT_LENGTH_PRECISION,\n      // Bandage's own floor only. A law and a raised floor are alternatives\n      // rather than a stack: the law has already lifted the small end, and a\n      // floor on top of it would flatten exactly what it just spread.\n      minimumNodeLength: BANDAGE_MINIMUM_NODE_LENGTH\n    }\n  };\n}\nfunction drawnLengthOf(graph, spread = PROPORTIONAL_SPREAD) {\n  if (isProportional(spread.law)) {\n    const opts = bandageAutoScale(graph, spread.minNodeLength);\n    return (bp) => drawnNodeLength(opts, bp);\n  }\n  return drawnLengthFor(graph, spread.law);\n}\n\nexport {\n  MEAN_NODE_LENGTH,\n  drawnNodeLength,\n  bandageAutoScale,\n  PROPORTIONAL_LENGTH,\n  drawnLengthFor,\n  layoutScaling,\n  drawnLengthOf\n};\n", "import {\n  MEAN_NODE_LENGTH,\n  PROPORTIONAL_LENGTH\n} from \"./chunk-34BOZKIE.js\";\n\n// src/bubbleSpreads.ts\nvar BUBBLE_SPREADS = [\n  {\n    value: \"auto\",\n    label: \"Proportional\",\n    description: \"Bandage's own scale: a node draws proportional to its length, so a 1 bp allele is a speck.\",\n    law: PROPORTIONAL_LENGTH,\n    minNodeFactor: 0\n  },\n  {\n    value: \"open\",\n    label: \"Open bubbles\",\n    description: \"Give every allele a drawn length, so a bubble reads as two arms rather than a knot.\",\n    law: PROPORTIONAL_LENGTH,\n    minNodeFactor: 2.5\n  },\n  {\n    value: \"wide\",\n    label: \"Wide bubbles\",\n    description: \"As open, spread further. Best on a window of a dozen bubbles.\",\n    law: PROPORTIONAL_LENGTH,\n    minNodeFactor: 10\n  },\n  {\n    value: \"compress\",\n    label: \"Compress lengths\",\n    description: \"Pull the longest and shortest nodes towards the graph\\u2019s mean, so a cut spanning kb and bp fits one pane.\",\n    law: { power: 0.5, effect: 0.5 },\n    minNodeFactor: 0\n  }\n];\nvar BUBBLE_SPREAD_VALUES = BUBBLE_SPREADS.map((s) => s.value);\nfunction spreadFor(spread) {\n  const entry = BUBBLE_SPREADS.find((s) => s.value === spread);\n  return {\n    law: entry?.law ?? PROPORTIONAL_LENGTH,\n    minNodeLength: (entry?.minNodeFactor ?? 0) * MEAN_NODE_LENGTH\n  };\n}\n\nexport {\n  BUBBLE_SPREADS,\n  BUBBLE_SPREAD_VALUES,\n  spreadFor\n};\n"],
   "mappings": "AAAA,IAAIA,GACG,SAASC,IAAW,CACvB,OAAAD,KAAiDA,GAAS,OAAO,8BAAqB,EACjF,KAAKE,GAAOA,EAAI,QAAQ,CAAC,EACzB,MAAOC,GAAM,CACd,MAAAH,GAAS,OACHG,CACV,CAAC,GACMH,EACX,CCRA,eAAsBI,GAAWC,EAAS,CAEtC,OADe,MAAMC,GAAS,GAChB,cAAcD,EAAQ,MAAOA,EAAQ,OAAO,CAC9D,CCFO,IAAME,GAAW,cAkBxB,IAAMC,GAAa,GAAK,KAAK,GAAM,IAE7BC,GAAM,IACNC,GAAU,IAEVC,GAAiB,CAAC,EAAG,KAAO,IAAM,IAAM,GAAK,MAAO,KAAM,KAAM,GAAG,EACnEC,GAAQ,CAAC,EAAG,CAAC,EACnB,SAASC,GAAMC,EAAM,CACjB,OAAOA,EAAO,EAAI,CACtB,CACA,SAASC,GAAKC,EAAGC,EAAG,CAChB,IAAMC,EAAKD,EAAE,EAAID,EAAE,EACbG,EAAKF,EAAE,EAAID,EAAE,EACbI,EAAI,KAAK,MAAMF,EAAIC,CAAE,GAAK,EAChC,MAAO,CAAE,EAAGD,EAAKE,EAAG,EAAGD,EAAKC,CAAE,CAClC,CACA,SAASC,GAAKL,EAAGC,EAAGK,EAAG,CACnB,MAAO,CAAE,EAAGN,EAAE,GAAKC,EAAE,EAAID,EAAE,GAAKM,EAAG,EAAGN,EAAE,GAAKC,EAAE,EAAID,EAAE,GAAKM,CAAE,CAChE,CACA,SAASC,GAAWC,EAAK,CACrB,IAAIC,EAAI,EACJC,EAAI,EACR,QAAWC,KAAKH,EACZC,GAAKE,EAAE,EACPD,GAAKC,EAAE,EAEX,MAAO,CAAE,EAAGF,EAAID,EAAI,OAAQ,EAAGE,EAAIF,EAAI,MAAO,CAClD,CACA,SAASI,GAAWJ,EAAK,CACrB,IAAMK,EAAM,IAAI,aAAaL,EAAI,MAAM,EACvC,QAASM,EAAI,EAAGA,EAAIN,EAAI,OAAQM,IAC5BD,EAAIC,CAAC,EACDD,EAAIC,EAAI,CAAC,EACL,KAAK,MAAMN,EAAIM,CAAC,EAAE,EAAIN,EAAIM,EAAI,CAAC,EAAE,EAAGN,EAAIM,CAAC,EAAE,EAAIN,EAAIM,EAAI,CAAC,EAAE,CAAC,EAEvE,OAAOD,CACX,CACA,SAASE,GAAeP,EAAK,CACzB,IAAIQ,EACJ,OAAQA,EAAKJ,GAAWJ,CAAG,EAAEA,EAAI,OAAS,CAAC,KAAO,MAAQQ,IAAO,OAASA,EAAK,CACnF,CAGA,IAAMC,GAAY,IAAI,IACtB,SAASC,GAASC,EAAO,CACrB,IAAMC,EAAQH,GAAU,IAAIE,CAAK,EACjC,GAAIC,IAAU,OACV,OAAOA,EAEX,IAAMC,EAAQC,GAAcH,CAAK,EACjC,OAAIF,GAAU,KAAO,KACjBA,GAAU,MAAM,EAEpBA,GAAU,IAAIE,EAAOE,CAAK,EACnBA,CACX,CACA,SAASC,GAAcH,EAAO,CAC1B,IAAII,EAAK,KACLC,EAAK,EAAI,KAAK,GAAK,KACvB,QAASV,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,IAAMW,GAAOF,EAAKC,GAAM,EACpBC,GAAO,EAAI,KAAK,IAAIA,EAAM,CAAC,GAAKN,EAChCI,EAAKE,EAGLD,EAAKC,CAEb,CACA,OAAQF,EAAKC,GAAM,CACvB,CAEA,SAASE,GAAWC,EAAGC,EAAG,CACtB,GAAID,EAAI,KACJ,OAAO,KAAK,GAAKC,EAErB,IAAMC,GAAMF,EAAIA,EAAK,EAAIC,EAAIA,IAAM,EAAIA,GACjCE,EAAQ,EAAI,KAAK,KAAK,KAAK,IAAI,EAAGH,GAAK,EAAIE,EAAE,CAAC,EACpD,OAAOA,GAAKD,EAAIC,EAAI,EAAI,KAAK,GAAKC,EAAQA,EAC9C,CAGA,SAASC,GAAQJ,EAAGK,EAAQC,EAAGC,EAAM,CACjC,IAAMrB,EAAMmB,EAAS,EAAIC,EACnBH,EAAQH,EAAI,KAAO,EAAI,KAAK,GAAKT,GAASL,EAAMc,CAAC,EACjDE,EAAIhB,EAAMiB,EACVK,EAAM,KAAK,IAAIL,EAAQ,CAAC,EACxBM,EAAKT,EAAI,EACTU,EAAKH,EAAOD,EAAIJ,EAAIM,EAC1B,MAAO,CACH,GAAIG,GAAK,CACL,GAAIA,GAAKL,EACL,MAAO,CAAE,EAAG,EAAG,EAAGC,EAAOI,CAAE,EAE/B,GAAIA,GAAKN,EAASC,EACd,MAAO,CAAE,EAAGN,EAAG,EAAGO,EAAOF,EAASM,CAAE,EAExC,IAAMtC,GAAKsC,EAAIL,GAAKJ,EAAIC,EAAQ,EAChC,MAAO,CAAE,EAAGM,EAAKP,EAAI,KAAK,IAAI7B,CAAC,EAAG,EAAGqC,EAAKR,EAAI,KAAK,IAAI7B,CAAC,CAAE,CAC9D,EACA,KAAMkC,EAAOD,EAAIJ,GAAK,EAAIM,GAC1B,OAAAH,CACJ,CACJ,CAKA,SAASO,GAAOC,EAAMb,EAAGN,EAAO,CAC5B,GAAI,CAACA,EACD,OAAOmB,EAEX,IAAML,EAAM,KAAK,IAAId,CAAK,EACpBoB,EAAM,KAAK,IAAIpB,CAAK,EAC1B,MAAO,CACH,GAAGmB,EACH,GAAIF,GAAK,CACL,GAAM,CAAE,EAAAI,EAAG,EAAAC,CAAE,EAAIH,EAAK,GAAGF,CAAC,EACpBM,EAAKF,EAAIf,EAAI,EACnB,MAAO,CAAE,EAAGA,EAAI,EAAIiB,EAAKT,EAAMQ,EAAIF,EAAK,EAAGG,EAAKH,EAAME,EAAIR,CAAI,CAClE,CACJ,CACJ,CAGA,SAASU,GAAYL,EAAM,CACvB,QAAS1B,EAAI,EAAGA,GAAK,GAAIA,IACrB,GAAI0B,EAAK,GAAIA,EAAK,OAAS1B,EAAK,EAAE,EAAE,EAAI,MACpC,MAAO,GAGf,MAAO,EACX,CACA,SAASgC,GAASC,EAAIC,EAAIJ,EAAIK,EAAIjB,EAAQ,CACtC,MAAO,CACH,GAAIM,IAAM,CAAE,EAAGS,EAAKH,EAAKN,EAAG,EAAGU,EAAKC,EAAKX,CAAE,GAC3C,KAAMU,EAAK,KAAK,IAAI,EAAGC,CAAE,EAAIjB,EAC7B,OAAAA,CACJ,CACJ,CAEA,IAAMkB,GAAN,KAAY,CACR,YAAY1C,EAAK2C,EAASC,EAAW,GAAO,CACxC,IAAIpC,EACJ,KAAK,IAAMR,EACX,KAAK,QAAU2C,EACf,KAAK,SAAWC,EAChB,KAAK,IAAMxC,GAAWJ,CAAG,EACzB,KAAK,OAASQ,EAAK,KAAK,IAAIR,EAAI,OAAS,CAAC,KAAO,MAAQQ,IAAO,OAASA,EAAK,CAClF,CACA,QAAQ,EAAG,CACP,GAAM,CAAE,IAAAH,CAAI,EAAI,KACZU,EAAK,EACLC,EAAKX,EAAI,OAAS,EACtB,KAAOU,EAAKC,GAAI,CACZ,IAAMC,EAAOF,EAAKC,GAAO,EACrBX,EAAIY,CAAG,EAAI,EACXF,EAAKE,EAAM,EAGXD,EAAKC,CAEb,CACA,OAAOF,CACX,CACA,SAAST,EAAGwB,EAAG,CACX,IAAMe,EAAO,KAAK,IAAIvC,CAAC,EAAI,KAAK,IAAIA,EAAI,CAAC,EACzC,OAAOuC,EAAO,GAAKf,EAAI,KAAK,IAAIxB,EAAI,CAAC,GAAKuC,EAAO,CACrD,CACA,QAAQ,EAAG,CACP,GAAM,CAAE,IAAA7C,CAAI,EAAI,KACV8C,EAAO9C,EAAI,OAAS,EAC1B,GAAI8C,IAAS,EACT,MAAO,CAAE,GAAG9C,EAAI,CAAC,CAAE,EAEvB,GAAI,GAAK,EAAG,CACR,IAAM+C,EAAIxD,GAAKS,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,EAC7B,MAAO,CAAE,EAAGA,EAAI,CAAC,EAAE,EAAI+C,EAAE,EAAI,EAAG,EAAG/C,EAAI,CAAC,EAAE,EAAI+C,EAAE,EAAI,CAAE,CAC1D,CACA,GAAI,GAAK,KAAK,MAAO,CACjB,IAAMA,EAAIxD,GAAKS,EAAI8C,EAAO,CAAC,EAAG9C,EAAI8C,CAAI,CAAC,EACjC,EAAI,EAAI,KAAK,MACnB,MAAO,CAAE,EAAG9C,EAAI8C,CAAI,EAAE,EAAIC,EAAE,EAAI,EAAG,EAAG/C,EAAI8C,CAAI,EAAE,EAAIC,EAAE,EAAI,CAAE,CAChE,CACA,IAAMzC,EAAI,KAAK,QAAQ,CAAC,EACxB,OAAOT,GAAKG,EAAIM,EAAI,CAAC,EAAGN,EAAIM,CAAC,EAAG,KAAK,SAASA,EAAG,CAAC,CAAC,CACvD,CACA,SAAS,EAAG,CACR,GAAM,CAAE,QAAAqC,CAAQ,EAAI,KACpB,GAAIA,EAAQ,SAAW,GAAK,GAAK,EAC7B,OAAOA,EAAQ,CAAC,EAEpB,GAAI,GAAK,KAAK,MACV,OAAOA,EAAQA,EAAQ,OAAS,CAAC,EAErC,IAAMrC,EAAI,KAAK,QAAQ,CAAC,EAClB,CAAE,EAAAL,EAAG,EAAAC,CAAE,EAAIL,GAAK8C,EAAQrC,EAAI,CAAC,EAAGqC,EAAQrC,CAAC,EAAG,KAAK,SAASA,EAAG,CAAC,CAAC,EAC/DV,EAAI,KAAK,MAAMK,EAAGC,CAAC,GAAK,EAC9B,MAAO,CAAE,EAAGD,EAAIL,EAAG,EAAGM,EAAIN,CAAE,CAChC,CACJ,EAGA,SAASoD,GAAehD,EAAKiD,EAAQ,CACjC,IAAMC,EAAWnD,GAAWC,CAAG,EAC/B,OAAOA,EAAI,IAAI,CAACG,EAAGG,IAAM,CACrB,IAAMwB,EAAIvC,GAAKS,EAAI,KAAK,IAAI,EAAGM,EAAI,CAAC,CAAC,EAAGN,EAAI,KAAK,IAAIA,EAAI,OAAS,EAAGM,EAAI,CAAC,CAAC,CAAC,EACtE6C,EAAI,CAAE,EAAG,CAACrB,EAAE,EAAG,EAAGA,EAAE,CAAE,EACtBsB,EAAKjD,EAAE,EAAI+C,EAAS,EACpBG,EAAKlD,EAAE,EAAI+C,EAAS,EACpBI,EAAK,KAAK,MAAMF,EAAIC,CAAE,EACtBE,EAAMJ,EAAE,EAAIC,EAAKD,EAAE,EAAIE,EACvBG,EAAMP,EAAO3C,CAAC,EACdmD,EAAOH,EAAK,MAAQ,KAAK,IAAIC,CAAG,EAAI,GAAMD,EAC1C,KAAK,KAAKC,CAAG,EACb,KAAK,KAAKJ,EAAE,EAAIK,EAAI,EAAIL,EAAE,EAAIK,EAAI,CAAC,GAAK,EAC9C,MAAO,CAAE,EAAGL,EAAE,EAAIM,EAAM,EAAGN,EAAE,EAAIM,CAAK,CAC1C,CAAC,CACL,CAGA,SAASC,GAAQC,EAAOC,EAAIH,EAAMzB,EAAM6B,EAAM,CAC1C,IAAMC,EAAK,KAAK,IAAID,EAAM,KAAK,IAAI7B,EAAK,OAAS,GAAI,EAAG,CAAC,EACnDhC,EAAM,CAAC,EACP+D,EAAO,CAAC,EACd,QAASjC,EAAI,EAAGA,GAAKE,EAAK,OAAS,KAAMF,GAAKgC,EAAI,CAC9C,GAAM,CAAE,EAAA5B,EAAG,EAAAC,CAAE,EAAIH,EAAK,GAAG,KAAK,IAAIF,EAAGE,EAAK,MAAM,CAAC,EAC3CgC,EAAIL,EAAM,QAAQC,EAAK1B,CAAC,EACxB+B,EAAKN,EAAM,SAASC,EAAK1B,CAAC,EAC1BgC,EAAKD,EAAG,EAAIR,EACZU,EAAKF,EAAG,EAAIR,EAClBzD,EAAI,KAAK,CAAE,EAAGgE,EAAE,EAAIE,EAAK/B,EAAG,EAAG6B,EAAE,EAAIG,EAAKhC,CAAE,CAAC,EAC7C4B,EAAK,KAAK,CAAE,EAAGG,EAAI,EAAGC,CAAG,CAAC,CAC9B,CACA,MAAO,CAAE,IAAAnE,EAAK,KAAA+D,CAAK,CACvB,CACA,IAAMK,GAAY,EACZC,GAAc,KAAQ,EAG5B,SAASC,GAAOX,EAAOC,EAAIH,EAAMc,EAAM/C,EAAQqC,EAAM,CACjD,IAAIW,EAAahD,EACbiD,EAASf,GAAQC,EAAOC,EAAIH,EAAMc,EAAKC,CAAU,EAAGX,CAAI,EAC5D,GAAIF,EAAM,SACN,OAAOc,EAEX,QAASnE,EAAI,EAAGA,EAAI,EAAGA,IAAK,CACxB,IAAMoE,EAAMnE,GAAekE,EAAO,GAAG,EACrC,GAAI,EAAEC,EAAM,IAAM,KAAK,IAAIA,EAAMlD,EAAS,CAAC,EAAI,KAC3C,MAEJgD,GAAchD,EAASkD,EACvBD,EAASf,GAAQC,EAAOC,EAAIH,EAAMc,EAAKC,CAAU,EAAGX,CAAI,CAC5D,CACA,OAAOY,CACX,CACA,SAASE,GAAOC,EAAMzB,EAAG,CACrB,OAAO,MAAM,KAAK,CAAE,OAAQA,CAAE,EAAG,CAAC0B,EAAGvE,IAAMsE,EAAQtE,EAAI,GAAY,CAAC,CACxE,CACA,SAASwE,GAAOC,EAAS,CACrB,GAAIA,EAAQ,SAAW,EACnB,MAAO,KAEX,IAAIhE,EAAK,IACLC,EAAK,KACT,QAAWxB,KAAKuF,EACZhE,EAAK,KAAK,IAAIA,EAAIvB,EAAE,MAAM,CAAC,EAC3BwB,EAAK,KAAK,IAAIA,EAAIxB,EAAE,MAAM,CAAC,EAE/B,OAAOwB,EAAKD,CAChB,CACA,SAASiE,GAAQC,EAAIC,EAAI,CACrB,OAAQD,EAAK,SAAaC,EAAK,QACnC,CACA,IAAMC,GAAN,KAAa,CACT,YAAYhE,EAAG,CACX,KAAK,EAAIA,EACT,KAAK,KAAO,IAAI,IAChB,GAAM,CAAE,IAAAiE,EAAK,MAAAC,EAAO,MAAAC,EAAO,IAAAC,EAAK,MAAAC,EAAO,MAAAC,EAAO,SAAAC,CAAS,EAAIvE,EACrDwE,EAAIP,EAAI,OACd,KAAK,OAAS,MAAM,KAAK,CAAE,OAAQO,CAAE,EAAG,IAAG,EAAY,EACvD,KAAK,OAAS,MAAM,KAAK,CAAE,OAAQA,CAAE,EAAG,IAAG,EAAY,EACvD,KAAK,OAAS,MAAM,KAAK,CAAE,OAAQA,CAAE,EAAG,IAAG,EAAY,EACvD,KAAK,MAAQxE,EAAE,MAAM,IAAI,CAACyE,EAAOC,IAAMD,EAAM,IAAIE,GAAOA,EAAI,OAAO,CAAC,CAAC3D,CAAC,IAAMA,IAAM0D,CAAC,CAAC,CAAC,EACrF,KAAK,MAAQT,EAAI,IAAIW,GAAMA,EAAG,WAAWC,EAAQ,CAAC,EAClD,IAAIC,EAAM,IACNC,EAAM,KACV,QAASL,EAAI,EAAGA,EAAIF,EAAGE,IAAK,CACxB,IAAMM,EAAQd,EAAMQ,CAAC,EACjB,CAACH,EAASS,CAAK,GAAK,OAAO,MAAMX,EAAMW,CAAK,CAAC,IAGjDF,EAAM,KAAK,IAAIA,EAAKT,EAAMW,CAAK,CAAC,EAChCD,EAAM,KAAK,IAAIA,EAAKV,EAAMW,CAAK,EAAIZ,EAAIM,CAAC,GAAKP,EAAMO,CAAC,EAAI,EAAE,EAC9D,CACA,KAAK,SAAW,IAAInD,GAAM,CACtB,CAAE,EAAGuD,EAAK,EAAG,CAAE,EACf,CAAE,EAAGC,EAAK,EAAG,CAAE,CACnB,EAAG,CACC,CAAE,EAAG,EAAG,EAAG,CAAE,EACb,CAAE,EAAG,EAAG,EAAG,CAAE,CACjB,EAAG,EAAI,EACP,KAAK,iBAAmB,CAAE,GAAID,EAAMC,GAAO,EAAG,EAAG,CAAE,EACnD,QAASL,EAAI,EAAGA,EAAIF,EAAGE,IAAK,CACxB,IAAMM,EAAQd,EAAMQ,CAAC,EACrB,GAAI,CAACH,EAASS,CAAK,GAAK,OAAO,MAAMX,EAAMW,CAAK,CAAC,EAC7C,SAEJ,IAAMnG,EAAM,CAAC,EACPoG,EAAK,CAAC,EACZ,QAAS9F,EAAI,EAAGA,EAAIgF,EAAMO,CAAC,EAAGvF,IAAK,CAC/B,IAAML,EAAIuF,EAAMW,CAAK,EAAI7F,EAAIiF,EAAIM,CAAC,EAClC7F,EAAI,KAAK,CAAE,EAAAC,EAAG,EAAGwF,EAAMU,CAAK,CAAE,CAAC,EAC/BC,EAAG,KAAKnG,EAAIgG,CAAG,CACnB,CACA,KAAK,OAAOJ,CAAC,EAAI7F,EACjB,KAAK,OAAO6F,CAAC,EAAIO,EACjB,KAAK,OAAOP,CAAC,EAAI,KAAK,SACtB,KAAK,OAAO7F,EAAK,KAAK,QAAQ,CAClC,CACJ,CACA,OAAO,YAAYmB,EAAG,CAClB,QAAS0E,EAAI,EAAGA,EAAI1E,EAAE,IAAI,OAAQ0E,IAAK,CACnC,IAAMM,EAAQhF,EAAE,MAAM0E,CAAC,EACvB,GAAI1E,EAAE,SAASgF,CAAK,GAAK,CAAC,OAAO,MAAMhF,EAAE,MAAMgF,CAAK,CAAC,EACjD,MAAO,EAEf,CACA,MAAO,EACX,CACA,KAAM,CACF,IAAME,EAAO,CAAC,EACd,QAASR,EAAI,EAAGA,EAAI,KAAK,OAAO,OAAQA,IAC/B,KAAK,OAAOA,CAAC,GACdQ,EAAK,KAAKR,CAAC,EAWnB,IAAMS,EAAS,KAAK,aAAaD,CAAI,EAChC,IAAIE,IAAY,CAAE,QAAAA,EAAS,QAAS,KAAK,UAAUA,CAAO,CAAE,EAAE,EAC9D,OAAOpG,GAAKA,EAAE,QAAQ,MAAM,EAC5B,IAAIA,IAAM,CACX,QAASA,EAAE,QACX,KAAM2E,GAAO3E,EAAE,OAAO,EACtB,MAAOA,EAAE,QAAQ,OAAO,CAAC,EAAG0F,IAAM,EAAI,KAAK,MAAMA,CAAC,EAAG,CAAC,EACtD,KAAM1F,EAAE,QACH,IAAIX,GAAK,GAAGA,EAAE,MAAM,CAAC,IAAIA,EAAE,MAAM,CAAC,EAAE,EACpC,KAAK,EACL,KAAK,GAAG,CACjB,EAAE,EACG,KAAK,CAACA,EAAGC,IAAMD,EAAE,KAAOC,EAAE,OAC1BD,EAAE,OAASC,EAAE,KAAOA,EAAE,MAAQD,EAAE,MAAQA,EAAE,MAAQC,EAAE,MAAM,EAC/D,QAAWU,KAAKmG,EACZ,KAAK,WAAWnG,EAAE,QAAS,KAAK,gBAAgB,CAExD,CACA,MAAMqG,EAAGC,EAAG,CACR,GAAM,CAAE,MAAApB,CAAM,EAAI,KAAK,EACvB,KAAK,OAAO,QAAQ,CAACrF,EAAK6F,IAAM,CACc7F,GAAI,QAAQ,CAACG,EAAGG,IAAM,CAC5DkG,EAAEnB,EAAMQ,CAAC,EAAIvF,CAAC,EAAIH,EAAE,EACpBsG,EAAEpB,EAAMQ,CAAC,EAAIvF,CAAC,EAAIH,EAAE,CACxB,CAAC,CACL,CAAC,CACL,CACA,MAAM0F,EAAG,CACL,OAAO,KAAK,EAAE,IAAIA,CAAC,GAAK,KAAK,EAAE,MAAMA,CAAC,EAAI,EAC9C,CACA,SAASA,EAAGvG,EAAM,CACd,OAAOA,EAAO,KAAK,EAAE,MAAMuG,CAAC,EAAI,EAAI,CACxC,CACA,OAAO7F,EAAK0G,EAAO,CACf,QAAWvG,KAAKH,EAAK,CACjB,IAAM2G,EAAM3B,GAAQ,KAAK,MAAM7E,EAAE,EAAI,IAAK,EAAG,KAAK,MAAMA,EAAE,EAAI,IAAK,CAAC,EAC9DyG,EAAO,KAAK,KAAK,IAAID,CAAG,EACxBE,EAAW,CAAE,EAAG1G,EAAE,EAAG,EAAGA,EAAE,EAAG,MAAAuG,CAAM,EACrCE,EACAA,EAAK,KAAKC,CAAQ,EAGlB,KAAK,KAAK,IAAIF,EAAK,CAACE,CAAQ,CAAC,CAErC,CACJ,CAKA,WAAW7G,EAAK8G,EAAQC,EAAWC,EAAO,CACtC,IAAIxG,EACJ,IAAI2C,EAAI,EACR,QAAWhD,KAAKH,EAAK,CACjB,GAAI+G,EAAU,KAAK,GAAK,KAAK,MAAM5G,EAAE,EAAI,EAAE,EAAGA,EAAE,EAAI,EAAE,CAAC,EAAI,EAAQ,EAC/D,SAEJ,IAAM8G,EAAK,KAAK,MAAM9G,EAAE,EAAI,IAAK,EAC3B+G,EAAK,KAAK,MAAM/G,EAAE,EAAI,IAAK,EACjC,QAAS8E,EAAKgC,EAAK,EAAGhC,GAAMgC,EAAK,EAAGhC,IAChC,QAASC,EAAKgC,EAAK,EAAGhC,GAAMgC,EAAK,EAAGhC,IAChC,QAAWlB,KAAMxD,EAAK,KAAK,KAAK,IAAIwE,GAAQC,EAAIC,CAAE,CAAC,KAAO,MAAQ1E,IAAO,OAASA,EAAK,CAAC,EACpF,GAAIwD,EAAE,QAAU8C,GACZ,KAAK,MAAM3G,EAAE,EAAI6D,EAAE,EAAG7D,EAAE,EAAI6D,EAAE,CAAC,EAAI,OACnCb,IACIA,GAAK6D,GACL,OAAO7D,CAM/B,CACA,OAAOA,CACX,CAKA,OAAOgE,EAAYL,EAAQC,EAAW,CAClC,IAAIK,EACAC,EAAQ,IACZ,QAAWC,KAAaH,EAAY,CAChC,IAAMhF,EAAI,KAAK,WAAWmF,EAAUjD,EAAW,EAAE,IAAKyC,EAAQC,EAAWM,CAAK,EAC9E,GAAIlF,IAAM,EACN,OAAOmF,EAAUlD,EAAS,EAE1BjC,EAAIkF,IACJA,EAAQlF,EACRiF,EAAOE,EAEf,CACA,OAAOF,EAAKhD,EAAS,CACzB,CACA,UAAUmC,EAAS,CACf,IAAMgB,EAAM,IAAI,IAAIhB,CAAO,EACrBT,EAAM,CAAC,EACb,QAAW5D,KAAKqE,EACZ,QAAWiB,KAASpI,GAChB,OAAW,CAAC+C,EAAGsF,CAAK,IAAK,KAAK,MAAMvF,CAAC,EAAEsF,CAAK,EAAG,CAC3C,IAAMxH,EAAM,KAAK,OAAOmC,CAAC,EACzB,GAAIoF,EAAI,IAAIpF,CAAC,GAAK,CAACnC,EACf,SAEJ,IAAMM,EAAI,KAAK,SAAS6B,EAAGsF,CAAK,EAChC3B,EAAI,KAAK,CACL,EAAA5D,EACA,MAAAsF,EACA,EAAArF,EACA,MAAAsF,EACA,MAAOzH,EAAIM,CAAC,EACZ,MAAO,KAAK,OAAO6B,CAAC,EACpB,EAAG,KAAK,OAAOA,CAAC,EAAE7B,CAAC,CACvB,CAAC,CACL,CAGR,OAAOwF,CACX,CACA,aAAaS,EAAS,CAClB,IAAMgB,EAAM,IAAI,IAAIhB,CAAO,EACrBmB,EAAO,IAAI,IACXC,EAAQ,CAAC,EACf,QAAWvG,KAAKmF,EAAS,CACrB,GAAImB,EAAK,IAAItG,CAAC,EACV,SAEJ,IAAMwG,EAAQ,CAACxG,CAAC,EAChBsG,EAAK,IAAItG,CAAC,EACV,QAAWc,KAAK0F,EACZ,QAAWtI,KAAQF,GACf,OAAW,CAAC+C,CAAC,IAAK,KAAK,MAAMD,CAAC,EAAE5C,CAAI,EAC5BiI,EAAI,IAAIpF,CAAC,GAAK,CAACuF,EAAK,IAAIvF,CAAC,IACzBuF,EAAK,IAAIvF,CAAC,EACVyF,EAAM,KAAKzF,CAAC,GAK5BwF,EAAM,KAAKC,CAAK,CACpB,CACA,OAAOD,CACX,CAGA,UAAUpB,EAAS3B,EAAMiD,EAAUC,EAAIC,EAAY,CAC/C,IAAMR,EAAM,IAAI,IAAIhB,CAAO,EACrBI,EAAM,CAACd,EAAGzE,IAAMyE,EAAI,EAAIzE,EACxB4G,EAAU,CAACnC,EAAGzE,IAAMyE,IAAMiC,GAAMzI,GAAM+B,CAAC,IAAM2G,EAC7CE,EAAO,IAAI,IAAI,CAAC,CAACtB,EAAI/B,EAAMiD,CAAQ,EAAG,EAAE,CAAC,CAAC,EAC1CD,EAAQ,CAAC,CAAChD,EAAMiD,CAAQ,CAAC,EAC3BK,EAAM,CAACtD,EAAMiD,CAAQ,EACzB,OAAW,CAAChC,EAAGzE,CAAC,IAAKwG,EAAO,CAExB,GADAM,EAAM,CAACrC,EAAGzE,CAAC,EACP0G,IAAO,QAAaE,EAAQnC,EAAGzE,CAAC,EAChC,MAEJ,OAAW,CAACe,EAAGL,CAAC,IAAK,KAAK,MAAM+D,CAAC,EAAExG,GAAM+B,CAAC,CAAC,EACnC,CAACmG,EAAI,IAAIpF,CAAC,GAAK8F,EAAK,IAAItB,EAAIxE,EAAGL,CAAC,CAAC,IAGrCmG,EAAK,IAAItB,EAAIxE,EAAGL,CAAC,EAAG6E,EAAId,EAAGzE,CAAC,CAAC,EAC7BwG,EAAM,KAAK,CAACzF,EAAGL,CAAC,CAAC,EAEzB,CACA,GAAIgG,IAAO,QAAa,CAACE,EAAQE,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,EAC3C,OAEJ,IAAMC,EAAO,CAAC,EACd,QAASC,EAAMzB,EAAIuB,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,EAAGE,IAAQ,GAAIA,EAAMH,EAAK,IAAIG,CAAG,EAC9DD,EAAK,KAAK,CAAE,EAAGC,GAAO,EAAG,MAAQA,EAAM,CAAG,CAAC,EAE/C,OAAOD,EAAK,QAAQ,CACxB,CACA,UAAU5B,EAAS3B,EAAMkD,EAAI,CACzB,IAAMP,EAAM,IAAI,IAAIhB,CAAO,EACrB0B,EAAO,IAAI,IAAI,CAAC,CAACrD,EAAM,EAAE,CAAC,CAAC,EAC3BtF,EAAO,IAAI,IAAI,CAAC,CAACsF,EAAM,CAAC,CAAC,CAAC,EAC1BgD,EAAQ,CAAChD,CAAI,EACnB,QAAWiB,KAAK+B,EAAO,CACnB,GAAI/B,IAAMiC,EACN,MAEJ,QAAW1G,KAAKhC,GACZ,OAAW,CAAC+C,EAAGL,CAAC,IAAK,KAAK,MAAM+D,CAAC,EAAEzE,CAAC,EAC5B,CAACmG,EAAI,IAAIpF,CAAC,GAAK8F,EAAK,IAAI9F,CAAC,IAG7B8F,EAAK,IAAI9F,EAAG0D,CAAC,EACbvG,EAAK,IAAI6C,EAAGL,CAAC,EACb8F,EAAM,KAAKzF,CAAC,EAGxB,CACA,IAAMgG,EAAO,CAAC,EACd,QAASC,EAAMN,EAAIM,IAAQ,GAAIA,EAAMH,EAAK,IAAIG,CAAG,EAC7CD,EAAK,KAAK,CAAE,EAAGC,EAAK,MAAO9I,EAAK,IAAI8I,CAAG,CAAE,CAAC,EAE9C,OAAOD,EAAK,QAAQ,CACxB,CACA,YAAYE,EAAO,CACf,GAAM,CAAE,KAAAC,CAAK,EAAI,KAAK,EACtB,OAAOD,EAAM,OAAO,CAACjH,EAAG,CAAE,EAAAyE,CAAE,IAAMzE,EAAI,KAAK,MAAMyE,CAAC,EAAIyC,EAAMA,CAAI,CACpE,CAGA,SAASD,EAAO3B,EAAO6B,EAAIC,EAAS,CAChC,GAAM,CAAE,MAAAlD,EAAO,IAAAC,EAAK,KAAA+C,CAAK,EAAI,KAAK,EAC9BxG,EAAIyG,EACFE,EAAM,CAAC,EACb,OAAW,CAAE,EAAA5C,EAAG,MAAA6C,CAAM,IAAKL,EAAO,CAC9B,IAAMxE,EAAO2E,GAAmDjD,EAAIM,CAAC,EAC/D7F,EAAM,CAAC,EACPoG,EAAK,CAAC,EACZ,QAAS9F,EAAI,EAAGA,EAAIgF,EAAMO,CAAC,EAAGvF,IAC1BN,EAAI,KAAK0G,EAAM,QAAQ5E,EAAIxB,EAAIuD,CAAI,CAAC,EACpCuC,EAAG,KAAKtE,EAAIxB,EAAIuD,CAAI,EAEpB6E,IAAU,IACV1I,EAAI,QAAQ,EACZoG,EAAG,QAAQ,GAEf,KAAK,OAAOP,CAAC,EAAI7F,EACjB,KAAK,OAAO6F,CAAC,EAAIO,EACjB,KAAK,OAAOP,CAAC,EAAIa,EACjB+B,EAAI,KAAK,GAAGzI,CAAG,EACf8B,GAAK+B,GAAQyB,EAAMO,CAAC,EAAI,GAAKyC,CACjC,CACA,OAAOG,CACX,CACA,cAAc9E,EAAOC,EAAIH,EAAMtC,EAAGwH,EAAG,CACjC,IAAMC,GAAQD,EAAIxH,GAAK,EAAI,KACrB0H,EAAQF,EAAI,EAAIxH,EAAIhC,GAAiB,CAAC,CAAC,EACvCgI,EAAa,CAAC,EACpB,QAAWzF,KAAQiD,GAAO,EAAG,CAAC,EAC1B,QAAWmE,KAAQD,EACf,QAASvI,EAAI,EAAGA,GAAK,GAAIA,IAAK,CAC1B,IAAMmB,EAAKmH,EAAOtI,EAAK,GACjB0B,EAAOD,GAAOR,GAAQJ,EAAGwH,EAAGlH,EAAGC,CAAI,EAAGP,EAAG2H,CAAI,EAC9CxI,EAAI,IAAM0B,EAAK,KAAO,IAAcK,GAAYL,CAAI,GAGzDmF,EAAW,KAAKtD,GAAQS,GAAOX,EAAOC,EAAIH,EAAMjC,GAAUO,GAAOR,GAAQJ,EAAGK,EAAQ,KAAK,IAAIC,GAAID,EAASL,GAAK,EAAI,IAAI,EAAGO,CAAI,EAAGP,EAAG2H,CAAI,EAAGH,EAAG9E,CAAI,CAAC,CACvJ,CAGR,OAAOsD,CACX,CACA,WAAWZ,EAASwC,EAAQ,CACxB,IAAIvI,EACJ,GAAM,CAAE,MAAA8E,EAAO,KAAAgD,CAAK,EAAI,KAAK,EACvBvD,EAAU,KAAK,UAAUwB,CAAO,EACtC,GAAIxB,EAAQ,SAAW,EACnB,OAEJ,IAAMiE,EAAQzC,EAAQ,MAAMV,GAAK,KAAK,MAAMA,CAAC,CAAC,EACxCoD,EAASlE,EAAQ,MAAMvF,GAAKA,EAAE,QAAUuF,EAAQ,CAAC,EAAE,KAAK,EACxDA,EAAQ,CAAC,EAAE,MACX,OACFpB,EACAC,EACAsF,EACAzF,EACJ,GAAIwF,EACAlE,EAAQ,KAAK,CAACvF,EAAGC,IAAMD,EAAE,EAAIC,EAAE,CAAC,EAChCkE,EAAQsF,EACRrF,EAAKmB,EAAQ,CAAC,EAAE,EAChBmE,EAAKnE,EAAQA,EAAQ,OAAS,CAAC,EAAE,EACjCtB,EAAOE,IAAU,KAAK,UAAYqF,EAAQ,GAAK,MAE9C,CAODjE,EAAQ,KAAK,CAACvF,EAAGC,IAAMD,EAAE,MAAM,EAAIC,EAAE,MAAM,GAAKD,EAAE,MAAM,EAAIC,EAAE,MAAM,CAAC,EACrE,IAAMD,EAAIuF,EAAQ,CAAC,EAAE,MACftF,EAAIsF,EAAQA,EAAQ,OAAS,CAAC,EAAE,MAChCoE,EAAQ,KAAK,MAAM1J,EAAE,EAAID,EAAE,EAAGC,EAAE,EAAID,EAAE,CAAC,EACvC0C,EAAIiH,EAAQ,KAAO5J,GAAKC,EAAGC,CAAC,EAAI,CAAE,EAAG,EAAG,EAAG,CAAE,EAC7C0D,EAAI,CAAE,EAAG,CAACjB,EAAE,EAAG,EAAGA,EAAE,CAAE,EACtBjB,EAAMpB,GAAKL,EAAGC,EAAG,EAAG,EAC1BgE,EAAOsB,EAAQ,KAAK9E,GAAKA,EAAE,QAAU,KAAK,QAAQ,GAC3C+I,EAAQ,GAAK,IAAM,KAAK,KAAK7F,EAAE,CAAC,GAAK,IACrClC,EAAI,EAAI8H,EAAO,GAAK5F,EAAE,GAAKlC,EAAI,EAAI8H,EAAO,GAAK5F,EAAE,GAAK,EACnD,EACA,GACVQ,EAAQ,IAAIjB,GAAM,CAAClD,EAAGC,CAAC,EAAG,CAAC0D,EAAGA,CAAC,EAAG,EAAI,EACtCS,EAAK,EACLsF,EAAKC,CACT,CACA,IAAMC,EAAIrE,EAAQ,CAAC,EACbsE,EAAItE,EAAQA,EAAQ,OAAS,CAAC,EAC9B5D,EAAI+H,EAAKtF,EACT0F,EAASvE,EAAQ,SAAW,GAAMqE,EAAE,IAAMC,EAAE,GAAKD,EAAE,QAAUC,EAAE,OAASlI,EAAI,KAC5E4F,EAAY,CAACqC,EAAE,MAAOC,EAAE,KAAK,EAC7BE,EAAQpC,GAAe,KAAK,OAAOA,EAAY8B,EAAQlC,CAAS,EAClEsB,EACA5D,EACA0B,EAAQmC,EACRE,EACJ,GAAIc,EAAQ,CACRjB,EAAQ,KAAK,UAAU9B,EAAS6C,EAAE,EAAGA,EAAE,KAAK,EAC5C,IAAMT,EAAI,KAAK,YAAYN,CAAK,EAC1BmB,EAAOJ,EAAE,MACT,KAAK,IAAI,EAAG9D,EAAM8D,EAAE,CAAC,EAAI,CAAC,EAC1B,KAAK,IAAI,EAAG9D,EAAM8D,EAAE,CAAC,EAAI,CAAC,EAE1BhH,GADOgH,EAAE,GAAK,KAAK,OAAOA,EAAE,CAAC,EAAEI,CAAI,EAAI,EAAI,IAC/B,KAAK,IAAIxK,EAAS,EAC9ByD,EAAK,KAAK,IAAIzD,EAAS,EAC7ByF,EAAS8E,EAAK5E,GAAO,EAAG,EAAE,EAAE,IAAIjD,GAASmC,GAASS,GAAOX,EAAOC,EAAIH,EAAMjC,GAAUc,GAAS,EAAGZ,EAAMU,EAAIK,EAAIjB,CAAM,EAAGmH,EAAG9E,CAAI,CAAC,CAAC,CACpI,KACK,CACDwE,GACK7H,EAAK,KAAK,UAAU+F,EAAS6C,EAAE,EAAGA,EAAE,MAAOC,EAAE,EAAGA,EAAE,KAAK,KAAO,MAAQ7I,IAAO,OAASA,EAAK,KAAK,UAAU+F,EAAS6C,EAAE,EAAGC,EAAE,CAAC,EAChI,IAAMV,EAAI,KAAK,YAAYN,CAAK,EAChC,GAAIW,EAAO,CACP,IAAMS,EAAK,KAAK,IAAI,GAAW,KAAK,IAAIxK,GAAMkC,EAAGjC,EAAO,CAAC,EACzDuF,EAAS8E,EAAK5E,GAAO8E,EAAI,EAAE,EAAE,IAAI1G,GAAMc,GAASH,GAAQC,EAAOC,EAAIH,EAAMlC,GAAQJ,EAAGD,GAAWC,EAAG4B,CAAC,EAAG,EAAG,CAAC,EAAGc,CAAI,CAAC,CAAC,EACnH,IAAM6F,EAAQnJ,GAAekE,EAAO,GAAG,EACvC+D,EAAU,KAAK,IAAI,MAAOkB,EAAQ,EAAIpB,IAAShD,EAAM+C,EAAM,CAAC,EAAE,CAAC,EAAI,EAAE,CACzE,SACSM,EAAIxH,EAAI,KACbsD,EAAS8E,EAAK,KAAK,cAAc5F,EAAOC,EAAIH,EAAMtC,EAAGwH,CAAC,CAAC,MAEtD,CACD,IAAMgB,EAAMhB,EAAI,EAAIL,EACdmB,EAAK,KAAK,IAAI,GAAW,KAAK,IAAIxK,IAAOkC,EAAIwI,GAAMzK,EAAO,CAAC,EACjEuF,EAAS8E,EAAK5E,GAAO8E,EAAI,EAAE,EAAE,IAAI1G,GAAMc,GAASS,GAAOX,EAAOC,EAAIH,EAAMjC,GAAUc,GAASnB,EAAI,EAAIK,EAAS,EAAGuB,EAAG,EAAG,EAAGvB,CAAM,EAAGmI,EAAK9F,CAAI,CAAC,CAAC,EAC5IsC,EAAQ,CACZ,CACJ,CACA,IAAMO,EAAQ,IAAIhE,GAAM+B,EAAO,IAAKzB,GAAeyB,EAAO,IAAKA,EAAO,IAAI,CAAC,EACrEmF,EAAS,KAAK,SAASvB,EAAO3B,EAAOP,EAAOqC,CAAO,EACzD,KAAK,OAAOoB,EAAQlD,CAAK,EACzB,IAAMxD,EAAWnD,GAAW6J,CAAM,EAC5BC,EAAOtD,EAAQ,OAAOV,GAAK,CAAC,KAAK,OAAOA,CAAC,CAAC,EAC1CiE,EAAO,KAAK,aAAaD,CAAI,EAC9B,IAAIjK,IAAM,CAAE,QAASA,EAAG,KAAMkF,GAAO,KAAK,UAAUlF,CAAC,CAAC,CAAE,EAAE,EAC1D,KAAK,CAACJ,EAAGC,IAAMD,EAAE,KAAOC,EAAE,IAAI,EACnC,QAAWsK,KAAOD,EACd,KAAK,WAAWC,EAAI,QAAS7G,CAAQ,CAE7C,CACJ,EAEO,SAAS8G,GAAgB7I,EAAG,CAC/B,IAAMqF,EAAI,IAAI,aAAarF,EAAE,CAAC,EAAE,KAAK,GAAG,EAClCsF,EAAI,IAAI,aAAatF,EAAE,CAAC,EAAE,KAAK,GAAG,EACxC,GAAIgE,GAAO,YAAYhE,CAAC,EAAG,CACvB,IAAM8I,EAAS,IAAI9E,GAAOhE,CAAC,EAC3B8I,EAAO,IAAI,EACXA,EAAO,MAAMzD,EAAGC,CAAC,CACrB,CACA,MAAO,CAAE,EAAAD,EAAG,EAAAC,CAAE,CAClB,CChsBA,IAAMyD,GAAU,CACZ,CAAE,MAAO,EAAG,WAAY,EAAG,EAC3B,CAAE,MAAO,EAAG,WAAY,EAAG,EAC3B,CAAE,MAAO,EAAG,WAAY,EAAG,EAC3B,CAAE,MAAO,GAAI,WAAY,EAAG,EAC5B,CAAE,MAAO,GAAI,WAAY,GAAI,CACjC,EACMC,GAAkB,GAElBC,GAAiB,EACjBC,GAAgB,GAChBC,GAAgB,EAEhBC,GAAW,IAEXC,GAAM,GAENC,GAAO,GACPC,GAAcC,GAAS,CAAE,IAAIC,EAAI,QAASA,EAAKD,EAAK,UAAY,MAAQC,IAAO,OAAS,OAASA,EAAG,QAAU,CAAG,EACvH,SAASC,GAAQC,EAAQC,EAAM,CAC3B,IAAMC,EAAMD,EAAK,GAAG,EAAE,EACtB,OAASD,IAAW,KAAOA,IAAW,OACjCE,IAAQ,KAAOA,IAAQ,MACxBF,IAAWE,CACnB,CACA,SAASC,GAASC,EAAM,CACpB,IAAIC,EAAI,KAAK,KAAKD,EAAM,UAAU,IAAM,GAAK,EAC7C,MAAO,KACHC,GAAKA,GAAK,GACVA,KAAO,EACPA,GAAKA,IAAM,GACXA,GAAKA,GAAK,EACVA,KAAO,EACAA,EAAI,WAEnB,CACO,SAASC,EAAIC,EAAOC,EAAU,CACjC,OAAO,OAAOD,GAAU,UAAY,OAAO,SAASA,CAAK,EAAIA,EAAQC,CACzE,CAEO,SAASC,GAAYC,EAASC,EAAI,CACrC,OAAO,KAAK,IAAKL,EAAII,EAAQ,sBAAuB,GAAI,EAAIC,EAAM,IAASL,EAAII,EAAQ,kBAAmB,CAAC,CAAC,CAChH,CACO,SAASE,GAAOC,EAAS,CAC5B,GAAM,CAAE,MAAAC,EAAO,MAAAC,CAAM,EAAIF,EAAQ,MAC3BG,EAAIH,EAAQ,QACZI,EAAUX,EAAIU,EAAE,kBAAmB,CAAC,EACpCE,EAAOZ,EAAIU,EAAE,WAAY,CAAC,EAC1BG,EAAML,EAAM,IAAIM,GAAKA,EAAE,EAAE,EACzBC,EAAQ,IAAI,WAAWP,EAAM,MAAM,EACnCQ,EAAQ,IAAI,WAAWR,EAAM,MAAM,EACnCS,EAAM,IAAI,aAAaT,EAAM,MAAM,EACrCM,EAAI,EACRN,EAAM,QAAQ,CAACjB,EAAM2B,IAAM,CACvB,IAAMC,EAAQhB,GAAYO,EAAGnB,EAAK,MAAM,EAClC6B,EAAQ,KAAK,IAAI,EAAG,KAAK,KAAKD,EAAQR,CAAO,CAAC,EACpDI,EAAMG,CAAC,EAAIJ,EACXE,EAAME,CAAC,EAAIE,EAAQ,EACnBH,EAAIC,CAAC,EAAIC,EAAQC,EACjBN,GAAKM,EAAQ,CACjB,CAAC,EACD,IAAMC,EAAU,IAAI,WAAWP,CAAC,EAC1BQ,EAAU,IAAI,WAAWR,CAAC,EAC1BS,EAAQ,IAAI,aAAaT,CAAC,EAAE,KAAK,GAAG,EACpCU,EAAQ,IAAI,aAAaV,CAAC,EAAE,KAAK,GAAG,EACpCW,EAAW,IAAI,WAAWX,CAAC,EAC3BY,EAAW,MAAM,KAAK,CAAE,OAAQZ,CAAE,EAAG,IAAM,CAAC,CAAC,EACnDN,EAAM,QAAQ,CAACjB,EAAM2B,IAAM,CACvB,IAAMS,EAAS,OAAOpC,EAAK,GAAM,UAAY,OAAOA,EAAK,GAAM,SACzDqC,EAAYtC,GAAWC,CAAI,EAAI,EAAI,EACzC,QAASsC,EAAI,EAAGA,EAAIb,EAAME,CAAC,EAAGW,IAAK,CAC/B,IAAMC,EAAIf,EAAMG,CAAC,EAAIW,EACrBR,EAAQS,CAAC,EAAIZ,EACbI,EAAQQ,CAAC,EAAID,EACbJ,EAASK,CAAC,EAAIF,EACVD,IACAJ,EAAMO,CAAC,EAAIvC,EAAK,EAAIsC,EAAIZ,EAAIC,CAAC,EAC7BM,EAAMM,CAAC,EAAIvC,EAAK,GAEhBsC,EAAI,IACJH,EAASI,EAAI,CAAC,EAAE,KAAK,CAACA,EAAGb,EAAIC,CAAC,CAAC,CAAC,EAChCQ,EAASI,CAAC,EAAE,KAAK,CAACA,EAAI,EAAGb,EAAIC,CAAC,CAAC,CAAC,EAExC,CACJ,CAAC,EACD,IAAMa,EAAQ,IAAI,IAAIlB,EAAI,IAAI,CAACmB,EAAId,IAAM,CAACc,EAAId,CAAC,CAAC,CAAC,EAC3Ce,EAAQzB,EAAM,IAAI,IAAM,CAAC,CAAC,EAAG,CAAC,CAAC,CAAC,EACtC,QAAW0B,KAAQzB,EAAO,CACtB,IAAM0B,EAAIJ,EAAM,IAAIG,EAAK,IAAI,EACvBE,EAAIL,EAAM,IAAIG,EAAK,EAAE,EAK3B,GAJIC,IAAM,QAAaC,IAAM,QAIzBD,IAAMC,GAAKpB,EAAMmB,CAAC,GAAK,EACvB,SAEJ,IAAME,EAAW5C,GAAQyC,EAAK,WAAYA,EAAK,IAAI,EAAI,EAAI,EACrDI,EAAS7C,GAAQyC,EAAK,SAAUA,EAAK,EAAE,EAAI,EAAI,EAC/CK,EAAIxB,EAAMoB,CAAC,GAAKE,EAAWrB,EAAMmB,CAAC,EAAI,EAAI,GAC1CL,EAAIf,EAAMqB,CAAC,GAAKE,EAAStB,EAAMoB,CAAC,EAAI,EAAI,GAC9CV,EAASa,CAAC,EAAE,KAAK,CAACT,EAAGlB,CAAI,CAAC,EAC1Bc,EAASI,CAAC,EAAE,KAAK,CAACS,EAAG3B,CAAI,CAAC,EAC1BqB,EAAME,CAAC,EAAEE,CAAQ,EAAE,KAAK,CAACD,EAAGE,CAAM,CAAC,EACnCL,EAAMG,CAAC,EAAEE,CAAM,EAAE,KAAK,CAACH,EAAGE,CAAQ,CAAC,CACvC,CACA,IAAMG,EAAM,IAAI,WAAW1B,EAAI,CAAC,EAChC,QAASe,EAAI,EAAGA,EAAIf,EAAGe,IACnBW,EAAIX,EAAI,CAAC,EAAIW,EAAIX,CAAC,EAAIH,EAASG,CAAC,EAAE,OAEtC,IAAMY,EAAK,IAAI,WAAWD,EAAI1B,CAAC,CAAC,EAC1B4B,EAAK,IAAI,aAAaF,EAAI1B,CAAC,CAAC,EAClC,QAASe,EAAI,EAAGA,EAAIf,EAAGe,IACnBH,EAASG,CAAC,EAAE,QAAQ,CAAC,CAACC,EAAGa,CAAC,EAAGzB,IAAM,CAC/BuB,EAAGD,EAAIX,CAAC,EAAIX,CAAC,EAAIY,EACjBY,EAAGF,EAAIX,CAAC,EAAIX,CAAC,EAAIyB,CACrB,CAAC,EAEL,MAAO,CACH,IAAA9B,EACA,MAAAE,EACA,MAAAC,EACA,IAAAC,EACA,MAAAgB,EACA,QAAAZ,EACA,QAAAC,EACA,MAAAC,EACA,MAAAC,EACA,SAAAC,EACA,IAAAe,EACA,GAAAC,EACA,GAAAC,EACA,EAAA5B,EACA,KAAAF,CACJ,CACJ,CAEA,SAASgC,GAAWC,EAAG,CACnB,GAAM,CAAE,EAAA/B,EAAG,IAAA0B,EAAK,GAAAC,CAAG,EAAII,EACjBC,EAAO,IAAI,WAAWhC,CAAC,EAAE,KAAK,EAAE,EAChCiC,EAAU,CAAC,EACjB,QAAShD,EAAI,EAAGA,EAAIe,EAAGf,IAAK,CACxB,GAAI+C,EAAK/C,CAAC,GAAK,EACX,SAEJ,IAAMiD,EAAQ,CAACjD,CAAC,EAChB+C,EAAK/C,CAAC,EAAIgD,EAAQ,OAClB,QAAWR,KAAKS,EACZ,QAASC,EAAIT,EAAID,CAAC,EAAGU,EAAIT,EAAID,EAAI,CAAC,EAAGU,IAAK,CACtC,IAAMnB,EAAIW,EAAGQ,CAAC,EACVH,EAAKhB,CAAC,EAAI,IACVgB,EAAKhB,CAAC,EAAIiB,EAAQ,OAClBC,EAAM,KAAKlB,CAAC,EAEpB,CAEJiB,EAAQ,KAAKC,CAAK,CACtB,CACA,MAAO,CAAE,KAAAF,EAAM,QAAAC,CAAQ,CAC3B,CACO,SAASG,GAAa3C,EAAS4C,EAAO,CAAC,EAAG,CAC7C,IAAI3D,EAAI4D,EAAIC,EACZ,IAAMR,EAAIvC,GAAOC,CAAO,EAClB,CAAE,EAAAO,EAAG,IAAA0B,EAAK,GAAAC,EAAI,GAAAC,EAAI,MAAAnB,EAAO,MAAAC,EAAO,MAAAT,EAAO,MAAAC,EAAO,IAAAC,EAAK,KAAAL,CAAK,EAAIiC,EAC5DnC,EAAIH,EAAQ,QACZ+C,EAAUxE,GAAQ,KAAK,IAAI,EAAG,KAAK,IAAI,EAAGkB,GAAKR,EAAK2D,EAAK,WAAa,MAAQ3D,IAAO,OAASA,EAAKkB,EAAE,QAAS,CAAC,CAAC,CAAC,CAAC,EAClH6C,EAAMvD,GAAKoD,EAAKD,EAAK,uBAAyB,MAAQC,IAAO,OAASA,EAAK1C,EAAE,oBAAqB,EAAE,EACpG8C,EAAO3D,GAASG,GAAKqD,EAAKF,EAAK,QAAU,MAAQE,IAAO,OAASA,EAAK3C,EAAE,KAAM,CAAC,CAAC,EAChF+C,EAAI,IAAI,aAAa3C,CAAC,EACtB4C,EAAI,IAAI,aAAa5C,CAAC,EACtB6C,EAAgB,CAAC,EACvB,GAAI7C,IAAM,EACN,MAAO,CAAE,cAAA6C,CAAc,EAE3B,GAAM,CAAE,KAAAb,EAAM,QAAAC,CAAQ,EAAIH,GAAWC,CAAC,EAClCe,EAAO,IACPC,EAAQ,EACZ,QAASZ,EAAI,EAAGA,EAAIR,EAAG,OAAQQ,IAC3BW,EAAO,KAAK,IAAIA,EAAMlB,EAAGO,CAAC,CAAC,EAC3BY,GAASnB,EAAGO,CAAC,EAEjBY,GAAS,EACT,IAAIC,EAAU,GACd,QAASjC,EAAI,EAAGA,EAAIf,EAAGe,IACnB,GAAI,CAAC,OAAO,MAAMN,EAAMM,CAAC,CAAC,EAAG,CACzBiC,EAAU,GACV,KACJ,CAEJ,IAAMC,EAASD,EAAUE,GAAgBnB,CAAC,EAAI,OACxCoB,EAAO,KAAK,KAAKnD,CAAC,EAAI,GAC5B,QAASe,EAAI,EAAGA,EAAIf,EAAGe,IACfkC,GAAU,CAAC,OAAO,MAAMA,EAAO,EAAElC,CAAC,CAAC,GACnC4B,EAAE5B,CAAC,EAAIkC,EAAO,EAAElC,CAAC,EACjB6B,EAAE7B,CAAC,EAAIkC,EAAO,EAAElC,CAAC,GAEZiC,GAAW,CAAC,OAAO,MAAMvC,EAAMM,CAAC,CAAC,GACtC4B,EAAE5B,CAAC,EAAIN,EAAMM,CAAC,EAAI2B,EAAK,EAAI,GAC3BE,EAAE7B,CAAC,EAAIL,EAAMK,CAAC,EAAI2B,EAAK,EAAI,KAG3BC,EAAE5B,CAAC,EAAI2B,EAAK,EAAIS,EAChBP,EAAE7B,CAAC,EAAI2B,EAAK,EAAIS,GAKxB,IAAM9C,EAAQ4B,EAAQ,IAAImB,GAAUH,IAAW,QAAaG,EAAO,MAAMrC,GAAK,CAAC,OAAO,MAAMkC,EAAO,EAAElC,CAAC,CAAC,CAAC,CAAC,EACnGsC,EAAQ,CAAC,EACXC,EAAc,GAClB,QAASvC,EAAI,EAAGA,EAAIf,EAAGe,IACdV,EAAM2B,EAAKjB,CAAC,CAAC,IACdsC,EAAM,KAAKtC,CAAC,EACZuC,IAAgBA,EAAc,CAAC,OAAO,MAAM7C,EAAMM,CAAC,CAAC,IAG5D,IAAMwC,EAAO,KAAK,IAAIR,EAAQ,EAAGD,EAAO,EAAE,EACpCU,EAASD,EAAOA,EAChBE,EAASnF,GAAMwE,EAAOA,EACtB,CAAE,MAAAY,GAAO,WAAAC,EAAW,EAAInB,EACxBoB,GAAS,KAAK,IAAIJ,EAASC,CAAM,EAAI,KAAK,IAAI,EAAGE,GAAa,CAAC,EAC/DE,GAAS,KAAK,IAAIf,CAAI,EACtBgB,GAAS,KAAK,IAAIP,CAAI,EACtBQ,GAAO,CAAChD,EAAGiD,EAAGC,EAAGC,IAAQ,CAC3B,IAAIC,EAAKD,GAAOD,EAAIA,GAChBE,EAAK,IACLA,EAAK,GAET,IAAMC,EAAKzB,EAAE5B,CAAC,EAAI4B,EAAEqB,CAAC,EACfK,EAAKzB,EAAE7B,CAAC,EAAI6B,EAAEoB,CAAC,EACfM,EAAM,KAAK,KAAKF,EAAKA,EAAKC,EAAKA,CAAE,GAAK,KACtCE,EAAKJ,GAAMG,EAAML,IAAO,EAAIK,GAC5BE,EAAKD,EAAIH,EACTK,EAAKF,EAAIF,EACf1B,EAAE5B,CAAC,EAAI4B,EAAE5B,CAAC,EAAIyD,EACd5B,EAAE7B,CAAC,EAAI6B,EAAE7B,CAAC,EAAI0D,EACd9B,EAAEqB,CAAC,EAAIrB,EAAEqB,CAAC,EAAIQ,EACd5B,EAAEoB,CAAC,EAAIpB,EAAEoB,CAAC,EAAIS,CAClB,EAGIC,GAAS,EACPC,GAAO,CAAC5D,EAAG6D,IAAW,CACxB,IAAIC,EAAQ9C,EAAE,QAAQhB,CAAC,EACnB+D,EAAM/C,EAAE,QAAQhB,CAAC,EACjBgE,EAAMrC,EAAK,EAAI,GAAM,GAAK,EAC1BsC,EAAYJ,EAChB,QAASK,EAAO,EAAGA,EAAO5G,GAAU4G,IAAQ,CACxC,IAAM7B,EAASlD,EAAM2E,CAAK,EACpBK,EAAO/E,EAAI0E,CAAK,EAChBM,GAASJ,EAAM,EAAI3B,EAAS,EAAI0B,EAAMA,GAAOI,EACnD,GAAIF,GAAaG,EAAO,CACpB,IAAM7E,EAAQ,KAAK,MAAM0E,EAAYE,CAAI,EACzC,OAAAR,GAASE,EAASI,EAAY1E,EAAQ4E,EAC/BjF,EAAM4E,CAAK,EAAIC,EAAMC,EAAMzE,CACtC,CACA0E,GAAaG,EACb,IAAMC,EAAMrD,EAAE,MAAM8C,CAAK,EAAEE,EAAM,EAAI,EAAI,CAAC,EAC1C,GAAIK,EAAI,SAAW,EACf,OAAAV,GAASE,EAASI,EACX/E,EAAM4E,CAAK,GAAKE,EAAM,EAAI3B,EAAS,EAAI,GAElD,GAAM,CAACiC,EAAMC,CAAS,EAAIF,EAAI,KAAK,MAAM1C,EAAK,EAAI0C,EAAI,MAAM,CAAC,EAK7D,GAJAJ,GAAalF,EACb+E,EAAQQ,EACRN,EAAMO,IAAc,EAAI,EAAI,GAC5BR,EAAMQ,IAAc,EAAI,EAAIpF,EAAMmF,CAAI,EAAI,EACtCL,GAAa,EACb,OAAAN,GAASE,EAASI,EACX/E,EAAM4E,CAAK,EAAIC,CAE9B,CACA,MAAO,EACX,EACMS,GAAgB,CAACxE,EAAGmD,IAAQ,CAC9B,QAAS/B,EAAIT,EAAIX,CAAC,EAAGoB,EAAIT,EAAIX,EAAI,CAAC,EAAGoB,IAAK,CACtC,IAAM6B,EAAIrC,EAAGQ,CAAC,EACV6B,EAAIjD,GACJgD,GAAKhD,EAAGiD,EAAGpC,EAAGO,CAAC,EAAG+B,CAAG,CAE7B,CACJ,EACMsB,EAAQ,WAAW,KAAKnC,CAAK,EAC7BoC,GAAOnC,EAAc,KAAK,MAAM/E,GAAOoF,EAAU,EAAI,EAC3D,QAAS+B,EAAIrC,EAAM,OAASoC,GAAO9B,GAAY+B,EAAI/B,GAAY+B,IAAK,CAChE,IAAMxB,EAAMV,EAAS,KAAK,IAAI,CAACI,GAAS8B,CAAC,EACzC,QAAStF,EAAIoF,EAAM,OAAS,EAAGpF,EAAI,EAAGA,IAAK,CACvC,IAAMmE,EAAI,KAAK,MAAM7B,EAAK,GAAKtC,EAAI,EAAE,EAC/BuF,EAAMH,EAAMpF,CAAC,EACnBoF,EAAMpF,CAAC,EAAIoF,EAAMjB,CAAC,EAClBiB,EAAMjB,CAAC,EAAIoB,CACf,CACA,QAAW5E,KAAKyE,EAAO,CACnBD,GAAcxE,EAAGmD,CAAG,EACpB,QAASrC,EAAI,EAAGA,EAAI6B,GAAO7B,IAAK,CAC5B,IAAM+C,EAAS,KAAK,IAAIf,GAASnB,EAAK,GAAKoB,GAASD,GAAO,EACrDG,EAAIW,GAAK5D,EAAG6D,CAAM,EACpBZ,GAAK,GAAKA,IAAMjD,GAAK2D,GAAS,GAC9BX,GAAKhD,EAAGiD,EAAGU,GAAQR,CAAG,CAE9B,CACJ,CACJ,CAGA,IAAM0B,EAAS1H,GAAiB4B,EAC1B+F,GAAM,CAACC,EAAGC,IAAO,KAAK,MAAMD,EAAIF,CAAM,EAAI,SAAa,KAAK,MAAMG,EAAIH,CAAM,EAAI,SACtF,QAASnE,EAAI,EAAGA,GAAK4B,EAAM,OAASpF,GAAkB,GAAIwD,IAAK,CAC3D,IAAMuE,EAAO,IAAI,IACjB,QAAWjF,KAAKsC,EAAO,CACnB,IAAM,EAAIwC,GAAIlD,EAAE5B,CAAC,EAAG6B,EAAE7B,CAAC,CAAC,EAClBkF,EAAOD,EAAK,IAAI,CAAC,EACnBC,EACAA,EAAK,KAAKlF,CAAC,EAGXiF,EAAK,IAAI,EAAG,CAACjF,CAAC,CAAC,CAEvB,CACA,QAAWA,KAAKsC,EAAO,CACnB,IAAM6C,EAAK,KAAK,MAAMvD,EAAE5B,CAAC,EAAI6E,CAAM,EAC7BO,EAAK,KAAK,MAAMvD,EAAE7B,CAAC,EAAI6E,CAAM,EACnC,QAASQ,EAAKF,EAAK,EAAGE,GAAMF,EAAK,EAAGE,IAChC,QAASC,EAAKF,EAAK,EAAGE,GAAMF,EAAK,EAAGE,IAAM,CACtC,IAAMJ,EAAOD,EAAK,IAAKI,EAAK,SAAaC,EAAK,QAAS,EACvD,GAAKJ,EAGL,QAAWjC,KAAKiC,EAAM,CAClB,GAAIjC,GAAKjD,EACL,SAEJ,IAAIuF,EAAS,GACb,QAASnE,EAAIT,EAAIX,CAAC,EAAGoB,EAAIT,EAAIX,EAAI,CAAC,EAAGoB,IACjC,GAAIR,EAAGQ,CAAC,IAAM6B,EAAG,CACbsC,EAAS,GACT,KACJ,CAEJ,GAAIA,EACA,SAEJ,IAAMlC,EAAKzB,EAAE5B,CAAC,EAAI4B,EAAEqB,CAAC,EACfK,EAAKzB,EAAE7B,CAAC,EAAI6B,EAAEoB,CAAC,EACfM,EAAM,KAAK,KAAKF,EAAKA,EAAKC,EAAKA,CAAE,EACvC,GAAIC,GAAOsB,EACP,SAEJ,IAAIpB,EACAC,GACJ,GAAIH,EAAM,KAAM,CACZ,IAAMC,EAAKpG,IAAiByH,EAAStB,IAAS,EAAIA,GAClDE,EAAKD,EAAIH,EACTK,GAAKF,EAAIF,CACb,MAEIG,EAAKrG,GAAgByH,GAAUlD,EAAK,EAAI,IACxC+B,GAAKtG,GAAgByH,GAAUlD,EAAK,EAAI,IAE5CC,EAAE5B,CAAC,EAAI4B,EAAE5B,CAAC,EAAIyD,EACd5B,EAAE7B,CAAC,EAAI6B,EAAE7B,CAAC,EAAI0D,GACd9B,EAAEqB,CAAC,EAAIrB,EAAEqB,CAAC,EAAIQ,EACd5B,EAAEoB,CAAC,EAAIpB,EAAEoB,CAAC,EAAIS,EAClB,CACJ,CAER,CACA,QAAW1D,KAAKsC,EACZkC,GAAcxE,EAAG,GAAQ,CAEjC,CAGA,QAASX,EAAI,EAAGA,EAAIF,EAAM,OAAQE,IAAK,CACnC,IAAMiB,EAAIpB,EAAMG,CAAC,EACX,EAAIF,EAAME,CAAC,EACjB,GAAI,IAAI,GAGR,SAASnB,EAAI,EAAGA,EAAIb,GAAea,IAAK,CACpC,IAAMsH,EAAK5D,EAAE,MAAMtB,EAAGA,EAAI,CAAC,EACrBmF,EAAK5D,EAAE,MAAMvB,EAAGA,EAAI,CAAC,EAC3B,QAASN,EAAI,EAAGA,EAAI,EAAI,EAAGA,IACvB4B,EAAEtB,EAAIN,CAAC,EAAI,GAAMwF,EAAGxF,CAAC,EAAI,KAAQwF,EAAGxF,EAAI,CAAC,EAAIwF,EAAGxF,EAAI,CAAC,GACrD6B,EAAEvB,EAAIN,CAAC,EAAI,GAAMyF,EAAGzF,CAAC,EAAI,KAAQyF,EAAGzF,EAAI,CAAC,EAAIyF,EAAGzF,EAAI,CAAC,EAE7D,CACA0F,GAAQ9D,EAAGC,EAAGvB,EAAG,EAAGlB,EAAIC,CAAC,CAAC,EAC9B,CACAsG,GAAe1E,EAAMC,EAASU,EAAGC,EAAGI,EAASP,CAAG,EAChD,QAASrC,EAAI,EAAGA,EAAI2B,EAAE,IAAI,OAAQ3B,IAAK,CACnC,IAAMgD,EAAS,CAAC,EAChB,QAASrC,EAAI,EAAGA,EAAIb,EAAME,CAAC,EAAGW,IAC1BqC,EAAO,KAAK,CAAE,EAAGT,EAAE1C,EAAMG,CAAC,EAAIW,CAAC,EAAG,EAAG6B,EAAE3C,EAAMG,CAAC,EAAIW,CAAC,CAAE,CAAC,EAE1D8B,EAAcd,EAAE,IAAI3B,CAAC,CAAC,EAAIgD,CAC9B,CACA,MAAO,CAAE,cAAAP,CAAc,CAC3B,CAMA,SAAS4D,GAAQ9D,EAAGC,EAAGvB,EAAGsF,EAAGxG,EAAK,CAC9ByG,GAAMjE,EAAGC,EAAGvB,EAAGsF,EAAGxG,GAAOwG,EAAI,EAAE,EAC/B,IAAME,EAAU,IAAI,aAAaF,CAAC,EAClC,QAAS5F,EAAI,EAAGA,EAAI4F,EAAG5F,IACnB8F,EAAQ9F,CAAC,EACL8F,EAAQ9F,EAAI,CAAC,EACT,KAAK,MAAM4B,EAAEtB,EAAIN,CAAC,EAAI4B,EAAEtB,EAAIN,EAAI,CAAC,EAAG6B,EAAEvB,EAAIN,CAAC,EAAI6B,EAAEvB,EAAIN,EAAI,CAAC,CAAC,EAEvE,GAAI,CAAC8F,EAAQF,EAAI,CAAC,EACd,OAEJ,IAAM5D,EAAQ8D,EAAQF,EAAI,CAAC,EACrBJ,EAAK5D,EAAE,MAAMtB,EAAGA,EAAIsF,CAAC,EACrBH,EAAK5D,EAAE,MAAMvB,EAAGA,EAAIsF,CAAC,EACvBG,EAAM,EACV,QAAS/F,EAAI,EAAGA,EAAI,EAAI4F,EAAG5F,IAAK,CAC5B,IAAM9B,EAAK8D,EAAQhC,GAAM4F,EAAI,GAC7B,KAAOG,EAAMH,EAAI,GAAKE,EAAQC,CAAG,EAAI7H,GACjC6H,IAEJ,IAAMC,EAAOF,EAAQC,CAAG,EAAID,EAAQC,EAAM,CAAC,EACrCpB,EAAIqB,EAAO,GAAK9H,EAAI4H,EAAQC,EAAM,CAAC,GAAKC,EAAO,EACrDpE,EAAEtB,EAAIN,CAAC,EAAIwF,EAAGO,EAAM,CAAC,GAAKP,EAAGO,CAAG,EAAIP,EAAGO,EAAM,CAAC,GAAKpB,EACnD9C,EAAEvB,EAAIN,CAAC,EAAIyF,EAAGM,EAAM,CAAC,GAAKN,EAAGM,CAAG,EAAIN,EAAGM,EAAM,CAAC,GAAKpB,CACvD,CACJ,CAKA,SAASkB,GAAMjE,EAAGC,EAAGvB,EAAGsF,EAAGK,EAAQ,CAC/B,IAAM1F,EAAID,EAAIsF,EAAI,EACZT,EAAKvD,EAAEtB,CAAC,EACR8E,EAAKvD,EAAEvB,CAAC,EACR4F,EAAQ,KAAK,MAAMtE,EAAErB,CAAC,EAAI4E,EAAItD,EAAEtB,CAAC,EAAI6E,CAAE,EACvCe,EAAKD,EAAQ,MAAQtE,EAAErB,CAAC,EAAI4E,GAAMe,EAAQ,EAC1CE,EAAKF,EAAQ,MAAQrE,EAAEtB,CAAC,EAAI6E,GAAMc,EAAQ,EAC1CG,EAAQ,IAAI,aAAaT,CAAC,EAC1BjF,EAAM,IAAI,aAAaiF,CAAC,EAC1BU,EAAO,GACX,QAAStG,EAAI,EAAGA,EAAI4F,EAAG5F,IAAK,CACxB,IAAMqD,EAAKzB,EAAEtB,EAAIN,CAAC,EAAImF,EAChB7B,EAAKzB,EAAEvB,EAAIN,CAAC,EAAIoF,EACtBiB,EAAMrG,CAAC,EAAIqD,EAAK8C,EAAK7C,EAAK8C,EAC1BzF,EAAIX,CAAC,EAAIsD,EAAK6C,EAAK9C,EAAK+C,EACxBE,IAASA,EAAO,KAAK,IAAI3F,EAAIX,CAAC,CAAC,EAAI,KACvC,CACA,IAAMuG,EAAYC,GAAM,CACpB,IAAIxE,EAAQ,EACZ,QAAShC,EAAI,EAAGA,EAAI4F,EAAG5F,IACnBgC,GAAS,KAAK,MAAMqE,EAAMrG,CAAC,EAAIqG,EAAMrG,EAAI,CAAC,EAAGwG,GAAK7F,EAAIX,CAAC,EAAIW,EAAIX,EAAI,CAAC,EAAE,EAE1E,OAAOgC,CACX,EACA,GAAIsE,GAAQC,EAAS,CAAC,GAAKN,EACvB,OAEJ,IAAIQ,EAAK,EACLC,EAAK,EACT,KAAOH,EAASG,CAAE,EAAIT,GAAUS,EAAK,KACjCD,EAAKC,EACLA,GAAM,EAEV,QAASC,EAAK,EAAGA,EAAK,GAAIA,IAAM,CAC5B,IAAMC,GAAOH,EAAKC,GAAM,EACpBH,EAASK,CAAG,EAAIX,EAChBQ,EAAKG,EAGLF,EAAKE,CAEb,CACA,IAAMJ,GAAKC,EAAKC,GAAM,EACtB,QAAS1G,EAAI,EAAGA,EAAI,EAAI4F,EAAG5F,IACvB4B,EAAEtB,EAAIN,CAAC,EAAImF,EAAKkB,EAAMrG,CAAC,EAAImG,EAAKK,EAAI7F,EAAIX,CAAC,EAAIoG,EAC7CvE,EAAEvB,EAAIN,CAAC,EAAIoF,EAAKiB,EAAMrG,CAAC,EAAIoG,EAAKI,EAAI7F,EAAIX,CAAC,EAAImG,CAErD,CAIA,SAASR,GAAe1E,EAAMC,EAASU,EAAGC,EAAGI,EAASP,EAAK,CACvD,GAAI,CAACO,EACD,QAAWI,KAAUnB,EACjB2F,GAAsBjF,EAAGC,EAAGQ,CAAM,EAG1C,GAAInB,EAAQ,OAAS,EACjB,OAEJ,IAAM4F,EAAO,IAAI,aAAa5F,EAAQ,MAAM,EAAE,KAAK,GAAQ,EACrD6F,EAAO,IAAI,aAAa7F,EAAQ,MAAM,EAAE,KAAK,GAAQ,EACrD8F,EAAO,IAAI,aAAa9F,EAAQ,MAAM,EAAE,KAAK,IAAS,EAC5D,QAASlB,EAAI,EAAGA,EAAI4B,EAAE,OAAQ5B,IAAK,CAC/B,IAAMX,EAAI4B,EAAKjB,CAAC,EAChB8G,EAAKzH,CAAC,EAAI,KAAK,IAAIyH,EAAKzH,CAAC,EAAGuC,EAAE5B,CAAC,CAAC,EAChC+G,EAAK1H,CAAC,EAAI,KAAK,IAAI0H,EAAK1H,CAAC,EAAGwC,EAAE7B,CAAC,CAAC,EAChCgH,EAAK3H,CAAC,EAAI,KAAK,IAAI2H,EAAK3H,CAAC,EAAGwC,EAAE7B,CAAC,CAAC,CACpC,CACA,IAAMiH,EAAQ,IAAI,aAAa/F,EAAQ,MAAM,EACzC8D,EAAI,EACR,QAAS3F,EAAI,EAAGA,EAAI6B,EAAQ,OAAQ7B,IAChC4H,EAAM5H,CAAC,EAAI2F,EAAI+B,EAAK1H,CAAC,EACrB2F,GAAKgC,EAAK3H,CAAC,EAAI0H,EAAK1H,CAAC,EAAIqC,EAE7B,QAAS1B,EAAI,EAAGA,EAAI4B,EAAE,OAAQ5B,IAAK,CAC/B,IAAMX,EAAI4B,EAAKjB,CAAC,EAChB4B,EAAE5B,CAAC,EAAI4B,EAAE5B,CAAC,EAAI8G,EAAKzH,CAAC,EACpBwC,EAAE7B,CAAC,EAAI6B,EAAE7B,CAAC,EAAIiH,EAAM5H,CAAC,CACzB,CACJ,CACA,SAASwH,GAAsBjF,EAAGC,EAAGQ,EAAQ,CACzC,GAAIA,EAAO,OAAS,EAChB,OAEJ,IAAI8C,EAAK,EACLC,EAAK,EACT,QAAWpF,KAAKqC,EACZ8C,GAAMvD,EAAE5B,CAAC,EACToF,GAAMvD,EAAE7B,CAAC,EAEbmF,GAAM9C,EAAO,OACb+C,GAAM/C,EAAO,OACb,IAAI6E,EAAM,EACNC,EAAM,EACNC,EAAM,EACV,QAAWpH,KAAKqC,EAAQ,CACpB,IAAMgB,EAAKzB,EAAE5B,CAAC,EAAImF,EACZ7B,EAAKzB,EAAE7B,CAAC,EAAIoF,EAClB8B,GAAO7D,EAAKA,EACZ8D,GAAO7D,EAAKA,EACZ8D,GAAO/D,EAAKC,CAChB,CACA,IAAM+D,EAAQ,IAAO,KAAK,MAAM,EAAID,EAAKF,EAAMC,CAAG,EAC5CG,EAAM,KAAK,IAAID,CAAK,EACpBE,EAAM,KAAK,IAAIF,CAAK,EAC1B,QAAWrH,KAAKqC,EAAQ,CACpB,IAAMgB,EAAKzB,EAAE5B,CAAC,EAAImF,EACZ7B,EAAKzB,EAAE7B,CAAC,EAAIoF,EAClBxD,EAAE5B,CAAC,EAAImF,EAAKmC,EAAMjE,EAAKkE,EAAMjE,EAC7BzB,EAAE7B,CAAC,EAAIoF,EAAKmC,EAAMlE,EAAKiE,EAAMhE,CACjC,CACJ,CChjBA,IAAIkE,GAAiB,CACnB,CACE,MAAO,OACP,MAAO,iBACP,YAAa,6FACf,EACA,CACE,MAAO,SACP,MAAO,SACP,YAAa,yNACf,CACF,EACIC,GAAuBD,GAAe,IAAKE,GAAMA,EAAE,KAAK,EAI5D,IAAIC,GAAe,MAAOC,GAAY,CACpC,IAAMC,EAAQ,YAAY,IAAI,EAE9B,MAAO,CAAE,OADMD,EAAQ,QAAQ,SAAW,SAAWE,GAAaF,CAAO,EAAI,MAAMG,GAAWH,CAAO,EACpF,SAAU,YAAY,IAAI,EAAIC,CAAM,CACvD,ECtBA,IAAIG,GAAmB,GACnBC,GAAyB,IACzBC,GAA8B,EAClC,SAASC,GAAgBC,EAAMC,EAAQ,CACrC,OAAO,KAAK,IACVD,EAAK,sBAAwBC,EAAS,IACtCD,EAAK,iBACP,CACF,CACA,SAASE,GAAiBC,EAAOC,EAAgBN,GAA6B,CAE5E,IAAMO,EADcF,EAAM,MAAM,OAAO,CAACG,EAAKC,IAAMD,EAAMC,EAAE,OAAQ,CAAC,EACpC,IAC1BC,EAAS,KAAK,IAClBL,EAAM,MAAM,OAASP,GACrBC,EACF,EACA,MAAO,CACL,sBAAuBQ,EAAY,EAAIG,EAASH,EAAY,IAC5D,kBAAmB,KAAK,IAAIP,GAA6BM,CAAa,EACtE,WAAY,EACZ,kBAAmB,EACrB,CACF,CACA,IAAIK,GAAsB,CAAE,MAAO,EAAG,OAAQ,CAAE,EAChD,SAASC,GAAeC,EAAK,CAC3B,OAAOA,EAAI,QAAU,GAAKA,EAAI,SAAW,CAC3C,CACA,SAASC,GAAeT,EAAOQ,EAAK,CAClC,IAAME,EAAQV,EAAM,MAAM,OACpBW,EAAcX,EAAM,MAAM,OAAO,CAACG,EAAKC,IAAMD,EAAMC,EAAE,OAAQ,CAAC,EAC9DQ,EAASF,EAAQ,EAAIC,EAAcD,EAAQ,EAC3CG,EAAYH,EAAQ,EAAI,KAAK,IAAIA,EAAQjB,GAAkBC,EAAsB,EAAIgB,EAAQjB,GACnG,OAAQqB,GAAO,CACb,GAAIF,GAAU,EACZ,OAAOC,EAET,IAAME,GAAYD,EAAKF,IAAWJ,EAAI,MACtC,OAAO,KAAK,IACVK,IAAcE,EAAW,GAAKP,EAAI,OAAS,GAC3Cb,EACF,CACF,CACF,CACA,IAAIqB,GAA0B,IAC1BC,GAAsB,CACxB,IAAKX,GACL,cAAe,CACjB,EACA,SAASY,GAAclB,EAAOmB,EAASF,GAAqB,CAC1D,GAAM,CAAE,IAAAT,EAAK,cAAAP,CAAc,EAAIkB,EACzBtB,EAAOE,GAAiBC,EAAOC,CAAa,EAClD,GAAIM,GAAeC,CAAG,EACpB,MAAO,CAAE,MAAOR,EAAM,MAAO,KAAAH,CAAK,EAEpC,IAAMuB,EAAQX,GAAeT,EAAOQ,CAAG,EACvC,MAAO,CACL,MAAOR,EAAM,MAAM,IAAKqB,IAAU,CAChC,GAAGA,EACH,OAAQ,KAAK,MAAMD,EAAMC,EAAK,MAAM,EAAIL,EAAuB,CACjE,EAAE,EACF,KAAM,CACJ,GAAGnB,EACH,sBAAuB,IAAMmB,GAI7B,kBAAmBrB,EACrB,CACF,CACF,CACA,SAAS2B,GAActB,EAAOmB,EAASF,GAAqB,CAC1D,GAAIV,GAAeY,EAAO,GAAG,EAAG,CAC9B,IAAMtB,EAAOE,GAAiBC,EAAOmB,EAAO,aAAa,EACzD,OAAQL,GAAOlB,GAAgBC,EAAMiB,CAAE,CACzC,CACA,OAAOL,GAAeT,EAAOmB,EAAO,GAAG,CACzC,CCvEA,IAAII,GAAiB,CACnB,CACE,MAAO,OACP,MAAO,eACP,YAAa,6FACb,IAAKC,GACL,cAAe,CACjB,EACA,CACE,MAAO,OACP,MAAO,eACP,YAAa,sFACb,IAAKA,GACL,cAAe,GACjB,EACA,CACE,MAAO,OACP,MAAO,eACP,YAAa,gEACb,IAAKA,GACL,cAAe,EACjB,EACA,CACE,MAAO,WACP,MAAO,mBACP,YAAa,gHACb,IAAK,CAAE,MAAO,GAAK,OAAQ,EAAI,EAC/B,cAAe,CACjB,CACF,EACIC,GAAuBF,GAAe,IAAKG,GAAMA,EAAE,KAAK,EAC5D,SAASC,GAAUC,EAAQ,CACzB,IAAMC,EAAQN,GAAe,KAAMG,GAAMA,EAAE,QAAUE,CAAM,EAC3D,MAAO,CACL,IAAKC,GAAO,KAAOL,GACnB,eAAgBK,GAAO,eAAiB,GAAKC,EAC/C,CACF",
   "names": ["cached", "loadFmmm", "mod", "e", "fmmmLayout", "request", "loadFmmm", "ROUTE_ID", "TIP_ANGLE", "BOW", "BOW_CAP", "TEARDROP_TILTS", "SIDES", "other", "side", "unit", "a", "b", "dx", "dy", "m", "lerp", "f", "centroidOf", "pts", "x", "y", "p", "arcLengths", "arc", "i", "polylineLength", "_a", "arcAngles", "arcAngle", "ratio", "known", "angle", "solveArcAngle", "lo", "hi", "mid", "archLength", "c", "s", "R", "theta", "arcFlat", "length", "h", "drop", "cos", "cu", "cv", "t", "tilted", "flat", "sin", "u", "v", "du", "behindFrame", "lineFlat", "u0", "v0", "dv", "Curve", "normals", "straight", "span", "last", "d", "outwardNormals", "outRef", "centroid", "n", "rx", "ry", "rm", "dot", "ref", "sign", "mapFlat", "frame", "tA", "step", "ds", "refs", "q", "nr", "ox", "oy", "FINE_STEP", "COARSE_STEP", "fitted", "make", "flatLength", "mapped", "got", "depths", "from", "_", "spanOf", "anchors", "cellKey", "gx", "gy", "Placer", "ids", "first", "count", "per", "seedX", "seedY", "backbone", "N", "sides", "k", "out", "id", "ROUTE_ID", "min", "max", "start", "ts", "free", "pieces", "members", "X", "Y", "curve", "key", "list", "occupant", "exempt", "anchorPts", "limit", "cx", "cy", "candidates", "best", "bestV", "candidate", "set", "uSide", "vSide", "seen", "comps", "queue", "fromSide", "to", "toExitSide", "reached", "prev", "far", "path", "cur", "spine", "link", "t0", "spacing", "all", "enter", "L", "hMax", "tilts", "tilt", "parent", "route", "shared", "tB", "chord", "A", "B", "single", "pick", "next", "d0", "total", "bar", "placed", "rest", "subs", "sub", "stressPlacement", "placer", "QUALITY", "UNTANGLE_PASSES", "UNTANGLE_LINKS", "UNTANGLE_PUSH", "SMOOTH_PASSES", "MAX_HOPS", "EPS", "WARM", "isBackbone", "node", "_a", "flipped", "strand", "name", "own", "xorshift", "seed", "s", "num", "value", "fallback", "drawnLength", "options", "bp", "chains", "request", "nodes", "edges", "o", "segment", "link", "ids", "n", "first", "count", "per", "k", "drawn", "steps", "chainOf", "indexOf", "seedX", "seedY", "backbone", "adjacent", "seeded", "reference", "i", "v", "index", "id", "links", "edge", "a", "b", "fromSide", "toSide", "u", "off", "nb", "wt", "w", "components", "c", "comp", "members", "queue", "e", "stressLayout", "opts", "_b", "_c", "quality", "gap", "rand", "X", "Y", "nodePositions", "dmin", "total", "anySeed", "placed", "stressPlacement", "side", "points", "loose", "looseSeeded", "dmax", "etaMax", "etaMin", "walks", "iterations", "lambda", "logMin", "logMax", "move", "j", "d", "eta", "mu", "dx", "dy", "mag", "r", "rx", "ry", "walked", "walk", "length", "chain", "idx", "dir", "remaining", "hops", "step", "toEnd", "out", "next", "enterSide", "adjacentTerms", "order", "warm", "t", "tmp", "radius", "key", "x", "y", "grid", "list", "cx", "cy", "gx", "gy", "joined", "xs", "ys", "respace", "packComponents", "m", "bulge", "lengths", "seg", "span", "target", "chord", "ux", "uy", "along", "flat", "lengthAt", "f", "lo", "hi", "it", "mid", "rotateToPrincipalAxis", "minX", "minY", "maxY", "shift", "sxx", "syy", "sxy", "angle", "cos", "sin", "LAYOUT_ENGINES", "LAYOUT_ENGINE_VALUES", "e", "layoutEngine", "request", "start", "stressLayout", "fmmmLayout", "MEAN_NODE_LENGTH", "MIN_TOTAL_GRAPH_LENGTH", "BANDAGE_MINIMUM_NODE_LENGTH", "drawnNodeLength", "opts", "length", "bandageAutoScale", "graph", "minNodeLength", "megabases", "sum", "n", "target", "PROPORTIONAL_LENGTH", "isProportional", "law", "drawnLengthFor", "count", "totalLength", "meanBp", "meanDrawn", "bp", "relative", "LAYOUT_LENGTH_PRECISION", "PROPORTIONAL_SPREAD", "layoutScaling", "spread", "drawn", "node", "drawnLengthOf", "BUBBLE_SPREADS", "PROPORTIONAL_LENGTH", "BUBBLE_SPREAD_VALUES", "s", "spreadFor", "spread", "entry", "MEAN_NODE_LENGTH"]

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

@@ -1,2 +1,2 @@
-import{a as u}from"./chunk-3M3UH5JQ.js";function b(t,s,e){let n=t.get(s);n?n.push(e):t.set(s,[e])}function S(t,s,e){let n=t.get(s);n?n.add(e):t.set(s,new Set([e]))}function m(t,s){let e=new Map;for(let n of t)b(e,s(n),n);return e}function g(t,s){let e=0,n=t;for(;e<n;){let r=e+n>>1;s(r)?e=r+1:n=r}return e}var l=0;function _(t){return t.stable!==void 0}function w(t){return t.stable?.rank===l}function G(t){return t.stable!==void 0&&t.stable.rank>l}function U(t){return t.nodes.filter(w)}function C(t,s){return t.stable.start<s.end&&t.stable.start+t.length>s.start}function K(t){let s={};for(let e of t)s[e.id]=[{x:e.stable.start,y:0},{x:e.stable.start+e.length,y:0}];return s}function T(t,s){return g(t.length,e=>t[e].stable.start<s)}function y(t){let s=1/0,e=-1/0;for(let n of t)s=Math.min(s,n.stable.start),e=Math.max(e,n.stable.start+n.length);return e-s}function $(t,s){return s&&s.end>s.start?s.end-s.start:y(t)}var A=class{constructor(t){this.segments=t.segments,this.offsets=t.offsets,this.path=t.path,this.start=t.start,this.reversed=t.reversed,this.paths=t.paths,this.samples=t.samples,this.slots=new Map(this.segments.map((s,e)=>[s,e]))}static from(t){let s=new d;for(let[e,n]of t){s.declare(e);for(let r of n)s.add(e,r.path,r.sample,r.start,r.strand==="-")}return s.build()}get size(){return this.segments.length}slot(t){return this.slots.get(t)??-1}pathIndex(t){return this.paths.indexOf(t)}firstBy(t,s){for(let e=this.offsets[t];e<this.offsets[t+1];e++)if(this.path[e]===s)return e;return-1}firstByName(t){let s=this.offsets[t];for(let e=s+1;e<this.offsets[t+1];e++){let n=this.paths[this.path[e]],r=this.paths[this.path[s]];(n<r||n===r&&this.start[e]<this.start[s])&&(s=e)}return s}replay(){let t=new Map;return(s,e)=>{if(s<0||e<0)return-1;let n=s*this.paths.length+e,r=this.offsets[s+1],a=t.get(n)??this.offsets[s];for(;a<r&&this.path[a]!==e;)a++;return t.set(n,a+1),a<r?a:-1}}filter(t,s=()=>!0){let e=this.paths.map(t),n=new d;return this.segments.forEach((r,a)=>{if(!s(r))return;let h=n.declare(r);for(let o=this.offsets[a];o<this.offsets[a+1];o++){let i=this.path[o];e[i]&&n.addAt(h,n.pathOf(this.paths[i],this.samples[i]),this.start[o],this.reversed[o]===1)}}),n.build()}strand(t){return this.reversed[t]?"-":"+"}visit(t){let s=this.path[t];return{path:this.paths[s],sample:this.samples[s],start:this.start[t],strand:this.strand(t)}}visitsAt(t){let s=[];for(let e=this.offsets[t];e<this.offsets[t+1];e++)s.push(this.visit(e));return s}get(t){let s=this.slot(t);return s<0?void 0:this.visitsAt(s)}has(t){return this.slots.has(t)}keys(){return this.segments[Symbol.iterator]()}*values(){for(let t=0;t<this.segments.length;t++)yield this.visitsAt(t)}*entries(){for(let t=0;t<this.segments.length;t++)yield[this.segments[t],this.visitsAt(t)]}[Symbol.iterator](){return this.entries()}},p=class{constructor(t){this.data=t,this.length=0}push(t){if(this.length===this.data.length){let s=new this.data.constructor(this.data.length*2);s.set(this.data),this.data=s}this.data[this.length++]=t}},d=class{constructor(){this.segments=[],this.slots=new Map,this.paths=[],this.samples=[],this.pathIndex=new Map,this.slot=new p(new Int32Array(1024)),this.path=new p(new Int32Array(1024)),this.start=new p(new Float64Array(1024)),this.reversed=new p(new Uint8Array(1024))}declare(t){let s=this.slots.get(t);return s===void 0&&(s=this.segments.length,this.slots.set(t,s),this.segments.push(t)),s}pathOf(t,s){let e=this.pathIndex.get(t);return e===void 0&&(e=this.paths.length,this.pathIndex.set(t,e),this.paths.push(t),this.samples.push(s)),e}add(t,s,e,n,r){this.addAt(this.declare(t),this.pathOf(s,e),n,r)}addAt(t,s,e,n){this.slot.push(t),this.path.push(s),this.start.push(e),this.reversed.push(n?1:0)}build(){let t=this.slot.length,s=this.segments.length,e=new Int32Array(s+1),n=this.slot.data;for(let i=0;i<t;i++)e[n[i]+1]++;for(let i=0;i<s;i++)e[i+1]+=e[i];let r=e.slice(0,s),a=new Int32Array(t),h=new Float64Array(t),o=new Uint8Array(t);for(let i=0;i<t;i++){let f=r[n[i]]++;a[f]=this.path.data[i],h[f]=this.start.data[i],o[f]=this.reversed.data[i]}return new A({segments:this.segments,offsets:e,path:a,start:h,reversed:o,paths:this.paths,samples:this.samples})}};var v=/:(\d+)-\d+$/,x=/^([^#]*#[^#]*#[^#[]*)#(\d+)(?:\[(\d+)-\d+\])?$/,I=/\[(\d+)-\d+\]$/;function E(t){let s=x.exec(t);if(s)return{name:s[1],start:+s[2]+ +(s[3]??0)};let e=v.exec(t)??I.exec(t);return e?{name:t.slice(0,e.index),start:+e[1]}:{name:t,start:0}}function Q(t,s){let e=[],n=new d;for(let r of t){let a=u(r.name),h=n.pathOf(r.name,a),o=r.start;for(let i of r.steps)n.addAt(n.declare(i.id),h,o,i.strand==="-"),o+=s(i.id);e.push({name:r.name,sample:a,start:r.start,length:o-r.start})}return{anchorPaths:e,pathVisits:n.build()}}function P(t,s){return t.find(n=>n.sample===s||n.name===s)??t[0]}var R=1;function N(t,s,e,n){let r=s.slot(t.name);if(r<0||s.offsets[r]===s.offsets[r+1])return t;let a=s.firstBy(r,e),h=a>=0?a:s.firstByName(r);return{...t,stable:{refName:s.paths[s.path[h]],start:s.start[h],rank:a>=0?l:R,strand:s.strand(h)},samples:n(r)}}function O(t){let s=[...new Set(t.samples)].sort(),e=new Map(s.map((h,o)=>[h,o])),n=Int32Array.from(t.samples,h=>e.get(h)),r=new Uint8Array(s.length),a=new Int32Array(s.length);return h=>{let o=0;for(let f=t.offsets[h];f<t.offsets[h+1];f++){let c=n[t.path[f]];r[c]===0&&(r[c]=1,a[o++]=c)}let i;if(o===s.length)i=s,r.fill(0);else if(o*8<s.length){let f=a.subarray(0,o);f.forEach(c=>r[c]=0),i=Array.from(f.sort(),c=>s[c])}else{i=[];for(let f=0;f<s.length;f++)r[f]===1&&(r[f]=0,i.push(s[f]))}return i}}function k(t,s){let{anchorPaths:e,pathVisits:n}=t,r=e&&n?P(e,s):void 0;if(!r||!e||!n)return t;let a=O(n),h=n.pathIndex(r.name);return{...t,nodes:t.nodes.map(o=>N(o,n,h,a)),anchoredBy:"paths",referencePath:r.name}}function Y(t,s){if(t.anchoredBy!=="tags")return k(t,s);let e=B(t);return e?{...t,referencePath:e}:t}function B(t){let s=t.nodes.find(e=>e.stable?.rank===0)?.stable?.refName;return s!==void 0&&t.anchorPaths?.some(e=>e.name===s)?s:void 0}function Z(t,s){if(!t.anchorPaths)return;let e=new Map(t.nodes.map(a=>[a.id,a.length])),n=(a,h=a.length)=>{let o=0;for(let i=0;i<h;i++)o+=e.get(a[i])??0;return o},r=m(t.paths??[],a=>E(a.name).name);return t.anchorPaths.map(a=>{let h=r.get(a.name),o=h?.length===1?h[0]:void 0,i=o&&s.get(o.name);return o&&i?{...a,start:a.start+n(o.nodeIds,i.first),length:n(i.nodeIds)}:a})}function tt(t){let{pathVisits:s}=t,e=new Map;return n=>{let r=e.get(n.id);if(!r){r=[];let a=s?s.slot(n.name):-1,h=a>=0?s.pathIndex(n.stable.refName):-1;if(h>=0)for(let o=s.offsets[a];o<s.offsets[a+1];o++)s.path[o]===h&&r.push(s.start[o]);r.length<2&&(r=[n.stable.start]),e.set(n.id,r)}return r}}export{b as a,S as b,m as c,g as d,l as e,_ as f,w as g,G as h,U as i,C as j,K as k,T as l,y as m,$ as n,A as o,p,d as q,E as r,Q as s,P as t,k as u,Y as v,Z as w,tt as x};
-//# sourceMappingURL=chunk-PVRRW4PM.js.map
+import{a as u}from"./chunk-JKW2OX73.js";function b(t,s,e){let n=t.get(s);n?n.push(e):t.set(s,[e])}function S(t,s,e){let n=t.get(s);n?n.add(e):t.set(s,new Set([e]))}function m(t,s){let e=new Map;for(let n of t)b(e,s(n),n);return e}function g(t,s){let e=0,n=t;for(;e<n;){let r=e+n>>1;s(r)?e=r+1:n=r}return e}var l=0;function _(t){return t.stable!==void 0}function w(t){return t.stable?.rank===l}function G(t){return t.stable!==void 0&&t.stable.rank>l}function U(t){return t.nodes.filter(w)}function C(t,s){return t.stable.start<s.end&&t.stable.start+t.length>s.start}function K(t){let s={};for(let e of t)s[e.id]=[{x:e.stable.start,y:0},{x:e.stable.start+e.length,y:0}];return s}function T(t,s){return g(t.length,e=>t[e].stable.start<s)}function y(t){let s=1/0,e=-1/0;for(let n of t)s=Math.min(s,n.stable.start),e=Math.max(e,n.stable.start+n.length);return e-s}function $(t,s){return s&&s.end>s.start?s.end-s.start:y(t)}var A=class{constructor(t){this.segments=t.segments,this.offsets=t.offsets,this.path=t.path,this.start=t.start,this.reversed=t.reversed,this.paths=t.paths,this.samples=t.samples,this.slots=new Map(this.segments.map((s,e)=>[s,e]))}static from(t){let s=new d;for(let[e,n]of t){s.declare(e);for(let r of n)s.add(e,r.path,r.sample,r.start,r.strand==="-")}return s.build()}get size(){return this.segments.length}slot(t){return this.slots.get(t)??-1}pathIndex(t){return this.paths.indexOf(t)}firstBy(t,s){for(let e=this.offsets[t];e<this.offsets[t+1];e++)if(this.path[e]===s)return e;return-1}firstByName(t){let s=this.offsets[t];for(let e=s+1;e<this.offsets[t+1];e++){let n=this.paths[this.path[e]],r=this.paths[this.path[s]];(n<r||n===r&&this.start[e]<this.start[s])&&(s=e)}return s}replay(){let t=new Map;return(s,e)=>{if(s<0||e<0)return-1;let n=s*this.paths.length+e,r=this.offsets[s+1],a=t.get(n)??this.offsets[s];for(;a<r&&this.path[a]!==e;)a++;return t.set(n,a+1),a<r?a:-1}}filter(t,s=()=>!0){let e=this.paths.map(t),n=new d;return this.segments.forEach((r,a)=>{if(!s(r))return;let h=n.declare(r);for(let o=this.offsets[a];o<this.offsets[a+1];o++){let i=this.path[o];e[i]&&n.addAt(h,n.pathOf(this.paths[i],this.samples[i]),this.start[o],this.reversed[o]===1)}}),n.build()}strand(t){return this.reversed[t]?"-":"+"}visit(t){let s=this.path[t];return{path:this.paths[s],sample:this.samples[s],start:this.start[t],strand:this.strand(t)}}visitsAt(t){let s=[];for(let e=this.offsets[t];e<this.offsets[t+1];e++)s.push(this.visit(e));return s}get(t){let s=this.slot(t);return s<0?void 0:this.visitsAt(s)}has(t){return this.slots.has(t)}keys(){return this.segments[Symbol.iterator]()}*values(){for(let t=0;t<this.segments.length;t++)yield this.visitsAt(t)}*entries(){for(let t=0;t<this.segments.length;t++)yield[this.segments[t],this.visitsAt(t)]}[Symbol.iterator](){return this.entries()}},p=class{constructor(t){this.data=t,this.length=0}push(t){if(this.length===this.data.length){let s=new this.data.constructor(this.data.length*2);s.set(this.data),this.data=s}this.data[this.length++]=t}},d=class{constructor(){this.segments=[],this.slots=new Map,this.paths=[],this.samples=[],this.pathIndex=new Map,this.slot=new p(new Int32Array(1024)),this.path=new p(new Int32Array(1024)),this.start=new p(new Float64Array(1024)),this.reversed=new p(new Uint8Array(1024))}declare(t){let s=this.slots.get(t);return s===void 0&&(s=this.segments.length,this.slots.set(t,s),this.segments.push(t)),s}pathOf(t,s){let e=this.pathIndex.get(t);return e===void 0&&(e=this.paths.length,this.pathIndex.set(t,e),this.paths.push(t),this.samples.push(s)),e}add(t,s,e,n,r){this.addAt(this.declare(t),this.pathOf(s,e),n,r)}addAt(t,s,e,n){this.slot.push(t),this.path.push(s),this.start.push(e),this.reversed.push(n?1:0)}build(){let t=this.slot.length,s=this.segments.length,e=new Int32Array(s+1),n=this.slot.data;for(let i=0;i<t;i++)e[n[i]+1]++;for(let i=0;i<s;i++)e[i+1]+=e[i];let r=e.slice(0,s),a=new Int32Array(t),h=new Float64Array(t),o=new Uint8Array(t);for(let i=0;i<t;i++){let f=r[n[i]]++;a[f]=this.path.data[i],h[f]=this.start.data[i],o[f]=this.reversed.data[i]}return new A({segments:this.segments,offsets:e,path:a,start:h,reversed:o,paths:this.paths,samples:this.samples})}};var v=/:(\d+)-\d+$/,x=/^([^#]*#[^#]*#[^#[]*)#(\d+)(?:\[(\d+)-\d+\])?$/,I=/\[(\d+)-\d+\]$/;function E(t){let s=x.exec(t);if(s)return{name:s[1],start:+s[2]+ +(s[3]??0)};let e=v.exec(t)??I.exec(t);return e?{name:t.slice(0,e.index),start:+e[1]}:{name:t,start:0}}function Q(t,s){let e=[],n=new d;for(let r of t){let a=u(r.name),h=n.pathOf(r.name,a),o=r.start;for(let i of r.steps)n.addAt(n.declare(i.id),h,o,i.strand==="-"),o+=s(i.id);e.push({name:r.name,sample:a,start:r.start,length:o-r.start})}return{anchorPaths:e,pathVisits:n.build()}}function P(t,s){return t.find(n=>n.sample===s||n.name===s)??t[0]}var R=1;function N(t,s,e,n){let r=s.slot(t.name);if(r<0||s.offsets[r]===s.offsets[r+1])return t;let a=s.firstBy(r,e),h=a>=0?a:s.firstByName(r);return{...t,stable:{refName:s.paths[s.path[h]],start:s.start[h],rank:a>=0?l:R,strand:s.strand(h)},samples:n(r)}}function O(t){let s=[...new Set(t.samples)].sort(),e=new Map(s.map((h,o)=>[h,o])),n=Int32Array.from(t.samples,h=>e.get(h)),r=new Uint8Array(s.length),a=new Int32Array(s.length);return h=>{let o=0;for(let f=t.offsets[h];f<t.offsets[h+1];f++){let c=n[t.path[f]];r[c]===0&&(r[c]=1,a[o++]=c)}let i;if(o===s.length)i=s,r.fill(0);else if(o*8<s.length){let f=a.subarray(0,o);f.forEach(c=>r[c]=0),i=Array.from(f.sort(),c=>s[c])}else{i=[];for(let f=0;f<s.length;f++)r[f]===1&&(r[f]=0,i.push(s[f]))}return i}}function k(t,s){let{anchorPaths:e,pathVisits:n}=t,r=e&&n?P(e,s):void 0;if(!r||!e||!n)return t;let a=O(n),h=n.pathIndex(r.name);return{...t,nodes:t.nodes.map(o=>N(o,n,h,a)),anchoredBy:"paths",referencePath:r.name}}function Y(t,s){if(t.anchoredBy!=="tags")return k(t,s);let e=B(t);return e?{...t,referencePath:e}:t}function B(t){let s=t.nodes.find(e=>e.stable?.rank===0)?.stable?.refName;return s!==void 0&&t.anchorPaths?.some(e=>e.name===s)?s:void 0}function Z(t,s){if(!t.anchorPaths)return;let e=new Map(t.nodes.map(a=>[a.id,a.length])),n=(a,h=a.length)=>{let o=0;for(let i=0;i<h;i++)o+=e.get(a[i])??0;return o},r=m(t.paths??[],a=>E(a.name).name);return t.anchorPaths.map(a=>{let h=r.get(a.name),o=h?.length===1?h[0]:void 0,i=o&&s.get(o.name);return o&&i?{...a,start:a.start+n(o.nodeIds,i.first),length:n(i.nodeIds)}:a})}function tt(t){let{pathVisits:s}=t,e=new Map;return n=>{let r=e.get(n.id);if(!r){r=[];let a=s?s.slot(n.name):-1,h=a>=0?s.pathIndex(n.stable.refName):-1;if(h>=0)for(let o=s.offsets[a];o<s.offsets[a+1];o++)s.path[o]===h&&r.push(s.start[o]);r.length<2&&(r=[n.stable.start]),e.set(n.id,r)}return r}}export{b as a,S as b,m as c,g as d,l as e,_ as f,w as g,G as h,U as i,C as j,K as k,T as l,y as m,$ as n,A as o,p,d as q,E as r,Q as s,P as t,k as u,Y as v,Z as w,tt as x};
+//# sourceMappingURL=chunk-AZUO4NZ5.js.map