jbrowse-plugin-graphgenomeviewer 8.3.5 → 8.3.6

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 (23) hide show
  1. package/dist/chunks/{GbzBaseSyntenyAdapter-RRLBONL5.js → GbzBaseSyntenyAdapter-BG6FNGHY.js} +2 -2
  2. package/dist/chunks/WalkTabixSyntenyAdapter-7COETKFB.js +2 -0
  3. package/dist/chunks/WalkTabixSyntenyAdapter-7COETKFB.js.map +7 -0
  4. package/dist/chunks/{chunk-HMIJBEUE.js → chunk-HLWIFWDZ.js} +2 -2
  5. package/dist/chunks/{chunk-HMIJBEUE.js.map → chunk-HLWIFWDZ.js.map} +2 -2
  6. package/dist/jbrowse-plugin-graphgenomeviewer.esm.js +2 -2
  7. package/dist/jbrowse-plugin-graphgenomeviewer.esm.js.map +1 -1
  8. package/package.json +1 -1
  9. package/src/RgfaTabixAdapter/test_data/walks5_skipfollow.GRCh38.walks.bed.gz +0 -0
  10. package/src/RgfaTabixAdapter/test_data/walks5_skipfollow.GRCh38.walks.bed.gz.tbi +0 -0
  11. package/src/RgfaTabixAdapter/test_data/walks5_skipinv.GRCh38.walks.bed.gz +0 -0
  12. package/src/RgfaTabixAdapter/test_data/walks5_skipinv.GRCh38.walks.bed.gz.tbi +0 -0
  13. package/src/WalkTabixSyntenyAdapter/WalkTabixSyntenyAdapter.test.ts +111 -84
  14. package/src/WalkTabixSyntenyAdapter/WalkTabixSyntenyAdapter.ts +96 -93
  15. package/src/WalkTabixSyntenyAdapter/walkLanes.ts +71 -48
  16. package/src/synteny/clipFeatureToRegion.ts +3 -2
  17. package/src/synteny/matchFeature.ts +2 -3
  18. package/src/version.ts +1 -1
  19. package/dist/chunks/WalkTabixSyntenyAdapter-4I32E62Y.js +0 -2
  20. package/dist/chunks/WalkTabixSyntenyAdapter-4I32E62Y.js.map +0 -7
  21. package/src/RgfaTabixAdapter/test_data/walks5_skippair.GRCh38.walks.bed.gz +0 -0
  22. package/src/RgfaTabixAdapter/test_data/walks5_skippair.GRCh38.walks.bed.gz.tbi +0 -0
  23. /package/dist/chunks/{GbzBaseSyntenyAdapter-RRLBONL5.js.map → GbzBaseSyntenyAdapter-BG6FNGHY.js.map} +0 -0
@@ -2,11 +2,16 @@ import { weightedLcs } from '@gmod/gbz-base/lcs'
2
2
  import { pairAlignments, pairCigar } from '@gmod/gbz-base/pairAlignment'
3
3
  import { panSNContig } from '@jbrowse/bandage-core/pansn'
4
4
 
5
+ import SyntenyFeature from '../synteny/SyntenyFeature.ts'
5
6
  import { matchFeature } from '../synteny/matchFeature.ts'
6
7
 
7
- import type { MatchSide } from '../synteny/matchFeature.ts'
8
8
  import type { PairChain, PairEdit } from '@gmod/gbz-base/pairAlignment'
9
- import type { WalkFragment, WalkNode, WalkSkip } from '@jbrowse/graph-walks'
9
+ import type {
10
+ WalkFragment,
11
+ WalkNode,
12
+ WalkSkip,
13
+ WalkStop,
14
+ } from '@jbrowse/graph-walks'
10
15
 
11
16
  // The longest bubble with equal bases on both sides that is written as
12
17
  // mismatches; a longer one stays an insertion and a deletion
@@ -303,19 +308,35 @@ export interface SkipCrossing {
303
308
  strand: '+' | '-'
304
309
  }
305
310
 
311
+ /**
312
+ * The reference node either side of a skipped stretch: the one a haplotype
313
+ * leaves, ending at `refStart`, or the one it rejoins, starting at `refEnd`
314
+ */
315
+ export type SkipSide = 'leave' | 'rejoin'
316
+
306
317
  /**
307
318
  * Where a haplotype that skips the window crosses its deletion, from a cut
308
- * over the reference node it leaves at `skip.refStart`: past that node, or
309
- * where it enters the node when it passes it backwards, arriving across the
310
- * deletion
319
+ * over the reference node on one `side` of it. The jump lies on whichever end
320
+ * of the walk's fragment goes on to a chunk across the stretch; with neither
321
+ * or both, on the end the fragment's other steps leave free, and failing that
322
+ * on the end the node's own direction points to. A walk that passes the node
323
+ * inverted between two forward steps still crosses after it.
311
324
  */
312
325
  export function skipCrossing(
313
326
  skip: WalkSkip,
314
327
  refName: string,
315
328
  fragments: WalkFragment[],
316
329
  nodes: Map<number, WalkNode>,
330
+ side: SkipSide,
317
331
  ): SkipCrossing | undefined {
318
- for (const { name, fragStart, hapStart, ids, rev } of fragments) {
332
+ const leaving = side === 'leave'
333
+ const across = (stop: WalkStop) =>
334
+ stop.kind === 'elsewhere' &&
335
+ (leaving
336
+ ? stop.chunk.start >= skip.refStart
337
+ : stop.chunk.start < skip.refStart)
338
+ for (const fragment of fragments) {
339
+ const { name, fragStart, hapStart, ids, rev, before, after } = fragment
319
340
  if (name === skip.name && fragStart === skip.fragStart) {
320
341
  let at = hapStart
321
342
  for (let i = 0; i < ids.length; i++) {
@@ -324,11 +345,19 @@ export function skipCrossing(
324
345
  if (
325
346
  node?.rank === 0 &&
326
347
  node.refName === refName &&
327
- node.end === skip.refStart
348
+ (leaving ? node.end === skip.refStart : node.start === skip.refEnd)
328
349
  ) {
329
- return rev[i]
330
- ? { skip, at, strand: '-' }
331
- : { skip, at: at + length, strand: '+' }
350
+ const jumpsAfter =
351
+ across(after) !== across(before)
352
+ ? across(after)
353
+ : i > 0 !== i < ids.length - 1
354
+ ? i > 0
355
+ : leaving !== (rev[i] === 1)
356
+ return {
357
+ skip,
358
+ at: jumpsAfter ? at + length : at,
359
+ strand: jumpsAfter === leaving ? '+' : '-',
360
+ }
332
361
  }
333
362
  at += length
334
363
  }
@@ -337,47 +366,41 @@ export function skipCrossing(
337
366
  return undefined
338
367
  }
339
368
 
340
- /** One side of a record: a walk fragment's extent on its contig */
341
- export function walkSide(fragment: WalkFragment, assemblyName: string) {
342
- return {
343
- name: fragment.name,
344
- assemblyName,
345
- refName: panSNContig(fragment.name),
346
- start: fragment.hapStart,
347
- end: fragment.hapEnd,
348
- }
349
- }
350
-
351
- /** One side of a record: the point where a haplotype crosses its deletion */
352
- export function crossingSide({ skip, at }: SkipCrossing, assemblyName: string) {
353
- return {
354
- name: skip.name,
355
- assemblyName,
356
- refName: panSNContig(skip.name),
357
- start: at,
358
- end: at,
359
- }
360
- }
361
-
362
369
  /**
363
- * A record with one side a haplotype's deletion crossing. With no CIGAR, a
364
- * display clipping it to a window maps the window onto that point, so the
365
- * haplotype gets a lane that the window's ribbon narrows to.
370
+ * A haplotype whose deletion spans the whole window, as the record a
371
+ * multi-way display lifts out as a deletion: `spansWindow`, the skipped
372
+ * stretch whole so its length heads the lane, and the crossing as its mate.
373
+ * The record carries no CIGAR and no identity, so no ramp or identity filter
374
+ * reads it as an alignment.
366
375
  */
367
- export function crossingFeature({
368
- target,
369
- query,
370
- strand,
376
+ export function skipFeature({
377
+ crossing,
378
+ refName,
379
+ assemblyName,
380
+ mateAssemblyName,
371
381
  }: {
372
- target: MatchSide
373
- query: MatchSide
374
- strand: string
382
+ crossing: SkipCrossing
383
+ refName: string
384
+ assemblyName: string
385
+ mateAssemblyName: string
375
386
  }) {
376
- return matchFeature({
377
- target,
378
- query,
379
- strand,
380
- matches: 0,
381
- columns: Math.max(target.end - target.start, query.end - query.start),
387
+ const { skip, at, strand } = crossing
388
+ const id = `${skip.name}:${skip.fragStart}:${skip.piece}:skip`
389
+ return new SyntenyFeature({
390
+ uniqueId: id,
391
+ assemblyName,
392
+ refName,
393
+ start: skip.refStart,
394
+ end: skip.refEnd,
395
+ type: 'deletion',
396
+ strand: strand === '-' ? -1 : 1,
397
+ syntenyId: id,
398
+ spansWindow: true,
399
+ mate: {
400
+ refName: panSNContig(skip.name),
401
+ start: at,
402
+ end: at,
403
+ assemblyName: mateAssemblyName,
404
+ },
382
405
  })
383
406
  }
@@ -151,7 +151,8 @@ function clippedFeature(
151
151
  * record the piece was cut from, so a display can tell two runs of one record
152
152
  * from two records; `keepAlignment` hands back its
153
153
  * own stretch of them as packed ops in `alignmentOps`. A feature with no
154
- * `mate` is not a pairwise record and passes through whole.
154
+ * `mate` is not a pairwise record, and a `spansWindow` one is a deletion
155
+ * whose length the display reads off its extent; both pass through whole.
155
156
  *
156
157
  * A copy of `@jbrowse/plugin-comparative-adapters`' own, which a runtime plugin
157
158
  * cannot import: the worker serves that package as a stub too.
@@ -163,7 +164,7 @@ export function clipFeatureToRegion(
163
164
  keepAlignment = false,
164
165
  ): Feature[] {
165
166
  const mate = mateOf(feature)
166
- if (mate === undefined) {
167
+ if (mate === undefined || feature.get('spansWindow')) {
167
168
  return [feature]
168
169
  } else {
169
170
  const pieces = clipIntervals(
@@ -12,7 +12,6 @@ export interface MatchSide {
12
12
  * One record of a walk aligned to another, on the target walk's contig with
13
13
  * the query walk as its mate and the CIGAR read along the target, a `D` being
14
14
  * target bases the query lacks. Each side's walk name and extent make the id.
15
- * A record without a CIGAR maps its two extents onto each other in proportion.
16
15
  */
17
16
  export function matchFeature({
18
17
  target,
@@ -25,7 +24,7 @@ export function matchFeature({
25
24
  target: MatchSide
26
25
  query: MatchSide
27
26
  strand: string
28
- cigar?: string
27
+ cigar: string
29
28
  matches: number
30
29
  columns: number
31
30
  }) {
@@ -38,7 +37,7 @@ export function matchFeature({
38
37
  end: target.end,
39
38
  type: 'match',
40
39
  strand: strand === '-' ? -1 : 1,
41
- ...(cigar === undefined ? {} : { CIGAR: cigar }),
40
+ CIGAR: cigar,
42
41
  syntenyId: id,
43
42
  identity: matches / Math.max(columns, 1),
44
43
  numMatches: matches,
package/src/version.ts CHANGED
@@ -1 +1 @@
1
- export const version = '8.3.5'
1
+ export const version = '8.3.6'
@@ -1,2 +0,0 @@
1
- import{a as ee}from"./chunk-KVZIGTH3.js";import{b as Z,d as J,e as Q,f as B,g as Y,h as L}from"./chunk-HMIJBEUE.js";import"./chunk-SYKOZDP6.js";import{a as V}from"./chunk-KOB7YIMR.js";import{p as E,q as U,r as X}from"./chunk-M2D7NUOY.js";import"./chunk-YBLNN5FU.js";import"./chunk-3HS6N7WB.js";import"./chunk-HICKAMKK.js";import{E as G,F as K,i as z}from"./chunk-DAF7EWRF.js";import"./chunk-YBLNN5FU.js";import"./chunk-ROZPEXN4.js";import{a as O,c as $,d as F,g as M,h as A,i as v}from"./chunk-L372SDUG.js";import"./chunk-OTBDKJEA.js";import"./chunk-3VGXCEMQ.js";import"./chunk-OGQ6OQDN.js";import"./chunk-3WG3GF2A.js";import{o as P}from"./chunk-J5RMHLFJ.js";var le=50;function ce(a){let i=[];for(let e=0;e<a.length;e++){let[t,n]=a[e],[r,s]=a[e+1]??[];n===s&&n<=le&&(t==="I"&&r==="D"||t==="D"&&r==="I")?(i.push(["X",n]),e++):i.push([t,n])}return i}function I(a){return Array.from(a.ids,(i,e)=>2*i+a.rev[e])}function C(a,i){let e=a.get(i);return e===void 0?0:e.end-e.start}function te(a){let i=new Map,e=r=>{let s=C(a,r),o=i.get(s);return o===void 0&&(o="N".repeat(s),i.set(s,o)),o},t=new Map,n=r=>{let s=t.get(r);return s===void 0&&(s=I(r),t.set(r,s)),s};return(r,s)=>U({query:n(r),target:n(s),sequenceOf:e,bases:!1})}var _=100;function R(a,i,e){let t=a.at(-1);e>0&&(t?.[0]===i?t[1]+=e:a.push([i,e]))}function ae(a){let i=t=>C(a,t>>1),e=t=>{let n=new Float64Array(t.length+1);return t.forEach((r,s)=>{n[s+1]=n[s]+i(r)}),n};return(t,n)=>{let r=I(n),s=I(t),[o,p]=E(s,r,i),[h,u]=E(s.map(k=>k^1).reverse(),r,i),y=u>p,l=y?h:o,S=Math.max(p,u);if(S<_)return[];let f=e(r),W=e(s),N=k=>y?s.length-1-l[k][0]:l[k][0],c=[];l.forEach(([,k],w)=>{if(w>0){let[m,b]=[N(w-1),N(w)].sort((x,me)=>x-me);R(c,"I",W[b]-W[m+1]),R(c,"D",f[k]-f[l[w-1][1]+1])}R(c,"=",i(r[k]))});let[g,d]=[N(0),N(l.length-1)].sort((k,w)=>k-w);return[{queryStart:W[g],queryEnd:W[d+1],targetStart:f[l[0][1]],targetEnd:f[l.at(-1)[1]+1],strand:y?"-":"+",edits:c,sharedBases:S}]}}function pe(a){let i=new Map,e=new Set;a.ids.forEach((t,n)=>{i.has(t)?e.add(t):i.set(t,a.rev[n])});for(let t of e)i.delete(t);return i}function ne(a){let i=new Map,e=t=>{let n=i.get(t);return n===void 0&&(n=pe(t),i.set(t,n)),n};return(t,n)=>{let r=e(n),s=0,o=0;for(let[p,h]of e(t)){let u=r.get(p);u===h?s+=C(a,p):u!==void 0&&(o+=C(a,p))}return{same:s,opposite:o}}}function se(a){let i=ae(a),e=te(a),t=ne(a);return(n,r)=>{let{same:s,opposite:o}=t(n,r);return s>=_&&o>=_?e(n,r):i(n,r)}}var ue=1e4;function re(a){let i=ae(a),e=te(a),t=ne(a);return(n,r)=>{let s=i(n,r),o=s[0]?.strand,{same:p,opposite:h}=t(n,r);return o===void 0||Math.min(p,h)<ue?s:[...s,...e(n,r).filter(u=>u.strand!==o)]}}function T({chain:a,target:i,query:e,assemblyName:t,refName:n,mateAssemblyName:r}){let s=ce(a.edits);return L({target:{name:i.name,assemblyName:t,refName:n,start:i.hapStart+a.targetStart,end:i.hapStart+a.targetEnd},query:{name:e.name,assemblyName:r,refName:F(e.name),start:e.hapStart+a.queryStart,end:e.hapStart+a.queryEnd},strand:a.strand,cigar:X(s),matches:s.reduce((o,[p,h])=>o+(p==="="?h:0),0),columns:s.reduce((o,[,p])=>o+p,0)})}function ie(a,i,e,t){for(let{name:n,fragStart:r,hapStart:s,ids:o,rev:p}of e)if(n===a.name&&r===a.fragStart){let h=s;for(let u=0;u<o.length;u++){let y=t.get(o[u]),l=y===void 0?0:y.end-y.start;if(y?.rank===0&&y.refName===i&&y.end===a.refStart)return p[u]?{skip:a,at:h,strand:"-"}:{skip:a,at:h+l,strand:"+"};h+=l}}}function oe(a,i){return{name:a.name,assemblyName:i,refName:F(a.name),start:a.hapStart,end:a.hapEnd}}function j({skip:a,at:i},e){return{name:a.name,assemblyName:e,refName:F(a.name),start:i,end:i}}function D({target:a,query:i,strand:e}){return L({target:a,query:i,strand:e,matches:0,columns:Math.max(a.end-a.start,i.end-i.start)})}var H=({name:a})=>$(a)??a,q=class extends Z{constructor(){super(...arguments);this.walks=new ee(G(this,["walksLocation"],["walksIndex"]),this);this.refNames=new K(this.walks.file,this)}get anchor(){let e=this.getConf("assemblyNames")[0];if(e===void 0)throw new Error("WalkTabixSyntenyAdapter needs assemblyNames: its first entry is the assembly the reference sample is loaded as");return e}async getHaplotypeNames(e={}){return this.walks.haplotypeNames(e)}async getHeader(e={}){let{haplotypes:t}=await this.walks.reader.header(e),{anchor:n}=this,r=A(this,n),s=v(this);return{hasCoarseTier:!1,anchorAssemblyName:n,lanes:t.filter(o=>o!==r&&O(o)!==r).map(o=>({name:B(s,o),label:o,group:O(o)}))}}async getRefNames(e={}){let{assemblyName:t}=e;return t===void 0||t===this.anchor?this.refNames.assemblyRefNames({...e,assemblyName:this.anchor}):[]}async getSubgraph(e,t={}){let n=await this.refNames.resolveForCut(e,{signal:t.signal});return this.walks.subgraph(n,e,t)}async laneWalks(e,t,n,r,s){let o=z(n,e);return P(s,r.statusCallback,()=>this.walks.reader.cut(e,t,{...this.walks.budgets(),signal:r.signal,keep:o,expand:o,links:!1}).catch(p=>{throw Y(p,t.end-t.start)}))}async skipCrossings(e,{skips:t,fragments:n},r){let{signal:s}=r,o=new Set(n.map(H)),p=t.filter(l=>!o.has(H(l))),{chunk:h}=await this.walks.reader.header({signal:s}),u=new Map;for(let l of p){let S=Math.floor((l.refStart-1)/h),f=u.get(S);f?(f.group.push(l),f.start=Math.min(f.start,l.refStart-1),f.end=Math.max(f.end,l.refStart)):u.set(S,{group:[l],start:l.refStart-1,end:l.refStart})}return(await Promise.all([...u.values()].map(async({group:l,start:S,end:f})=>{let W=new Set(l.map(d=>d.name)),N=d=>W.has(d),{graph:c,fragments:g}=await this.walks.reader.cut(e,{start:S,end:f},{signal:s,keep:N,expand:N,context:0,links:!1});return l.map(d=>ie(d,e,g,c.nodes))}))).flat().filter(l=>l!==void 0)}async anchorFeatures(e,t,n){let r=n.haplotypes?.length?n.haplotypes.map(m=>A(this,m)):void 0,s=A(this,n.targetAssemblyName),o=s===void 0?r:r===void 0||r.some(m=>M(s,m)||M(m,s))?[s]:[];if(o?.length===0)return[];let{start:p,end:h}=t,u=`Reading walks ${t.refName}:${p.toLocaleString()}-${h.toLocaleString()}`,{graph:y,fragments:l,skips:S}=await this.laneWalks(e,t,o,n,u),f=({name:m})=>o===void 0?0:o.findIndex(b=>M(m,b)),W=await P(u,n.statusCallback,()=>this.skipCrossings(e,{skips:S.filter(m=>f(m)>=0),fragments:l},n)),N=re(y.nodes),c=v(this),g=m=>B(c,H(m)),d=l.filter(m=>m.name===e),k=l.filter(m=>m.name!==e&&f(m)>=0).map(m=>({rank:f(m),features:d.flatMap(b=>N(m,b).map(x=>T({chain:x,target:b,query:m,assemblyName:t.assemblyName,refName:t.refName,mateAssemblyName:g(m)})))})),w=W.map(m=>{let{skip:b}=m;return{rank:f(b),features:[D({target:{name:e,assemblyName:t.assemblyName,refName:t.refName,start:b.refStart,end:b.refEnd},query:j(m,g(b)),strand:m.strand})]}});return[...k,...w].sort((m,b)=>m.rank-b.rank).flatMap(m=>m.features)}async pairFeatures(e,t,n,r){let s=n.map(c=>({pair:c,featurePrefix:A(this,c.queryAssemblyName),matePrefix:A(this,c.targetAssemblyName)})),o=Q(n),{graph:p,fragments:h,skips:u}=await this.laneWalks(e,t,s.flatMap(c=>[c.featurePrefix,c.matePrefix]),r,o),y=await P(o,r.statusCallback,()=>this.skipCrossings(e,{skips:u,fragments:h},r)),l=se(p.nodes),S=c=>h.filter(g=>M(g.name,c)),f=(c,g)=>S(c).map(d=>oe(d,g)),W=(c,g)=>y.filter(({skip:d})=>M(d.name,c)).map(d=>j(d,g)),N=(c,g)=>c.flatMap(d=>g.map(k=>D({target:d,query:k,strand:"+"})));return s.flatMap(({pair:c,featurePrefix:g,matePrefix:d})=>{let{queryAssemblyName:k,targetAssemblyName:w}=c;return[...S(g).flatMap(m=>S(d).flatMap(b=>l(b,m).map(x=>T({chain:x,target:m,query:b,assemblyName:k,refName:F(m.name),mateAssemblyName:w})))),...N(f(g,k),W(d,w)),...N(W(g,k),f(d,w))]})}getFeatures(e,t={}){return V(async n=>{let r=e.assemblyName===this.anchor?await this.refNames.resolve(e,t):void 0;if(r!==void 0){let s=J(t),o=s.length>0?await this.pairFeatures(r,e,s,t):await this.anchorFeatures(r,e,t);for(let p of o)n.next(p)}n.complete()},t.signal)}};export{q as default};
2
- //# sourceMappingURL=WalkTabixSyntenyAdapter-4I32E62Y.js.map
@@ -1,7 +0,0 @@
1
- {
2
- "version": 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 { MatchSide } from '../synteny/matchFeature.ts'\nimport type { PairChain, PairEdit } from '@gmod/gbz-base/pairAlignment'\nimport type { WalkFragment, WalkNode, WalkSkip } 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\n/** The point on a haplotype's contig where it crosses a skipped stretch */\nexport interface SkipCrossing {\n skip: WalkSkip\n at: number\n strand: '+' | '-'\n}\n\n/**\n * Where a haplotype that skips the window crosses its deletion, from a cut\n * over the reference node it leaves at `skip.refStart`: past that node, or\n * where it enters the node when it passes it backwards, arriving across the\n * deletion\n */\nexport function skipCrossing(\n skip: WalkSkip,\n refName: string,\n fragments: WalkFragment[],\n nodes: Map<number, WalkNode>,\n): SkipCrossing | undefined {\n for (const { name, fragStart, hapStart, ids, rev } of fragments) {\n if (name === skip.name && fragStart === skip.fragStart) {\n let at = hapStart\n for (let i = 0; i < ids.length; i++) {\n const node = nodes.get(ids[i]!)\n const length = node === undefined ? 0 : node.end - node.start\n if (\n node?.rank === 0 &&\n node.refName === refName &&\n node.end === skip.refStart\n ) {\n return rev[i]\n ? { skip, at, strand: '-' }\n : { skip, at: at + length, strand: '+' }\n }\n at += length\n }\n }\n }\n return undefined\n}\n\n/** One side of a record: a walk fragment's extent on its contig */\nexport function walkSide(fragment: WalkFragment, assemblyName: string) {\n return {\n name: fragment.name,\n assemblyName,\n refName: panSNContig(fragment.name),\n start: fragment.hapStart,\n end: fragment.hapEnd,\n }\n}\n\n/** One side of a record: the point where a haplotype crosses its deletion */\nexport function crossingSide({ skip, at }: SkipCrossing, assemblyName: string) {\n return {\n name: skip.name,\n assemblyName,\n refName: panSNContig(skip.name),\n start: at,\n end: at,\n }\n}\n\n/**\n * A record with one side a haplotype's deletion crossing. With no CIGAR, a\n * display clipping it to a window maps the window onto that point, so the\n * haplotype gets a lane that the window's ribbon narrows to.\n */\nexport function crossingFeature({\n target,\n query,\n strand,\n}: {\n target: MatchSide\n query: MatchSide\n strand: string\n}) {\n return matchFeature({\n target,\n query,\n strand,\n matches: 0,\n columns: Math.max(target.end - target.start, query.end - query.start),\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 {\n anchorAligner,\n chainFeature,\n crossingFeature,\n crossingSide,\n lanePairAligner,\n skipCrossing,\n walkSide,\n} 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 { MatchSide } from '../synteny/matchFeature.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 { WalkSkip } from '@jbrowse/graph-walks'\n\nconst haplotypeOf = ({ name }: { name: string }) => panSNHaplotype(name) ?? 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 * Where each haplotype that skips the window crosses its deletion, read\n * from cuts over the reference nodes they leave at, one cut per chunk those\n * nodes fall in. A haplotype with a walk in the window draws that instead:\n * NA19036#1 skips the IGL locus on one contig and walks it on another.\n */\n private async skipCrossings(\n refName: string,\n { skips, fragments }: { skips: WalkSkip[]; fragments: { name: string }[] },\n opts: LaneFeatureOptions,\n ) {\n const { signal } = opts\n const walked = new Set(fragments.map(haplotypeOf))\n const crossing = skips.filter(skip => !walked.has(haplotypeOf(skip)))\n const { chunk } = await this.walks.reader.header({ signal })\n const byChunk = new Map<\n number,\n { group: WalkSkip[]; start: number; end: number }\n >()\n for (const skip of crossing) {\n const cs = Math.floor((skip.refStart - 1) / chunk)\n const held = byChunk.get(cs)\n if (held) {\n held.group.push(skip)\n held.start = Math.min(held.start, skip.refStart - 1)\n held.end = Math.max(held.end, skip.refStart)\n } else {\n byChunk.set(cs, {\n group: [skip],\n start: skip.refStart - 1,\n end: skip.refStart,\n })\n }\n }\n const found = await Promise.all(\n [...byChunk.values()].map(async ({ group, start, end }) => {\n const names = new Set(group.map(skip => skip.name))\n const keep = (name: string) => names.has(name)\n const { graph, fragments } = await this.walks.reader.cut(\n refName,\n { start, end },\n { signal, keep, expand: keep, context: 0, links: false },\n )\n return group.map(skip =>\n skipCrossing(skip, refName, fragments, graph.nodes),\n )\n }),\n )\n return found.flat().filter(crossing => crossing !== undefined)\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. A haplotype whose\n * deletion spans the window is one record of the skipped stretch, its mate\n * the point where the haplotype crosses the deletion.\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 status = `Reading walks ${region.refName}:${start.toLocaleString()}-${end.toLocaleString()}`\n const { graph, fragments, skips } = await this.laneWalks(\n refName,\n region,\n prefixes,\n opts,\n status,\n )\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 = ({ name }: { name: string }) =>\n prefixes === undefined\n ? 0\n : prefixes.findIndex(prefix => panSNMatchesPrefix(name, prefix))\n const crossings = await updateStatus(status, opts.statusCallback, () =>\n this.skipCrossings(\n refName,\n { skips: skips.filter(skip => rank(skip) >= 0), fragments },\n opts,\n ),\n )\n const align = anchorAligner(graph.nodes)\n const asmByPrefix = assemblyByPanSNPrefix(this)\n const laneOf = (walk: { name: string }) =>\n laneAssemblyName(asmByPrefix, haplotypeOf(walk))\n const references = fragments.filter(f => f.name === refName)\n const walked = fragments\n .filter(fragment => fragment.name !== refName && rank(fragment) >= 0)\n .map(query => ({\n rank: rank(query),\n features: 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: laneOf(query),\n }),\n ),\n ),\n }))\n const skipped = crossings.map(crossing => {\n const { skip } = crossing\n return {\n rank: rank(skip),\n features: [\n crossingFeature({\n target: {\n name: refName,\n assemblyName: region.assemblyName,\n refName: region.refName,\n start: skip.refStart,\n end: skip.refEnd,\n },\n query: crossingSide(crossing, laneOf(skip)),\n strand: crossing.strand,\n }),\n ],\n }\n })\n return [...walked, ...skipped]\n .sort((a, b) => a.rank - b.rank)\n .flatMap(lane => lane.features)\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. A lane that skips the window pairs as the\n * point where it crosses its deletion.\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 status = lanePairsStatus(pairs)\n const { graph, fragments, skips } = await this.laneWalks(\n refName,\n region,\n sides.flatMap(side => [side.featurePrefix, side.matePrefix]),\n opts,\n status,\n )\n const crossings = await updateStatus(status, opts.statusCallback, () =>\n this.skipCrossings(refName, { skips, fragments }, opts),\n )\n const align = lanePairAligner(graph.nodes)\n const walksOf = (prefix: string) =>\n fragments.filter(f => panSNMatchesPrefix(f.name, prefix))\n const walkSides = (prefix: string, assemblyName: string) =>\n walksOf(prefix).map(walk => walkSide(walk, assemblyName))\n const crossingSides = (prefix: string, assemblyName: string) =>\n crossings\n .filter(({ skip }) => panSNMatchesPrefix(skip.name, prefix))\n .map(crossing => crossingSide(crossing, assemblyName))\n const crossed = (own: MatchSide[], mates: MatchSide[]) =>\n own.flatMap(target =>\n mates.map(query => crossingFeature({ target, query, strand: '+' })),\n )\n return sides.flatMap(({ pair, featurePrefix, matePrefix }) => {\n const { queryAssemblyName, targetAssemblyName } = pair\n return [\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: queryAssemblyName,\n refName: panSNContig(target.name),\n mateAssemblyName: targetAssemblyName,\n }),\n ),\n ),\n ),\n ...crossed(\n walkSides(featurePrefix, queryAssemblyName),\n crossingSides(matePrefix, targetAssemblyName),\n ),\n ...crossed(\n crossingSides(featurePrefix, queryAssemblyName),\n walkSides(matePrefix, targetAssemblyName),\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": "mpBAYA,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,GAAYF,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,GAAiBhB,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,EAAU,GACdL,EAAUN,EAAI,OAAS,EAAIO,EAAM,CAAC,EAAG,CAAC,EAAIA,EAAM,CAAC,EAAG,CAAC,EACjDvC,EAAoB,CAAC,EAC3BuC,EAAM,QAAQ,CAAC,CAAC,CAAEK,CAAC,EAAGC,IAAM,CAC1B,GAAIA,EAAI,EAAG,CACT,GAAM,CAACC,EAAIC,CAAE,EAAI,CAACJ,EAAOE,EAAI,CAAC,EAAGF,EAAOE,CAAC,CAAC,EAAE,KAAK,CAAC,EAAGG,KAAM,EAAIA,EAAC,EAChEvB,EAAWzB,EAAO,IAAK0C,EAAMK,CAAG,EAAKL,EAAMI,EAAM,CAAC,CAAE,EACpDrB,EAAWzB,EAAO,IAAKyC,EAAMG,CAAC,EAAKH,EAAMF,EAAMM,EAAI,CAAC,EAAG,CAAC,EAAI,CAAC,CAAE,CACjE,CACApB,EAAWzB,EAAO,IAAK4B,EAASG,EAAIa,CAAC,CAAE,CAAC,CAC1C,CAAC,EACD,GAAM,CAACE,EAAIC,CAAE,EAAI,CAACJ,EAAO,CAAC,EAAGA,EAAOJ,EAAM,OAAS,CAAC,CAAC,EAAE,KAAK,CAACU,EAAGD,IAAMC,EAAID,CAAC,EAC3E,MAAO,CACL,CACE,WAAYN,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,GAAgB1C,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,GAAgBjD,EAA8B,CAC5D,IAAMkD,EAAclC,GAAiBhB,CAAK,EACpCmD,EAAUjD,GAAYF,CAAK,EAC3BoD,EAASV,GAAgB1C,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,GAActD,EAA8B,CAC1D,IAAMkD,EAAclC,GAAiBhB,CAAK,EACpCmD,EAAUjD,GAAYF,CAAK,EAC3BoD,EAASV,GAAgB1C,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,CAeO,SAASC,GACdC,EACAR,EACAS,EACArE,EAC0B,CAC1B,OAAW,CAAE,KAAAsE,EAAM,UAAAC,EAAW,SAAAC,EAAU,IAAAC,EAAK,IAAAjC,CAAI,IAAK6B,EACpD,GAAIC,IAASF,EAAK,MAAQG,IAAcH,EAAK,UAAW,CACtD,IAAIM,EAAKF,EACT,QAASjF,EAAI,EAAGA,EAAIkF,EAAI,OAAQlF,IAAK,CACnC,IAAMU,EAAOD,EAAM,IAAIyE,EAAIlF,CAAC,CAAE,EACxBc,EAASJ,IAAS,OAAY,EAAIA,EAAK,IAAMA,EAAK,MACxD,GACEA,GAAM,OAAS,GACfA,EAAK,UAAY2D,GACjB3D,EAAK,MAAQmE,EAAK,SAElB,OAAO5B,EAAIjD,CAAC,EACR,CAAE,KAAA6E,EAAM,GAAAM,EAAI,OAAQ,GAAI,EACxB,CAAE,KAAAN,EAAM,GAAIM,EAAKrE,EAAQ,OAAQ,GAAI,EAE3CqE,GAAMrE,CACR,CACF,CAGJ,CAGO,SAASsE,GAAS9E,EAAwB8D,EAAsB,CACrE,MAAO,CACL,KAAM9D,EAAS,KACf,aAAA8D,EACA,QAASI,EAAYlE,EAAS,IAAI,EAClC,MAAOA,EAAS,SAChB,IAAKA,EAAS,MAChB,CACF,CAGO,SAAS+E,EAAa,CAAE,KAAAR,EAAM,GAAAM,CAAG,EAAiBf,EAAsB,CAC7E,MAAO,CACL,KAAMS,EAAK,KACX,aAAAT,EACA,QAASI,EAAYK,EAAK,IAAI,EAC9B,MAAOM,EACP,IAAKA,CACP,CACF,CAOO,SAASG,EAAgB,CAC9B,OAAAlE,EACA,MAAAD,EACA,OAAAoE,CACF,EAIG,CACD,OAAOhB,EAAa,CAClB,OAAAnD,EACA,MAAAD,EACA,OAAAoE,EACA,QAAS,EACT,QAAS,KAAK,IAAInE,EAAO,IAAMA,EAAO,MAAOD,EAAM,IAAMA,EAAM,KAAK,CACtE,CAAC,CACH,CCtVA,IAAMqE,EAAc,CAAC,CAAE,KAAAC,CAAK,IAAwBC,EAAeD,CAAI,GAAKA,EAEvDE,EAArB,cAAqDC,CAAsD,CAA3G,kCACE,KAAiB,MAAmB,IAAIC,GACtCC,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,CAQA,MAAc,cACZC,EACA,CAAE,MAAAQ,EAAO,UAAAC,CAAU,EACnBpB,EACA,CACA,GAAM,CAAE,OAAAqB,CAAO,EAAIrB,EACbsB,EAAS,IAAI,IAAIF,EAAU,IAAI7B,CAAW,CAAC,EAC3CgC,EAAWJ,EAAM,OAAOK,GAAQ,CAACF,EAAO,IAAI/B,EAAYiC,CAAI,CAAC,CAAC,EAC9D,CAAE,MAAAC,CAAM,EAAI,MAAM,KAAK,MAAM,OAAO,OAAO,CAAE,OAAAJ,CAAO,CAAC,EACrDK,EAAU,IAAI,IAIpB,QAAWF,KAAQD,EAAU,CAC3B,IAAMI,EAAK,KAAK,OAAOH,EAAK,SAAW,GAAKC,CAAK,EAC3CG,EAAOF,EAAQ,IAAIC,CAAE,EACvBC,GACFA,EAAK,MAAM,KAAKJ,CAAI,EACpBI,EAAK,MAAQ,KAAK,IAAIA,EAAK,MAAOJ,EAAK,SAAW,CAAC,EACnDI,EAAK,IAAM,KAAK,IAAIA,EAAK,IAAKJ,EAAK,QAAQ,GAE3CE,EAAQ,IAAIC,EAAI,CACd,MAAO,CAACH,CAAI,EACZ,MAAOA,EAAK,SAAW,EACvB,IAAKA,EAAK,QACZ,CAAC,CAEL,CAeA,OAdc,MAAM,QAAQ,IAC1B,CAAC,GAAGE,EAAQ,OAAO,CAAC,EAAE,IAAI,MAAO,CAAE,MAAAG,EAAO,MAAAC,EAAO,IAAAC,CAAI,IAAM,CACzD,IAAMC,EAAQ,IAAI,IAAIH,EAAM,IAAIL,GAAQA,EAAK,IAAI,CAAC,EAC5CV,EAAQtB,GAAiBwC,EAAM,IAAIxC,CAAI,EACvC,CAAE,MAAAyC,EAAO,UAAAb,CAAU,EAAI,MAAM,KAAK,MAAM,OAAO,IACnDT,EACA,CAAE,MAAAmB,EAAO,IAAAC,CAAI,EACb,CAAE,OAAAV,EAAQ,KAAAP,EAAM,OAAQA,EAAM,QAAS,EAAG,MAAO,EAAM,CACzD,EACA,OAAOe,EAAM,IAAIL,GACfU,GAAaV,EAAMb,EAASS,EAAWa,EAAM,KAAK,CACpD,CACF,CAAC,CACH,GACa,KAAK,EAAE,OAAOV,GAAYA,IAAa,MAAS,CAC/D,CAQA,MAAc,eACZZ,EACAD,EACAV,EACA,CACA,IAAMmC,EAASnC,EAAK,YAAY,OAC5BA,EAAK,WAAW,IAAIoC,GAAQjC,EAAmB,KAAMiC,CAAI,CAAC,EAC1D,OACEC,EAASlC,EAAmB,KAAMH,EAAK,kBAAkB,EACzDY,EACJyB,IAAW,OACPF,EACAA,IAAW,QACTA,EAAO,KACL7B,GACEgC,EAAmBD,EAAQ/B,CAAM,GACjCgC,EAAmBhC,EAAQ+B,CAAM,CACrC,EACA,CAACA,CAAM,EACP,CAAC,EACT,GAAIzB,GAAU,SAAW,EACvB,MAAO,CAAC,EAEV,GAAM,CAAE,MAAAkB,EAAO,IAAAC,CAAI,EAAIrB,EACjBG,EAAS,iBAAiBH,EAAO,OAAO,IAAIoB,EAAM,eAAe,CAAC,IAAIC,EAAI,eAAe,CAAC,GAC1F,CAAE,MAAAE,EAAO,UAAAb,EAAW,MAAAD,CAAM,EAAI,MAAM,KAAK,UAC7CR,EACAD,EACAE,EACAZ,EACAa,CACF,EAGM0B,EAAO,CAAC,CAAE,KAAA/C,CAAK,IACnBoB,IAAa,OACT,EACAA,EAAS,UAAUN,GAAUgC,EAAmB9C,EAAMc,CAAM,CAAC,EAC7DkC,EAAY,MAAMxB,EAAaH,EAAQb,EAAK,eAAgB,IAChE,KAAK,cACHW,EACA,CAAE,MAAOQ,EAAM,OAAOK,GAAQe,EAAKf,CAAI,GAAK,CAAC,EAAG,UAAAJ,CAAU,EAC1DpB,CACF,CACF,EACMyC,EAAQC,GAAcT,EAAM,KAAK,EACjC7B,EAAcC,EAAsB,IAAI,EACxCsC,EAAUC,GACdpC,EAAiBJ,EAAab,EAAYqD,CAAI,CAAC,EAC3CC,EAAazB,EAAU,OAAO0B,GAAKA,EAAE,OAASnC,CAAO,EACrDW,EAASF,EACZ,OAAO2B,GAAYA,EAAS,OAASpC,GAAW4B,EAAKQ,CAAQ,GAAK,CAAC,EACnE,IAAIC,IAAU,CACb,KAAMT,EAAKS,CAAK,EAChB,SAAUH,EAAW,QAAQI,GAC3BR,EAAMO,EAAOC,CAAS,EAAE,IAAIC,GAC1BC,EAAa,CACX,MAAAD,EACA,OAAQD,EACR,MAAAD,EACA,aAActC,EAAO,aACrB,QAASA,EAAO,QAChB,iBAAkBiC,EAAOK,CAAK,CAChC,CAAC,CACH,CACF,CACF,EAAE,EACEI,EAAUZ,EAAU,IAAIjB,GAAY,CACxC,GAAM,CAAE,KAAAC,CAAK,EAAID,EACjB,MAAO,CACL,KAAMgB,EAAKf,CAAI,EACf,SAAU,CACR6B,EAAgB,CACd,OAAQ,CACN,KAAM1C,EACN,aAAcD,EAAO,aACrB,QAASA,EAAO,QAChB,MAAOc,EAAK,SACZ,IAAKA,EAAK,MACZ,EACA,MAAO8B,EAAa/B,EAAUoB,EAAOnB,CAAI,CAAC,EAC1C,OAAQD,EAAS,MACnB,CAAC,CACH,CACF,CACF,CAAC,EACD,MAAO,CAAC,GAAGD,EAAQ,GAAG8B,CAAO,EAC1B,KAAK,CAACG,EAAG,IAAMA,EAAE,KAAO,EAAE,IAAI,EAC9B,QAAQnB,GAAQA,EAAK,QAAQ,CAClC,CASA,MAAc,aACZzB,EACAD,EACA8C,EACAxD,EACA,CACA,IAAMyD,EAAQD,EAAM,IAAIE,IAAS,CAC/B,KAAAA,EACA,cAAevD,EAAmB,KAAMuD,EAAK,iBAAiB,EAC9D,WAAYvD,EAAmB,KAAMuD,EAAK,kBAAkB,CAC9D,EAAE,EACI7C,EAAS8C,EAAgBH,CAAK,EAC9B,CAAE,MAAAvB,EAAO,UAAAb,EAAW,MAAAD,CAAM,EAAI,MAAM,KAAK,UAC7CR,EACAD,EACA+C,EAAM,QAAQG,GAAQ,CAACA,EAAK,cAAeA,EAAK,UAAU,CAAC,EAC3D5D,EACAa,CACF,EACM2B,EAAY,MAAMxB,EAAaH,EAAQb,EAAK,eAAgB,IAChE,KAAK,cAAcW,EAAS,CAAE,MAAAQ,EAAO,UAAAC,CAAU,EAAGpB,CAAI,CACxD,EACMyC,EAAQoB,GAAgB5B,EAAM,KAAK,EACnC6B,EAAWxD,GACfc,EAAU,OAAO0B,GAAKR,EAAmBQ,EAAE,KAAMxC,CAAM,CAAC,EACpDyD,EAAY,CAACzD,EAAgBG,IACjCqD,EAAQxD,CAAM,EAAE,IAAIsC,GAAQoB,GAASpB,EAAMnC,CAAY,CAAC,EACpDwD,EAAgB,CAAC3D,EAAgBG,IACrC+B,EACG,OAAO,CAAC,CAAE,KAAAhB,CAAK,IAAMc,EAAmBd,EAAK,KAAMlB,CAAM,CAAC,EAC1D,IAAIiB,GAAY+B,EAAa/B,EAAUd,CAAY,CAAC,EACnDyD,EAAU,CAACC,EAAkBC,IACjCD,EAAI,QAAQ9B,GACV+B,EAAM,IAAIpB,GAASK,EAAgB,CAAE,OAAAhB,EAAQ,MAAAW,EAAO,OAAQ,GAAI,CAAC,CAAC,CACpE,EACF,OAAOS,EAAM,QAAQ,CAAC,CAAE,KAAAC,EAAM,cAAAW,EAAe,WAAAC,CAAW,IAAM,CAC5D,GAAM,CAAE,kBAAAC,EAAmB,mBAAAC,CAAmB,EAAId,EAClD,MAAO,CACL,GAAGI,EAAQO,CAAa,EAAE,QAAQhC,GAChCyB,EAAQQ,CAAU,EAAE,QAAQtB,GAC1BP,EAAMO,EAAOX,CAAM,EAAE,IAAIa,GACvBC,EAAa,CACX,MAAAD,EACA,OAAAb,EACA,MAAAW,EACA,aAAcuB,EACd,QAASE,EAAYpC,EAAO,IAAI,EAChC,iBAAkBmC,CACpB,CAAC,CACH,CACF,CACF,EACA,GAAGN,EACDH,EAAUM,EAAeE,CAAiB,EAC1CN,EAAcK,EAAYE,CAAkB,CAC9C,EACA,GAAGN,EACDD,EAAcI,EAAeE,CAAiB,EAC9CR,EAAUO,EAAYE,CAAkB,CAC1C,CACF,CACF,CAAC,CACH,CAIA,YAAY9D,EAAgBV,EAA2B,CAAC,EAAG,CACzD,OAAO0E,EAA0B,MAAMC,GAAY,CACjD,IAAMhE,EACJD,EAAO,eAAiB,KAAK,OACzB,MAAM,KAAK,SAAS,QAAQA,EAAQV,CAAI,EACxC,OACN,GAAIW,IAAY,OAAW,CACzB,IAAM6C,EAAQoB,EAAe5E,CAAI,EAC3B6E,EACJrB,EAAM,OAAS,EACX,MAAM,KAAK,aAAa7C,EAASD,EAAQ8C,EAAOxD,CAAI,EACpD,MAAM,KAAK,eAAeW,EAASD,EAAQV,CAAI,EACrD,QAAW8E,KAAWD,EACpBF,EAAS,KAAKG,CAAO,CAEzB,CACAH,EAAS,SAAS,CACpB,EAAG3E,EAAK,MAAM,CAChB,CACF",
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", "r", "k", "lo", "hi", "y", "x", "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", "skipCrossing", "skip", "fragments", "name", "fragStart", "hapStart", "ids", "at", "walkSide", "crossingSide", "crossingFeature", "strand", "haplotypeOf", "name", "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", "skips", "fragments", "signal", "walked", "crossing", "skip", "chunk", "byChunk", "cs", "held", "group", "start", "end", "names", "graph", "skipCrossing", "wanted", "lane", "target", "panSNMatchesPrefix", "rank", "crossings", "align", "anchorAligner", "laneOf", "walk", "references", "f", "fragment", "query", "reference", "chain", "chainFeature", "skipped", "crossingFeature", "crossingSide", "a", "pairs", "sides", "pair", "lanePairsStatus", "side", "lanePairAligner", "walksOf", "walkSides", "walkSide", "crossingSides", "crossed", "own", "mates", "featurePrefix", "matePrefix", "queryAssemblyName", "targetAssemblyName", "panSNContig", "ObservableCreate", "observer", "requestedPairs", "features", "feature"]
7
- }