jbrowse-plugin-graphgenomeviewer 7.4.4 → 7.5.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (129) hide show
  1. package/dist/chunks/{GbzBaseSyntenyAdapter-A5MNPCKX.js → GbzBaseSyntenyAdapter-4KVWVUN6.js} +2 -2
  2. package/dist/chunks/{GbzBaseSyntenyAdapter-A5MNPCKX.js.map → GbzBaseSyntenyAdapter-4KVWVUN6.js.map} +1 -1
  3. package/dist/chunks/{GraphGenomeView-SEAPDRXS.js → GraphGenomeView-KI4FQ5A7.js} +2 -2
  4. package/dist/chunks/GraphTrackSettingsDialog-UQNMDXTE.js +4 -0
  5. package/dist/chunks/GraphTrackSettingsDialog-UQNMDXTE.js.map +7 -0
  6. package/dist/chunks/{HighlightColorDialog-QAYWLO5I.js → HighlightColorDialog-D4RCUCUF.js} +2 -2
  7. package/dist/chunks/LinearGraphDisplay-RPZUZSM2.js +2 -0
  8. package/dist/chunks/{LinearGraphDisplay-ZC4BQ27J.js.map → LinearGraphDisplay-RPZUZSM2.js.map} +2 -2
  9. package/dist/chunks/{MinigraphBubbleAdapter-3QM4XV47.js → MinigraphBubbleAdapter-TJYI7KEN.js} +2 -2
  10. package/dist/chunks/RgfaTabixAdapter-5ZMJLFZP.js +2 -0
  11. package/dist/chunks/RgfaTabixAdapter-5ZMJLFZP.js.map +7 -0
  12. package/dist/chunks/{WalkFormsAdapter-FT2SW4H6.js → WalkFormsAdapter-CAJOWOEX.js} +2 -2
  13. package/dist/chunks/WalkTabixSyntenyAdapter-VI3KA2GX.js +2 -0
  14. package/dist/chunks/{WalkTabixSyntenyAdapter-3WRVNDLB.js.map → WalkTabixSyntenyAdapter-VI3KA2GX.js.map} +2 -2
  15. package/dist/chunks/{chunk-6WUWQX2P.js → chunk-22ANI2KL.js} +2 -2
  16. package/dist/chunks/{chunk-6WUWQX2P.js.map → chunk-22ANI2KL.js.map} +1 -1
  17. package/dist/chunks/chunk-42KD4AVY.js +2 -0
  18. package/dist/chunks/{chunk-HCDKP3IP.js.map → chunk-42KD4AVY.js.map} +4 -4
  19. package/dist/chunks/chunk-4NIWMRKH.js +2 -0
  20. package/dist/chunks/{chunk-S333HOG5.js.map → chunk-4NIWMRKH.js.map} +4 -4
  21. package/dist/chunks/chunk-BCOXRUNQ.js +3 -0
  22. package/dist/chunks/chunk-BCOXRUNQ.js.map +7 -0
  23. package/dist/chunks/chunk-DAPI7M4M.js +4 -0
  24. package/dist/chunks/chunk-DAPI7M4M.js.map +7 -0
  25. package/dist/chunks/{chunk-G53BI7VK.js → chunk-DEWZOJSC.js} +2 -2
  26. package/dist/chunks/{chunk-G53BI7VK.js.map → chunk-DEWZOJSC.js.map} +1 -1
  27. package/dist/chunks/{chunk-6SWXMRAV.js → chunk-FCMXEFJA.js} +1 -1
  28. package/dist/chunks/{chunk-6SWXMRAV.js.map → chunk-FCMXEFJA.js.map} +1 -1
  29. package/dist/chunks/{chunk-P3FBI5ML.js → chunk-GYY6LF5L.js} +1 -1
  30. package/dist/chunks/{chunk-P3FBI5ML.js.map → chunk-GYY6LF5L.js.map} +1 -1
  31. package/dist/chunks/{chunk-HF4H6LQI.js → chunk-HHMJNAA3.js} +2 -2
  32. package/dist/chunks/{chunk-XXBE4IFZ.js → chunk-HTTONSO4.js} +2 -2
  33. package/dist/chunks/{chunk-XXBE4IFZ.js.map → chunk-HTTONSO4.js.map} +1 -1
  34. package/dist/chunks/{chunk-MUONTMYZ.js → chunk-K4JL57NR.js} +2 -2
  35. package/dist/chunks/chunk-KOC23YNN.js +4 -0
  36. package/dist/chunks/chunk-KOC23YNN.js.map +7 -0
  37. package/dist/chunks/{chunk-OJWBLPPH.js → chunk-LTNFVL2F.js} +2 -2
  38. package/dist/chunks/chunk-OZEKEYT3.js +2 -0
  39. package/dist/chunks/{chunk-6VNU7SD4.js.map → chunk-OZEKEYT3.js.map} +4 -4
  40. package/dist/chunks/{chunk-KIYRMZWP.js → chunk-POUV7OPY.js} +2 -2
  41. package/dist/chunks/{chunk-KIYRMZWP.js.map → chunk-POUV7OPY.js.map} +1 -1
  42. package/dist/chunks/{chunk-LE7FZM6Y.js → chunk-SPL3UO2D.js} +2 -2
  43. package/dist/chunks/{chunk-LE7FZM6Y.js.map → chunk-SPL3UO2D.js.map} +1 -1
  44. package/dist/chunks/chunk-UR2MJJUP.js +2 -0
  45. package/dist/chunks/chunk-VTMJQFN5.js +2 -0
  46. package/dist/chunks/chunk-VTMJQFN5.js.map +7 -0
  47. package/dist/chunks/{chunk-2KVE7YAS.js → chunk-XZGYJ3JC.js} +1 -1
  48. package/dist/chunks/{chunk-2KVE7YAS.js.map → chunk-XZGYJ3JC.js.map} +1 -1
  49. package/dist/chunks/{chunk-7RJMG6I2.js → chunk-Z3IKZAYC.js} +1 -1
  50. package/dist/chunks/{chunk-7RJMG6I2.js.map → chunk-Z3IKZAYC.js.map} +1 -1
  51. package/dist/chunks/{chunk-FTXDTU27.js → chunk-ZV5FNOHS.js} +3 -3
  52. package/dist/chunks/{chunk-FTXDTU27.js.map → chunk-ZV5FNOHS.js.map} +2 -2
  53. package/dist/chunks/{renderSvg-ZIUOPWJQ.js → renderSvg-3PPAEMBT.js} +2 -2
  54. package/dist/jbrowse-plugin-graphgenomeviewer.esm.js +4 -3
  55. package/dist/jbrowse-plugin-graphgenomeviewer.esm.js.map +4 -4
  56. package/package.json +2 -2
  57. package/src/GraphComputeLayout.test.ts +24 -0
  58. package/src/GraphComputeLayout.ts +4 -2
  59. package/src/GraphGenomeView/components/GraphSettingsDialog.tsx +16 -0
  60. package/src/GraphGenomeView/components/WalkRowsOverlay.tsx +83 -0
  61. package/src/GraphGenomeView/components/usePaneGestures.test.tsx +82 -5
  62. package/src/GraphGenomeView/components/usePaneGestures.ts +10 -4
  63. package/src/GraphGenomeView/graphLayers.ts +14 -1
  64. package/src/GraphGenomeView/legendSections.ts +32 -0
  65. package/src/GraphGenomeView/model.test.ts +292 -4
  66. package/src/GraphGenomeView/model.ts +3 -10
  67. package/src/GraphGenomeView/nodeSize.test.ts +21 -5
  68. package/src/GraphGenomeView/nodeSize.ts +24 -8
  69. package/src/GraphGenomeView/pane/fitViews.ts +5 -1
  70. package/src/GraphGenomeView/pane/graphViews.ts +96 -16
  71. package/src/GraphGenomeView/pane/launchActions.ts +55 -11
  72. package/src/GraphGenomeView/pane/launchViews.ts +46 -0
  73. package/src/GraphGenomeView/pane/loadActions.ts +85 -25
  74. package/src/GraphGenomeView/pane/morph.test.ts +25 -1
  75. package/src/GraphGenomeView/pane/morph.ts +3 -1
  76. package/src/GraphGenomeView/pane/paneBase.ts +5 -0
  77. package/src/GraphGenomeView/pane/renderingActions.ts +61 -2
  78. package/src/GraphGenomeView/pane/settingActions.ts +62 -4
  79. package/src/GraphGenomeView/pane/walkRowViews.ts +17 -6
  80. package/src/GraphGenomeView/tubeMapPanels.ts +2 -1
  81. package/src/GraphGenomeView/viewModel.ts +4 -6
  82. package/src/GraphGenomeView/walkRowBlocks.ts +50 -0
  83. package/src/LinearGraphDisplay/LinearGraphDisplay.test.ts +35 -5
  84. package/src/LinearGraphDisplay/components/GraphStatusChrome.test.tsx +18 -0
  85. package/src/LinearGraphDisplay/components/GraphStatusChrome.tsx +4 -2
  86. package/src/LinearGraphDisplay/components/SubgraphHaplotypesField.test.tsx +41 -1
  87. package/src/LinearGraphDisplay/components/SubgraphHaplotypesField.tsx +33 -19
  88. package/src/LinearGraphDisplay/configSchema.ts +4 -3
  89. package/src/RgfaTabixAdapter/RgfaTabixAdapter.ts +2 -9
  90. package/src/WalkTabixSyntenyAdapter/WalkTabixSyntenyAdapter.ts +3 -6
  91. package/src/hoverSync/graphViewHighlights.test.ts +53 -0
  92. package/src/hoverSync/graphViewHighlights.ts +25 -0
  93. package/src/hoverSync/lgvHover.test.ts +100 -1
  94. package/src/hoverSync/lgvHover.ts +77 -6
  95. package/src/launchFromGraph/contributors.test.ts +52 -0
  96. package/src/launchFromGraph/contributors.ts +105 -1
  97. package/src/launchFromGraph/launchFromGraph.ts +2 -2
  98. package/src/panSNTabix.test.ts +28 -0
  99. package/src/panSNTabix.ts +26 -8
  100. package/src/version.ts +1 -1
  101. package/dist/chunks/GraphTrackSettingsDialog-EVIIGC5G.js +0 -6
  102. package/dist/chunks/GraphTrackSettingsDialog-EVIIGC5G.js.map +0 -7
  103. package/dist/chunks/LinearGraphDisplay-ZC4BQ27J.js +0 -2
  104. package/dist/chunks/RgfaTabixAdapter-XSOIEWBK.js +0 -2
  105. package/dist/chunks/RgfaTabixAdapter-XSOIEWBK.js.map +0 -7
  106. package/dist/chunks/WalkTabixSyntenyAdapter-3WRVNDLB.js +0 -2
  107. package/dist/chunks/chunk-6VNU7SD4.js +0 -2
  108. package/dist/chunks/chunk-GRTN25B6.js +0 -3
  109. package/dist/chunks/chunk-GRTN25B6.js.map +0 -7
  110. package/dist/chunks/chunk-HCDKP3IP.js +0 -2
  111. package/dist/chunks/chunk-LE43I4PT.js +0 -4
  112. package/dist/chunks/chunk-LE43I4PT.js.map +0 -7
  113. package/dist/chunks/chunk-QV7SSOMJ.js +0 -2
  114. package/dist/chunks/chunk-S333HOG5.js +0 -2
  115. package/dist/chunks/chunk-VZQ6VOUP.js +0 -2
  116. package/dist/chunks/chunk-VZQ6VOUP.js.map +0 -7
  117. package/dist/chunks/chunk-WLRRI35A.js +0 -3
  118. package/dist/chunks/chunk-WLRRI35A.js.map +0 -7
  119. package/src/launchFromGraph/launchTracks.test.ts +0 -95
  120. package/src/launchFromGraph/launchTracks.ts +0 -49
  121. /package/dist/chunks/{GraphGenomeView-SEAPDRXS.js.map → GraphGenomeView-KI4FQ5A7.js.map} +0 -0
  122. /package/dist/chunks/{HighlightColorDialog-QAYWLO5I.js.map → HighlightColorDialog-D4RCUCUF.js.map} +0 -0
  123. /package/dist/chunks/{MinigraphBubbleAdapter-3QM4XV47.js.map → MinigraphBubbleAdapter-TJYI7KEN.js.map} +0 -0
  124. /package/dist/chunks/{WalkFormsAdapter-FT2SW4H6.js.map → WalkFormsAdapter-CAJOWOEX.js.map} +0 -0
  125. /package/dist/chunks/{chunk-HF4H6LQI.js.map → chunk-HHMJNAA3.js.map} +0 -0
  126. /package/dist/chunks/{chunk-MUONTMYZ.js.map → chunk-K4JL57NR.js.map} +0 -0
  127. /package/dist/chunks/{chunk-OJWBLPPH.js.map → chunk-LTNFVL2F.js.map} +0 -0
  128. /package/dist/chunks/{chunk-QV7SSOMJ.js.map → chunk-UR2MJJUP.js.map} +0 -0
  129. /package/dist/chunks/{renderSvg-ZIUOPWJQ.js.map → renderSvg-3PPAEMBT.js.map} +0 -0
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "version": 3,
3
3
  "sources": ["../../src/WalkTabixSyntenyAdapter/walkLanes.ts", "../../src/WalkTabixSyntenyAdapter/WalkTabixSyntenyAdapter.ts"],
4
- "sourcesContent": ["import { weightedLcs } from '@gmod/gbz-base/lcs'\nimport { pairAlignments, pairCigar } from '@gmod/gbz-base/pairAlignment'\nimport { panSNContig } from '@jbrowse/bandage-core/pansn'\n\nimport { matchFeature } from '../synteny/matchFeature.ts'\n\nimport type { PairChain, PairEdit } from '@gmod/gbz-base/pairAlignment'\nimport type { WalkFragment, WalkNode } from '@jbrowse/graph-walks'\n\n// The longest bubble with equal bases on both sides that is written as\n// mismatches; a longer one stays an insertion and a deletion\nconst BALANCED_BUBBLE_MAX_BP = 50\n\n/**\n * A chain's edits with each short balanced bubble as `X`. The walks carry no\n * bases, so two walks differ wherever they leave a shared node, and a SNP is\n * one base inserted and one deleted until it is read as the mismatch it is.\n */\nexport function bubblesAsMismatches(edits: PairEdit[]) {\n const out: PairEdit[] = []\n for (let i = 0; i < edits.length; i++) {\n const [op, len] = edits[i]!\n const [nextOp, nextLen] = edits[i + 1] ?? []\n if (\n len === nextLen &&\n len <= BALANCED_BUBBLE_MAX_BP &&\n ((op === 'I' && nextOp === 'D') || (op === 'D' && nextOp === 'I'))\n ) {\n out.push(['X', len])\n i++\n } else {\n out.push([op, len])\n }\n }\n return out\n}\n\n// A walk's steps as the handles gbz-base reads, 2 * id + reversed\nfunction handlesOf(fragment: WalkFragment) {\n return Array.from(fragment.ids, (id, i) => 2 * id + fragment.rev[i]!)\n}\n\nfunction nodeLength(nodes: Map<number, WalkNode>, id: number) {\n const node = nodes.get(id)\n return node === undefined ? 0 : node.end - node.start\n}\n\n/**\n * Aligns one walk fragment to another on the nodes both visit, from node\n * lengths alone: the fragments' steps as the handles gbz-base's chainer reads,\n * and a stand-in sequence of each node's length.\n */\nexport function walkAligner(nodes: Map<number, WalkNode>) {\n const standIn = new Map<number, string>()\n const sequenceOf = (id: number) => {\n const length = nodeLength(nodes, id)\n let sequence = standIn.get(length)\n if (sequence === undefined) {\n sequence = 'N'.repeat(length)\n standIn.set(length, sequence)\n }\n return sequence\n }\n const handles = new Map<WalkFragment, number[]>()\n const cachedHandles = (fragment: WalkFragment) => {\n let steps = handles.get(fragment)\n if (steps === undefined) {\n steps = handlesOf(fragment)\n handles.set(fragment, steps)\n }\n return steps\n }\n return (query: WalkFragment, target: WalkFragment) =>\n pairAlignments({\n query: cachedHandles(query),\n target: cachedHandles(target),\n sequenceOf,\n bases: false,\n })\n}\n\n// The fewest bases on shared nodes a record against the reference keeps,\n// gbz-base's floor for a pair record\nconst MIN_MATCH_BP = 100\n\nfunction appendEdit(edits: PairEdit[], op: PairEdit[0], len: number) {\n const last = edits.at(-1)\n if (len > 0) {\n if (last?.[0] === op) {\n last[1] += len\n } else {\n edits.push([op, len])\n }\n }\n}\n\n/**\n * Aligns a haplotype's walk fragment to the reference's as gbz-base aligns a\n * walk to its reference path: the heaviest common subsequence of their steps,\n * each node weighing its length, read in whichever direction shares more. A\n * pair chain leaves out every node either walk passes twice, which is the\n * whole of a collapsed copy-number array (amylase, KIV-2); the subsequence\n * matches one pass over it, and the other copies are insertions.\n */\nexport function referenceAligner(nodes: Map<number, WalkNode>) {\n const lengthOf = (handle: number) => nodeLength(nodes, handle >> 1)\n const offsets = (handles: number[]) => {\n const out = new Float64Array(handles.length + 1)\n handles.forEach((handle, i) => {\n out[i + 1] = out[i]! + lengthOf(handle)\n })\n return out\n }\n\n return (query: WalkFragment, target: WalkFragment): PairChain[] => {\n const ref = handlesOf(target)\n const hap = handlesOf(query)\n const [same, sameWeight] = weightedLcs(hap, ref, lengthOf)\n const [turned, turnedWeight] = weightedLcs(\n hap.map(handle => handle ^ 1).reverse(),\n ref,\n lengthOf,\n )\n const reverse = turnedWeight > sameWeight\n const pairs = reverse ? turned : same\n const sharedBases = Math.max(sameWeight, turnedWeight)\n if (sharedBases < MIN_MATCH_BP) {\n return []\n }\n const refAt = offsets(ref)\n const hapAt = offsets(hap)\n // a pair's haplotype step, counted along the haplotype\n const stepOf = (k: number) =>\n reverse ? hap.length - 1 - pairs[k]![0] : pairs[k]![0]\n const edits: PairEdit[] = []\n pairs.forEach(([, r], k) => {\n if (k > 0) {\n const [lo, hi] = [stepOf(k - 1), stepOf(k)].sort((x, y) => x - y)\n appendEdit(edits, 'I', hapAt[hi!]! - hapAt[lo! + 1]!)\n appendEdit(edits, 'D', refAt[r]! - refAt[pairs[k - 1]![1] + 1]!)\n }\n appendEdit(edits, '=', lengthOf(ref[r]!))\n })\n const [lo, hi] = [stepOf(0), stepOf(pairs.length - 1)].sort((x, y) => x - y)\n return [\n {\n queryStart: hapAt[lo!]!,\n queryEnd: hapAt[hi! + 1]!,\n targetStart: refAt[pairs[0]![1]]!,\n targetEnd: refAt[pairs.at(-1)![1] + 1]!,\n strand: reverse ? '-' : '+',\n edits,\n sharedBases,\n },\n ]\n }\n}\n\n// Each node a walk visits once, with the direction it passes it\nfunction singleVisits(fragment: WalkFragment) {\n const rev = new Map<number, number>()\n const twice = new Set<number>()\n fragment.ids.forEach((id, i) => {\n if (rev.has(id)) {\n twice.add(id)\n } else {\n rev.set(id, fragment.rev[i]!)\n }\n })\n for (const id of twice) {\n rev.delete(id)\n }\n return rev\n}\n\n// The bases on singly visited nodes two walks pass the same way and the\n// opposite way\nfunction directionShares(nodes: Map<number, WalkNode>) {\n const visits = new Map<WalkFragment, Map<number, number>>()\n const visitsOf = (fragment: WalkFragment) => {\n let found = visits.get(fragment)\n if (found === undefined) {\n found = singleVisits(fragment)\n visits.set(fragment, found)\n }\n return found\n }\n return (query: WalkFragment, target: WalkFragment) => {\n const theirs = visitsOf(target)\n let same = 0\n let opposite = 0\n for (const [id, rev] of visitsOf(query)) {\n const other = theirs.get(id)\n if (other === rev) {\n same += nodeLength(nodes, id)\n } else if (other !== undefined) {\n opposite += nodeLength(nodes, id)\n }\n }\n return { same, opposite }\n }\n}\n\n/**\n * Aligns one lane's walk fragment to another's. The weighted subsequence\n * (`referenceAligner`) is the fast route and matches through copy-number\n * arrays, but it reads one direction per pair, so an inversion between the\n * lanes comes out as an insertion beside a deletion. A pair sharing 100 bp\n * (MIN_MATCH_BP) or more of singly visited nodes in each direction goes to\n * pair chaining (`walkAligner`) instead, which answers the inverted stretch as\n * a reverse-strand record of its own. Chaining leaves out every node a walk\n * passes twice, so counting singly visited nodes misses no inversion it could\n * draw.\n */\nexport function lanePairAligner(nodes: Map<number, WalkNode>) {\n const subsequence = referenceAligner(nodes)\n const chained = walkAligner(nodes)\n const shares = directionShares(nodes)\n return (query: WalkFragment, target: WalkFragment) => {\n const { same, opposite } = shares(query, target)\n return same >= MIN_MATCH_BP && opposite >= MIN_MATCH_BP\n ? chained(query, target)\n : subsequence(query, target)\n }\n}\n\n// The multi-way display's SPLIT_AT_GAP_BP, under which a turned stretch names\n// no inversion there\nconst TURNED_MIN_BP = 10_000\n\n/**\n * Aligns a haplotype's walk fragment to the reference's as `referenceAligner`\n * does, then adds the stretches it reads the other way. A walk sharing\n * TURNED_MIN_BP or more of singly visited nodes in each direction is chained\n * too, and the chained records on the strand the subsequence did not take are\n * its turned stretches. The subsequence record stays, so a copy-number array,\n * which chaining leaves out, still matches one pass alike in every lane.\n */\nexport function anchorAligner(nodes: Map<number, WalkNode>) {\n const subsequence = referenceAligner(nodes)\n const chained = walkAligner(nodes)\n const shares = directionShares(nodes)\n return (query: WalkFragment, target: WalkFragment) => {\n const records = subsequence(query, target)\n const taken = records[0]?.strand\n const { same, opposite } = shares(query, target)\n return taken === undefined || Math.min(same, opposite) < TURNED_MIN_BP\n ? records\n : [\n ...records,\n ...chained(query, target).filter(chain => chain.strand !== taken),\n ]\n }\n}\n\n/**\n * One record of a walk aligned to another, with its short balanced bubbles as\n * mismatches\n */\nexport function chainFeature({\n chain,\n target,\n query,\n assemblyName,\n refName,\n mateAssemblyName,\n}: {\n chain: PairChain\n target: WalkFragment\n query: WalkFragment\n assemblyName: string\n refName: string\n mateAssemblyName: string\n}) {\n const edits = bubblesAsMismatches(chain.edits)\n return matchFeature({\n target: {\n name: target.name,\n assemblyName,\n refName,\n start: target.hapStart + chain.targetStart,\n end: target.hapStart + chain.targetEnd,\n },\n query: {\n name: query.name,\n assemblyName: mateAssemblyName,\n refName: panSNContig(query.name),\n start: query.hapStart + chain.queryStart,\n end: query.hapStart + chain.queryEnd,\n },\n strand: chain.strand,\n cigar: pairCigar(edits),\n matches: edits.reduce((sum, [op, n]) => sum + (op === '=' ? n : 0), 0),\n columns: edits.reduce((sum, [, n]) => sum + n, 0),\n })\n}\n", "import {\n assemblyByPanSNPrefix,\n panSNContig,\n panSNHaplotype,\n panSNMatchesPrefix,\n panSNSample,\n resolvePanSNPrefix,\n} from '@jbrowse/bandage-core/pansn'\nimport { updateStatus } from '@jbrowse/core/util'\nimport { ObservableCreate } from '@jbrowse/core/util/rxjs'\nimport { walksKept } from '@jbrowse/graph-walks'\n\nimport { anchorAligner, chainFeature, lanePairAligner } from './walkLanes.ts'\nimport { WalkIndex } from '../RgfaTabixAdapter/walkReader.ts'\nimport { PanSNRefNames, openTabixSlot } from '../panSNTabix.ts'\nimport { ComparativeAdapterBase } from '../synteny/ComparativeAdapterBase.ts'\nimport {\n laneAssemblyName,\n lanePairsStatus,\n requestedPairs,\n} from '../synteny/lanePairs.ts'\nimport { laneZoomNotice } from '../synteny/laneZoomNotice.ts'\n\nimport type { WalkTabixSyntenyAdapterConfig } from './configSchema.ts'\nimport type { SubgraphAdapterOptions } from '../GetSubgraph.ts'\nimport type { LaneFeatureOptions, LanePair } from '../synteny/lanePairs.ts'\nimport type { BaseOptions } from '@jbrowse/core/data_adapters/BaseAdapter'\nimport type { Feature } from '@jbrowse/core/util'\nimport type { Region } from '@jbrowse/core/util/types'\nimport type { WalkFragment } from '@jbrowse/graph-walks'\n\nconst haplotypeOf = (fragment: WalkFragment) =>\n panSNHaplotype(fragment.name) ?? fragment.name\n\nexport default class WalkTabixSyntenyAdapter extends ComparativeAdapterBase<WalkTabixSyntenyAdapterConfig> {\n private readonly walks: WalkIndex = new WalkIndex(\n openTabixSlot(this, ['walksLocation'], ['walksIndex']),\n this,\n )\n private readonly refNames: PanSNRefNames = new PanSNRefNames(\n this.walks.file,\n this,\n )\n\n private get anchor() {\n const anchor = this.getConf('assemblyNames')[0]\n if (anchor === undefined) {\n throw new Error(\n 'WalkTabixSyntenyAdapter needs assemblyNames: its first entry is the assembly the reference sample is loaded as',\n )\n }\n return anchor\n }\n\n /**\n * The haplotypes the walk file's header names, `sample#haplotype` in byte\n * order, or undefined when it names none\n */\n async getHaplotypeNames(opts: BaseOptions = {}) {\n return this.walks.haplotypeNames(opts)\n }\n\n /**\n * `lanes` is every haplotype the header names but the anchor's own,\n * declared up front so the display can offer the whole graph's haplotypes\n * before a fetch has placed any of them\n */\n async getHeader(opts: BaseOptions = {}) {\n const { haplotypes } = await this.walks.reader.header(opts)\n const { anchor } = this\n const anchorPrefix = resolvePanSNPrefix(this, anchor)\n const asmByPrefix = assemblyByPanSNPrefix(this)\n return {\n hasCoarseTier: false,\n anchorAssemblyName: anchor,\n lanes: haplotypes\n .filter(\n prefix =>\n prefix !== anchorPrefix && panSNSample(prefix) !== anchorPrefix,\n )\n .map(prefix => ({\n name: laneAssemblyName(asmByPrefix, prefix),\n label: prefix,\n group: panSNSample(prefix),\n })),\n }\n }\n\n // A lane's contigs are named only in its walk rows, so only the anchor's\n // are listed\n async getRefNames(opts: BaseOptions = {}) {\n const { assemblyName } = opts\n return assemblyName === undefined || assemblyName === this.anchor\n ? this.refNames.assemblyRefNames({ ...opts, assemblyName: this.anchor })\n : []\n }\n\n /**\n * The graph display's cut of the window, as RgfaTabixAdapter cuts a\n * walk-indexed graph: the reference walk first, then the walks `haplotypes`\n * asks for, and the nodes and links they visit\n */\n async getSubgraph(region: Region, opts: SubgraphAdapterOptions = {}) {\n const refName = await this.refNames.resolve(region, { signal: opts.signal })\n if (refName === undefined) {\n throw new Error(\n `${region.assemblyName} ${region.refName} is not in this graph's index; the graph is cut on ${this.anchor}, mapped to its PanSN prefix in assemblyNameToPanSN`,\n )\n }\n return this.walks.subgraph(refName, region, opts)\n }\n\n // The window's walks for the haplotypes named and the reference, with no\n // link read; a window past a budget fails as a zoom-in notice for lanes.\n // Named lanes come back in full where format 5 abridged them: an abridged\n // walk is two reference steps, which drew 15 of the HPRC MHC launch's 32\n // lanes empty.\n private async laneWalks(\n refName: string,\n region: Region,\n prefixes: string[] | undefined,\n opts: LaneFeatureOptions,\n status: string,\n ) {\n const keep = walksKept(prefixes, refName)\n return updateStatus(status, opts.statusCallback, () =>\n this.walks.reader\n .cut(refName, region, {\n ...this.walks.budgets(),\n signal: opts.signal,\n keep,\n expand: keep,\n links: false,\n })\n .catch((error: unknown) => {\n throw laneZoomNotice(error, region.end - region.start)\n }),\n )\n }\n\n /**\n * One record per stretch a haplotype's walk shares with the reference's,\n * on the reference with the haplotype as its mate\n */\n private async anchorFeatures(\n refName: string,\n region: Region,\n opts: LaneFeatureOptions,\n ) {\n const wanted = opts.haplotypes?.length\n ? opts.haplotypes.map(lane => resolvePanSNPrefix(this, lane))\n : undefined\n const target = resolvePanSNPrefix(this, opts.targetAssemblyName)\n const prefixes =\n target === undefined\n ? wanted\n : wanted === undefined ||\n wanted.some(\n prefix =>\n panSNMatchesPrefix(target, prefix) ||\n panSNMatchesPrefix(prefix, target),\n )\n ? [target]\n : []\n if (prefixes?.length === 0) {\n return []\n }\n const { start, end } = region\n const { graph, fragments } = await this.laneWalks(\n refName,\n region,\n prefixes,\n opts,\n `Reading walks ${region.refName}:${start.toLocaleString()}-${end.toLocaleString()}`,\n )\n const align = anchorAligner(graph.nodes)\n const asmByPrefix = assemblyByPanSNPrefix(this)\n const references = fragments.filter(f => f.name === refName)\n // lanes come back in the order the fetch names them, which is the order\n // the display stacks lanes of equal weight in\n const rank = (fragment: WalkFragment) =>\n prefixes === undefined\n ? 0\n : prefixes.findIndex(prefix =>\n panSNMatchesPrefix(fragment.name, prefix),\n )\n const shown = fragments\n .filter(fragment => fragment.name !== refName && rank(fragment) >= 0)\n .sort((a, b) => rank(a) - rank(b))\n return shown.flatMap(query =>\n references.flatMap(reference =>\n align(query, reference).map(chain =>\n chainFeature({\n chain,\n target: reference,\n query,\n assemblyName: region.assemblyName,\n refName: region.refName,\n mateAssemblyName: laneAssemblyName(asmByPrefix, haplotypeOf(query)),\n }),\n ),\n ),\n )\n }\n\n /**\n * Each pair's two lanes read out of the anchor window, all pairs in one\n * read, and each walk of a pair's query lane aligned to each walk of its\n * target lane. A pair's records sit on its query lane's contigs, the lane\n * the display draws on top.\n */\n private async pairFeatures(\n refName: string,\n region: Region,\n pairs: LanePair[],\n opts: LaneFeatureOptions,\n ) {\n const sides = pairs.map(pair => ({\n pair,\n featurePrefix: resolvePanSNPrefix(this, pair.queryAssemblyName),\n matePrefix: resolvePanSNPrefix(this, pair.targetAssemblyName),\n }))\n const { graph, fragments } = await this.laneWalks(\n refName,\n region,\n sides.flatMap(side => [side.featurePrefix, side.matePrefix]),\n opts,\n lanePairsStatus(pairs),\n )\n const align = lanePairAligner(graph.nodes)\n const walksOf = (prefix: string) =>\n fragments.filter(f => panSNMatchesPrefix(f.name, prefix))\n return sides.flatMap(({ pair, featurePrefix, matePrefix }) =>\n walksOf(featurePrefix).flatMap(target =>\n walksOf(matePrefix).flatMap(query =>\n align(query, target).map(chain =>\n chainFeature({\n chain,\n target,\n query,\n assemblyName: pair.queryAssemblyName,\n refName: panSNContig(target.name),\n mateAssemblyName: pair.targetAssemblyName,\n }),\n ),\n ),\n ),\n )\n }\n\n // The files are filed under the reference alone, so a window on a\n // haplotype lane has no answer: a lane pair is read inside the anchor's\n getFeatures(region: Region, opts: LaneFeatureOptions = {}) {\n return ObservableCreate<Feature>(async observer => {\n const refName =\n region.assemblyName === this.anchor\n ? await this.refNames.resolve(region, opts)\n : undefined\n if (refName !== undefined) {\n const pairs = requestedPairs(opts)\n const features =\n pairs.length > 0\n ? await this.pairFeatures(refName, region, pairs, opts)\n : await this.anchorFeatures(refName, region, opts)\n for (const feature of features) {\n observer.next(feature)\n }\n }\n observer.complete()\n }, opts.signal)\n }\n}\n"],
5
- "mappings": "kpBAWA,IAAMA,GAAyB,GAOxB,SAASC,GAAoBC,EAAmB,CACrD,IAAMC,EAAkB,CAAC,EACzB,QAASC,EAAI,EAAGA,EAAIF,EAAM,OAAQE,IAAK,CACrC,GAAM,CAACC,EAAIC,CAAG,EAAIJ,EAAME,CAAC,EACnB,CAACG,EAAQC,CAAO,EAAIN,EAAME,EAAI,CAAC,GAAK,CAAC,EAEzCE,IAAQE,GACRF,GAAON,KACLK,IAAO,KAAOE,IAAW,KAASF,IAAO,KAAOE,IAAW,MAE7DJ,EAAI,KAAK,CAAC,IAAKG,CAAG,CAAC,EACnBF,KAEAD,EAAI,KAAK,CAACE,EAAIC,CAAG,CAAC,CAEtB,CACA,OAAOH,CACT,CAGA,SAASM,EAAUC,EAAwB,CACzC,OAAO,MAAM,KAAKA,EAAS,IAAK,CAACC,EAAIP,IAAM,EAAIO,EAAKD,EAAS,IAAIN,CAAC,CAAE,CACtE,CAEA,SAASQ,EAAWC,EAA8BF,EAAY,CAC5D,IAAMG,EAAOD,EAAM,IAAIF,CAAE,EACzB,OAAOG,IAAS,OAAY,EAAIA,EAAK,IAAMA,EAAK,KAClD,CAOO,SAASC,EAAYF,EAA8B,CACxD,IAAMG,EAAU,IAAI,IACdC,EAAcN,GAAe,CACjC,IAAMO,EAASN,EAAWC,EAAOF,CAAE,EAC/BQ,EAAWH,EAAQ,IAAIE,CAAM,EACjC,OAAIC,IAAa,SACfA,EAAW,IAAI,OAAOD,CAAM,EAC5BF,EAAQ,IAAIE,EAAQC,CAAQ,GAEvBA,CACT,EACMC,EAAU,IAAI,IACdC,EAAiBX,GAA2B,CAChD,IAAIY,EAAQF,EAAQ,IAAIV,CAAQ,EAChC,OAAIY,IAAU,SACZA,EAAQb,EAAUC,CAAQ,EAC1BU,EAAQ,IAAIV,EAAUY,CAAK,GAEtBA,CACT,EACA,MAAO,CAACC,EAAqBC,IAC3BC,EAAe,CACb,MAAOJ,EAAcE,CAAK,EAC1B,OAAQF,EAAcG,CAAM,EAC5B,WAAAP,EACA,MAAO,EACT,CAAC,CACL,CAIA,IAAMS,EAAe,IAErB,SAASC,EAAWzB,EAAmBG,EAAiBC,EAAa,CACnE,IAAMsB,EAAO1B,EAAM,GAAG,EAAE,EACpBI,EAAM,IACJsB,IAAO,CAAC,IAAMvB,EAChBuB,EAAK,CAAC,GAAKtB,EAEXJ,EAAM,KAAK,CAACG,EAAIC,CAAG,CAAC,EAG1B,CAUO,SAASuB,EAAiBhB,EAA8B,CAC7D,IAAMiB,EAAYC,GAAmBnB,EAAWC,EAAOkB,GAAU,CAAC,EAC5DC,EAAWZ,GAAsB,CACrC,IAAMjB,EAAM,IAAI,aAAaiB,EAAQ,OAAS,CAAC,EAC/C,OAAAA,EAAQ,QAAQ,CAACW,EAAQ3B,IAAM,CAC7BD,EAAIC,EAAI,CAAC,EAAID,EAAIC,CAAC,EAAK0B,EAASC,CAAM,CACxC,CAAC,EACM5B,CACT,EAEA,MAAO,CAACoB,EAAqBC,IAAsC,CACjE,IAAMS,EAAMxB,EAAUe,CAAM,EACtBU,EAAMzB,EAAUc,CAAK,EACrB,CAACY,EAAMC,CAAU,EAAIC,EAAYH,EAAKD,EAAKH,CAAQ,EACnD,CAACQ,EAAQC,CAAY,EAAIF,EAC7BH,EAAI,IAAIH,GAAUA,EAAS,CAAC,EAAE,QAAQ,EACtCE,EACAH,CACF,EACMU,EAAUD,EAAeH,EACzBK,EAAQD,EAAUF,EAASH,EAC3BO,EAAc,KAAK,IAAIN,EAAYG,CAAY,EACrD,GAAIG,EAAchB,EAChB,MAAO,CAAC,EAEV,IAAMiB,EAAQX,EAAQC,CAAG,EACnBW,EAAQZ,EAAQE,CAAG,EAEnBW,EAAUC,GACdN,EAAUN,EAAI,OAAS,EAAIO,EAAMK,CAAC,EAAG,CAAC,EAAIL,EAAMK,CAAC,EAAG,CAAC,EACjD5C,EAAoB,CAAC,EAC3BuC,EAAM,QAAQ,CAAC,CAAC,CAAEM,CAAC,EAAG,IAAM,CAC1B,GAAI,EAAI,EAAG,CACT,GAAM,CAACC,GAAIC,EAAE,EAAI,CAACJ,EAAO,EAAI,CAAC,EAAGA,EAAO,CAAC,CAAC,EAAE,KAAK,CAACK,GAAGC,KAAMD,GAAIC,EAAC,EAChExB,EAAWzB,EAAO,IAAK0C,EAAMK,EAAG,EAAKL,EAAMI,GAAM,CAAC,CAAE,EACpDrB,EAAWzB,EAAO,IAAKyC,EAAMI,CAAC,EAAKJ,EAAMF,EAAM,EAAI,CAAC,EAAG,CAAC,EAAI,CAAC,CAAE,CACjE,CACAd,EAAWzB,EAAO,IAAK4B,EAASG,EAAIc,CAAC,CAAE,CAAC,CAC1C,CAAC,EACD,GAAM,CAACC,EAAIC,CAAE,EAAI,CAACJ,EAAO,CAAC,EAAGA,EAAOJ,EAAM,OAAS,CAAC,CAAC,EAAE,KAAK,CAACS,EAAGC,IAAMD,EAAIC,CAAC,EAC3E,MAAO,CACL,CACE,WAAYP,EAAMI,CAAG,EACrB,SAAUJ,EAAMK,EAAM,CAAC,EACvB,YAAaN,EAAMF,EAAM,CAAC,EAAG,CAAC,CAAC,EAC/B,UAAWE,EAAMF,EAAM,GAAG,EAAE,EAAG,CAAC,EAAI,CAAC,EACrC,OAAQD,EAAU,IAAM,IACxB,MAAAtC,EACA,YAAAwC,CACF,CACF,CACF,CACF,CAGA,SAASU,GAAa1C,EAAwB,CAC5C,IAAM2C,EAAM,IAAI,IACVC,EAAQ,IAAI,IAClB5C,EAAS,IAAI,QAAQ,CAACC,EAAIP,IAAM,CAC1BiD,EAAI,IAAI1C,CAAE,EACZ2C,EAAM,IAAI3C,CAAE,EAEZ0C,EAAI,IAAI1C,EAAID,EAAS,IAAIN,CAAC,CAAE,CAEhC,CAAC,EACD,QAAWO,KAAM2C,EACfD,EAAI,OAAO1C,CAAE,EAEf,OAAO0C,CACT,CAIA,SAASE,EAAgB1C,EAA8B,CACrD,IAAM2C,EAAS,IAAI,IACbC,EAAY/C,GAA2B,CAC3C,IAAIgD,EAAQF,EAAO,IAAI9C,CAAQ,EAC/B,OAAIgD,IAAU,SACZA,EAAQN,GAAa1C,CAAQ,EAC7B8C,EAAO,IAAI9C,EAAUgD,CAAK,GAErBA,CACT,EACA,MAAO,CAACnC,EAAqBC,IAAyB,CACpD,IAAMmC,EAASF,EAASjC,CAAM,EAC1BW,EAAO,EACPyB,EAAW,EACf,OAAW,CAACjD,EAAI0C,CAAG,IAAKI,EAASlC,CAAK,EAAG,CACvC,IAAMsC,EAAQF,EAAO,IAAIhD,CAAE,EACvBkD,IAAUR,EACZlB,GAAQvB,EAAWC,EAAOF,CAAE,EACnBkD,IAAU,SACnBD,GAAYhD,EAAWC,EAAOF,CAAE,EAEpC,CACA,MAAO,CAAE,KAAAwB,EAAM,SAAAyB,CAAS,CAC1B,CACF,CAaO,SAASE,EAAgBjD,EAA8B,CAC5D,IAAMkD,EAAclC,EAAiBhB,CAAK,EACpCmD,EAAUjD,EAAYF,CAAK,EAC3BoD,EAASV,EAAgB1C,CAAK,EACpC,MAAO,CAACU,EAAqBC,IAAyB,CACpD,GAAM,CAAE,KAAAW,EAAM,SAAAyB,CAAS,EAAIK,EAAO1C,EAAOC,CAAM,EAC/C,OAAOW,GAAQT,GAAgBkC,GAAYlC,EACvCsC,EAAQzC,EAAOC,CAAM,EACrBuC,EAAYxC,EAAOC,CAAM,CAC/B,CACF,CAIA,IAAM0C,GAAgB,IAUf,SAASC,EAActD,EAA8B,CAC1D,IAAMkD,EAAclC,EAAiBhB,CAAK,EACpCmD,EAAUjD,EAAYF,CAAK,EAC3BoD,EAASV,EAAgB1C,CAAK,EACpC,MAAO,CAACU,EAAqBC,IAAyB,CACpD,IAAM4C,EAAUL,EAAYxC,EAAOC,CAAM,EACnC6C,EAAQD,EAAQ,CAAC,GAAG,OACpB,CAAE,KAAAjC,EAAM,SAAAyB,CAAS,EAAIK,EAAO1C,EAAOC,CAAM,EAC/C,OAAO6C,IAAU,QAAa,KAAK,IAAIlC,EAAMyB,CAAQ,EAAIM,GACrDE,EACA,CACE,GAAGA,EACH,GAAGJ,EAAQzC,EAAOC,CAAM,EAAE,OAAO8C,GAASA,EAAM,SAAWD,CAAK,CAClE,CACN,CACF,CAMO,SAASE,EAAa,CAC3B,MAAAD,EACA,OAAA9C,EACA,MAAAD,EACA,aAAAiD,EACA,QAAAC,EACA,iBAAAC,CACF,EAOG,CACD,IAAMxE,EAAQD,GAAoBqE,EAAM,KAAK,EAC7C,OAAOK,EAAa,CAClB,OAAQ,CACN,KAAMnD,EAAO,KACb,aAAAgD,EACA,QAAAC,EACA,MAAOjD,EAAO,SAAW8C,EAAM,YAC/B,IAAK9C,EAAO,SAAW8C,EAAM,SAC/B,EACA,MAAO,CACL,KAAM/C,EAAM,KACZ,aAAcmD,EACd,QAASE,EAAYrD,EAAM,IAAI,EAC/B,MAAOA,EAAM,SAAW+C,EAAM,WAC9B,IAAK/C,EAAM,SAAW+C,EAAM,QAC9B,EACA,OAAQA,EAAM,OACd,MAAOO,EAAU3E,CAAK,EACtB,QAASA,EAAM,OAAO,CAAC4E,EAAK,CAACzE,EAAI0E,CAAC,IAAMD,GAAOzE,IAAO,IAAM0E,EAAI,GAAI,CAAC,EACrE,QAAS7E,EAAM,OAAO,CAAC4E,EAAK,CAAC,CAAEC,CAAC,IAAMD,EAAMC,EAAG,CAAC,CAClD,CAAC,CACH,CCxQA,IAAMC,GAAeC,GACnBC,EAAeD,EAAS,IAAI,GAAKA,EAAS,KAEvBE,EAArB,cAAqDC,CAAsD,CAA3G,kCACE,KAAiB,MAAmB,IAAIC,EACtCC,EAAc,KAAM,CAAC,eAAe,EAAG,CAAC,YAAY,CAAC,EACrD,IACF,EACA,KAAiB,SAA0B,IAAIC,EAC7C,KAAK,MAAM,KACX,IACF,EAEA,IAAY,QAAS,CACnB,IAAMC,EAAS,KAAK,QAAQ,eAAe,EAAE,CAAC,EAC9C,GAAIA,IAAW,OACb,MAAM,IAAI,MACR,gHACF,EAEF,OAAOA,CACT,CAMA,MAAM,kBAAkBC,EAAoB,CAAC,EAAG,CAC9C,OAAO,KAAK,MAAM,eAAeA,CAAI,CACvC,CAOA,MAAM,UAAUA,EAAoB,CAAC,EAAG,CACtC,GAAM,CAAE,WAAAC,CAAW,EAAI,MAAM,KAAK,MAAM,OAAO,OAAOD,CAAI,EACpD,CAAE,OAAAD,CAAO,EAAI,KACbG,EAAeC,EAAmB,KAAMJ,CAAM,EAC9CK,EAAcC,EAAsB,IAAI,EAC9C,MAAO,CACL,cAAe,GACf,mBAAoBN,EACpB,MAAOE,EACJ,OACCK,GACEA,IAAWJ,GAAgBK,EAAYD,CAAM,IAAMJ,CACvD,EACC,IAAII,IAAW,CACd,KAAME,EAAiBJ,EAAaE,CAAM,EAC1C,MAAOA,EACP,MAAOC,EAAYD,CAAM,CAC3B,EAAE,CACN,CACF,CAIA,MAAM,YAAYN,EAAoB,CAAC,EAAG,CACxC,GAAM,CAAE,aAAAS,CAAa,EAAIT,EACzB,OAAOS,IAAiB,QAAaA,IAAiB,KAAK,OACvD,KAAK,SAAS,iBAAiB,CAAE,GAAGT,EAAM,aAAc,KAAK,MAAO,CAAC,EACrE,CAAC,CACP,CAOA,MAAM,YAAYU,EAAgBV,EAA+B,CAAC,EAAG,CACnE,IAAMW,EAAU,MAAM,KAAK,SAAS,QAAQD,EAAQ,CAAE,OAAQV,EAAK,MAAO,CAAC,EAC3E,GAAIW,IAAY,OACd,MAAM,IAAI,MACR,GAAGD,EAAO,YAAY,IAAIA,EAAO,OAAO,sDAAsD,KAAK,MAAM,qDAC3G,EAEF,OAAO,KAAK,MAAM,SAASC,EAASD,EAAQV,CAAI,CAClD,CAOA,MAAc,UACZW,EACAD,EACAE,EACAZ,EACAa,EACA,CACA,IAAMC,EAAOC,EAAUH,EAAUD,CAAO,EACxC,OAAOK,EAAaH,EAAQb,EAAK,eAAgB,IAC/C,KAAK,MAAM,OACR,IAAIW,EAASD,EAAQ,CACpB,GAAG,KAAK,MAAM,QAAQ,EACtB,OAAQV,EAAK,OACb,KAAAc,EACA,OAAQA,EACR,MAAO,EACT,CAAC,EACA,MAAOG,GAAmB,CACzB,MAAMC,EAAeD,EAAOP,EAAO,IAAMA,EAAO,KAAK,CACvD,CAAC,CACL,CACF,CAMA,MAAc,eACZC,EACAD,EACAV,EACA,CACA,IAAMmB,EAASnB,EAAK,YAAY,OAC5BA,EAAK,WAAW,IAAIoB,GAAQjB,EAAmB,KAAMiB,CAAI,CAAC,EAC1D,OACEC,EAASlB,EAAmB,KAAMH,EAAK,kBAAkB,EACzDY,EACJS,IAAW,OACPF,EACAA,IAAW,QACTA,EAAO,KACLb,GACEgB,EAAmBD,EAAQf,CAAM,GACjCgB,EAAmBhB,EAAQe,CAAM,CACrC,EACA,CAACA,CAAM,EACP,CAAC,EACT,GAAIT,GAAU,SAAW,EACvB,MAAO,CAAC,EAEV,GAAM,CAAE,MAAAW,EAAO,IAAAC,CAAI,EAAId,EACjB,CAAE,MAAAe,EAAO,UAAAC,CAAU,EAAI,MAAM,KAAK,UACtCf,EACAD,EACAE,EACAZ,EACA,iBAAiBU,EAAO,OAAO,IAAIa,EAAM,eAAe,CAAC,IAAIC,EAAI,eAAe,CAAC,EACnF,EACMG,EAAQC,EAAcH,EAAM,KAAK,EACjCrB,EAAcC,EAAsB,IAAI,EACxCwB,EAAaH,EAAU,OAAOI,GAAKA,EAAE,OAASnB,CAAO,EAGrDoB,EAAQvC,GACZoB,IAAa,OACT,EACAA,EAAS,UAAUN,GACjBgB,EAAmB9B,EAAS,KAAMc,CAAM,CAC1C,EAIN,OAHcoB,EACX,OAAOlC,GAAYA,EAAS,OAASmB,GAAWoB,EAAKvC,CAAQ,GAAK,CAAC,EACnE,KAAK,CAACwC,EAAG,IAAMD,EAAKC,CAAC,EAAID,EAAK,CAAC,CAAC,EACtB,QAAQE,GACnBJ,EAAW,QAAQK,GACjBP,EAAMM,EAAOC,CAAS,EAAE,IAAIC,GAC1BC,EAAa,CACX,MAAAD,EACA,OAAQD,EACR,MAAAD,EACA,aAAcvB,EAAO,aACrB,QAASA,EAAO,QAChB,iBAAkBF,EAAiBJ,EAAab,GAAY0C,CAAK,CAAC,CACpE,CAAC,CACH,CACF,CACF,CACF,CAQA,MAAc,aACZtB,EACAD,EACA2B,EACArC,EACA,CACA,IAAMsC,EAAQD,EAAM,IAAIE,IAAS,CAC/B,KAAAA,EACA,cAAepC,EAAmB,KAAMoC,EAAK,iBAAiB,EAC9D,WAAYpC,EAAmB,KAAMoC,EAAK,kBAAkB,CAC9D,EAAE,EACI,CAAE,MAAAd,EAAO,UAAAC,CAAU,EAAI,MAAM,KAAK,UACtCf,EACAD,EACA4B,EAAM,QAAQE,GAAQ,CAACA,EAAK,cAAeA,EAAK,UAAU,CAAC,EAC3DxC,EACAyC,EAAgBJ,CAAK,CACvB,EACMV,EAAQe,EAAgBjB,EAAM,KAAK,EACnCkB,EAAWrC,GACfoB,EAAU,OAAOI,GAAKR,EAAmBQ,EAAE,KAAMxB,CAAM,CAAC,EAC1D,OAAOgC,EAAM,QAAQ,CAAC,CAAE,KAAAC,EAAM,cAAAK,EAAe,WAAAC,CAAW,IACtDF,EAAQC,CAAa,EAAE,QAAQvB,GAC7BsB,EAAQE,CAAU,EAAE,QAAQZ,GAC1BN,EAAMM,EAAOZ,CAAM,EAAE,IAAIc,GACvBC,EAAa,CACX,MAAAD,EACA,OAAAd,EACA,MAAAY,EACA,aAAcM,EAAK,kBACnB,QAASO,EAAYzB,EAAO,IAAI,EAChC,iBAAkBkB,EAAK,kBACzB,CAAC,CACH,CACF,CACF,CACF,CACF,CAIA,YAAY7B,EAAgBV,EAA2B,CAAC,EAAG,CACzD,OAAO+C,EAA0B,MAAMC,GAAY,CACjD,IAAMrC,EACJD,EAAO,eAAiB,KAAK,OACzB,MAAM,KAAK,SAAS,QAAQA,EAAQV,CAAI,EACxC,OACN,GAAIW,IAAY,OAAW,CACzB,IAAM0B,EAAQY,EAAejD,CAAI,EAC3BkD,EACJb,EAAM,OAAS,EACX,MAAM,KAAK,aAAa1B,EAASD,EAAQ2B,EAAOrC,CAAI,EACpD,MAAM,KAAK,eAAeW,EAASD,EAAQV,CAAI,EACrD,QAAWmD,KAAWD,EACpBF,EAAS,KAAKG,CAAO,CAEzB,CACAH,EAAS,SAAS,CACpB,EAAGhD,EAAK,MAAM,CAChB,CACF",
4
+ "sourcesContent": ["import { weightedLcs } from '@gmod/gbz-base/lcs'\nimport { pairAlignments, pairCigar } from '@gmod/gbz-base/pairAlignment'\nimport { panSNContig } from '@jbrowse/bandage-core/pansn'\n\nimport { matchFeature } from '../synteny/matchFeature.ts'\n\nimport type { PairChain, PairEdit } from '@gmod/gbz-base/pairAlignment'\nimport type { WalkFragment, WalkNode } from '@jbrowse/graph-walks'\n\n// The longest bubble with equal bases on both sides that is written as\n// mismatches; a longer one stays an insertion and a deletion\nconst BALANCED_BUBBLE_MAX_BP = 50\n\n/**\n * A chain's edits with each short balanced bubble as `X`. The walks carry no\n * bases, so two walks differ wherever they leave a shared node, and a SNP is\n * one base inserted and one deleted until it is read as the mismatch it is.\n */\nexport function bubblesAsMismatches(edits: PairEdit[]) {\n const out: PairEdit[] = []\n for (let i = 0; i < edits.length; i++) {\n const [op, len] = edits[i]!\n const [nextOp, nextLen] = edits[i + 1] ?? []\n if (\n len === nextLen &&\n len <= BALANCED_BUBBLE_MAX_BP &&\n ((op === 'I' && nextOp === 'D') || (op === 'D' && nextOp === 'I'))\n ) {\n out.push(['X', len])\n i++\n } else {\n out.push([op, len])\n }\n }\n return out\n}\n\n// A walk's steps as the handles gbz-base reads, 2 * id + reversed\nfunction handlesOf(fragment: WalkFragment) {\n return Array.from(fragment.ids, (id, i) => 2 * id + fragment.rev[i]!)\n}\n\nfunction nodeLength(nodes: Map<number, WalkNode>, id: number) {\n const node = nodes.get(id)\n return node === undefined ? 0 : node.end - node.start\n}\n\n/**\n * Aligns one walk fragment to another on the nodes both visit, from node\n * lengths alone: the fragments' steps as the handles gbz-base's chainer reads,\n * and a stand-in sequence of each node's length.\n */\nexport function walkAligner(nodes: Map<number, WalkNode>) {\n const standIn = new Map<number, string>()\n const sequenceOf = (id: number) => {\n const length = nodeLength(nodes, id)\n let sequence = standIn.get(length)\n if (sequence === undefined) {\n sequence = 'N'.repeat(length)\n standIn.set(length, sequence)\n }\n return sequence\n }\n const handles = new Map<WalkFragment, number[]>()\n const cachedHandles = (fragment: WalkFragment) => {\n let steps = handles.get(fragment)\n if (steps === undefined) {\n steps = handlesOf(fragment)\n handles.set(fragment, steps)\n }\n return steps\n }\n return (query: WalkFragment, target: WalkFragment) =>\n pairAlignments({\n query: cachedHandles(query),\n target: cachedHandles(target),\n sequenceOf,\n bases: false,\n })\n}\n\n// The fewest bases on shared nodes a record against the reference keeps,\n// gbz-base's floor for a pair record\nconst MIN_MATCH_BP = 100\n\nfunction appendEdit(edits: PairEdit[], op: PairEdit[0], len: number) {\n const last = edits.at(-1)\n if (len > 0) {\n if (last?.[0] === op) {\n last[1] += len\n } else {\n edits.push([op, len])\n }\n }\n}\n\n/**\n * Aligns a haplotype's walk fragment to the reference's as gbz-base aligns a\n * walk to its reference path: the heaviest common subsequence of their steps,\n * each node weighing its length, read in whichever direction shares more. A\n * pair chain leaves out every node either walk passes twice, which is the\n * whole of a collapsed copy-number array (amylase, KIV-2); the subsequence\n * matches one pass over it, and the other copies are insertions.\n */\nexport function referenceAligner(nodes: Map<number, WalkNode>) {\n const lengthOf = (handle: number) => nodeLength(nodes, handle >> 1)\n const offsets = (handles: number[]) => {\n const out = new Float64Array(handles.length + 1)\n handles.forEach((handle, i) => {\n out[i + 1] = out[i]! + lengthOf(handle)\n })\n return out\n }\n\n return (query: WalkFragment, target: WalkFragment): PairChain[] => {\n const ref = handlesOf(target)\n const hap = handlesOf(query)\n const [same, sameWeight] = weightedLcs(hap, ref, lengthOf)\n const [turned, turnedWeight] = weightedLcs(\n hap.map(handle => handle ^ 1).reverse(),\n ref,\n lengthOf,\n )\n const reverse = turnedWeight > sameWeight\n const pairs = reverse ? turned : same\n const sharedBases = Math.max(sameWeight, turnedWeight)\n if (sharedBases < MIN_MATCH_BP) {\n return []\n }\n const refAt = offsets(ref)\n const hapAt = offsets(hap)\n // a pair's haplotype step, counted along the haplotype\n const stepOf = (k: number) =>\n reverse ? hap.length - 1 - pairs[k]![0] : pairs[k]![0]\n const edits: PairEdit[] = []\n pairs.forEach(([, r], k) => {\n if (k > 0) {\n const [lo, hi] = [stepOf(k - 1), stepOf(k)].sort((x, y) => x - y)\n appendEdit(edits, 'I', hapAt[hi!]! - hapAt[lo! + 1]!)\n appendEdit(edits, 'D', refAt[r]! - refAt[pairs[k - 1]![1] + 1]!)\n }\n appendEdit(edits, '=', lengthOf(ref[r]!))\n })\n const [lo, hi] = [stepOf(0), stepOf(pairs.length - 1)].sort((x, y) => x - y)\n return [\n {\n queryStart: hapAt[lo!]!,\n queryEnd: hapAt[hi! + 1]!,\n targetStart: refAt[pairs[0]![1]]!,\n targetEnd: refAt[pairs.at(-1)![1] + 1]!,\n strand: reverse ? '-' : '+',\n edits,\n sharedBases,\n },\n ]\n }\n}\n\n// Each node a walk visits once, with the direction it passes it\nfunction singleVisits(fragment: WalkFragment) {\n const rev = new Map<number, number>()\n const twice = new Set<number>()\n fragment.ids.forEach((id, i) => {\n if (rev.has(id)) {\n twice.add(id)\n } else {\n rev.set(id, fragment.rev[i]!)\n }\n })\n for (const id of twice) {\n rev.delete(id)\n }\n return rev\n}\n\n// The bases on singly visited nodes two walks pass the same way and the\n// opposite way\nfunction directionShares(nodes: Map<number, WalkNode>) {\n const visits = new Map<WalkFragment, Map<number, number>>()\n const visitsOf = (fragment: WalkFragment) => {\n let found = visits.get(fragment)\n if (found === undefined) {\n found = singleVisits(fragment)\n visits.set(fragment, found)\n }\n return found\n }\n return (query: WalkFragment, target: WalkFragment) => {\n const theirs = visitsOf(target)\n let same = 0\n let opposite = 0\n for (const [id, rev] of visitsOf(query)) {\n const other = theirs.get(id)\n if (other === rev) {\n same += nodeLength(nodes, id)\n } else if (other !== undefined) {\n opposite += nodeLength(nodes, id)\n }\n }\n return { same, opposite }\n }\n}\n\n/**\n * Aligns one lane's walk fragment to another's. The weighted subsequence\n * (`referenceAligner`) is the fast route and matches through copy-number\n * arrays, but it reads one direction per pair, so an inversion between the\n * lanes comes out as an insertion beside a deletion. A pair sharing 100 bp\n * (MIN_MATCH_BP) or more of singly visited nodes in each direction goes to\n * pair chaining (`walkAligner`) instead, which answers the inverted stretch as\n * a reverse-strand record of its own. Chaining leaves out every node a walk\n * passes twice, so counting singly visited nodes misses no inversion it could\n * draw.\n */\nexport function lanePairAligner(nodes: Map<number, WalkNode>) {\n const subsequence = referenceAligner(nodes)\n const chained = walkAligner(nodes)\n const shares = directionShares(nodes)\n return (query: WalkFragment, target: WalkFragment) => {\n const { same, opposite } = shares(query, target)\n return same >= MIN_MATCH_BP && opposite >= MIN_MATCH_BP\n ? chained(query, target)\n : subsequence(query, target)\n }\n}\n\n// The multi-way display's SPLIT_AT_GAP_BP, under which a turned stretch names\n// no inversion there\nconst TURNED_MIN_BP = 10_000\n\n/**\n * Aligns a haplotype's walk fragment to the reference's as `referenceAligner`\n * does, then adds the stretches it reads the other way. A walk sharing\n * TURNED_MIN_BP or more of singly visited nodes in each direction is chained\n * too, and the chained records on the strand the subsequence did not take are\n * its turned stretches. The subsequence record stays, so a copy-number array,\n * which chaining leaves out, still matches one pass alike in every lane.\n */\nexport function anchorAligner(nodes: Map<number, WalkNode>) {\n const subsequence = referenceAligner(nodes)\n const chained = walkAligner(nodes)\n const shares = directionShares(nodes)\n return (query: WalkFragment, target: WalkFragment) => {\n const records = subsequence(query, target)\n const taken = records[0]?.strand\n const { same, opposite } = shares(query, target)\n return taken === undefined || Math.min(same, opposite) < TURNED_MIN_BP\n ? records\n : [\n ...records,\n ...chained(query, target).filter(chain => chain.strand !== taken),\n ]\n }\n}\n\n/**\n * One record of a walk aligned to another, with its short balanced bubbles as\n * mismatches\n */\nexport function chainFeature({\n chain,\n target,\n query,\n assemblyName,\n refName,\n mateAssemblyName,\n}: {\n chain: PairChain\n target: WalkFragment\n query: WalkFragment\n assemblyName: string\n refName: string\n mateAssemblyName: string\n}) {\n const edits = bubblesAsMismatches(chain.edits)\n return matchFeature({\n target: {\n name: target.name,\n assemblyName,\n refName,\n start: target.hapStart + chain.targetStart,\n end: target.hapStart + chain.targetEnd,\n },\n query: {\n name: query.name,\n assemblyName: mateAssemblyName,\n refName: panSNContig(query.name),\n start: query.hapStart + chain.queryStart,\n end: query.hapStart + chain.queryEnd,\n },\n strand: chain.strand,\n cigar: pairCigar(edits),\n matches: edits.reduce((sum, [op, n]) => sum + (op === '=' ? n : 0), 0),\n columns: edits.reduce((sum, [, n]) => sum + n, 0),\n })\n}\n", "import {\n assemblyByPanSNPrefix,\n panSNContig,\n panSNHaplotype,\n panSNMatchesPrefix,\n panSNSample,\n resolvePanSNPrefix,\n} from '@jbrowse/bandage-core/pansn'\nimport { updateStatus } from '@jbrowse/core/util'\nimport { ObservableCreate } from '@jbrowse/core/util/rxjs'\nimport { walksKept } from '@jbrowse/graph-walks'\n\nimport { anchorAligner, chainFeature, lanePairAligner } from './walkLanes.ts'\nimport { WalkIndex } from '../RgfaTabixAdapter/walkReader.ts'\nimport { PanSNRefNames, openTabixSlot } from '../panSNTabix.ts'\nimport { ComparativeAdapterBase } from '../synteny/ComparativeAdapterBase.ts'\nimport {\n laneAssemblyName,\n lanePairsStatus,\n requestedPairs,\n} from '../synteny/lanePairs.ts'\nimport { laneZoomNotice } from '../synteny/laneZoomNotice.ts'\n\nimport type { WalkTabixSyntenyAdapterConfig } from './configSchema.ts'\nimport type { SubgraphAdapterOptions } from '../GetSubgraph.ts'\nimport type { LaneFeatureOptions, LanePair } from '../synteny/lanePairs.ts'\nimport type { BaseOptions } from '@jbrowse/core/data_adapters/BaseAdapter'\nimport type { Feature } from '@jbrowse/core/util'\nimport type { Region } from '@jbrowse/core/util/types'\nimport type { WalkFragment } from '@jbrowse/graph-walks'\n\nconst haplotypeOf = (fragment: WalkFragment) =>\n panSNHaplotype(fragment.name) ?? fragment.name\n\nexport default class WalkTabixSyntenyAdapter extends ComparativeAdapterBase<WalkTabixSyntenyAdapterConfig> {\n private readonly walks: WalkIndex = new WalkIndex(\n openTabixSlot(this, ['walksLocation'], ['walksIndex']),\n this,\n )\n private readonly refNames: PanSNRefNames = new PanSNRefNames(\n this.walks.file,\n this,\n )\n\n private get anchor() {\n const anchor = this.getConf('assemblyNames')[0]\n if (anchor === undefined) {\n throw new Error(\n 'WalkTabixSyntenyAdapter needs assemblyNames: its first entry is the assembly the reference sample is loaded as',\n )\n }\n return anchor\n }\n\n /**\n * The haplotypes the walk file's header names, `sample#haplotype` in byte\n * order, or undefined when it names none\n */\n async getHaplotypeNames(opts: BaseOptions = {}) {\n return this.walks.haplotypeNames(opts)\n }\n\n /**\n * `lanes` is every haplotype the header names but the anchor's own,\n * declared up front so the display can offer the whole graph's haplotypes\n * before a fetch has placed any of them\n */\n async getHeader(opts: BaseOptions = {}) {\n const { haplotypes } = await this.walks.reader.header(opts)\n const { anchor } = this\n const anchorPrefix = resolvePanSNPrefix(this, anchor)\n const asmByPrefix = assemblyByPanSNPrefix(this)\n return {\n hasCoarseTier: false,\n anchorAssemblyName: anchor,\n lanes: haplotypes\n .filter(\n prefix =>\n prefix !== anchorPrefix && panSNSample(prefix) !== anchorPrefix,\n )\n .map(prefix => ({\n name: laneAssemblyName(asmByPrefix, prefix),\n label: prefix,\n group: panSNSample(prefix),\n })),\n }\n }\n\n // A lane's contigs are named only in its walk rows, so only the anchor's\n // are listed\n async getRefNames(opts: BaseOptions = {}) {\n const { assemblyName } = opts\n return assemblyName === undefined || assemblyName === this.anchor\n ? this.refNames.assemblyRefNames({ ...opts, assemblyName: this.anchor })\n : []\n }\n\n /**\n * The graph display's cut of the window, as RgfaTabixAdapter cuts a\n * walk-indexed graph: the reference walk first, then the walks `haplotypes`\n * asks for, and the nodes and links they visit\n */\n async getSubgraph(region: Region, opts: SubgraphAdapterOptions = {}) {\n const refName = await this.refNames.resolveForCut(region, {\n signal: opts.signal,\n })\n return this.walks.subgraph(refName, region, opts)\n }\n\n // The window's walks for the haplotypes named and the reference, with no\n // link read; a window past a budget fails as a zoom-in notice for lanes.\n // Named lanes come back in full where format 5 abridged them: an abridged\n // walk is two reference steps, which drew 15 of the HPRC MHC launch's 32\n // lanes empty.\n private async laneWalks(\n refName: string,\n region: Region,\n prefixes: string[] | undefined,\n opts: LaneFeatureOptions,\n status: string,\n ) {\n const keep = walksKept(prefixes, refName)\n return updateStatus(status, opts.statusCallback, () =>\n this.walks.reader\n .cut(refName, region, {\n ...this.walks.budgets(),\n signal: opts.signal,\n keep,\n expand: keep,\n links: false,\n })\n .catch((error: unknown) => {\n throw laneZoomNotice(error, region.end - region.start)\n }),\n )\n }\n\n /**\n * One record per stretch a haplotype's walk shares with the reference's,\n * on the reference with the haplotype as its mate\n */\n private async anchorFeatures(\n refName: string,\n region: Region,\n opts: LaneFeatureOptions,\n ) {\n const wanted = opts.haplotypes?.length\n ? opts.haplotypes.map(lane => resolvePanSNPrefix(this, lane))\n : undefined\n const target = resolvePanSNPrefix(this, opts.targetAssemblyName)\n const prefixes =\n target === undefined\n ? wanted\n : wanted === undefined ||\n wanted.some(\n prefix =>\n panSNMatchesPrefix(target, prefix) ||\n panSNMatchesPrefix(prefix, target),\n )\n ? [target]\n : []\n if (prefixes?.length === 0) {\n return []\n }\n const { start, end } = region\n const { graph, fragments } = await this.laneWalks(\n refName,\n region,\n prefixes,\n opts,\n `Reading walks ${region.refName}:${start.toLocaleString()}-${end.toLocaleString()}`,\n )\n const align = anchorAligner(graph.nodes)\n const asmByPrefix = assemblyByPanSNPrefix(this)\n const references = fragments.filter(f => f.name === refName)\n // lanes come back in the order the fetch names them, which is the order\n // the display stacks lanes of equal weight in\n const rank = (fragment: WalkFragment) =>\n prefixes === undefined\n ? 0\n : prefixes.findIndex(prefix =>\n panSNMatchesPrefix(fragment.name, prefix),\n )\n const shown = fragments\n .filter(fragment => fragment.name !== refName && rank(fragment) >= 0)\n .sort((a, b) => rank(a) - rank(b))\n return shown.flatMap(query =>\n references.flatMap(reference =>\n align(query, reference).map(chain =>\n chainFeature({\n chain,\n target: reference,\n query,\n assemblyName: region.assemblyName,\n refName: region.refName,\n mateAssemblyName: laneAssemblyName(asmByPrefix, haplotypeOf(query)),\n }),\n ),\n ),\n )\n }\n\n /**\n * Each pair's two lanes read out of the anchor window, all pairs in one\n * read, and each walk of a pair's query lane aligned to each walk of its\n * target lane. A pair's records sit on its query lane's contigs, the lane\n * the display draws on top.\n */\n private async pairFeatures(\n refName: string,\n region: Region,\n pairs: LanePair[],\n opts: LaneFeatureOptions,\n ) {\n const sides = pairs.map(pair => ({\n pair,\n featurePrefix: resolvePanSNPrefix(this, pair.queryAssemblyName),\n matePrefix: resolvePanSNPrefix(this, pair.targetAssemblyName),\n }))\n const { graph, fragments } = await this.laneWalks(\n refName,\n region,\n sides.flatMap(side => [side.featurePrefix, side.matePrefix]),\n opts,\n lanePairsStatus(pairs),\n )\n const align = lanePairAligner(graph.nodes)\n const walksOf = (prefix: string) =>\n fragments.filter(f => panSNMatchesPrefix(f.name, prefix))\n return sides.flatMap(({ pair, featurePrefix, matePrefix }) =>\n walksOf(featurePrefix).flatMap(target =>\n walksOf(matePrefix).flatMap(query =>\n align(query, target).map(chain =>\n chainFeature({\n chain,\n target,\n query,\n assemblyName: pair.queryAssemblyName,\n refName: panSNContig(target.name),\n mateAssemblyName: pair.targetAssemblyName,\n }),\n ),\n ),\n ),\n )\n }\n\n // The files are filed under the reference alone, so a window on a\n // haplotype lane has no answer: a lane pair is read inside the anchor's\n getFeatures(region: Region, opts: LaneFeatureOptions = {}) {\n return ObservableCreate<Feature>(async observer => {\n const refName =\n region.assemblyName === this.anchor\n ? await this.refNames.resolve(region, opts)\n : undefined\n if (refName !== undefined) {\n const pairs = requestedPairs(opts)\n const features =\n pairs.length > 0\n ? await this.pairFeatures(refName, region, pairs, opts)\n : await this.anchorFeatures(refName, region, opts)\n for (const feature of features) {\n observer.next(feature)\n }\n }\n observer.complete()\n }, opts.signal)\n }\n}\n"],
5
+ "mappings": "kpBAWA,IAAMA,GAAyB,GAOxB,SAASC,GAAoBC,EAAmB,CACrD,IAAMC,EAAkB,CAAC,EACzB,QAASC,EAAI,EAAGA,EAAIF,EAAM,OAAQE,IAAK,CACrC,GAAM,CAACC,EAAIC,CAAG,EAAIJ,EAAME,CAAC,EACnB,CAACG,EAAQC,CAAO,EAAIN,EAAME,EAAI,CAAC,GAAK,CAAC,EAEzCE,IAAQE,GACRF,GAAON,KACLK,IAAO,KAAOE,IAAW,KAASF,IAAO,KAAOE,IAAW,MAE7DJ,EAAI,KAAK,CAAC,IAAKG,CAAG,CAAC,EACnBF,KAEAD,EAAI,KAAK,CAACE,EAAIC,CAAG,CAAC,CAEtB,CACA,OAAOH,CACT,CAGA,SAASM,EAAUC,EAAwB,CACzC,OAAO,MAAM,KAAKA,EAAS,IAAK,CAACC,EAAIP,IAAM,EAAIO,EAAKD,EAAS,IAAIN,CAAC,CAAE,CACtE,CAEA,SAASQ,EAAWC,EAA8BF,EAAY,CAC5D,IAAMG,EAAOD,EAAM,IAAIF,CAAE,EACzB,OAAOG,IAAS,OAAY,EAAIA,EAAK,IAAMA,EAAK,KAClD,CAOO,SAASC,EAAYF,EAA8B,CACxD,IAAMG,EAAU,IAAI,IACdC,EAAcN,GAAe,CACjC,IAAMO,EAASN,EAAWC,EAAOF,CAAE,EAC/BQ,EAAWH,EAAQ,IAAIE,CAAM,EACjC,OAAIC,IAAa,SACfA,EAAW,IAAI,OAAOD,CAAM,EAC5BF,EAAQ,IAAIE,EAAQC,CAAQ,GAEvBA,CACT,EACMC,EAAU,IAAI,IACdC,EAAiBX,GAA2B,CAChD,IAAIY,EAAQF,EAAQ,IAAIV,CAAQ,EAChC,OAAIY,IAAU,SACZA,EAAQb,EAAUC,CAAQ,EAC1BU,EAAQ,IAAIV,EAAUY,CAAK,GAEtBA,CACT,EACA,MAAO,CAACC,EAAqBC,IAC3BC,EAAe,CACb,MAAOJ,EAAcE,CAAK,EAC1B,OAAQF,EAAcG,CAAM,EAC5B,WAAAP,EACA,MAAO,EACT,CAAC,CACL,CAIA,IAAMS,EAAe,IAErB,SAASC,EAAWzB,EAAmBG,EAAiBC,EAAa,CACnE,IAAMsB,EAAO1B,EAAM,GAAG,EAAE,EACpBI,EAAM,IACJsB,IAAO,CAAC,IAAMvB,EAChBuB,EAAK,CAAC,GAAKtB,EAEXJ,EAAM,KAAK,CAACG,EAAIC,CAAG,CAAC,EAG1B,CAUO,SAASuB,EAAiBhB,EAA8B,CAC7D,IAAMiB,EAAYC,GAAmBnB,EAAWC,EAAOkB,GAAU,CAAC,EAC5DC,EAAWZ,GAAsB,CACrC,IAAMjB,EAAM,IAAI,aAAaiB,EAAQ,OAAS,CAAC,EAC/C,OAAAA,EAAQ,QAAQ,CAACW,EAAQ3B,IAAM,CAC7BD,EAAIC,EAAI,CAAC,EAAID,EAAIC,CAAC,EAAK0B,EAASC,CAAM,CACxC,CAAC,EACM5B,CACT,EAEA,MAAO,CAACoB,EAAqBC,IAAsC,CACjE,IAAMS,EAAMxB,EAAUe,CAAM,EACtBU,EAAMzB,EAAUc,CAAK,EACrB,CAACY,EAAMC,CAAU,EAAIC,EAAYH,EAAKD,EAAKH,CAAQ,EACnD,CAACQ,EAAQC,CAAY,EAAIF,EAC7BH,EAAI,IAAIH,GAAUA,EAAS,CAAC,EAAE,QAAQ,EACtCE,EACAH,CACF,EACMU,EAAUD,EAAeH,EACzBK,EAAQD,EAAUF,EAASH,EAC3BO,EAAc,KAAK,IAAIN,EAAYG,CAAY,EACrD,GAAIG,EAAchB,EAChB,MAAO,CAAC,EAEV,IAAMiB,EAAQX,EAAQC,CAAG,EACnBW,EAAQZ,EAAQE,CAAG,EAEnBW,EAAUC,GACdN,EAAUN,EAAI,OAAS,EAAIO,EAAMK,CAAC,EAAG,CAAC,EAAIL,EAAMK,CAAC,EAAG,CAAC,EACjD5C,EAAoB,CAAC,EAC3BuC,EAAM,QAAQ,CAAC,CAAC,CAAEM,CAAC,EAAG,IAAM,CAC1B,GAAI,EAAI,EAAG,CACT,GAAM,CAACC,GAAIC,EAAE,EAAI,CAACJ,EAAO,EAAI,CAAC,EAAGA,EAAO,CAAC,CAAC,EAAE,KAAK,CAACK,GAAGC,KAAMD,GAAIC,EAAC,EAChExB,EAAWzB,EAAO,IAAK0C,EAAMK,EAAG,EAAKL,EAAMI,GAAM,CAAC,CAAE,EACpDrB,EAAWzB,EAAO,IAAKyC,EAAMI,CAAC,EAAKJ,EAAMF,EAAM,EAAI,CAAC,EAAG,CAAC,EAAI,CAAC,CAAE,CACjE,CACAd,EAAWzB,EAAO,IAAK4B,EAASG,EAAIc,CAAC,CAAE,CAAC,CAC1C,CAAC,EACD,GAAM,CAACC,EAAIC,CAAE,EAAI,CAACJ,EAAO,CAAC,EAAGA,EAAOJ,EAAM,OAAS,CAAC,CAAC,EAAE,KAAK,CAACS,EAAGC,IAAMD,EAAIC,CAAC,EAC3E,MAAO,CACL,CACE,WAAYP,EAAMI,CAAG,EACrB,SAAUJ,EAAMK,EAAM,CAAC,EACvB,YAAaN,EAAMF,EAAM,CAAC,EAAG,CAAC,CAAC,EAC/B,UAAWE,EAAMF,EAAM,GAAG,EAAE,EAAG,CAAC,EAAI,CAAC,EACrC,OAAQD,EAAU,IAAM,IACxB,MAAAtC,EACA,YAAAwC,CACF,CACF,CACF,CACF,CAGA,SAASU,GAAa1C,EAAwB,CAC5C,IAAM2C,EAAM,IAAI,IACVC,EAAQ,IAAI,IAClB5C,EAAS,IAAI,QAAQ,CAACC,EAAIP,IAAM,CAC1BiD,EAAI,IAAI1C,CAAE,EACZ2C,EAAM,IAAI3C,CAAE,EAEZ0C,EAAI,IAAI1C,EAAID,EAAS,IAAIN,CAAC,CAAE,CAEhC,CAAC,EACD,QAAWO,KAAM2C,EACfD,EAAI,OAAO1C,CAAE,EAEf,OAAO0C,CACT,CAIA,SAASE,EAAgB1C,EAA8B,CACrD,IAAM2C,EAAS,IAAI,IACbC,EAAY/C,GAA2B,CAC3C,IAAIgD,EAAQF,EAAO,IAAI9C,CAAQ,EAC/B,OAAIgD,IAAU,SACZA,EAAQN,GAAa1C,CAAQ,EAC7B8C,EAAO,IAAI9C,EAAUgD,CAAK,GAErBA,CACT,EACA,MAAO,CAACnC,EAAqBC,IAAyB,CACpD,IAAMmC,EAASF,EAASjC,CAAM,EAC1BW,EAAO,EACPyB,EAAW,EACf,OAAW,CAACjD,EAAI0C,CAAG,IAAKI,EAASlC,CAAK,EAAG,CACvC,IAAMsC,EAAQF,EAAO,IAAIhD,CAAE,EACvBkD,IAAUR,EACZlB,GAAQvB,EAAWC,EAAOF,CAAE,EACnBkD,IAAU,SACnBD,GAAYhD,EAAWC,EAAOF,CAAE,EAEpC,CACA,MAAO,CAAE,KAAAwB,EAAM,SAAAyB,CAAS,CAC1B,CACF,CAaO,SAASE,EAAgBjD,EAA8B,CAC5D,IAAMkD,EAAclC,EAAiBhB,CAAK,EACpCmD,EAAUjD,EAAYF,CAAK,EAC3BoD,EAASV,EAAgB1C,CAAK,EACpC,MAAO,CAACU,EAAqBC,IAAyB,CACpD,GAAM,CAAE,KAAAW,EAAM,SAAAyB,CAAS,EAAIK,EAAO1C,EAAOC,CAAM,EAC/C,OAAOW,GAAQT,GAAgBkC,GAAYlC,EACvCsC,EAAQzC,EAAOC,CAAM,EACrBuC,EAAYxC,EAAOC,CAAM,CAC/B,CACF,CAIA,IAAM0C,GAAgB,IAUf,SAASC,EAActD,EAA8B,CAC1D,IAAMkD,EAAclC,EAAiBhB,CAAK,EACpCmD,EAAUjD,EAAYF,CAAK,EAC3BoD,EAASV,EAAgB1C,CAAK,EACpC,MAAO,CAACU,EAAqBC,IAAyB,CACpD,IAAM4C,EAAUL,EAAYxC,EAAOC,CAAM,EACnC6C,EAAQD,EAAQ,CAAC,GAAG,OACpB,CAAE,KAAAjC,EAAM,SAAAyB,CAAS,EAAIK,EAAO1C,EAAOC,CAAM,EAC/C,OAAO6C,IAAU,QAAa,KAAK,IAAIlC,EAAMyB,CAAQ,EAAIM,GACrDE,EACA,CACE,GAAGA,EACH,GAAGJ,EAAQzC,EAAOC,CAAM,EAAE,OAAO8C,GAASA,EAAM,SAAWD,CAAK,CAClE,CACN,CACF,CAMO,SAASE,EAAa,CAC3B,MAAAD,EACA,OAAA9C,EACA,MAAAD,EACA,aAAAiD,EACA,QAAAC,EACA,iBAAAC,CACF,EAOG,CACD,IAAMxE,EAAQD,GAAoBqE,EAAM,KAAK,EAC7C,OAAOK,EAAa,CAClB,OAAQ,CACN,KAAMnD,EAAO,KACb,aAAAgD,EACA,QAAAC,EACA,MAAOjD,EAAO,SAAW8C,EAAM,YAC/B,IAAK9C,EAAO,SAAW8C,EAAM,SAC/B,EACA,MAAO,CACL,KAAM/C,EAAM,KACZ,aAAcmD,EACd,QAASE,EAAYrD,EAAM,IAAI,EAC/B,MAAOA,EAAM,SAAW+C,EAAM,WAC9B,IAAK/C,EAAM,SAAW+C,EAAM,QAC9B,EACA,OAAQA,EAAM,OACd,MAAOO,EAAU3E,CAAK,EACtB,QAASA,EAAM,OAAO,CAAC4E,EAAK,CAACzE,EAAI0E,CAAC,IAAMD,GAAOzE,IAAO,IAAM0E,EAAI,GAAI,CAAC,EACrE,QAAS7E,EAAM,OAAO,CAAC4E,EAAK,CAAC,CAAEC,CAAC,IAAMD,EAAMC,EAAG,CAAC,CAClD,CAAC,CACH,CCxQA,IAAMC,GAAeC,GACnBC,EAAeD,EAAS,IAAI,GAAKA,EAAS,KAEvBE,EAArB,cAAqDC,CAAsD,CAA3G,kCACE,KAAiB,MAAmB,IAAIC,EACtCC,EAAc,KAAM,CAAC,eAAe,EAAG,CAAC,YAAY,CAAC,EACrD,IACF,EACA,KAAiB,SAA0B,IAAIC,EAC7C,KAAK,MAAM,KACX,IACF,EAEA,IAAY,QAAS,CACnB,IAAMC,EAAS,KAAK,QAAQ,eAAe,EAAE,CAAC,EAC9C,GAAIA,IAAW,OACb,MAAM,IAAI,MACR,gHACF,EAEF,OAAOA,CACT,CAMA,MAAM,kBAAkBC,EAAoB,CAAC,EAAG,CAC9C,OAAO,KAAK,MAAM,eAAeA,CAAI,CACvC,CAOA,MAAM,UAAUA,EAAoB,CAAC,EAAG,CACtC,GAAM,CAAE,WAAAC,CAAW,EAAI,MAAM,KAAK,MAAM,OAAO,OAAOD,CAAI,EACpD,CAAE,OAAAD,CAAO,EAAI,KACbG,EAAeC,EAAmB,KAAMJ,CAAM,EAC9CK,EAAcC,EAAsB,IAAI,EAC9C,MAAO,CACL,cAAe,GACf,mBAAoBN,EACpB,MAAOE,EACJ,OACCK,GACEA,IAAWJ,GAAgBK,EAAYD,CAAM,IAAMJ,CACvD,EACC,IAAII,IAAW,CACd,KAAME,EAAiBJ,EAAaE,CAAM,EAC1C,MAAOA,EACP,MAAOC,EAAYD,CAAM,CAC3B,EAAE,CACN,CACF,CAIA,MAAM,YAAYN,EAAoB,CAAC,EAAG,CACxC,GAAM,CAAE,aAAAS,CAAa,EAAIT,EACzB,OAAOS,IAAiB,QAAaA,IAAiB,KAAK,OACvD,KAAK,SAAS,iBAAiB,CAAE,GAAGT,EAAM,aAAc,KAAK,MAAO,CAAC,EACrE,CAAC,CACP,CAOA,MAAM,YAAYU,EAAgBV,EAA+B,CAAC,EAAG,CACnE,IAAMW,EAAU,MAAM,KAAK,SAAS,cAAcD,EAAQ,CACxD,OAAQV,EAAK,MACf,CAAC,EACD,OAAO,KAAK,MAAM,SAASW,EAASD,EAAQV,CAAI,CAClD,CAOA,MAAc,UACZW,EACAD,EACAE,EACAZ,EACAa,EACA,CACA,IAAMC,EAAOC,EAAUH,EAAUD,CAAO,EACxC,OAAOK,EAAaH,EAAQb,EAAK,eAAgB,IAC/C,KAAK,MAAM,OACR,IAAIW,EAASD,EAAQ,CACpB,GAAG,KAAK,MAAM,QAAQ,EACtB,OAAQV,EAAK,OACb,KAAAc,EACA,OAAQA,EACR,MAAO,EACT,CAAC,EACA,MAAOG,GAAmB,CACzB,MAAMC,EAAeD,EAAOP,EAAO,IAAMA,EAAO,KAAK,CACvD,CAAC,CACL,CACF,CAMA,MAAc,eACZC,EACAD,EACAV,EACA,CACA,IAAMmB,EAASnB,EAAK,YAAY,OAC5BA,EAAK,WAAW,IAAIoB,GAAQjB,EAAmB,KAAMiB,CAAI,CAAC,EAC1D,OACEC,EAASlB,EAAmB,KAAMH,EAAK,kBAAkB,EACzDY,EACJS,IAAW,OACPF,EACAA,IAAW,QACTA,EAAO,KACLb,GACEgB,EAAmBD,EAAQf,CAAM,GACjCgB,EAAmBhB,EAAQe,CAAM,CACrC,EACA,CAACA,CAAM,EACP,CAAC,EACT,GAAIT,GAAU,SAAW,EACvB,MAAO,CAAC,EAEV,GAAM,CAAE,MAAAW,EAAO,IAAAC,CAAI,EAAId,EACjB,CAAE,MAAAe,EAAO,UAAAC,CAAU,EAAI,MAAM,KAAK,UACtCf,EACAD,EACAE,EACAZ,EACA,iBAAiBU,EAAO,OAAO,IAAIa,EAAM,eAAe,CAAC,IAAIC,EAAI,eAAe,CAAC,EACnF,EACMG,EAAQC,EAAcH,EAAM,KAAK,EACjCrB,EAAcC,EAAsB,IAAI,EACxCwB,EAAaH,EAAU,OAAOI,GAAKA,EAAE,OAASnB,CAAO,EAGrDoB,EAAQvC,GACZoB,IAAa,OACT,EACAA,EAAS,UAAUN,GACjBgB,EAAmB9B,EAAS,KAAMc,CAAM,CAC1C,EAIN,OAHcoB,EACX,OAAOlC,GAAYA,EAAS,OAASmB,GAAWoB,EAAKvC,CAAQ,GAAK,CAAC,EACnE,KAAK,CAACwC,EAAG,IAAMD,EAAKC,CAAC,EAAID,EAAK,CAAC,CAAC,EACtB,QAAQE,GACnBJ,EAAW,QAAQK,GACjBP,EAAMM,EAAOC,CAAS,EAAE,IAAIC,GAC1BC,EAAa,CACX,MAAAD,EACA,OAAQD,EACR,MAAAD,EACA,aAAcvB,EAAO,aACrB,QAASA,EAAO,QAChB,iBAAkBF,EAAiBJ,EAAab,GAAY0C,CAAK,CAAC,CACpE,CAAC,CACH,CACF,CACF,CACF,CAQA,MAAc,aACZtB,EACAD,EACA2B,EACArC,EACA,CACA,IAAMsC,EAAQD,EAAM,IAAIE,IAAS,CAC/B,KAAAA,EACA,cAAepC,EAAmB,KAAMoC,EAAK,iBAAiB,EAC9D,WAAYpC,EAAmB,KAAMoC,EAAK,kBAAkB,CAC9D,EAAE,EACI,CAAE,MAAAd,EAAO,UAAAC,CAAU,EAAI,MAAM,KAAK,UACtCf,EACAD,EACA4B,EAAM,QAAQE,GAAQ,CAACA,EAAK,cAAeA,EAAK,UAAU,CAAC,EAC3DxC,EACAyC,EAAgBJ,CAAK,CACvB,EACMV,EAAQe,EAAgBjB,EAAM,KAAK,EACnCkB,EAAWrC,GACfoB,EAAU,OAAOI,GAAKR,EAAmBQ,EAAE,KAAMxB,CAAM,CAAC,EAC1D,OAAOgC,EAAM,QAAQ,CAAC,CAAE,KAAAC,EAAM,cAAAK,EAAe,WAAAC,CAAW,IACtDF,EAAQC,CAAa,EAAE,QAAQvB,GAC7BsB,EAAQE,CAAU,EAAE,QAAQZ,GAC1BN,EAAMM,EAAOZ,CAAM,EAAE,IAAIc,GACvBC,EAAa,CACX,MAAAD,EACA,OAAAd,EACA,MAAAY,EACA,aAAcM,EAAK,kBACnB,QAASO,EAAYzB,EAAO,IAAI,EAChC,iBAAkBkB,EAAK,kBACzB,CAAC,CACH,CACF,CACF,CACF,CACF,CAIA,YAAY7B,EAAgBV,EAA2B,CAAC,EAAG,CACzD,OAAO+C,EAA0B,MAAMC,GAAY,CACjD,IAAMrC,EACJD,EAAO,eAAiB,KAAK,OACzB,MAAM,KAAK,SAAS,QAAQA,EAAQV,CAAI,EACxC,OACN,GAAIW,IAAY,OAAW,CACzB,IAAM0B,EAAQY,EAAejD,CAAI,EAC3BkD,EACJb,EAAM,OAAS,EACX,MAAM,KAAK,aAAa1B,EAASD,EAAQ2B,EAAOrC,CAAI,EACpD,MAAM,KAAK,eAAeW,EAASD,EAAQV,CAAI,EACrD,QAAWmD,KAAWD,EACpBF,EAAS,KAAKG,CAAO,CAEzB,CACAH,EAAS,SAAS,CACpB,EAAGhD,EAAK,MAAM,CAChB,CACF",
6
6
  "names": ["BALANCED_BUBBLE_MAX_BP", "bubblesAsMismatches", "edits", "out", "i", "op", "len", "nextOp", "nextLen", "handlesOf", "fragment", "id", "nodeLength", "nodes", "node", "walkAligner", "standIn", "sequenceOf", "length", "sequence", "handles", "cachedHandles", "steps", "query", "target", "pairAlignments", "MIN_MATCH_BP", "appendEdit", "last", "referenceAligner", "lengthOf", "handle", "offsets", "ref", "hap", "same", "sameWeight", "weightedLcs", "turned", "turnedWeight", "reverse", "pairs", "sharedBases", "refAt", "hapAt", "stepOf", "k", "r", "lo", "hi", "x", "y", "singleVisits", "rev", "twice", "directionShares", "visits", "visitsOf", "found", "theirs", "opposite", "other", "lanePairAligner", "subsequence", "chained", "shares", "TURNED_MIN_BP", "anchorAligner", "records", "taken", "chain", "chainFeature", "assemblyName", "refName", "mateAssemblyName", "matchFeature", "panSNContig", "pairCigar", "sum", "n", "haplotypeOf", "fragment", "panSNHaplotype", "WalkTabixSyntenyAdapter", "ComparativeAdapterBase", "WalkIndex", "openTabixSlot", "PanSNRefNames", "anchor", "opts", "haplotypes", "anchorPrefix", "resolvePanSNPrefix", "asmByPrefix", "assemblyByPanSNPrefix", "prefix", "panSNSample", "laneAssemblyName", "assemblyName", "region", "refName", "prefixes", "status", "keep", "walksKept", "updateStatus", "error", "laneZoomNotice", "wanted", "lane", "target", "panSNMatchesPrefix", "start", "end", "graph", "fragments", "align", "anchorAligner", "references", "f", "rank", "a", "query", "reference", "chain", "chainFeature", "pairs", "sides", "pair", "side", "lanePairsStatus", "lanePairAligner", "walksOf", "featurePrefix", "matePrefix", "panSNContig", "ObservableCreate", "observer", "requestedPairs", "features", "feature"]
7
7
  }
@@ -1,2 +1,2 @@
1
- import{b as d,g as l}from"./chunk-LE7FZM6Y.js";import{a as m,b as u,c as p,d as f}from"./chunk-6SWXMRAV.js";var v=new Map([["hg38","GRCh38"],["hg19","GRCh37"],["hs1","CHM13"],["t2t-chm13","CHM13"],["chm13v2","CHM13"]]);function M(n){return v.get(n.toLowerCase())}function h(n){let t=n.includes("#")?m(n):void 0;return t===void 0||u(t)?void 0:t}function N(n){return p(n)??m(n)}function b(n){let t=new Set((n.anchorPaths??[]).map(e=>e.name));for(let e of n.nodes)e.stable&&t.add(e.stable.refName);let s=new Map;for(let e of t){let o=h(e);o!==void 0&&d(s,o,N(e))}return s}function g(n,t){let s=new Set(n.map(i=>h(i.refName))),[e]=s;if(s.size!==1||e===void 0)return{contigs:n,prefixes:[],named:!1};let o=new Set(n.map(i=>N(i.refName))),c=[...t.get(e)??[]].every(i=>o.has(i)),a=new Set(n.map(i=>p(i.refName))),[r]=a;return{contigs:n,prefixes:[...c?[e]:[],...a.size===1&&r?[r]:[]],named:!0}}function S(n){let t=new Map;for(let e of n.nodes)if(l(e)){let{refName:o,start:c}=e.stable,a=c+e.length,r=t.get(o);r?(r.start=Math.min(r.start,c),r.end=Math.max(r.end,a)):t.set(o,{refName:o,contig:f(o),start:c,end:a})}let s=[...t.values()];return s.length?g(s,b(n)):void 0}function B(n,t){let s=S(n),e=t?f(t.refName):s?.contigs.length===1?s.contigs[0].contig:void 0,o=s?.named?m(s.contigs[0].refName):void 0;return e&&(o?`${o} ${e}`:e)}function w(n,t){let s=a=>[a.name,...a.aliases??[]],e=a=>r=>s(r).some(i=>i.toLowerCase()===a.toLowerCase()),o=[...n?.prefixes??[]].reverse(),c=n?.prefixes.find(a=>!a.includes("#"))?.toLowerCase();for(let a of o){let r=t.find(e(a));if(r)return r}return c===void 0?void 0:t.find(a=>s(a).some(r=>M(r)?.toLowerCase()===c))}function O(n,t){let s=b(n);return n.anchorPaths?.find(e=>w(g([{refName:e.name,contig:f(e.name),start:e.start,end:e.start+e.length}],s),[t]))}function y(n){let t=n.replace(/^chr/i,""),s=t?/^(M|MT)$/i.test(t)?["M","MT"]:[t]:[];return[...new Set([n,...s.flatMap(e=>[e,`chr${e}`])])]}function C(n,t={}){let s=new Set(n),e=new Map;for(let o of s){let c=f(o),a=t[c];for(let r of new Set([...y(c),...a?[a]:[]]))e.set(r,e.has(r)?void 0:o)}return o=>s.has(o)?o:e.get(o)}function $(n,t,s){let e=C(t.contigs.map(o=>o.refName),s);return n.flatMap(o=>{let c=e(o.refName);return c===void 0?[]:[c===o.refName?o:{...o,refName:c}]})}export{M as a,S as b,B as c,w as d,O as e,$ as f};
2
- //# sourceMappingURL=chunk-6WUWQX2P.js.map
1
+ import{b as d,g as l}from"./chunk-SPL3UO2D.js";import{a as m,b as u,c as p,d as f}from"./chunk-FCMXEFJA.js";var v=new Map([["hg38","GRCh38"],["hg19","GRCh37"],["hs1","CHM13"],["t2t-chm13","CHM13"],["chm13v2","CHM13"]]);function M(n){return v.get(n.toLowerCase())}function h(n){let t=n.includes("#")?m(n):void 0;return t===void 0||u(t)?void 0:t}function N(n){return p(n)??m(n)}function b(n){let t=new Set((n.anchorPaths??[]).map(e=>e.name));for(let e of n.nodes)e.stable&&t.add(e.stable.refName);let s=new Map;for(let e of t){let o=h(e);o!==void 0&&d(s,o,N(e))}return s}function g(n,t){let s=new Set(n.map(i=>h(i.refName))),[e]=s;if(s.size!==1||e===void 0)return{contigs:n,prefixes:[],named:!1};let o=new Set(n.map(i=>N(i.refName))),c=[...t.get(e)??[]].every(i=>o.has(i)),a=new Set(n.map(i=>p(i.refName))),[r]=a;return{contigs:n,prefixes:[...c?[e]:[],...a.size===1&&r?[r]:[]],named:!0}}function S(n){let t=new Map;for(let e of n.nodes)if(l(e)){let{refName:o,start:c}=e.stable,a=c+e.length,r=t.get(o);r?(r.start=Math.min(r.start,c),r.end=Math.max(r.end,a)):t.set(o,{refName:o,contig:f(o),start:c,end:a})}let s=[...t.values()];return s.length?g(s,b(n)):void 0}function B(n,t){let s=S(n),e=t?f(t.refName):s?.contigs.length===1?s.contigs[0].contig:void 0,o=s?.named?m(s.contigs[0].refName):void 0;return e&&(o?`${o} ${e}`:e)}function w(n,t){let s=a=>[a.name,...a.aliases??[]],e=a=>r=>s(r).some(i=>i.toLowerCase()===a.toLowerCase()),o=[...n?.prefixes??[]].reverse(),c=n?.prefixes.find(a=>!a.includes("#"))?.toLowerCase();for(let a of o){let r=t.find(e(a));if(r)return r}return c===void 0?void 0:t.find(a=>s(a).some(r=>M(r)?.toLowerCase()===c))}function O(n,t){let s=b(n);return n.anchorPaths?.find(e=>w(g([{refName:e.name,contig:f(e.name),start:e.start,end:e.start+e.length}],s),[t]))}function y(n){let t=n.replace(/^chr/i,""),s=t?/^(M|MT)$/i.test(t)?["M","MT"]:[t]:[];return[...new Set([n,...s.flatMap(e=>[e,`chr${e}`])])]}function C(n,t={}){let s=new Set(n),e=new Map;for(let o of s){let c=f(o),a=t[c];for(let r of new Set([...y(c),...a?[a]:[]]))e.set(r,e.has(r)?void 0:o)}return o=>s.has(o)?o:e.get(o)}function $(n,t,s){let e=C(t.contigs.map(o=>o.refName),s);return n.flatMap(o=>{let c=e(o.refName);return c===void 0?[]:[c===o.refName?o:{...o,refName:c}]})}export{M as a,S as b,B as c,w as d,O as e,$ as f};
2
+ //# sourceMappingURL=chunk-22ANI2KL.js.map
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "version": 3,
3
- "sources": ["../../node_modules/.pnpm/@jbrowse+bandage-core@11.9.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-5ORP7EFJ.js"],
3
+ "sources": ["../../node_modules/.pnpm/@jbrowse+bandage-core@11.11.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-5ORP7EFJ.js"],
4
4
  "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"],
5
5
  "mappings": "4GAcA,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,EAAevB,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,EAAapC,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,EAAmBC,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",
6
6
  "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"]
@@ -0,0 +1,2 @@
1
+ import{a as O,b as pt}from"./chunk-OZEKEYT3.js";import{a as Qe,b as et,c as ee,d as tt,e as nt,f as te,h as ot,i as rt,j as at,k as it,m as ne,n as st,o as ut,p as dt,r as ft,t as ht,u as mt}from"./chunk-KOC23YNN.js";import{N as qe,O as Ue,R as pe,T as Je,U as lt,V as ct,a as S,c as Ge,f as U,g as Te,h as He,q as Ae,r as We,t as Ye,u as Ze,v as $e,w as je}from"./chunk-DAPI7M4M.js";import{n as N}from"./chunk-Z3IKZAYC.js";import{Ca as Fe,Fb as _,J as se,Ja as Ve,Jb as le,Lb as ce,N as J,Nb as Q,R as Oe,T as De,a as X,b as ve,ca as Xe,dc as Ke,q as ze,r as _e,va as Be}from"./chunk-BCOXRUNQ.js";import{n as Ne}from"./chunk-VTMJQFN5.js";import{e as T}from"./chunk-NDRLCGPC.js";import{j}from"./chunk-TENPGIPX.js";import{d as H,e as Ee,f as Ie,g as k,h as C}from"./chunk-YU7T5WOQ.js";import{D as Le,G as q,H as B,b as be,c as we,e as ie,k as xe,o as Se,p as Pe,s as Me,v as K,w as ke,y as Re,z as Ce}from"./chunk-UGCNPRKC.js";import{a as I,b as n,c as f,d as h}from"./chunk-JMBDTNUR.js";var W=JBrowseExports["@jbrowse/render-core/useRenderingBackend"],ln=t=>W!=null&&t in Object(W)?W[t]:Object.assign(function(){throw new Error("This JBrowse does not provide '"+t+"' from '@jbrowse/render-core/useRenderingBackend' to plugins: GraphGenomeView was built for a different JBrowse version, so update the plugin or JBrowse")},{jbrowseHostMissing:t});var gt=ln("useRenderingBackend"),co=W&&W.__esModule?W.default:W;var ue=et(1);function de({model:t}){let[e,o]=C(null);return H(()=>{if(!e)return;let i=new _(e),a=X(()=>{Xe(Ke()),i.resize(t.paneWidth,t.canvasHeight),t.paintHover(i,t.drawnBatch)});return()=>{a(),i.dispose()}},[e,t]),n("canvas",{ref:o,"data-testid":"graph-hover-layer",style:ue})}var yt={background:"rgba(255,255,255,0.82)",padding:"3px 6px",fontSize:11,lineHeight:"15px",whiteSpace:"nowrap"},oe={display:"flex",alignItems:"center",gap:5},vt={color:"#666"};function re({row:t,at:e,hint:o,after:i}){return t.swatch?f("div",{title:[t.title,o].filter(Boolean).join(" \xB7 ")||void 0,children:[f("div",{style:oe,children:[n(ne,{swatch:t.swatch}),f("span",{children:[t.strong?n("strong",{children:t.strong}):null,t.label]}),i]}),e?n("div",{"data-testid":"graph-walk-at",children:e}):t.under?n("div",{children:t.under}):null]}):n("div",{style:vt,children:t.label})}var cn={pointerEvents:"auto",cursor:"pointer",border:"none",background:"none",padding:"0 2px",font:"inherit",textDecoration:"underline"},bt=h(function({model:e}){return n(I,{children:it(e).map(({testid:o,rows:i})=>n("div",{style:yt,"data-testid":o,children:i.map(a=>n(re,{row:a,at:a.walk?e.hoveredOn(a.walk):void 0,after:a.closesBubble?n("button",{type:"button",style:cn,"data-testid":"graph-close-bubble",onClick:()=>{e.closeBubbles()},children:"close"}):null},a.key))},o))})});var pn={position:"absolute",left:0,top:0,zIndex:4,display:"grid",gap:ze,lineHeight:"normal"},un={height:_e,padding:"2px 6px",boxSizing:"border-box",fontFamily:"inherit",fontSize:11,color:"inherit",cursor:"pointer",border:"none",background:"none",textAlign:"left",display:"block"},dn={position:"relative"},fn={gridColumn:"1 / -1",height:Ue,padding:"2px 6px",boxSizing:"border-box",display:"flex",gap:14,fontSize:11,lineHeight:"15px"},hn=h(function({model:e,lift:o,width:i,height:a,cell:p,handlers:c,canvasStyle:l}){let[s,d]=C(null),[g,x]=C(null),w=o.walks[0];H(()=>{if(!s||!g)return;let G=new _(s),A=new _(g),z=ve(()=>e.buildDrawing(o,!1)),Y,Z=[X(()=>{let R=e.facetGrid;R&&G.resize(R.width,R.height);let L=z.get();L&&(L!==Y&&(G.uploadGeometry(L.batch),Y=L),e.applySelection(G),e.paint(G))}),X(()=>{let R=e.facetGrid;R&&A.resize(R.width,R.height);let L=z.get();L&&e.paintHover(A,L.batch)})];return()=>{for(let R of Z)R();G.dispose(),A.dispose()}},[s,g,e,o]);let D=e.walkLabel(w.name);return f("div",{style:p,children:[n("button",{type:"button",style:un,"data-testid":"graph-facet-title",onClick:()=>{e.liftWalks([w.name]),e.setFacet("")},children:n(re,{row:rt(e,w),hint:`click to lift ${D} alone`,at:e.hoveredOn(w)})}),f("div",{style:dn,children:[n("canvas",{ref:d,"data-testid":"graph-facet-canvas",style:{...l,width:i,height:a,display:"block"},...c}),n("canvas",{ref:x,style:ue})]})]})}),mn=h(function({model:e,handlers:o,canvasStyle:i}){let a=e.facetPanels,p=e.facetGrid,c=e.facetPlacement;if(!a||!p||!c)return null;let{columns:l,width:s,height:d}=p;return f("div",{"data-testid":"graph-facet-panels",style:{...pn,width:e.paneWidth,minHeight:e.canvasHeight,gridTemplateColumns:`repeat(${l}, ${s}px)`,background:J},children:[a.map((g,x)=>n(hn,{model:e,lift:g,width:s,height:d,cell:{gridRow:Math.floor(c.cells[x]/l)+1,gridColumn:c.cells[x]%l+1},handlers:o,canvasStyle:i},g.walks[0].name)),n("div",{style:{...fn,gridRow:Math.floor(c.cells.reduce((g,x)=>Math.max(g,x),-1/0)/l)+2},"data-testid":"graph-facet-key",children:at(e).map(g=>n(re,{row:g},g.key))})]})}),wt=mn;var xt=S(n("path",{d:"M3 5v4h2V5h4V3H5c-1.1 0-2 .9-2 2m2 10H3v4c0 1.1.9 2 2 2h4v-2H5zm14 4h-4v2h4c1.1 0 2-.9 2-2v-4h-2zm0-16h-4v2h4v4h2V5c0-1.1-.9-2-2-2"}),"CropFree");var St=S([n("path",{d:"M15.5 14h-.79l-.28-.27C15.41 12.59 16 11.11 16 9.5 16 5.91 13.09 3 9.5 3S3 5.91 3 9.5 5.91 16 9.5 16c1.61 0 3.09-.59 4.23-1.57l.27.28v.79l5 4.99L20.49 19zm-6 0C7.01 14 5 11.99 5 9.5S7.01 5 9.5 5 14 7.01 14 9.5 11.99 14 9.5 14"},"0"),n("path",{d:"M12 10h-2v2H9v-2H7V9h2V7h1v2h2z"},"1")],"ZoomIn");var Pt=S(n("path",{d:"M15.5 14h-.79l-.28-.27C15.41 12.59 16 11.11 16 9.5 16 5.91 13.09 3 9.5 3S3 5.91 3 9.5 5.91 16 9.5 16c1.61 0 3.09-.59 4.23-1.57l.27.28v.79l5 4.99L20.49 19zm-6 0C7.01 14 5 11.99 5 9.5S7.01 5 9.5 5 14 7.01 14 9.5 11.99 14 9.5 14M7 9h5v1H7z"}),"ZoomOut");var gn=h(function({model:e}){let o=e.colorSchemeLock;return n(O,{label:"Color",size:"small",sx:{minWidth:100},disabled:o!==void 0,title:o?.why,shown:o?.value,value:e.chosenColorScheme,options:Ae.map(({value:i})=>({value:i,label:e.colorSchemeLabel(i)})),testId:"graph-color-select",onChange:i=>{e.setColorScheme(i)}})}),Mt=gn;var kt=N()({stats:{marginLeft:"auto"},perf:{color:"#888",fontVariantNumeric:"tabular-nums"}});function fe(t){return t===void 0?"\u2013":`${Math.round(t)}ms`}var yn=h(function({model:e}){let{classes:o}=kt(),{lastFetchMs:i,lastLayoutMs:a,lastGeometryMs:p}=e,c=i!==void 0||a!==void 0||p!==void 0;return e.showPerf&&c?f(B,{variant:"caption",className:o.perf,"data-testid":"graph-perf-stats",children:["fetch ",fe(i)," \xB7 layout ",fe(a)," \xB7 geom"," ",fe(p)]}):null}),vn=h(function({model:e}){let{classes:o}=kt();return f("div",{className:o.stats,"data-testid":"graph-stats","data-node-count":e.nodeCount,"data-edge-count":e.edgeCount,"data-path-count":e.pathCount,"data-fetch-ms":e.lastFetchMs??"","data-layout-ms":e.lastLayoutMs??"","data-geometry-ms":e.lastGeometryMs??"","data-geometry-strokes":e.lastGeometryStrokeCount??"",children:[f(B,{variant:"body2",component:"span",children:[e.nodeCount," nodes, ",e.edgeCount," edges",e.pathCount>0?`, ${e.pathCount} paths`:""]})," ",n(yn,{model:e})]})}),Rt=vn;var bn=h(function({model:e}){let{graph:o}=e;return n(O,{label:"Layout",size:"small",sx:{minWidth:140},testId:"graph-layout-select",value:e.chosenLayoutMode,options:Ge.map(({value:i,label:a,description:p,available:c})=>({value:i,label:a,description:p,disabled:o?!c(o):!1})),onChange:i=>{e.switchLayout(i)}})}),Ct=bn;var wn=h(function({model:e}){return e.chosenLayoutMode!=="walkrows"||e.repeatChoices.length===0?null:n(O,{label:"Repeat",size:"small",sx:{minWidth:130,maxWidth:260},testId:"graph-repeat-select",value:e.selectedRepeat?.key??"",options:e.repeatOptions,onChange:o=>{e.setRepeatKey(o)}})}),Lt=wn;var Et=S(n("path",{d:"M19 6.41 17.59 5 12 10.59 6.41 5 5 6.41 10.59 12 5 17.59 6.41 19 12 13.41 17.59 19 19 17.59 13.41 12z"}),"Close");var It=S(n("path",{d:"M12 8c1.1 0 2-.9 2-2s-.9-2-2-2-2 .9-2 2 .9 2 2 2m0 2c-1.1 0-2 .9-2 2s.9 2 2 2 2-.9 2-2-.9-2-2-2m0 6c-1.1 0-2 .9-2 2s.9 2 2 2 2-.9 2-2-.9-2-2-2"}),"MoreVert");var xn=h(function({model:e}){let o=e.highlightMenuItems({picks:!1});return n(be,{size:"small",tooltip:"Graph options",menuItems:[...o.length>0?[{label:"Haplotypes",icon:lt,subMenu:o}]:[],...e.layoutOptionMenuItems({repeat:!1}),{label:"Show...",icon:We,subMenu:[...e.showMenuItems(),...e.modeDrawsNodes&&e.walkChoices.length>1?[{type:"checkbox",label:"Show walk rows under the graph",checked:e.walkStrip,onClick:()=>{e.setWalkStrip(!e.walkStrip)}}]:[],{type:"checkbox",label:"Show timings",checked:e.showPerf,onClick:()=>{e.setShowPerf(!e.showPerf)}}]},{type:"divider"},{label:"Graph settings...",icon:ct,helpText:"Subgraph node limit; node width and path colors; the force-directed layout engine",onClick:()=>{j(e).queueDialog(i=>[pt,{model:e,onClose:i}])}},{type:"divider"},{label:"Close graph",icon:Et,onClick:()=>{e.clearGraph()}}],children:n(It,{})})}),Gt=xn;var Sn=N()({formControl:{minWidth:130,maxWidth:260}}),Pn=h(function({model:e}){let{classes:o}=Sn(),i=Ee(),{walkChoices:a}=e;if(a.length===0||!e.liftsWalks)return null;let p=new Set(a.map(s=>s.name)),c=new Map(a.map(s=>[s.name,s.label])),l=e.walkLayers.map(s=>s.walk).filter(s=>p.has(s));return a.length>De?n(Se,{size:"small",variant:"outlined",color:"inherit","data-testid":"graph-walk-choose",onClick:()=>{j(e).queueDialog(s=>[Oe,{model:e,onClose:s}])},children:l.length>0?`${l.length} of ${a.length} haplotypes`:"Highlight haplotypes..."}):f(Me,{size:"small",className:o.formControl,children:[n(ke,{id:i,children:"Highlight"}),n(Le,{labelId:i,multiple:!0,value:l,label:"Highlight","data-testid":"graph-walk-select",renderValue:s=>s.map(d=>c.get(d)).join(", "),onChange:s=>{let{value:d}=s.target;e.liftAmongChoices(typeof d=="string"?d.split(","):d)},children:a.map(({name:s,label:d})=>f(Ce,{value:s,dense:!0,children:[n(Pe,{size:"small",checked:l.includes(s)}),n(Re,{primary:d})]},s))})]})}),Tt=Pn;var Mn=N()({toolbar:{display:"flex",flexWrap:"wrap",alignItems:"center",gap:4,padding:"2px 4px",borderBottom:"1px solid #ddd"}}),kn=h(function({model:e}){return n(B,{variant:"body2",children:e.zoomPercent})}),Rn=h(function({model:e}){let{classes:o}=Mn(),i=a=>{e.zoom(a,e.viewBox.width/2,e.viewBox.height/2)};return f("div",{className:o.toolbar,children:[n(Ct,{model:e}),n(Mt,{model:e}),n(Tt,{model:e}),n(Lt,{model:e}),n(q,{title:"Zoom in",children:n(K,{size:"small",onClick:()=>{i(1.5)},children:n(St,{})})}),n(q,{title:"Zoom out",children:n(K,{size:"small",onClick:()=>{i(1/1.5)},children:n(Pt,{})})}),n(q,{title:"Zoom to fit",children:n(K,{size:"small",onClick:()=>{e.refitView()},children:n(xt,{})})}),n(kn,{model:e}),n(Rt,{model:e}),n(Gt,{model:e})]})}),Ht=Rn;var Cn={position:"absolute",bottom:qe,lineHeight:"normal",background:"rgba(0,0,0,0.75)",color:"white",padding:"4px 8px",borderRadius:4,fontSize:12,pointerEvents:"none",zIndex:6};function he({label:t,readout:e}){return f(I,{children:[n("strong",{children:t})," \u2014 ",e]})}function Ln(t,e){if(e)return{testId:"graph-chip-tooltip",body:he(e)};let o=t.hoveredNode?t.hoverNodeById?.get(t.hoveredNode):void 0;if(o){let c=t.hoverDrawing?.members.get(o.id),l=He(o);return{body:f(I,{children:[n("strong",{children:o.name}),c?` and ${c.length-1} more`:""," \u2014"," ",o.length.toLocaleString()," bp, depth ",o.depth.toFixed(1),l?f(I,{children:[n("br",{}),l.sample," ",U(l)," (rank ",o.stable?.rank,")"]}):null]})}}let i=t.hoveredEdge===null?void 0:t.graph?.edges[t.hoveredEdge];if(i){let c=Te(i,t.deletions.find(l=>l.edgeIndex===t.hoveredEdge),l=>t.nodeById?.get(l)?.name??l);return{body:c.deletion?f(I,{children:[n("strong",{children:"Deletion"})," ",c.deletion.bp,n("br",{}),c.deletion.where]}):f(I,{children:["Edge: ",c.ends]})}}let a=t.hoveredWalkRowText;if(a)return{testId:"graph-walk-row-tooltip",body:he(a)};let p=t.hoveredTubeText;return p?{testId:"graph-tube-tooltip",body:he(p)}:void 0}var En=h(function({model:e,chip:o}){let i=Ln(e,o);return i?n("div",{style:{...Cn,right:e.tooltipRightPx},"data-testid":i.testId,children:i.body}):null}),At=En;var zt=S(n("path",{d:"M10 18h4v-2h-4zM3 6v2h18V6zm3 7h12v-2H6z"}),"FilterList");var _t=S(n("path",{d:"M10.83 8H21V6H8.83zm5 5H18v-2h-4.17zM14 16.83V18h-4v-2h3.17l-3-3H6v-2h2.17l-3-3H3V6h.17L1.39 4.22 2.8 2.81l18.38 18.38-1.41 1.41z"}),"FilterListOff");var Wt=S(n("path",{d:"M12 2C6.48 2 2 6.48 2 12s4.48 10 10 10 10-4.48 10-10S17.52 2 12 2m1 15h-2v-6h2zm0-8h-2V7h2z"}),"Info");var In={x:0,y:0};function Gn(t,e){let{own:o,reference:i,highlight:a}=t.nodeLaunchTargets(e);return[{label:"Node details",icon:Wt,onClick:()=>{t.showNodeDetails(e)}},...Je({own:o,reference:i,highlight:a,onShowLinear:p=>{t.showInLinearView(p)},onHighlight:t.canHighlightInLinearView?p=>{t.highlightInLinearView(p)}:void 0})]}function Tn(t){return t>=1e3?`${Math.round(t/1e3)} k`:`${t}`}function Hn(t,e,o){let i=o??t.walkRowBars,a=t.walkRowLaunchTarget(e,i),p=a?.assembly,c=e>0?i?.rows[e-1]:void 0,l=c?.sample,s=!o&&t.walkRowBars,d=t.walkRowSamples;return[a&&p?{label:`Linear genome view \u2014 ${p} ${U(a.location)}`,icon:pe,onClick:()=>{t.showInLinearView({location:a.location,assembly:p})}}:{label:"Linear genome view",icon:pe,disabled:!0,disabledHelpText:a?`No assembly in this session is ${a.location.haplotype??a.label}`:"This walk states no contig coordinates",onClick:()=>{}},...c?.abridgedSteps?[{label:`Load the ${Tn(c.abridgedSteps)} abridged steps`,onClick:()=>{t.expandWalk(c.name)}}]:[],...c&&t.liftsWalks&&t.modeDrawsNodes?[{type:"checkbox",label:`Highlight ${c.label}`,checked:t.walkLayers.some(g=>g.walk===c.name),onClick:()=>{t.toggleWalk(c.name)}}]:[],...s&&l&&!(d?.length===1&&d[0]===l)?[{label:`Show only ${l}`,icon:zt,onClick:()=>{t.setWalkRowSamples([l])}}]:[],...s&&d?[{label:"Show every sample",icon:_t,onClick:()=>{t.setWalkRowSamples(void 0)}}]:[]]}function F({model:t,at:e,onClose:o}){return n(we,{anchor:e,offset:In,onClose:o,menuItems:()=>e===void 0?[]:"nodeId"in e?Gn(t,e.nodeId):Hn(t,e.row,e.bars)})}var An={display:"flex",flexWrap:"wrap",gap:"2px 14px",padding:"2px 8px 6px",fontSize:11,color:"#333"},zn={position:"absolute",pointerEvents:"none",background:"rgba(255,255,255,0.92)",border:"1px solid #ccc",borderRadius:3,padding:"1px 6px",fontSize:11,whiteSpace:"nowrap",zIndex:4},_n=h(function({bars:e,frame:o,ramp:i,rowGenes:a}){let p=nt(),c=Ie(()=>Ve(e,o,{ramp:i,rowGenes:a,idPrefix:p}),[e,o,i,a,p]);return n(te,{el:c})}),Wn=h(function({model:e}){let o=e.walkStripRows,i=e.walkStripFrame,a=e.stripHover,p=o?[o.reference,...o.rows]:[],c=a?p.findIndex(g=>g.name===a.row):-1,l=p[c];if(!o||!i||i.labelled||!a||!l)return null;let s=(o.origin+a.offset)*i.scaleX+i.translateX,d=s>i.width/2?{right:i.width-s+12}:{left:s+12};return f("div",{"data-testid":"graph-walk-strip-tip",style:{...zn,...d,top:c*i.rowPx+i.translateY-18},children:[l.label," \xB7"," ",Be(l,c===0?void 0:o.reference)]})}),Nn=h(function({model:e,bars:o,frame:i}){return n(te,{el:Ze(o,i,e.walkStripMarks)})}),On=h(function({model:e}){let o=e.walkStripRows,i=e.walkStripFrame,[a,p]=C();if(!o||!i)return null;let c=s=>{let d=s.currentTarget.getBoundingClientRect();return Ye(o,i,s.clientX-d.left,s.clientY-d.top)},l=Fe(o,{ramp:e.referenceRampDomain,rampCss:Ne,genes:je(i,e.walkRowGenes,e.walkRowGeneGaps)});return f("div",{"data-testid":"graph-walk-strip",style:{position:"relative",borderTop:"1px solid #ddd"},onMouseEnter:()=>{e.setPointerInPane(!0)},onMouseLeave:()=>{T(e)&&(e.setPointerInPane(!1),e.setStripHover(null))},children:[f("svg",{width:i.width,height:i.height,style:{display:"block"},onMouseMove:s=>{let d=c(s);s.currentTarget.style.cursor=d&&d.index>0?"pointer":"",e.setStripHover(d?{row:d.row.name,offset:d.offset}:null)},onClick:s=>{let d=c(s);d&&d.index>0&&e.toggleWalk(d.row.name)},onContextMenu:s=>{let d=c(s);d&&(s.preventDefault(),p({clientX:s.clientX,clientY:s.clientY,row:d.index}))},children:[n(_n,{bars:o,frame:i,ramp:e.referenceRampDomain,rowGenes:e.walkRowGenes}),n(Nn,{model:e,bars:o,frame:i}),n(te,{el:$e(o,i,new Set(e.walkLayers.map(s=>s.walk)))})]}),n(Wn,{model:e}),f("div",{style:An,"data-testid":"graph-walk-strip-key",children:[l.map(s=>f("div",{style:oe,children:[n(ne,{swatch:ot(s.swatch)}),n("span",{children:s.label})]},s.label)),n("span",{style:{color:"#777"},children:"Ticks mark where each walk passes the node under the pointer; click a haplotype's bar to lift its walk"})]}),n(F,{model:e,at:a&&{...a,bars:o},onClose:()=>{p(void 0)}})]})}),Nt=On;var Dn=h(function({model:e}){let o=e.walkStripLocator;return o?f(ee,{model:e,zIndex:4,overflow:"visible",testId:"graph-walk-strip-locator",children:[n("circle",{cx:o.x,cy:o.y,r:11,fill:"none",stroke:"white",strokeWidth:4}),n("circle",{cx:o.x,cy:o.y,r:11,fill:"none",stroke:"#111",strokeWidth:1.75})]}):null}),Ot=Dn;var Xn=1.1,Bn=100,Fn=40,Vn=800,Yn=10,Dt=2;function me(t){let e=t.deltaY*(t.deltaMode===1?Fn:t.deltaMode===2?Vn:1),o=(t.ctrlKey?Yn:1)*e/Bn;return Xn**-Math.max(-Dt,Math.min(Dt,o))}var Zn=40,$n=100,jn=24,Xt=Math.log(16);function Kn(t,e){let o=t*Math.exp(-Math.max(0,e)/jn);return Math.abs(o)<.001?t:t-o}function qn(t,e){let o=Math.abs(t.deltaX)>Math.abs(t.deltaY);return t.ctrlKey||t.metaKey||!o&&(!e||e.scrollZoom)?"zoom":o?"pan":"page"}function Vt(t,e,o){H(()=>{if(!t)return;let i=-1/0,a={backlog:0,x:0,y:0,frame:0,last:0},p=l=>{let s=Kn(a.backlog,Math.min(100,l-a.last));a.backlog-=s,a.last=l,a.frame=a.backlog?requestAnimationFrame(p):0,T(o)&&o.zoom(Math.exp(s),a.x,a.y)},c=l=>{if(o.hostPlacesX||o.followsHostView)return;let g=((l.target instanceof Element?l.target.closest("canvas"):null)??(o.facetPanels?null:e))?.getBoundingClientRect();if(g&&l.clientY-g.top<o.referenceStripZonePx)return;let x=qn(l,o.host);if(x!=="page"){if(o.host&&l.stopPropagation(),l.preventDefault(),x==="pan"){if(l.timeStamp-i>$n){let w=l.deltaMode===1?Zn:1;o.setTransform(o.scale,o.translateX-l.deltaX*w,o.translateY)}return}i=l.timeStamp,g&&(a.x=l.clientX-g.left,a.y=l.clientY-g.top,a.backlog=Math.max(-Xt,Math.min(Xt,a.backlog+Math.log(me(l)))),a.frame||(a.last=performance.now()-1e3/60,a.frame=requestAnimationFrame(p)))}};return t.addEventListener("wheel",c,{passive:!1}),()=>{cancelAnimationFrame(a.frame),t.removeEventListener("wheel",c)}},[t,e,o])}var Bt=3,ge="data-gesture-owner",V=t=>({x:t.clientX,y:t.clientY});function Ft(t){let[e,o]=[...t.values()];return{spread:Math.hypot(e.x-o.x,e.y-o.y),mid:{x:(e.x+o.x)/2,y:(e.y+o.y)/2}}}function Yt(t){let e=k({x:0,y:0}),o=k({x:0,y:0}),i=k(!1),a=k(void 0),p=r=>a.current!==void 0&&r.pointerId!==a.current,c=k(new Map),l=k(null),s=k(null),d=k(!1),g=k(null),x=k(!1),w=k({frame:0,pan:null,hover:null,pinch:!1});H(()=>()=>{cancelAnimationFrame(w.current.frame)},[]);let[D,G]=C(),[A,z]=C(!1),[Y,Z]=C(void 0);function R(r){let u=r.currentTarget.getBoundingClientRect();return{x:r.clientX-u.left,y:r.clientY-u.top}}function L(r,u){if(t.layoutResult?.tubeMap)return t.tubeMapNodeAt(r,u);let m=t.referenceStripNodeAt(r,u);if(m)return m;let{nodePositions:y}=t;if(!y)return null;let{x:v,y:b}=se(r,u,t,t.axisScale);return le(y,v,b,t.axisScale,t.positionsVersion,t.nodeInk)}function jt(r,u){let{nodePositions:m,graph:y}=t;if(!m||!y)return null;let{x:v,y:b}=se(r,u,t,t.axisScale);return ce(m,y,v,b,t.axisScale,t.effectiveDrawPaths&&!t.facetPanels,t.positionsVersion,t.deletionEdgeIndexes,t.hiddenEdgeIndexes,t.deletionRoutes,t.layoutResult?.stranded)}function Kt(r){r.button===0&&r.preventDefault()}function qt(r){if(r.button!==0)return;let u=c.current;if(p(r)){t.isPanning&&!x.current&&r.pointerType==="touch"&&u.size===1&&(r.currentTarget.setPointerCapture(r.pointerId),u.set(r.pointerId,V(r)),s.current=Ft(u),i.current=!0);return}i.current=!1,o.current={x:r.clientX,y:r.clientY},r.currentTarget.removeAttribute(ge);let m=t.followsHostView;if(t.hostPlacesX||m&&r.shiftKey)return;r.currentTarget.setPointerCapture(r.pointerId),a.current=r.pointerId,l.current=r.currentTarget,u.clear(),u.set(r.pointerId,V(r));let{x:y,y:v}=R(r),b=v<t.referenceStripZonePx,P=t.layoutResult?.tubeMap||b?null:L(y,v);m&&P&&r.currentTarget.setAttribute(ge,""),x.current=m,d.current=b&&!m,P?t.setDraggingNode(P):t.setPanning(!0),e.current={x:r.clientX,y:r.clientY}}function ye(){let r=s.current,u=l.current;if(!r||!u)return;let m=Ft(c.current),y=u.getBoundingClientRect();r.spread>0&&m.spread>0&&t.zoom(m.spread/r.spread,r.mid.x-y.left,r.mid.y-y.top),t.setTransform(t.scale,t.translateX+m.mid.x-r.mid.x,t.translateY+m.mid.y-r.mid.y),s.current=m}function Ut(){let r=w.current,{pan:u,hover:m,pinch:y}=r;if(r.frame=0,r.pan=null,r.hover=null,r.pinch=!1,y&&ye(),u&&d.current?t.host?.horizontalScroll(-u.dx):u&&x.current?t.setTransform(t.scale,t.translateX,t.translateY+u.dy):u&&t.setTransform(t.scale,t.translateX+u.dx,t.translateY+u.dy),!m)return;let{x:v,y:b}=m,P=t.facetPanels?void 0:ut(t.overlayLabels,v,b);Z(M=>M?.label===P?.label&&M?.readout===P?.readout?M:P);let E=t.walkRowBars;if(E){let M=t.walkRowAt(v,b);t.setHoveredWalkRow(M===void 0?null:[E.reference,...E.rows][M].name)}if(t.nodePositions&&t.graph){let M=L(v,b);t.setHoveredPanel(t.tubeMapPanelAt(b)),t.setHoveredNode(M,{x:v,y:b}),z(M!==null&&!t.hostPlacesX&&!t.layoutResult?.tubeMap&&b>=t.referenceStripZonePx),t.setHoveredTube(M===null&&t.layoutResult?.tubeMap?t.tubeAt(v,b):null),t.setHoveredEdge(M||t.layoutResult?.tubeMap||!t.hoverLightsEverything?null:jt(v,b))}}function $(){w.current.frame||(w.current.frame=requestAnimationFrame(Ut))}function Jt(){let r=w.current;cancelAnimationFrame(r.frame),r.frame=0,r.pan=null,r.hover=null,r.pinch=!1}function Qt(r){let u=c.current;if(s.current&&u.has(r.pointerId)){u.set(r.pointerId,V(r)),w.current.pinch=!0,$();return}if(p(r)||g.current)return;let m=r.clientX-e.current.x,y=r.clientY-e.current.y;e.current={x:r.clientX,y:r.clientY},Math.hypot(r.clientX-o.current.x,r.clientY-o.current.y)>Bt&&(i.current=!0);let v=w.current;if(t.draggingNode)t.moveNode(t.draggingNode,m/t.scaleX,y/t.scaleY);else if(t.isPanning)v.pan={dx:(v.pan?.dx??0)+m,dy:(v.pan?.dy??0)+y},$();else{let b=r.currentTarget.getBoundingClientRect();v.hover={x:r.clientX-b.left,y:r.clientY-b.top},$()}}function ae(r){let u=c.current;if(s.current&&u.has(r.pointerId)){w.current.pinch&&(w.current.pinch=!1,ye()),u.delete(r.pointerId),s.current=null;let[[m,y]]=[...u];a.current=m,e.current=y;return}p(r)||(a.current=void 0,u.clear(),T(t)&&t.stopDragging())}function en(r){p(r)||(a.current=void 0,c.current.clear(),s.current=null,Jt(),Z(void 0),z(!1),T(t)&&(t.stopDragging(),t.clearHover()))}function tn(r){let{x:u,y:m}=R(r),y=L(u,m),{clientX:v,clientY:b}=r;if(y){r.preventDefault(),G({clientX:v,clientY:b,nodeId:y});return}let P=t.walkRowAt(u,m);P!==void 0&&(r.preventDefault(),G({clientX:v,clientY:b,row:P}))}function nn(r){if(!i.current){let{x:u,y:m}=R(r),y=L(u,m);t.setSelectedNode(y),y&&t.showNodeDetails(y)}}H(()=>()=>{g.current?.end()},[]);function on(r){if(r.button!==0||t.hostPlacesX||t.followsHostView||!(r.target instanceof Element)||!r.target.closest(`[${Qe}]`))return;g.current?.end(),d.current=!1,x.current=!1;let u=r.pointerId,m=V(r),y=m,v={moved:!1,end:()=>{window.removeEventListener("pointermove",b,!0),window.removeEventListener("pointerup",P,!0),window.removeEventListener("pointercancel",P,!0),v.moved&&T(t)&&t.stopDragging()}};function b(E){if(E.pointerId!==u)return;if(!v.moved){if(Math.hypot(E.clientX-m.x,E.clientY-m.y)<=Bt)return;v.moved=!0,t.setPanning(!0)}let M=w.current;M.pan={dx:(M.pan?.dx??0)+E.clientX-y.x,dy:(M.pan?.dy??0)+E.clientY-y.y},y=V(E),$()}function P(E){E.pointerId===u&&(v.end(),setTimeout(()=>{g.current===v&&(g.current=null)},0))}g.current=v,window.addEventListener("pointermove",b,!0),window.addEventListener("pointerup",P,!0),window.addEventListener("pointercancel",P,!0)}function rn(r){g.current?.moved&&(g.current=null,r.stopPropagation())}let an={cursor:t.isPanning||t.draggingNode?"grabbing":A?"move":"grab",touchAction:t.hostPlacesX?"auto":"none",overscrollBehavior:"contain"},sn=t.host!==void 0&&!t.hostPlacesX&&!t.followsHostView?{[ge]:"",onMouseDown:r=>{r.stopPropagation()}}:{};return{canvasStyle:an,surfaceProps:sn,handlers:{onMouseDown:Kt,onPointerDown:qt,onPointerMove:Qt,onPointerUp:ae,onPointerCancel:ae,onLostPointerCapture:ae,onPointerLeave:en,onClick:nn,onContextMenu:tn},contextMenu:D,hoveredChip:Y,labelHandlers:{onPointerDown:on,onClickCapture:rn},closeContextMenu:()=>{G(void 0)}}}function Zt(t){return Promise.resolve(new _(t))}var Un={position:"relative"},Jn={position:"relative",lineHeight:0,isolation:"isolate"},Qn={position:"absolute",left:0,right:0,bottom:0,zIndex:0},eo={position:"absolute",inset:0,zIndex:10,lineHeight:"normal",pointerEvents:"none"},to={position:"absolute",left:6,transform:"translateY(-50%)",background:"rgba(255,255,255,0.82)",padding:"0 4px",borderRadius:3,fontSize:11,lineHeight:"16px",whiteSpace:"nowrap",pointerEvents:"none",zIndex:4},no=h(function({model:e}){return n(I,{children:e.visibleRowLabels.map(({label:o,y:i,top:a})=>n("div",{"data-testid":"graph-row-label",style:{...to,top:a},children:o},i))})}),oo={position:"absolute",top:Q,right:Q,display:"flex",flexDirection:"column",borderRadius:3,overflow:"hidden",zIndex:4},$t={position:"absolute",transform:"translate(-50%, -50%)",background:"rgba(255,255,255,0.78)",padding:"0 3px",borderRadius:3,fontSize:10,lineHeight:"13px",whiteSpace:"nowrap",pointerEvents:"none",zIndex:3},ro={...$t,color:"#18181c",fontWeight:600},ao=h(function({model:e}){let o=k(null),i=e.legendAtRest;return H(()=>{let a=o.current;if(!a||!i)return;let p=()=>{T(e)&&e.legendAtRest&&e.setLegendSize({width:a.offsetWidth,height:a.offsetHeight})};p();let c=new ResizeObserver(p);return c.observe(a),()=>{c.disconnect()}},[e,i]),n("div",{ref:o,style:{...oo,top:Q+e.referenceStripZonePx},children:n(bt,{model:e})})}),io=h(function({model:e}){let o=e.overlayLabels.sizes,i=o.flatMap(({key:a,leader:p})=>p?[{key:a,...p}]:[]);return f(I,{children:[i.length>0?n(ee,{model:e,zIndex:2,overflow:"visible",children:i.map(({key:a,arcX:p,arcY:c,labelX:l,labelY:s})=>n("line",{"data-testid":"graph-label-leader",x1:p,y1:c,x2:l,y2:s,stroke:"#18181c",strokeWidth:1},a))}):null,o.map(({key:a,text:p,x:c,y:l,kind:s})=>n("div",{"data-testid":"graph-size-label",style:{...s==="deletion"?ro:$t,left:c,top:l},children:p},a))]})}),so=h(function({model:e,ownChrome:o=!0}){let{canvasRef:i,canvas:a,error:p,retry:c}=gt(Zt,e),{handlers:l,canvasStyle:s,surfaceProps:d,labelHandlers:g,contextMenu:x,closeContextMenu:w,hoveredChip:D}=Yt(e),[G,A]=C(null);Vt(G,a,e);let z=e.facetPanels!==void 0;return f("div",{style:Un,...d,children:[o?n(Ht,{model:e}):null,f("div",{ref:A,style:Jn,...g,onMouseEnter:()=>{e.setPointerInPane(!0)},onMouseLeave:()=>{T(e)&&e.setPointerInPane(!1)},children:[e.referenceStripShown?n("div",{style:{...Qn,top:e.referenceStripZonePx,background:J}}):null,n("canvas",{ref:i,"data-testid":"graph-genome-canvas",style:{...s,width:e.paneWidth,height:e.canvasHeight,display:"block",position:"relative",zIndex:1},...l}),z?n(wt,{model:e,handlers:l,canvasStyle:s}):f(I,{children:[n(ht,{model:e}),n(de,{model:e}),n(ft,{model:e}),n(no,{model:e}),n(io,{model:e}),n(tt,{model:e}),n(st,{model:e}),n(dt,{model:e}),n(mt,{model:e}),n(Ot,{model:e}),n(ao,{model:e})]}),o?n("div",{style:eo,children:n(xe,{isVisible:e.isLoading,immediate:!e.layoutResult,statusMessage:e.statusMessage,onCancel:e.canCancelLoad?()=>{e.cancelLoad()}:void 0})}):null,n(At,{model:e,chip:D})]}),e.walkStripShown?n(Nt,{model:e}):null,n(F,{model:e,at:x,onClose:w}),p?n(ie,{error:p,onReset:c}):null,o&&e.error?n(ie,{error:e.error,onReset:e.canRetryLoad?()=>{e.retryLoad()}:void 0}):null]})}),Di=so;export{Di as a};
2
+ //# sourceMappingURL=chunk-42KD4AVY.js.map