jbrowse-plugin-graphgenomeviewer 3.0.3 → 3.0.4
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.
- package/dist/chunks/GbzBaseSyntenyAdapter-6UTRY4CV.js +8 -0
- package/dist/chunks/GbzBaseSyntenyAdapter-6UTRY4CV.js.map +7 -0
- package/dist/jbrowse-plugin-graphgenomeviewer.esm.js +2 -2
- package/dist/jbrowse-plugin-graphgenomeviewer.esm.js.map +2 -2
- package/package.json +2 -2
- package/src/GbzBaseSyntenyAdapter/GbzBaseSyntenyAdapter.test.ts +260 -0
- package/src/GbzBaseSyntenyAdapter/GbzBaseSyntenyAdapter.ts +227 -40
- package/src/GbzBaseSyntenyAdapter/index.ts +9 -2
- package/src/synteny/ComparativeAdapterBase.ts +11 -2
- package/src/version.ts +1 -1
- package/dist/chunks/GbzBaseSyntenyAdapter-EFIOI2SN.js +0 -8
- package/dist/chunks/GbzBaseSyntenyAdapter-EFIOI2SN.js.map +0 -7
|
@@ -0,0 +1,7 @@
|
|
|
1
|
+
{
|
|
2
|
+
"version": 3,
|
|
3
|
+
"sources": ["global-externals:@jbrowse/core/util/installClearHoverOnSurfaceMove", "../../node_modules/.pnpm/@gmod+gbz-base@2.7.0/node_modules/@gmod/gbz-base/src/gbwt/node.ts", "../../node_modules/.pnpm/@gmod+gbz-base@2.7.0/node_modules/@gmod/gbz-base/src/gbwt/bytecode.ts", "../../node_modules/.pnpm/@gmod+gbz-base@2.7.0/node_modules/@gmod/gbz-base/src/gbwt/record.ts", "../../node_modules/.pnpm/@gmod+gbz-base@2.7.0/node_modules/@gmod/gbz-base/src/gbwt/sequence.ts", "../../node_modules/.pnpm/@gmod+gbz-base@2.7.0/node_modules/@gmod/gbz-base/src/graphName.ts", "../../node_modules/.pnpm/@gmod+gbz-base@2.7.0/node_modules/@gmod/gbz-base/src/pathName.ts", "../../node_modules/.pnpm/@gmod+gbz-base@2.7.0/node_modules/@gmod/gbz-base/src/lcs.ts", "../../node_modules/.pnpm/@gmod+gbz-base@2.7.0/node_modules/@gmod/gbz-base/src/pairAlignment.ts", "../../node_modules/.pnpm/@gmod+gbz-base@2.7.0/node_modules/@gmod/gbz-base/src/subgraph.ts", "../../node_modules/.pnpm/@gmod+gbz-base@2.7.0/node_modules/@gmod/gbz-base/src/query.ts", "../../node_modules/.pnpm/@gmod+gbz-base@2.7.0/node_modules/@gmod/gbz-base/src/sqlite/record.ts", "../../node_modules/.pnpm/@gmod+gbz-base@2.7.0/node_modules/@gmod/gbz-base/src/sqlite/btree.ts", "../../node_modules/.pnpm/@gmod+gbz-base@2.7.0/node_modules/@gmod/gbz-base/src/sqlite/pager.ts", "../../node_modules/.pnpm/@gmod+gbz-base@2.7.0/node_modules/@gmod/gbz-base/src/sqlite/database.ts", "../../node_modules/.pnpm/@gmod+gbz-base@2.7.0/node_modules/@gmod/gbz-base/src/db.ts", "../../src/GbzBaseSyntenyAdapter/GbzBaseSyntenyAdapter.ts", "../../src/synteny/ComparativeAdapterBase.ts", "../../node_modules/.pnpm/tslib@2.8.1/node_modules/tslib/tslib.es6.mjs", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/isFunction.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/createErrorClass.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/UnsubscriptionError.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/arrRemove.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/Subscription.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/config.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/scheduler/timeoutProvider.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/reportUnhandledError.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/noop.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/NotificationFactories.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/errorContext.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/Subscriber.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/symbol/observable.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/identity.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/pipe.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/Observable.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/lift.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/operators/OperatorSubscriber.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/isArrayLike.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/isPromise.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/isInteropObservable.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/isAsyncIterable.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/throwUnobservableError.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/symbol/iterator.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/isIterable.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/isReadableStreamLike.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/observable/innerFrom.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/util/executeSchedule.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/operators/observeOn.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/operators/subscribeOn.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/scheduled/scheduleObservable.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/scheduled/schedulePromise.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/scheduled/scheduleArray.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/scheduled/scheduleIterable.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/scheduled/scheduleAsyncIterable.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/scheduled/scheduleReadableStreamLike.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/scheduled/scheduled.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/observable/from.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/operators/map.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/operators/mergeInternals.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/operators/mergeMap.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/operators/scanInternals.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/operators/reduce.ts", "../../node_modules/.pnpm/rxjs@7.8.2/node_modules/rxjs/src/internal/operators/toArray.ts", "../../node_modules/.pnpm/@jbrowse+cigar-utils@5.0.0-beta.9/node_modules/@jbrowse/cigar-utils/esm/coarseCigar.js", "../../node_modules/.pnpm/@jbrowse+cigar-utils@5.0.0-beta.9/node_modules/@jbrowse/cigar-utils/esm/csOps.js", "../../node_modules/.pnpm/@jbrowse+cigar-utils@5.0.0-beta.9/node_modules/@jbrowse/cigar-utils/esm/cigarToMismatches2.js", "../../node_modules/.pnpm/@jbrowse+cigar-utils@5.0.0-beta.9/node_modules/@jbrowse/cigar-utils/esm/mdToMismatches2.js", "../../node_modules/.pnpm/@jbrowse+cigar-utils@5.0.0-beta.9/node_modules/@jbrowse/cigar-utils/esm/mismatchParser.js", "../../node_modules/.pnpm/@jbrowse+synteny-core@5.0.0-beta.9_@emotion+react@11.14.0_@types+react@19.3.0_react@19._e0d3f2cd9fb3ca518fba8dcf7794837f/node_modules/@jbrowse/synteny-core/esm/clipSyntenyFeature.js", "../../node_modules/.pnpm/@jbrowse+synteny-core@5.0.0-beta.9_@emotion+react@11.14.0_@types+react@19.3.0_react@19._e0d3f2cd9fb3ca518fba8dcf7794837f/node_modules/@jbrowse/synteny-core/esm/featureAlignmentOps.js", "../../node_modules/.pnpm/@jbrowse+synteny-core@5.0.0-beta.9_@emotion+react@11.14.0_@types+react@19.3.0_react@19._e0d3f2cd9fb3ca518fba8dcf7794837f/node_modules/@jbrowse/synteny-core/esm/index.js", "../../src/synteny/SyntenyFeature.ts", "../../src/synteny/clipFeatureToRegion.ts"],
|
|
4
|
+
"sourcesContent": ["module.exports = JBrowseExports[\"@jbrowse/core/util/installClearHoverOnSurfaceMove\"];", "export const ENDMARKER = 0\n\nexport type Orientation = 'forward' | 'reverse'\n\nexport function encodeNode(id: number, orientation: Orientation) {\n return 2 * id + (orientation === 'reverse' ? 1 : 0)\n}\n\nexport function nodeId(handle: number) {\n return Math.floor(handle / 2)\n}\n\nexport function nodeOrientation(handle: number): Orientation {\n return handle % 2 === 0 ? 'forward' : 'reverse'\n}\n\nexport function isReverse(handle: number) {\n return handle % 2 === 1\n}\n\nexport function flipNode(handle: number) {\n return handle % 2 === 0 ? handle + 1 : handle - 1\n}\n\nexport type NodeSide = 'left' | 'right'\n\nexport function flipSide(side: NodeSide): NodeSide {\n return side === 'left' ? 'right' : 'left'\n}\n\nexport function entrySide(orientation: Orientation): NodeSide {\n return orientation === 'forward' ? 'left' : 'right'\n}\n\nexport function exitSide(orientation: Orientation): NodeSide {\n return orientation === 'forward' ? 'right' : 'left'\n}\n\nexport function entryOrientation(side: NodeSide): Orientation {\n return side === 'left' ? 'forward' : 'reverse'\n}\n\nexport function exitOrientation(side: NodeSide): Orientation {\n return side === 'right' ? 'forward' : 'reverse'\n}\n\nexport function edgeIsCanonical(from: number, to: number) {\n const fromId = nodeId(from)\n const toId = nodeId(to)\n return isReverse(from)\n ? toId > fromId || (toId === fromId && !isReverse(to))\n : toId >= fromId\n}\n\nexport function pathIsCanonical(path: number[]) {\n return pathEndsAreCanonical(path[0], path[path.length - 1])\n}\n\nexport function pathEndsAreCanonical(\n first: number | undefined,\n last: number | undefined,\n) {\n if (first === undefined || last === undefined) {\n return true\n }\n return isReverse(first) === isReverse(last)\n ? !isReverse(first)\n : edgeIsCanonical(first, last)\n}\n", "export class ByteCodeReader {\n offset = 0\n private bytes: Uint8Array\n\n constructor(bytes: Uint8Array) {\n this.bytes = bytes\n }\n\n get done() {\n return this.offset >= this.bytes.length\n }\n\n byte() {\n const value = this.bytes[this.offset]\n if (value === undefined) {\n return undefined\n }\n this.offset += 1\n return value\n }\n\n int() {\n let shift = 1\n let result = 0\n while (this.offset < this.bytes.length) {\n const value = this.bytes[this.offset]!\n this.offset += 1\n result += (value & 0x7f) * shift\n shift *= 128\n if ((value & 0x80) === 0) {\n return result\n }\n }\n return undefined\n }\n}\n\nexport interface Run {\n value: number\n len: number\n}\n\nconst RLE_THRESHOLD = 255\nconst RLE_UNIVERSE = 256\n\nexport class RunReader {\n private source: ByteCodeReader\n private sigma: number\n private threshold: number\n\n constructor(bytes: Uint8Array, sigma: number) {\n this.source = new ByteCodeReader(bytes)\n this.sigma = sigma === 0 ? Number.MAX_SAFE_INTEGER : sigma\n this.threshold =\n this.sigma < RLE_THRESHOLD ? Math.floor(RLE_UNIVERSE / this.sigma) : 0\n }\n\n next(): Run | undefined {\n if (this.sigma >= RLE_THRESHOLD) {\n const value = this.source.int()\n const len = this.source.int()\n return value === undefined || len === undefined\n ? undefined\n : { value, len: len + 1 }\n }\n const byte = this.source.byte()\n if (byte === undefined) {\n return undefined\n }\n const value = byte % this.sigma\n let len = Math.floor(byte / this.sigma) + 1\n if (len === this.threshold) {\n const extra = this.source.int()\n if (extra === undefined) {\n return undefined\n }\n len += extra\n }\n return { value, len }\n }\n\n *[Symbol.iterator]() {\n for (let run = this.next(); run !== undefined; run = this.next()) {\n yield run\n }\n }\n}\n", "import { ByteCodeReader, RunReader } from './bytecode.ts'\nimport { ENDMARKER, flipNode, nodeId } from './node.ts'\n\nexport interface Pos {\n node: number\n offset: number\n}\n\nexport function decompressEdges(bytes: Uint8Array): Pos[] {\n const reader = new ByteCodeReader(bytes)\n const sigma = reader.int()\n if (sigma === undefined || sigma === 0) {\n return []\n }\n const edges: Pos[] = []\n let prev = 0\n for (let i = 0; i < sigma; i++) {\n const delta = reader.int()\n const offset = reader.int()\n if (delta === undefined || offset === undefined) {\n throw new Error('GBWT edge list ends early')\n }\n prev += delta\n edges.push({ node: prev, offset })\n }\n return edges\n}\n\nexport class GbwtRecord {\n readonly edges: Pos[]\n readonly bwt: Uint8Array\n\n constructor(edges: Pos[], bwt: Uint8Array) {\n this.edges = edges\n this.bwt = bwt\n }\n\n runs() {\n return new RunReader(this.bwt, this.edges.length)\n }\n\n private edge(rank: number) {\n const edge = this.edges[rank]\n if (edge === undefined) {\n throw new Error(\n `GBWT run refers to edge rank ${rank} of ${this.edges.length}`,\n )\n }\n return edge\n }\n\n lf(i: number): Pos | undefined {\n const offsets = this.edges.map(e => e.offset)\n let offset = 0\n for (const run of this.runs()) {\n const edge = this.edge(run.value)\n const soFar = offsets[run.value]!\n if (offset + run.len > i) {\n return edge.node === ENDMARKER\n ? undefined\n : { node: edge.node, offset: soFar + (i - offset) }\n }\n offsets[run.value] = soFar + run.len\n offset += run.len\n }\n return undefined\n }\n\n private edgeTo(node: number) {\n let low = 0\n let high = this.edges.length\n while (low < high) {\n const mid = (low + high) >> 1\n const edge = this.edges[mid]!\n if (edge.node === node) {\n return mid\n }\n if (edge.node < node) {\n low = mid + 1\n } else {\n high = mid\n }\n }\n return undefined\n }\n\n offsetTo(pos: Pos): number | undefined {\n if (pos.node === ENDMARKER) {\n return undefined\n }\n const rank = this.edgeTo(pos.node)\n if (rank === undefined) {\n return undefined\n }\n let succRank = this.edges[rank]!.offset\n if (succRank > pos.offset) {\n return undefined\n }\n let offset = 0\n for (const run of this.runs()) {\n offset += run.len\n if (run.value !== rank) {\n continue\n }\n succRank += run.len\n if (succRank > pos.offset) {\n return offset - (succRank - pos.offset)\n }\n }\n return undefined\n }\n\n predecessorAt(i: number): number | undefined {\n const counts = this.edges.map(e => ({\n node: e.node === ENDMARKER ? ENDMARKER : flipNode(e.node),\n count: 0,\n }))\n for (const run of this.runs()) {\n const entry = counts[run.value]\n if (entry) {\n entry.count += run.len\n }\n }\n for (let rank = 1; rank < counts.length; rank++) {\n const prev = counts[rank - 1] as { node: number; count: number }\n const curr = counts[rank] as { node: number; count: number }\n if (nodeId(prev.node) === nodeId(curr.node)) {\n counts[rank - 1] = curr\n counts[rank] = prev\n }\n }\n let offset = 0\n for (const entry of counts) {\n offset += entry.count\n if (offset > i) {\n return entry.node === ENDMARKER ? undefined : entry.node\n }\n }\n return undefined\n }\n\n decompressArrays() {\n const offsets = this.edges.map(e => e.offset)\n let total = 0\n for (const run of this.runs()) {\n total += run.len\n }\n const nodes = new Int32Array(total)\n const nextOffsets = new Int32Array(total)\n let i = 0\n for (const run of this.runs()) {\n const edge = this.edge(run.value)\n let offset = offsets[run.value]!\n for (let k = 0; k < run.len; k++) {\n nodes[i] = edge.node\n nextOffsets[i] = offset\n offset += 1\n i += 1\n }\n offsets[run.value] = offset\n }\n return { nodes, offsets: nextOffsets }\n }\n\n decompress(): Pos[] {\n const offsets = this.edges.map(e => e.offset)\n const result: Pos[] = []\n for (const run of this.runs()) {\n const edge = this.edge(run.value)\n for (let k = 0; k < run.len; k++) {\n result.push({ node: edge.node, offset: offsets[run.value]! })\n offsets[run.value] = offsets[run.value]! + 1\n }\n }\n return result\n }\n}\n", "const DECODE = ['', 'A', 'C', 'G', 'T', 'N']\n\nexport function encodedSequenceLength(encoded: Uint8Array) {\n const last = encoded[encoded.length - 1]\n if (last === undefined) {\n return 0\n }\n let value = last\n let inLast = 0\n for (let i = 0; i < 3; i++) {\n if (value % 6 === 0) {\n break\n }\n value = Math.floor(value / 6)\n inLast += 1\n }\n return 3 * (encoded.length - 1) + inLast\n}\n\nexport function decodeSequence(encoded: Uint8Array) {\n let result = ''\n for (const byte of encoded) {\n let value = byte\n for (let i = 0; i < 3; i++) {\n const base = DECODE[value % 6]!\n if (base === '') {\n return result\n }\n value = Math.floor(value / 6)\n result += base\n }\n }\n return result\n}\n\nconst COMPLEMENT: Record<string, string> = {\n A: 'T',\n C: 'G',\n G: 'C',\n T: 'A',\n N: 'N',\n}\n\nexport function reverseComplement(sequence: string) {\n let result = ''\n for (let i = sequence.length - 1; i >= 0; i--) {\n result += COMPLEMENT[sequence[i]!] ?? 'N'\n }\n return result\n}\n", "export interface GraphName {\n name: string | undefined\n subgraph: Map<string, Set<string>>\n translation: Map<string, Set<string>>\n}\n\nfunction parseRelationships(field: string | undefined, what: string) {\n const relationships = new Map<string, Set<string>>()\n if (field !== undefined) {\n for (const rel of field.split(';')) {\n const parts = rel.split(',')\n const [from, to] = parts\n if (parts.length !== 2 || !from || !to) {\n throw new Error(`Invalid ${what} relationship: ${rel}`)\n }\n let targets = relationships.get(from)\n if (!targets) {\n targets = new Set()\n relationships.set(from, targets)\n }\n targets.add(to)\n }\n }\n return relationships\n}\n\nexport function graphNameFromTags(tags: Map<string, string>): GraphName {\n return {\n name: tags.get('pggname'),\n subgraph: parseRelationships(tags.get('subgraph'), 'subgraph'),\n translation: parseRelationships(tags.get('translation'), 'translation'),\n }\n}\n\nfunction merge(into: Map<string, Set<string>>, from: Map<string, Set<string>>) {\n for (const [key, values] of from) {\n let targets = into.get(key)\n if (!targets) {\n targets = new Set()\n into.set(key, targets)\n }\n for (const value of values) {\n targets.add(value)\n }\n }\n}\n\nexport function subgraphName(name: string, parent: GraphName): GraphName {\n const result: GraphName = {\n name,\n subgraph: new Map(),\n translation: new Map(),\n }\n if (parent.name !== undefined) {\n result.subgraph.set(name, new Set([parent.name]))\n merge(result.subgraph, parent.subgraph)\n merge(result.translation, parent.translation)\n }\n return result\n}\n\nfunction sortedEntries(relationships: Map<string, Set<string>>) {\n return [...relationships.entries()]\n .sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0))\n .flatMap(([from, tos]) => [...tos].sort().map(to => [from, to] as const))\n}\n\nexport function gfaHeaderLines(graphName: GraphName) {\n const lines: string[] = []\n if (graphName.name !== undefined) {\n lines.push(`H\\tNM:Z:${graphName.name}`)\n }\n for (const [subgraph, supergraph] of sortedEntries(graphName.subgraph)) {\n lines.push(`H\\tSG:Z:${subgraph},${supergraph}`)\n }\n for (const [from, to] of sortedEntries(graphName.translation)) {\n lines.push(`H\\tTL:Z:${from},${to}`)\n }\n return lines\n}\n\nexport async function sha256Hex(chunks: Uint8Array[]) {\n const total = chunks.reduce((sum, chunk) => sum + chunk.length, 0)\n const bytes = new Uint8Array(total)\n let offset = 0\n for (const chunk of chunks) {\n bytes.set(chunk, offset)\n offset += chunk.length\n }\n const digest = await globalThis.crypto.subtle.digest('SHA-256', bytes)\n return [...new Uint8Array(digest)]\n .map(byte => byte.toString(16).padStart(2, '0'))\n .join('')\n}\n", "export interface PathName {\n sample: string\n contig: string\n haplotype: number\n fragment: number\n}\n\nexport interface PathQuery {\n sample?: string\n contig: string\n haplotype?: number\n}\n\nexport type PathRef = string | PathQuery\n\nexport const GENERIC_SAMPLE = '_gbwt_ref'\n\nexport function formatPathName(name: PathName, end: number) {\n return `${name.sample}#${name.haplotype}#${name.contig}[${name.fragment}-${end}]`\n}\n\nconst PAN_SN = /^([^#]+)#(\\d+)#([^#]+?)(?:\\[\\d+-\\d+\\])?$/\nconst BARE_CONTIG = /^([^#]+?)(?:\\[\\d+-\\d+\\])?$/\n\nexport function parsePathName(name: string): PathQuery {\n const panSn = PAN_SN.exec(name)\n if (panSn) {\n return {\n sample: panSn[1]!,\n haplotype: Number(panSn[2]),\n contig: panSn[3]!,\n }\n }\n const bare = BARE_CONTIG.exec(name)\n if (bare) {\n return { contig: bare[1]! }\n }\n throw new Error(\n `\"${name}\" is not a path name; expected \"sample#haplotype#contig\" or a bare contig`,\n )\n}\n\nexport function toPathQuery(ref: PathRef) {\n return typeof ref === 'string' ? parsePathName(ref) : ref\n}\n\nexport function pathNameFor(query: PathQuery, fragment: number): PathName {\n return {\n sample: query.sample ?? GENERIC_SAMPLE,\n contig: query.contig,\n haplotype: query.haplotype ?? 0,\n fragment,\n }\n}\n", "type Weight = (x: number) => number\n\nfunction lowerBound(ascending: number[], value: number) {\n let lo = 0\n let hi = ascending.length\n while (lo < hi) {\n const mid = (lo + hi) >> 1\n if (ascending[mid]! < value) {\n lo = mid + 1\n } else {\n hi = mid\n }\n }\n return lo\n}\n\nclass ColumnMax {\n readonly ending: Float64Array\n private readonly tree: Int32Array\n\n constructor(columns: number) {\n this.ending = new Float64Array(columns)\n this.tree = new Int32Array(columns + 1).fill(-1)\n }\n\n bestBefore(column: number) {\n let best = -1\n for (let p = column; p > 0; p -= p & -p) {\n const candidate = this.tree[p]!\n if (\n candidate !== -1 &&\n (best === -1 || this.ending[candidate]! > this.ending[best]!)\n ) {\n best = candidate\n }\n }\n return best\n }\n\n raise(column: number, value: number) {\n this.ending[column] = value\n for (let p = column + 1; p < this.tree.length; p += p & -p) {\n const holder = this.tree[p]!\n if (holder === -1 || value > this.ending[holder]!) {\n this.tree[p] = column\n }\n }\n }\n}\n\ninterface Trace {\n row: Int32Array\n column: Int32Array\n previous: Int32Array\n endingMatch: Int32Array\n count: number\n}\n\nclass SparseLcs {\n readonly pairs: [number, number][] = []\n total = 0\n private readonly a: number[]\n private readonly b: number[]\n private readonly weight: Weight\n private readonly occurrences = new Map<number, number[]>()\n\n constructor(a: number[], b: number[], weight: Weight) {\n this.a = a\n this.b = b\n this.weight = weight\n b.forEach((x, j) => {\n const list = this.occurrences.get(x)\n if (list) {\n list.push(j)\n } else {\n this.occurrences.set(x, [j])\n }\n })\n }\n\n solve(a0: number, a1: number, b0: number, b1: number) {\n let prefix = 0\n while (\n a0 + prefix < a1 &&\n b0 + prefix < b1 &&\n this.a[a0 + prefix] === this.b[b0 + prefix]\n ) {\n this.match(a0 + prefix, b0 + prefix)\n prefix += 1\n }\n let suffix = 0\n while (\n a1 - suffix > a0 + prefix &&\n b1 - suffix > b0 + prefix &&\n this.a[a1 - suffix - 1] === this.b[b1 - suffix - 1]\n ) {\n suffix += 1\n }\n this.solveMiddle(a0 + prefix, a1 - suffix, b0 + prefix, b1 - suffix)\n for (let k = suffix; k > 0; k--) {\n this.match(a1 - k, b1 - k)\n }\n }\n\n private match(i: number, j: number) {\n this.pairs.push([i, j])\n this.total += this.weight(this.a[i]!)\n }\n\n private solveMiddle(a0: number, a1: number, b0: number, b1: number) {\n if (a0 === a1 || b0 === b1) {\n return\n }\n const matches = this.matchCount(a0, a1, b0, b1)\n if (matches === 0) {\n return\n }\n if (matches <= a1 - a0 + (b1 - b0)) {\n this.chain(a0, a1, b0, b1, matches)\n return\n }\n const mid = (a0 + a1) >> 1\n const split = this.split(a0, mid, a1, b0, b1)\n this.solve(a0, mid, b0, split)\n this.solve(mid, a1, split, b1)\n }\n\n private matchCount(a0: number, a1: number, b0: number, b1: number) {\n let count = 0\n for (let i = a0; i < a1; i++) {\n const list = this.occurrences.get(this.a[i]!)\n if (list) {\n count += lowerBound(list, b1) - lowerBound(list, b0)\n }\n }\n return count\n }\n\n private sweep(\n from: number,\n to: number,\n step: 1 | -1,\n b0: number,\n b1: number,\n columns: ColumnMax,\n trace?: Trace,\n ) {\n for (let i = from; i !== to; i += step) {\n const list = this.occurrences.get(this.a[i]!)\n if (!list) {\n continue\n }\n const w = this.weight(this.a[i]!)\n const lo = lowerBound(list, b0)\n const hi = lowerBound(list, b1)\n for (let k = 0; k < hi - lo; k++) {\n const column =\n step === 1 ? list[hi - 1 - k]! - b0 : b1 - 1 - list[lo + k]!\n const before = columns.bestBefore(column)\n const value = (before === -1 ? 0 : columns.ending[before]!) + w\n if (value > columns.ending[column]!) {\n columns.raise(column, value)\n if (trace) {\n const match = trace.count++\n trace.row[match] = i\n trace.column[match] = column\n trace.previous[match] =\n before === -1 ? -1 : trace.endingMatch[before]!\n trace.endingMatch[column] = match\n }\n }\n }\n }\n }\n\n private chain(\n a0: number,\n a1: number,\n b0: number,\n b1: number,\n matches: number,\n ) {\n const columns = new ColumnMax(b1 - b0)\n const trace: Trace = {\n row: new Int32Array(matches),\n column: new Int32Array(matches),\n previous: new Int32Array(matches),\n endingMatch: new Int32Array(b1 - b0),\n count: 0,\n }\n this.sweep(a0, a1, 1, b0, b1, columns, trace)\n const last = columns.bestBefore(b1 - b0)\n if (last === -1) {\n return\n }\n this.total += columns.ending[last]!\n const chained: [number, number][] = []\n for (\n let match = trace.endingMatch[last]!;\n match !== -1;\n match = trace.previous[match]!\n ) {\n chained.push([trace.row[match]!, b0 + trace.column[match]!])\n }\n for (let k = chained.length - 1; k >= 0; k--) {\n this.pairs.push(chained[k]!)\n }\n }\n\n private frontier(\n from: number,\n to: number,\n step: 1 | -1,\n b0: number,\n b1: number,\n ) {\n const columns = new ColumnMax(b1 - b0)\n this.sweep(from, to, step, b0, b1, columns)\n const best = new Float64Array(b1 - b0 + 1)\n for (let column = 0; column < b1 - b0; column++) {\n best[column + 1] = Math.max(best[column]!, columns.ending[column]!)\n }\n return best\n }\n\n private split(a0: number, mid: number, a1: number, b0: number, b1: number) {\n const width = b1 - b0\n const before = this.frontier(a0, mid, 1, b0, b1)\n const after = this.frontier(a1 - 1, mid - 1, -1, b0, b1)\n let split = 0\n let best = -1\n for (let s = 0; s <= width; s++) {\n const combined = before[s]! + after[width - s]!\n if (combined > best) {\n best = combined\n split = s\n }\n }\n return b0 + split\n }\n}\n\nexport function weightedLcs(\n a: number[],\n b: number[],\n weight: Weight,\n): [pairs: [number, number][], weight: number] {\n const lcs = new SparseLcs(a, b, weight)\n lcs.solve(0, a.length, 0, b.length)\n return [lcs.pairs, lcs.total]\n}\n", "import { isReverse, nodeId } from './gbwt/node.ts'\nimport { reverseComplement } from './gbwt/sequence.ts'\n\nexport type PairOp = '=' | 'X' | 'I' | 'D'\nexport type PairEdit = [PairOp, number]\n\nexport interface PairChain {\n queryStart: number\n queryEnd: number\n targetStart: number\n targetEnd: number\n strand: '+' | '-'\n edits: PairEdit[]\n // bases on nodes both walks visit; the other `=` came from comparing bases\n sharedBases: number\n}\n\nexport interface PairOptions {\n maxGap?: number\n minMatch?: number\n}\n\n// An exact match: query [qs, qe) against target [ts, te), the target read\n// backwards when flipped.\ninterface Run {\n qs: number\n qe: number\n ts: number\n te: number\n flipped: boolean\n}\n\nconst DEFAULT_MIN_MATCH = 100\nconst MAX_ALIGNED_CELLS = 4_000_000\nconst CHAIN_LOOKBACK = 5000\nconst KMER = 15\nconst MAX_KMER_OCCURRENCES = 64\n// each level's gaps lie strictly inside the last, so this only bounds the work\nconst MAX_FILL_DEPTH = 8\n\n// vg's scoring, the model the reference CIGARs in subgraph.ts are scored by\nconst MATCH = 1\nconst MISMATCH = -4\nconst GAP_OPEN = -6\nconst GAP_EXTEND = -1\nconst UNREACHABLE = -(2 ** 30)\n\nconst DIAGONAL = 0\nconst INSERTION = 1\nconst DELETION = 2\n\nfunction appendEdit(edits: PairEdit[], op: PairOp, 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\nfunction best(diagonal: number, insertion: number, deletion: number) {\n return diagonal >= deletion && diagonal >= insertion\n ? DIAGONAL\n : deletion >= insertion\n ? DELETION\n : INSERTION\n}\n\n// The highest-scoring global alignment of a on b under affine gaps. Each cell\n// of `trace` packs, two bits apiece, the state each of the three states came\n// from. A tie goes to the diagonal, then to the deletion, so two stretches\n// with nothing in common read as an insertion followed by a deletion.\nfunction affineAlignment(a: string, b: string, edits: PairEdit[]) {\n const la = a.length\n const lb = b.length\n const width = lb + 1\n const trace = new Uint8Array((la + 1) * width)\n let diagonal = new Int32Array(width).fill(UNREACHABLE)\n let insertion = new Int32Array(width).fill(UNREACHABLE)\n let deletion = new Int32Array(width).fill(UNREACHABLE)\n diagonal[0] = 0\n for (let j = 1; j <= lb; j++) {\n deletion[j] = GAP_OPEN + (j - 1) * GAP_EXTEND\n trace[j] = (j === 1 ? DIAGONAL : DELETION) << 4\n }\n for (let i = 1; i <= la; i++) {\n const nextDiagonal = new Int32Array(width).fill(UNREACHABLE)\n const nextInsertion = new Int32Array(width).fill(UNREACHABLE)\n const nextDeletion = new Int32Array(width).fill(UNREACHABLE)\n nextInsertion[0] = GAP_OPEN + (i - 1) * GAP_EXTEND\n trace[i * width] = (i === 1 ? DIAGONAL : INSERTION) << 2\n const ai = a.charCodeAt(i - 1)\n for (let j = 1; j <= lb; j++) {\n const fromDiagonal = best(\n diagonal[j - 1]!,\n insertion[j - 1]!,\n deletion[j - 1]!,\n )\n nextDiagonal[j] =\n Math.max(diagonal[j - 1]!, insertion[j - 1]!, deletion[j - 1]!) +\n (ai === b.charCodeAt(j - 1) ? MATCH : MISMATCH)\n const fromInsertion = best(\n diagonal[j]! + GAP_OPEN,\n insertion[j]! + GAP_EXTEND,\n deletion[j]! + GAP_OPEN,\n )\n nextInsertion[j] = Math.max(\n diagonal[j]! + GAP_OPEN,\n insertion[j]! + GAP_EXTEND,\n deletion[j]! + GAP_OPEN,\n )\n const fromDeletion = best(\n nextDiagonal[j - 1]! + GAP_OPEN,\n nextInsertion[j - 1]! + GAP_OPEN,\n nextDeletion[j - 1]! + GAP_EXTEND,\n )\n nextDeletion[j] = Math.max(\n nextDiagonal[j - 1]! + GAP_OPEN,\n nextInsertion[j - 1]! + GAP_OPEN,\n nextDeletion[j - 1]! + GAP_EXTEND,\n )\n trace[i * width + j] =\n fromDiagonal | (fromInsertion << 2) | (fromDeletion << 4)\n }\n diagonal = nextDiagonal\n insertion = nextInsertion\n deletion = nextDeletion\n }\n const ops: PairOp[] = []\n let i = la\n let j = lb\n let state = best(diagonal[lb]!, insertion[lb]!, deletion[lb]!)\n while (i > 0 || j > 0) {\n const from = (trace[i * width + j]! >> (2 * state)) & 3\n if (state === DIAGONAL) {\n ops.push(a[i - 1] === b[j - 1] ? '=' : 'X')\n i -= 1\n j -= 1\n } else if (state === INSERTION) {\n ops.push('I')\n i -= 1\n } else {\n ops.push('D')\n j -= 1\n }\n state = from\n }\n for (const op of ops.reverse()) {\n appendEdit(edits, op, 1)\n }\n}\n\n// What a chain of walk steps pays to go from one run to the next over dq\n// private query bases and dt target ones. Those runs lie outside both walks'\n// repeats, so each has one place to go and the cost only has to let a chain\n// hold through a structural variant of any size: vg's charge for a short\n// indel, growing with the logarithm past it.\nfunction stepJumpCost(dq: number, dt: number) {\n const indel = Math.abs(dq - dt)\n const indelCost =\n indel === 0\n ? 0\n : Math.min(\n -GAP_OPEN - (indel - 1) * GAP_EXTEND,\n -GAP_OPEN + 10 * Math.log2(indel),\n )\n return indelCost + (Math.min(dq, dt) > 0 ? -MISMATCH : 0)\n}\n\n// What a chain of k-mer matches pays, which is minimap2's gap cost. Inside a\n// tandem array every copy offers a match, and the term that grows with the\n// indel is what keeps a chain in one register instead of hopping between\n// copies for a slightly longer match.\nfunction kmerJumpCost(dq: number, dt: number) {\n const indel = Math.abs(dq - dt)\n return indel === 0 ? 0 : 0.01 * KMER * indel + 0.5 * Math.log2(indel)\n}\n\ntype JumpCost = (dq: number, dt: number) => number\n\ninterface Link {\n run: Run\n trim: number\n}\n\ntype Interval = [number, number]\n\n// The stretch of a run from offset `from` to `to` along it\nfunction sliceRun(run: Run, from: number, to: number): Run {\n return {\n qs: run.qs + from,\n qe: run.qs + to,\n ts: run.flipped ? run.te - to : run.ts + from,\n te: run.flipped ? run.te - from : run.ts + to,\n flipped: run.flipped,\n }\n}\n\n// What is left of a run once taken bases are cut out of it, as the pieces a\n// k-mer long or more. An exact match divides at any base, so a flank that runs\n// one base into an inversion by chance costs the inversion one base, not all\n// of it.\nfunction untakenPieces(run: Run, query: Interval[], target: Interval[]) {\n const len = run.qe - run.qs\n const blocked: Interval[] = []\n for (const [s, e] of query) {\n const lo = Math.max(0, s - run.qs)\n const hi = Math.min(len, e - run.qs)\n if (lo < hi) {\n blocked.push([lo, hi])\n }\n }\n for (const [s, e] of target) {\n const lo = Math.max(0, run.flipped ? run.te - e : s - run.ts)\n const hi = Math.min(len, run.flipped ? run.te - s : e - run.ts)\n if (lo < hi) {\n blocked.push([lo, hi])\n }\n }\n if (blocked.length === 0) {\n return [run]\n }\n blocked.sort((x, y) => x[0] - y[0])\n const pieces: Run[] = []\n let from = 0\n for (const [lo, hi] of blocked) {\n if (lo - from >= KMER) {\n pieces.push(sliceRun(run, from, lo))\n }\n from = Math.max(from, hi)\n }\n if (len - from >= KMER) {\n pieces.push(sliceRun(run, from, len))\n }\n return pieces\n}\n\n// The best-scoring collinear chain of runs, then the best over the runs that\n// overlap no accepted run on either sequence, and so on: a second copy of a\n// repeat finds its target taken and an inversion finds its target free. A run\n// that overlaps its predecessor is trimmed from the front, which an exact\n// match allows at any base.\nfunction chainRuns(\n runs: Run[],\n maxGap: number,\n minMatch: number,\n jumpCost: JumpCost,\n maxChains = Infinity,\n) {\n const chains: Link[][] = []\n const basesTaken = { query: [] as Interval[], target: [] as Interval[] }\n const spanTaken = {\n forward: { query: [] as Interval[], target: [] as Interval[] },\n flipped: { query: [] as Interval[], target: [] as Interval[] },\n }\n let pool = [...runs].sort((a, b) => a.qs - b.qs || a.ts - b.ts)\n while (pool.length > 0 && chains.length < maxChains) {\n const score = pool.map(run => run.qe - run.qs)\n const back = new Int32Array(pool.length).fill(-1)\n const trims = new Int32Array(pool.length)\n for (let j = 0; j < pool.length; j++) {\n const b = pool[j]!\n const len = b.qe - b.qs\n for (let i = j - 1; i >= Math.max(0, j - CHAIN_LOOKBACK); i--) {\n if (score[i]! + len <= score[j]!) {\n continue\n }\n const a = pool[i]!\n const advances =\n a.flipped === b.flipped &&\n a.qs < b.qs &&\n (b.flipped ? b.te < a.te : a.ts < b.ts)\n if (advances) {\n const trim = Math.max(\n 0,\n a.qe - b.qs,\n b.flipped ? b.te - a.ts : a.te - b.ts,\n )\n const dq = b.qs + trim - a.qe\n const dt = b.flipped ? a.ts - (b.te - trim) : b.ts + trim - a.te\n if (trim < len && dq <= maxGap && dt <= maxGap) {\n const candidate = score[i]! + len - trim - jumpCost(dq, dt)\n if (candidate > score[j]!) {\n score[j] = candidate\n back[j] = i\n trims[j] = trim\n }\n }\n }\n }\n }\n let end = 0\n for (let j = 1; j < pool.length; j++) {\n if (score[j]! > score[end]!) {\n end = j\n }\n }\n const chain: Link[] = []\n for (let j = end; j >= 0; j = back[j]!) {\n chain.push({ run: pool[j]!, trim: trims[j]! })\n }\n chain.reverse()\n const matched = chain.reduce(\n (sum, { run, trim }) => sum + run.qe - run.qs - trim,\n 0,\n )\n if (matched < minMatch) {\n break\n }\n chains.push(chain)\n // A record's CIGAR accounts for every base between its ends in its own\n // orientation, so a later chain of that orientation may not nest in its\n // gaps: taking only the runs let one re-claim an earlier record's bases on\n // a paralog. An inversion is what a forward CIGAR cannot account for, so\n // across orientations only the bases themselves are taken.\n const first = chain[0]!\n const last = chain.at(-1)!\n const { flipped } = first.run\n const spans = flipped ? spanTaken.flipped : spanTaken.forward\n spans.query.push([first.run.qs + first.trim, last.run.qe])\n spans.target.push(\n flipped\n ? [last.run.ts, first.run.te - first.trim]\n : [first.run.ts + first.trim, last.run.te],\n )\n for (const { run, trim } of chain) {\n basesTaken.query.push([run.qs + trim, run.qe])\n basesTaken.target.push(\n run.flipped ? [run.ts, run.te - trim] : [run.ts + trim, run.te],\n )\n }\n pool = pool\n .flatMap(run => {\n const same = run.flipped ? spanTaken.flipped : spanTaken.forward\n return untakenPieces(\n run,\n [...basesTaken.query, ...same.query],\n [...basesTaken.target, ...same.target],\n )\n })\n .sort((x, y) => x.qs - y.qs || x.ts - y.ts)\n }\n return chains\n}\n\n// Exact matches of KMER bases or more between a and b, as runs along a\n// diagonal. A k-mer the target holds many times over seeds nothing.\nfunction forwardKmerRuns(a: string, b: string) {\n const index = new Map<string, number[]>()\n for (let p = 0; p + KMER <= b.length; p++) {\n const kmer = b.slice(p, p + KMER)\n const seen = index.get(kmer)\n if (seen) {\n seen.push(p)\n } else {\n index.set(kmer, [p])\n }\n }\n const runs: Run[] = []\n const open = new Map<number, Run>()\n for (let i = 0; i + KMER <= a.length; i++) {\n const hits = index.get(a.slice(i, i + KMER))\n if (hits && hits.length <= MAX_KMER_OCCURRENCES) {\n for (const p of hits) {\n const diagonal = p - i\n const run = open.get(diagonal)\n if (run && i <= run.qe) {\n run.qe = i + KMER\n run.te = p + KMER\n } else {\n const started = {\n qs: i,\n qe: i + KMER,\n ts: p,\n te: p + KMER,\n flipped: false,\n }\n open.set(diagonal, started)\n runs.push(started)\n }\n }\n }\n }\n return runs\n}\n\nfunction kmerRuns(a: string, b: string) {\n return [\n ...forwardKmerRuns(a, b),\n ...forwardKmerRuns(a, reverseComplement(b)).map(run => ({\n ...run,\n ts: b.length - run.te,\n te: b.length - run.ts,\n flipped: true,\n })),\n ]\n}\n\n// The edits of one chain: each run is a run of `=`, and what lies between two\n// runs goes to `between`. Edits read along the query; the caller reverses a\n// flipped chain's so they read along the target.\nfunction chainEdits(\n chain: Link[],\n a: string,\n b: string,\n edits: PairEdit[],\n between: (\n a: string,\n b: string,\n edits: PairEdit[],\n queryFrom: number,\n targetFrom: number,\n ) => void,\n) {\n let previous: Run | undefined\n for (const { run, trim } of chain) {\n const qs = run.qs + trim\n if (previous) {\n const targetFrom = run.flipped ? run.te - trim : previous.te\n const targetTo = run.flipped ? previous.ts : run.ts + trim\n const target = b.slice(targetFrom, targetTo)\n between(\n a.slice(previous.qe, qs),\n run.flipped ? reverseComplement(target) : target,\n edits,\n previous.qe,\n targetFrom,\n )\n }\n appendEdit(edits, '=', run.qe - qs)\n previous = run\n }\n}\n\n// Aligned exactly within the cell budget; past it an insertion and a deletion,\n// which claims no homology.\nfunction alignExact(a: string, b: string, edits: PairEdit[]) {\n if (a.length * b.length <= MAX_ALIGNED_CELLS) {\n affineAlignment(a, b, edits)\n } else {\n appendEdit(edits, 'I', a.length)\n appendEdit(edits, 'D', b.length)\n }\n}\n\n// The private bases between two runs of one chain, whose orientation the chain\n// has already fixed. Past the cell budget they are seeded on forward k-mers and\n// chained again, recursing into the gaps that chain leaves. It finds no\n// inversions, since the stretch has an orientation already.\nfunction fillGap(a: string, b: string, edits: PairEdit[], depth = 0) {\n const [chain] =\n a.length * b.length > MAX_ALIGNED_CELLS && depth < MAX_FILL_DEPTH\n ? chainRuns(forwardKmerRuns(a, b), Infinity, KMER, kmerJumpCost, 1)\n : []\n if (!chain) {\n alignExact(a, b, edits)\n return\n }\n const deeper = (qa: string, tb: string, into: PairEdit[]) => {\n fillGap(qa, tb, into, depth + 1)\n }\n const first = chain[0]!.run\n const last = chain.at(-1)!.run\n deeper(a.slice(0, first.qs), b.slice(0, first.ts), edits)\n chainEdits(chain, a, b, edits, deeper)\n deeper(a.slice(last.qe), b.slice(last.te), edits)\n}\n\nfunction fill(a: string, b: string, edits: PairEdit[]) {\n fillGap(a, b, edits)\n}\n\n// A chain as a record in the coordinates of the two strings it was made on\nfunction recordOf(chain: Link[], a: string, b: string): PairChain {\n const edits: PairEdit[] = []\n chainEdits(chain, a, b, edits, fill)\n const first = chain[0]!\n const last = chain.at(-1)!\n const { flipped } = first.run\n return {\n queryStart: first.run.qs + first.trim,\n queryEnd: last.run.qe,\n targetStart: flipped ? last.run.ts : first.run.ts + first.trim,\n targetEnd: flipped ? first.run.te - first.trim : last.run.te,\n strand: flipped ? '-' : '+',\n edits: flipped ? edits.reverse() : edits,\n sharedBases: 0,\n }\n}\n\n// The private bases between two shared nodes. A pair too large for the exact\n// alignment is seeded on shared k-mers in both orientations and chained the\n// way the walks are, which aligns two long copies of one sequence the graph\n// left apart. The best forward chain becomes edits. A flipped chain is an\n// inversion, which no CIGAR holds, so it comes back as a record of its own in\n// the coordinates of a and b. What no chain reaches is an insertion and a\n// deletion, which claims no homology.\nfunction alignPrivate(\n a: string,\n b: string,\n edits: PairEdit[],\n minMatch: number,\n): PairChain[] {\n let inversions: PairChain[] = []\n if (a.length * b.length <= MAX_ALIGNED_CELLS) {\n affineAlignment(a, b, edits)\n } else {\n const chains = chainRuns(\n kmerRuns(a, b),\n Infinity,\n Math.max(minMatch, KMER),\n kmerJumpCost,\n )\n const forward = chains.find(chain => !chain[0]!.run.flipped)\n inversions = chains\n .filter(chain => chain[0]!.run.flipped)\n .map(chain => recordOf(chain, a, b))\n if (forward) {\n // The forward record holds no inversion, so an inversion's bases stay\n // unaligned in it. A gap that hides one is not seeded again: at a tandem\n // array that finds only a neighbouring copy, matched forward over bases\n // the inversion's own record already claims.\n const forwardFill = (\n qa: string,\n tb: string,\n into: PairEdit[],\n queryFrom: number,\n targetFrom: number,\n ) => {\n const hidesInversion = inversions.some(\n inversion =>\n (queryFrom < inversion.queryEnd &&\n inversion.queryStart < queryFrom + qa.length) ||\n (targetFrom < inversion.targetEnd &&\n inversion.targetStart < targetFrom + tb.length),\n )\n if (hidesInversion) {\n alignExact(qa, tb, into)\n } else {\n fillGap(qa, tb, into)\n }\n }\n const first = forward[0]!.run\n const last = forward.at(-1)!.run\n forwardFill(a.slice(0, first.qs), b.slice(0, first.ts), edits, 0, 0)\n chainEdits(forward, a, b, edits, forwardFill)\n forwardFill(a.slice(last.qe), b.slice(last.te), edits, last.qe, last.te)\n } else {\n appendEdit(edits, 'I', a.length)\n appendEdit(edits, 'D', b.length)\n }\n }\n return inversions\n}\n\ninterface Claimed extends PairChain {\n // query stretches on nodes both walks visit\n shared: Interval[]\n}\n\ntype Side = 'query' | 'target'\n\n// Each edit of a record with the query and target position it sits at. A `-`\n// record's edits read along the target, so its query runs down from queryEnd.\nfunction forEachEdit(\n r: PairChain,\n visit: (op: PairOp, len: number, query: number, target: number) => void,\n) {\n const flipped = r.strand === '-'\n let qi = 0\n let ti = 0\n for (const [op, len] of r.edits) {\n visit(\n op,\n len,\n flipped ? r.queryEnd - 1 - qi : r.queryStart + qi,\n r.targetStart + ti,\n )\n if (op !== 'D') {\n qi += len\n }\n if (op !== 'I') {\n ti += len\n }\n }\n}\n\n// A record's score under vg's model over [lo, hi) on one side: a column counts\n// where its base on that side does, and a gap where it opens on that side.\nfunction scoreOver(r: PairChain, side: Side, lo: number, hi: number) {\n const step = side === 'query' && r.strand === '-' ? -1 : 1\n let score = 0\n forEachEdit(r, (op, len, query, target) => {\n const from = side === 'query' ? query : target\n const inside = (k: number) => {\n const at = from + step * k\n return at >= lo && at < hi\n }\n if (op === '=' || op === 'X') {\n for (let k = 0; k < len; k++) {\n if (inside(k)) {\n score += op === '=' ? MATCH : MISMATCH\n }\n }\n } else if ((op === 'I') === (side === 'query')) {\n for (let k = 0; k < len; k++) {\n if (inside(k)) {\n score += k === 0 ? GAP_OPEN : GAP_EXTEND\n }\n }\n } else if (inside(0)) {\n score += GAP_OPEN + (len - 1) * GAP_EXTEND\n }\n })\n return score\n}\n\nfunction spanOf(r: PairChain, side: Side): Interval {\n return side === 'query'\n ? [r.queryStart, r.queryEnd]\n : [r.targetStart, r.targetEnd]\n}\n\n// A record's edits with the aligned columns `lost` marks turned into an\n// insertion and a deletion, and its ends trimmed to the columns it keeps.\nfunction withoutColumns(r: Claimed, lost: Uint8Array): Claimed | undefined {\n const flipped = r.strand === '-'\n const edits: PairEdit[] = []\n let pendingQuery = 0\n let pendingTarget = 0\n let column = 0\n let sharedLost = 0\n const sharedMask = new Uint8Array(r.queryEnd - r.queryStart)\n for (const [s, e] of r.shared) {\n sharedMask.fill(1, s - r.queryStart, e - r.queryStart)\n }\n const inShared = (at: number) => sharedMask[at - r.queryStart] === 1\n const flush = () => {\n appendEdit(edits, 'I', pendingQuery)\n appendEdit(edits, 'D', pendingTarget)\n pendingQuery = 0\n pendingTarget = 0\n }\n forEachEdit(r, (op, len, query) => {\n if (op === 'I') {\n pendingQuery += len\n } else if (op === 'D') {\n pendingTarget += len\n } else {\n for (let k = 0; k < len; k++) {\n if (lost[column + k]) {\n pendingQuery += 1\n pendingTarget += 1\n if (inShared(flipped ? query - k : query + k)) {\n sharedLost += 1\n }\n } else {\n if (pendingQuery > 0 || pendingTarget > 0) {\n flush()\n }\n appendEdit(edits, op, 1)\n }\n }\n column += len\n }\n })\n flush()\n const lead = { I: 0, D: 0 }\n while (edits[0]?.[0] === 'I' || edits[0]?.[0] === 'D') {\n const [op, len] = edits.shift()!\n lead[op as 'I' | 'D'] += len\n }\n const tail = { I: 0, D: 0 }\n while (edits.at(-1)?.[0] === 'I' || edits.at(-1)?.[0] === 'D') {\n const [op, len] = edits.pop()!\n tail[op as 'I' | 'D'] += len\n }\n return edits.length === 0\n ? undefined\n : {\n ...r,\n queryStart: r.queryStart + (flipped ? tail.I : lead.I),\n queryEnd: r.queryEnd - (flipped ? lead.I : tail.I),\n targetStart: r.targetStart + lead.D,\n targetEnd: r.targetEnd - tail.D,\n edits,\n sharedBases: r.sharedBases - sharedLost,\n }\n}\n\n// A base aligns in one record at most. Where two records align the same bases\n// on either walk, the one scoring higher over the stretch their spans share\n// keeps them, and the other gives them up as an insertion and a deletion. In a\n// tandem array whose copies run both ways, one query copy aligns forward to one\n// target copy and inverted to another, and both are homology; the scoring\n// decides which one the pair's picture shows.\nfunction claimOnce(\n records: Claimed[],\n queryLength: number,\n targetLength: number,\n minMatch: number,\n) {\n const claims = {\n query: new Uint8Array(queryLength),\n target: new Uint8Array(targetLength),\n }\n const columnsOf = records.map(r => {\n const columns: [number, number][] = []\n forEachEdit(r, (op, len, query, target) => {\n if (op === '=' || op === 'X') {\n for (let k = 0; k < len; k++) {\n columns.push([r.strand === '-' ? query - k : query + k, target + k])\n }\n }\n })\n for (const [query, target] of columns) {\n claims.query[query] = Math.min(255, claims.query[query]! + 1)\n claims.target[target] = Math.min(255, claims.target[target]! + 1)\n }\n return columns\n })\n const holders = {\n query: new Map<number, number[]>(),\n target: new Map<number, number[]>(),\n }\n columnsOf.forEach((columns, i) => {\n for (const [query, target] of columns) {\n for (const [side, at] of [\n ['query', query],\n ['target', target],\n ] as const) {\n if (claims[side][at]! > 1) {\n const held = holders[side].get(at)\n if (!held) {\n holders[side].set(at, [i])\n } else if (held.at(-1) !== i) {\n held.push(i)\n }\n }\n }\n }\n })\n const beaten = new Map<string, boolean>()\n const losesTo = (i: number, j: number, side: Side) => {\n const key = `${side}:${i}:${j}`\n let loses = beaten.get(key)\n if (loses === undefined) {\n const [si, ei] = spanOf(records[i]!, side)\n const [sj, ej] = spanOf(records[j]!, side)\n const lo = Math.max(si, sj)\n const hi = Math.min(ei, ej)\n loses =\n scoreOver(records[i]!, side, lo, hi) <\n scoreOver(records[j]!, side, lo, hi)\n beaten.set(key, loses)\n }\n return loses\n }\n return records.flatMap((r, i) => {\n const columns = columnsOf[i]!\n const lost = new Uint8Array(columns.length)\n columns.forEach(([query, target], c) => {\n for (const [side, at] of [\n ['query', query],\n ['target', target],\n ] as const) {\n if (\n !lost[c] &&\n holders[side].get(at)?.some(j => j !== i && losesTo(i, j, side))\n ) {\n lost[c] = 1\n }\n }\n })\n if (!lost.includes(1)) {\n return [r]\n }\n const kept = withoutColumns(r, lost)\n const matched =\n kept?.edits.reduce((sum, [op, len]) => sum + (op === '=' ? len : 0), 0) ??\n 0\n return kept && matched >= minMatch ? [kept] : []\n })\n}\n\nfunction walkSequence(walk: number[], sequenceOf: (id: number) => string) {\n return walk\n .map(handle => {\n const sequence = sequenceOf(nodeId(handle))\n return isReverse(handle) ? reverseComplement(sequence) : sequence\n })\n .join('')\n}\n\nfunction walkOffsets(walk: number[], sequenceOf: (id: number) => string) {\n const offsets = [0]\n for (const handle of walk) {\n offsets.push(offsets.at(-1)! + sequenceOf(nodeId(handle)).length)\n }\n return offsets\n}\n\n// The steps between a walk's first and last visit to any node it visits more\n// than once. Copies of a repeat folded onto one node say nothing about which\n// copy of one haplotype pairs with which copy of the other, and a graph can\n// pair them out of register, so there the bases decide.\nfunction repeatSteps(walk: number[]) {\n const first = new Map<number, number>()\n const last = new Map<number, number>()\n walk.forEach((handle, i) => {\n const id = nodeId(handle)\n if (first.has(id)) {\n last.set(id, i)\n } else {\n first.set(id, i)\n }\n })\n const change = new Int32Array(walk.length + 1)\n for (const [id, end] of last) {\n change[first.get(id)!]! += 1\n change[end + 1]! -= 1\n }\n const inside = new Uint8Array(walk.length)\n let depth = 0\n for (let i = 0; i < walk.length; i++) {\n depth += change[i]!\n inside[i] = depth > 0 ? 1 : 0\n }\n return inside\n}\n\n// Every stretch of steps the two walks take through the same nodes, in the\n// same order or the opposite one, outside both walks' repeats.\nfunction sharedRuns(\n query: number[],\n target: number[],\n queryOffsets: number[],\n targetOffsets: number[],\n) {\n const queryRepeat = repeatSteps(query)\n const targetRepeat = repeatSteps(target)\n const visits = new Map<number, number[]>()\n target.forEach((handle, rank) => {\n if (!targetRepeat[rank]) {\n visits.set(nodeId(handle), [rank])\n }\n })\n const width = 2 * target.length\n const key = (i: number, rank: number, flipped: boolean) =>\n i * width + 2 * rank + (flipped ? 1 : 0)\n const seeds = new Set<number>()\n query.forEach((handle, i) => {\n for (const rank of queryRepeat[i]\n ? []\n : (visits.get(nodeId(handle)) ?? [])) {\n seeds.add(key(i, rank, isReverse(handle) !== isReverse(target[rank]!)))\n }\n })\n const runs: Run[] = []\n query.forEach((handle, i) => {\n for (const rank of queryRepeat[i]\n ? []\n : (visits.get(nodeId(handle)) ?? [])) {\n const flipped = isReverse(handle) !== isReverse(target[rank]!)\n const step = flipped ? -1 : 1\n if (!seeds.has(key(i - 1, rank - step, flipped))) {\n let j = i\n let r = rank\n while (\n j < query.length &&\n r >= 0 &&\n r < target.length &&\n seeds.has(key(j, r, flipped))\n ) {\n j += 1\n r += step\n }\n const lastRank = r - step\n runs.push({\n qs: queryOffsets[i]!,\n qe: queryOffsets[j]!,\n ts: targetOffsets[Math.min(rank, lastRank)]!,\n te: targetOffsets[Math.max(rank, lastRank) + 1]!,\n flipped,\n })\n }\n }\n })\n return runs\n}\n\n// A query walk's alignments to a target walk. A stretch of nodes both walks\n// visit is a run of `=`, a record is the best collinear chain of those\n// stretches, and what lies between two of them is aligned base by base under\n// vg's scoring, an inversion there coming back as a record of its own. A chain\n// pays for the gap it spans, so by default nothing bounds how far it reaches\n// but the window; maxGap caps that to bound the work. A record matching under\n// minMatch bases is dropped. Coordinates count from each walk's first base; a\n// `-` record's edits read along the target, the way minimap2 writes a\n// reverse-strand row.\nexport function pairAlignments(\n query: number[],\n target: number[],\n sequenceOf: (id: number) => string,\n opts: PairOptions = {},\n): PairChain[] {\n const a = walkSequence(query, sequenceOf)\n const b = walkSequence(target, sequenceOf)\n const runs = sharedRuns(\n query,\n target,\n walkOffsets(query, sequenceOf),\n walkOffsets(target, sequenceOf),\n )\n const minMatch = opts.minMatch ?? DEFAULT_MIN_MATCH\n const records: Claimed[] = []\n for (const chain of chainRuns(\n runs,\n opts.maxGap ?? Infinity,\n minMatch,\n stepJumpCost,\n )) {\n const edits: PairEdit[] = []\n const first = chain[0]!\n const last = chain.at(-1)!\n const { flipped } = first.run\n chainEdits(chain, a, b, edits, (qa, tb, into, queryFrom, targetFrom) => {\n for (const inversion of alignPrivate(qa, tb, into, minMatch)) {\n const targetTo = targetFrom + tb.length\n records.push({\n ...inversion,\n queryStart: queryFrom + inversion.queryStart,\n queryEnd: queryFrom + inversion.queryEnd,\n targetStart: flipped\n ? targetTo - inversion.targetEnd\n : targetFrom + inversion.targetStart,\n targetEnd: flipped\n ? targetTo - inversion.targetStart\n : targetFrom + inversion.targetEnd,\n strand: flipped ? '+' : '-',\n edits: flipped ? inversion.edits.reverse() : inversion.edits,\n shared: [],\n })\n }\n })\n records.push({\n queryStart: first.run.qs + first.trim,\n queryEnd: last.run.qe,\n targetStart: flipped ? last.run.ts : first.run.ts + first.trim,\n targetEnd: flipped ? first.run.te - first.trim : last.run.te,\n strand: flipped ? '-' : '+',\n edits: flipped ? edits.reverse() : edits,\n sharedBases: chain.reduce(\n (sum, { run, trim }) => sum + run.qe - run.qs - trim,\n 0,\n ),\n shared: chain.map(({ run, trim }) => [run.qs + trim, run.qe]),\n })\n }\n return claimOnce(records, a.length, b.length, minMatch)\n .map(({ shared: _, ...record }) => record)\n .sort((x, y) => x.queryStart - y.queryStart)\n}\n\nexport function pairCigar(edits: PairEdit[]) {\n return edits.map(([op, len]) => `${len}${op}`).join('')\n}\n", "import {\n ENDMARKER,\n edgeIsCanonical,\n encodeNode,\n entryOrientation,\n entrySide,\n exitOrientation,\n exitSide,\n flipNode,\n flipSide,\n isReverse,\n nodeId,\n nodeOrientation,\n pathEndsAreCanonical,\n pathIsCanonical,\n} from './gbwt/node.ts'\nimport { gfaHeaderLines, sha256Hex, subgraphName } from './graphName.ts'\nimport { weightedLcs } from './lcs.ts'\nimport { pairAlignments, pairCigar } from './pairAlignment.ts'\nimport { formatPathName } from './pathName.ts'\n\nimport type {\n GBZBase,\n GbzPath,\n GbzRecord,\n HaplotypeAnchor,\n HaplotypeSample,\n IndexedPosition,\n} from './db.ts'\nimport type { NodeSide, Orientation } from './gbwt/node.ts'\nimport type { Pos } from './gbwt/record.ts'\nimport type { PathName } from './pathName.ts'\n\nexport type HaplotypeOutput = 'all' | 'distinct' | 'reference-only' | 'none'\n\nexport type SnarlOutput = 'none' | 'contained' | 'overlapping'\n\ntype HandleType =\n | { kind: 'snarl-exit'; snarl: [number, number] }\n | { kind: 'chain' }\n | { kind: 'regular' }\n\nexport interface PathPosition {\n seqOffset: number\n handle: number\n nodeOffset: number\n gbwtOffset: number\n}\n\nexport interface ReferencePath {\n position: PathPosition\n name: PathName\n handle: number\n}\n\nexport interface PathIdentity {\n pathHandle: number\n name: PathName\n orientation: Orientation\n hapStart: number\n hapEnd: number\n}\n\ninterface PathInfo {\n path: number[]\n offsets: number[]\n len: number\n weight: number | undefined\n identity: PathIdentity | undefined\n}\n\ntype EditOp = 'M' | 'I' | 'D'\ntype Edit = [EditOp, number]\n\nexport interface SubgraphPath {\n name: string\n weight?: number\n cigar?: string\n path: { id: string; is_reverse: boolean }[]\n}\n\nexport interface SubgraphJson {\n nodes: { id: string; sequence: string }[]\n edges: {\n from: string\n from_is_reverse: boolean\n to: string\n to_is_reverse: boolean\n }[]\n paths: SubgraphPath[]\n}\n\n// A step, and either end of an edge, is a GBWT handle: 2 * nodeId for the\n// forward orientation and 2 * nodeId + 1 for the reverse, which is how the\n// GBWT itself numbers them. nodeId and isReverse read the two halves back.\nexport interface CompactPath {\n name: string\n weight: number | undefined\n cigar: string | undefined\n steps: Int32Array\n}\n\nexport interface CompactSubgraph {\n // Ascending, one entry per node; nodeSequences runs parallel to it.\n nodeIds: Int32Array\n nodeSequences: string[]\n // Handle pairs laid end to end: edges[2i] -> edges[2i + 1].\n edges: Int32Array\n paths: CompactPath[]\n}\n\nexport interface AlignmentSpan {\n strand: '+' | '-'\n refStart: number\n refEnd: number\n cigar: string\n weight: number | undefined\n path: number[]\n start: Pos\n}\n\nexport type HaplotypeAlignment = AlignmentSpan &\n (\n | {\n resolved: true\n name: PathName\n label: string\n pathHandle: number\n hapStart: number\n hapEnd: number\n }\n | { resolved: false }\n )\n\nexport interface HaplotypeRef {\n sample: string\n haplotype: number\n}\n\nexport interface PairAlignmentOptions {\n target: HaplotypeRef\n query?: HaplotypeRef\n maxGap?: number\n}\n\nexport interface PairAlignment {\n query: PathName\n queryStart: number\n queryEnd: number\n strand: '+' | '-'\n target: PathName\n targetStart: number\n targetEnd: number\n cigar: string\n matches: number\n columns: number\n sharedBases: number\n}\n\nexport interface SubgraphOutputOptions {\n cigar?: boolean | undefined\n names?: 'anonymous' | 'resolved' | undefined\n}\n\nexport interface SubgraphOptions {\n limit?: number | undefined\n signal?: AbortSignal | undefined\n}\n\nexport class SubgraphLimitError extends Error {\n override name = 'SubgraphLimitError'\n readonly limit: number\n readonly windowBp: number | undefined\n readonly walkedBp: number | undefined\n\n constructor(limit: number, walk?: { windowBp: number; walkedBp: number }) {\n super(\n walk === undefined\n ? `Subgraph size limit of ${limit} nodes exceeded`\n : `Subgraph size limit of ${limit} nodes exceeded ${walk.walkedBp} bp into a ${walk.windowBp} bp window`,\n )\n this.limit = limit\n this.windowBp = walk?.windowBp\n this.walkedBp = walk?.walkedBp\n }\n}\n\nfunction sideBefore(\n a: [number, number, NodeSide],\n b: [number, number, NodeSide],\n) {\n return (\n a[0] < b[0] ||\n (a[0] === b[0] && (a[1] < b[1] || (a[1] === b[1] && a[2] < b[2])))\n )\n}\n\nclass SideQueue {\n private heap: [number, number, NodeSide][] = []\n\n push(distance: number, node: number, side: NodeSide) {\n const heap = this.heap\n heap.push([distance, node, side])\n let i = heap.length - 1\n while (i > 0) {\n const parent = (i - 1) >> 1\n if (sideBefore(heap[i]!, heap[parent]!)) {\n ;[heap[i], heap[parent]] = [heap[parent]!, heap[i]!]\n i = parent\n } else {\n break\n }\n }\n }\n\n pop() {\n const heap = this.heap\n const top = heap[0]\n const last = heap.pop()\n if (heap.length > 0 && last !== undefined) {\n heap[0] = last\n let i = 0\n for (;;) {\n const left = 2 * i + 1\n const right = left + 1\n let smallest = i\n if (left < heap.length && sideBefore(heap[left]!, heap[smallest]!)) {\n smallest = left\n }\n if (right < heap.length && sideBefore(heap[right]!, heap[smallest]!)) {\n smallest = right\n }\n if (smallest === i) {\n break\n }\n ;[heap[i], heap[smallest]] = [heap[smallest]!, heap[i]!]\n i = smallest\n }\n }\n return top\n }\n\n get size() {\n return this.heap.length\n }\n}\n\n// Which step of a walk matches which step of the reference, as two parallel\n// arrays rather than a list of pairs: there is one entry per step of every\n// walk being aligned, and a window at HPRC scale has millions of them.\ninterface Matches {\n pathAt: Int32Array\n refAt: Int32Array\n count: number\n}\n\nfunction asMatches(pairs: [number, number][]): Matches {\n const pathAt = new Int32Array(pairs.length)\n const refAt = new Int32Array(pairs.length)\n pairs.forEach(([a, b], i) => {\n pathAt[i] = a\n refAt[i] = b\n })\n return { pathAt, refAt, count: pairs.length }\n}\n\n// The first entry above `bound` of an ascending list, or undefined. Called\n// once per step of every walk being aligned, which is where `Array.find` hurt:\n// it allocated a closure over the bound each time, and scanned from the front\n// of a reference node's occurrence list, which a repeat locus makes long.\nfunction firstAbove(ascending: number[], bound: number) {\n let lo = 0\n let hi = ascending.length\n while (lo < hi) {\n const mid = (lo + hi) >> 1\n if (ascending[mid]! > bound) {\n hi = mid\n } else {\n lo = mid + 1\n }\n }\n return ascending[lo]\n}\n\nfunction posKey(pos: Pos) {\n return `${pos.node}:${pos.offset}`\n}\n\ninterface FragmentAlignment {\n strand: '+' | '-'\n refStart: number\n refEnd: number\n edits: Edit[]\n weight: number | undefined\n path: number[]\n start: Pos\n identity:\n | {\n pathHandle: number\n name: PathName\n hapStart: number\n hapEnd: number\n walkForward: boolean\n }\n | undefined\n}\n\nfunction joinable(a: FragmentAlignment, b: FragmentAlignment) {\n const insertion = b.identity!.hapStart - a.identity!.hapEnd\n const deletion =\n a.strand === '+' ? b.refStart - a.refEnd : a.refStart - b.refEnd\n return a.strand === b.strand && insertion >= 0 && deletion >= 0\n ? { insertion, deletion }\n : undefined\n}\n\nfunction joinPair(\n a: FragmentAlignment,\n b: FragmentAlignment,\n gap: { insertion: number; deletion: number },\n): FragmentAlignment {\n const [left, right] = a.strand === '+' ? [a, b] : [b, a]\n const edits = left.edits.map(([op, len]): Edit => [op, len])\n appendGap(edits, gap.insertion, gap.deletion)\n for (const [op, len] of right.edits) {\n appendEdit(edits, op, len)\n }\n const walkForward = a.identity!.walkForward\n const [first, second] = walkForward ? [a, b] : [b, a]\n return {\n strand: a.strand,\n refStart: left.refStart,\n refEnd: right.refEnd,\n edits,\n weight: undefined,\n path: [...first.path, ...second.path],\n start: first.start,\n identity: {\n pathHandle: a.identity!.pathHandle,\n name: a.identity!.name,\n hapStart: a.identity!.hapStart,\n hapEnd: b.identity!.hapEnd,\n walkForward,\n },\n }\n}\n\nfunction joinSiblings(fragments: FragmentAlignment[]) {\n if (fragments.some(f => f.weight !== undefined)) {\n return fragments\n }\n const byPath = new Map<number, number[]>()\n fragments.forEach((fragment, index) => {\n if (fragment.identity) {\n const siblings = byPath.get(fragment.identity.pathHandle)\n if (siblings) {\n siblings.push(index)\n } else {\n byPath.set(fragment.identity.pathHandle, [index])\n }\n }\n })\n const joined = new Map<number, FragmentAlignment>()\n const consumed = new Set<number>()\n for (const siblings of byPath.values()) {\n siblings.sort(\n (x, y) =>\n fragments[x]!.identity!.hapStart - fragments[y]!.identity!.hapStart,\n )\n let head = siblings[0]!\n let current = fragments[head]!\n for (const index of siblings.slice(1)) {\n const next = fragments[index]!\n const gap = joinable(current, next)\n if (gap) {\n current = joinPair(current, next, gap)\n consumed.add(index)\n } else {\n joined.set(head, current)\n head = index\n current = next\n }\n }\n joined.set(head, current)\n }\n return fragments.flatMap((fragment, index) =>\n consumed.has(index) ? [] : [joined.get(index) ?? fragment],\n )\n}\n\nfunction pathPosition(info: PathInfo, k: number): Pos {\n return { node: info.path[k]!, offset: info.offsets[k]! }\n}\n\nconst SCAN_GAP = 4096\n\nfunction handleRuns(sortedHandles: number[]) {\n const runs: [number, number][] = []\n for (const handle of sortedHandles) {\n const last = runs[runs.length - 1]\n if (last && handle - last[1] <= SCAN_GAP) {\n last[1] = handle\n } else {\n runs.push([handle, handle])\n }\n }\n return runs\n}\n\ninterface Anchor {\n pathHandle: number\n orientation: Orientation\n base: number\n}\n\nexport type ChainEnd =\n | 'in-fragment sample'\n | 'identified sibling'\n | 'out-of-window sample'\n | 'bound'\n | 'endmarker'\n | 'cycle'\n\nexport interface ChainRecord {\n fragments: number\n steps: number\n seeks: number\n reentries: number\n twinLandings: number\n end: ChainEnd\n pathHandle: number | undefined\n}\n\nexport interface IdentificationStats {\n interval: number\n scans: [number, number][]\n windowSamples: number\n fragmentLengths: number[]\n companionSeeks: number\n companionMisses: number\n graphLookups: number\n graphFetches: number\n chains: ChainRecord[]\n}\n\nexport type AnchorWalkEnd =\n | 'through the window'\n | 'before the window'\n | 'past the window'\n | 'ended in the window'\n | 'bound'\n\nexport interface AnchorWalkRecord {\n pathHandle: number\n from: 'anchor' | 'sample'\n steps: number\n pieces: number\n end: AnchorWalkEnd\n}\n\nexport interface AnchorWalkStats {\n spacing: number\n anchorOffset: number\n anchorNodeOffset: number\n anchorHandle: number\n referenceSteps: number\n rows: number\n walks: AnchorWalkRecord[]\n graphFetches: number\n scans: [number, number][]\n scanRows: number\n fallback: string | undefined\n ms: {\n reference: number\n rows: number\n walks: number\n scan: number\n sampled: number\n }\n}\n\ninterface SubgraphStats {\n orderedAlignments: number\n lcsAlignments: number\n identificationSteps: number\n identificationFetches: number\n identification: IdentificationStats\n anchorWalk: AnchorWalkStats | undefined\n}\n\nconst PREFETCH_RUN_GAP = 32768\n\ninterface WalkStep {\n pos: Pos\n at: number\n len: number\n}\n\nconst ANCHOR_WALK_MARGIN = 65536\n\nfunction rowidRuns(handles: number[]) {\n const sorted = [...handles].sort((a, b) => a - b)\n const runs: [number, number][] = []\n for (const handle of sorted) {\n const last = runs[runs.length - 1]\n if (last && handle - last[1] <= PREFETCH_RUN_GAP) {\n last[1] = handle\n } else {\n runs.push([handle, handle])\n }\n }\n return runs\n}\n\nexport class Subgraph {\n private records = new Map<number, GbzRecord>()\n private paths: PathInfo[] = []\n private twinStarts = new Set<string>()\n private refId: number | undefined\n private refPath: PathName | undefined\n private refHandle: number | undefined\n private refInterval: [number, number] | undefined\n private refIndexCache: Map<number, number[]> | undefined\n private refPrefixCache: number[] | undefined\n private walkedBp: number | undefined\n readonly stats: SubgraphStats = {\n orderedAlignments: 0,\n lcsAlignments: 0,\n identificationSteps: 0,\n identificationFetches: 0,\n identification: {\n interval: 0,\n scans: [],\n windowSamples: 0,\n fragmentLengths: [],\n companionSeeks: 0,\n companionMisses: 0,\n graphLookups: 0,\n graphFetches: 0,\n chains: [],\n },\n anchorWalk: undefined,\n }\n\n private db: GBZBase\n private readonly limit: number | undefined\n private readonly signal: AbortSignal | undefined\n\n constructor(db: GBZBase, opts: SubgraphOptions = {}) {\n this.db = db\n this.limit = opts.limit\n this.signal = opts.signal\n }\n\n get nodeCount() {\n return this.records.size / 2\n }\n\n get pathCount() {\n return this.paths.length\n }\n\n get referenceInterval() {\n return this.refInterval && this.refPath\n ? {\n name: this.refPath,\n start: this.refPath.fragment + this.refInterval[0],\n end: this.refPath.fragment + this.refInterval[1],\n }\n : undefined\n }\n\n hasNode(id: number) {\n return this.records.has(encodeNode(id, 'forward'))\n }\n\n hasHandle(handle: number) {\n return this.records.has(handle)\n }\n\n private record(handle: number) {\n const record = this.records.get(handle)\n if (!record) {\n throw new Error(`Subgraph has no record for handle ${handle}`)\n }\n return record\n }\n\n private sortedHandles() {\n return [...this.records.keys()].sort((a, b) => a - b)\n }\n\n private async addNode(id: number) {\n this.signal?.throwIfAborted()\n if (this.limit !== undefined && this.nodeCount >= this.limit) {\n throw new SubgraphLimitError(this.limit)\n }\n const forward = await this.db.getRecord(encodeNode(id, 'forward'))\n const reverse = await this.db.getRecord(encodeNode(id, 'reverse'))\n if (!forward || !reverse) {\n throw new Error(`Node ${id} does not exist in the graph`)\n }\n this.records.set(forward.handle, forward)\n this.records.set(reverse.handle, reverse)\n }\n\n private async ensureNode(id: number) {\n if (!this.hasNode(id)) {\n await this.addNode(id)\n }\n }\n\n private clearPaths() {\n this.paths = []\n this.twinStarts.clear()\n this.refId = undefined\n this.refPath = undefined\n this.refHandle = undefined\n this.refInterval = undefined\n this.refIndexCache = undefined\n this.refPrefixCache = undefined\n }\n\n async pathPosition(query: PathName): Promise<ReferencePath> {\n const path = await this.db.findPath(query)\n if (!path) {\n throw new Error(\n `Cannot find a path covering ${formatPathName(query, query.fragment)}`,\n )\n }\n if (!path.isIndexed) {\n throw new Error(\n `Path ${formatPathName(path.name, path.name.fragment)} has not been indexed for random access`,\n )\n }\n const queryOffset = query.fragment - path.name.fragment\n const indexed = await this.db.indexedPosition(path.handle, queryOffset)\n if (!indexed) {\n throw new Error(\n `Path ${formatPathName(path.name, path.name.fragment)} has not been indexed for random access`,\n )\n }\n return this.findPathPosition(\n path,\n queryOffset,\n indexed.pathOffset,\n indexed.pos,\n )\n }\n\n private async findPathPosition(\n path: GbzPath,\n queryOffset: number,\n startOffset: number,\n start: Pos,\n ): Promise<ReferencePath> {\n let pathOffset = startOffset\n let pos = start\n for (;;) {\n await this.ensureNode(nodeId(pos.node))\n const record = this.record(pos.node)\n if (pathOffset + record.sequenceLen > queryOffset) {\n return {\n position: {\n seqOffset: queryOffset,\n handle: pos.node,\n nodeOffset: queryOffset - pathOffset,\n gbwtOffset: pos.offset,\n },\n name: path.name,\n handle: path.handle,\n }\n }\n pathOffset += record.sequenceLen\n const next = record.gbwt().lf(pos.offset)\n if (!next) {\n throw new Error(\n `Path ${formatPathName(path.name, path.name.fragment)} does not contain offset ${queryOffset}`,\n )\n }\n pos = next\n }\n }\n\n async aroundPosition(handle: number, nodeOffset: number, context: number) {\n const id = nodeId(handle)\n await this.ensureNode(id)\n const record = this.record(handle)\n const orientation = nodeOrientation(handle)\n const active = new SideQueue()\n active.push(nodeOffset, id, entrySide(orientation))\n active.push(record.sequenceLen - nodeOffset - 1, id, exitSide(orientation))\n return this.insertContext(active, context)\n }\n\n prefetchReferenceWalk(reference: ReferencePath, len: number) {\n return this.prefetchReferenceRange(\n reference.handle,\n reference.position.seqOffset,\n reference.position.seqOffset + len,\n )\n }\n\n // One request for the reference walk's node records where their rowids are\n // close, and one per run of them where the walk crosses a gap in node ids\n // (AMY1's reference walk spans two gaps of millions), so the walk after it\n // never fetches leaf pages one at a time.\n private async prefetchReferenceRange(\n pathHandle: number,\n fromOffset: number,\n toOffset: number,\n ) {\n const [first, last] = await Promise.all([\n this.db.indexedPosition(pathHandle, fromOffset),\n this.db.indexedPosition(pathHandle, toOffset),\n ])\n if (first && last) {\n const a = first.pos.node\n const b = last.pos.node\n const whole = await this.db.prefetchRecords(\n Math.min(a, b),\n Math.max(a, b) + 1,\n )\n if (!whole) {\n const positions = await this.db.indexedPositionsBetween(\n pathHandle,\n fromOffset,\n toOffset,\n )\n const runs = rowidRuns(positions.map(p => p.pos.node))\n await Promise.all(\n runs.map(([lo, hi]) => this.db.prefetchRecords(lo, hi + 2)),\n )\n }\n }\n return first\n }\n\n async aroundInterval(start: PathPosition, len: number, context: number) {\n if (len === 0) {\n throw new Error('Interval length must be greater than 0')\n }\n this.walkedBp = 0\n try {\n return await this.walkInterval(start, len, context)\n } catch (error) {\n throw error instanceof SubgraphLimitError && error.windowBp === undefined\n ? new SubgraphLimitError(error.limit, {\n windowBp: len,\n walkedBp: this.walkedBp,\n })\n : error\n }\n }\n\n get referenceWalkedBp() {\n return this.walkedBp\n }\n\n private async walkInterval(\n start: PathPosition,\n len: number,\n context: number,\n ) {\n let pos: Pos = { node: start.handle, offset: start.gbwtOffset }\n let offset = start.nodeOffset\n let remaining = len\n const active = new SideQueue()\n for (;;) {\n const id = nodeId(pos.node)\n const orientation = nodeOrientation(pos.node)\n this.walkedBp = len - remaining\n await this.ensureNode(id)\n const record = this.record(pos.node)\n if (offset >= record.sequenceLen) {\n throw new Error(\n `Offset ${offset} in node ${id} of length ${record.sequenceLen}`,\n )\n }\n active.push(offset, id, entrySide(orientation))\n const distanceToNext = record.sequenceLen - offset\n if (remaining <= distanceToNext) {\n active.push(\n remaining === distanceToNext ? 0 : distanceToNext - remaining - 1,\n id,\n exitSide(orientation),\n )\n break\n }\n active.push(0, id, exitSide(orientation))\n const next = record.gbwt().lf(pos.offset)\n if (!next) {\n throw new Error(\n `No successor for GBWT position (${pos.node}, ${pos.offset})`,\n )\n }\n pos = next\n offset = 0\n remaining -= distanceToNext\n }\n this.walkedBp = len\n return this.insertContext(active, context)\n }\n\n async aroundNodes(nodes: Iterable<number>, context: number) {\n const active = new SideQueue()\n for (const id of nodes) {\n await this.ensureNode(id)\n active.push(0, id, 'left')\n active.push(0, id, 'right')\n }\n return this.insertContext(active, context)\n }\n\n private async insertContext(active: SideQueue, context: number) {\n this.clearPaths()\n const visited = new Set<string>()\n const toRemove = new Set<number>()\n for (const handle of this.records.keys()) {\n toRemove.add(nodeId(handle))\n }\n let inserted = 0\n while (active.size > 0) {\n const [distance, id, side] = active.pop()!\n const key = `${id}:${side}`\n if (visited.has(key)) {\n continue\n }\n visited.add(key)\n toRemove.delete(id)\n if (!this.hasNode(id)) {\n await this.addNode(id)\n inserted += 1\n }\n const otherSide = flipSide(side)\n if (!visited.has(`${id}:${otherSide}`)) {\n const record = this.record(encodeNode(id, entryOrientation(side)))\n const nextDistance = distance + record.sequenceLen - 1\n if (nextDistance <= context) {\n active.push(nextDistance, id, otherSide)\n }\n }\n const record = this.record(encodeNode(id, exitOrientation(side)))\n const nextDistance = distance + 1\n if (nextDistance <= context) {\n for (const successor of record.successors()) {\n const successorId = nodeId(successor)\n const successorSide = entrySide(nodeOrientation(successor))\n if (!visited.has(`${successorId}:${successorSide}`)) {\n active.push(nextDistance, successorId, successorSide)\n }\n }\n }\n }\n for (const id of toRemove) {\n this.records.delete(encodeNode(id, 'forward'))\n this.records.delete(encodeNode(id, 'reverse'))\n }\n return { inserted, removed: toRemove.size }\n }\n\n async betweenNodes(start: number, end: number) {\n this.clearPaths()\n const active = [start, flipNode(end)]\n const visited = new Set([nodeId(start), nodeId(end)])\n let inserted = 0\n while (active.length > 0) {\n const curr = active.pop()!\n const id = nodeId(curr)\n if (!this.hasNode(id)) {\n await this.addNode(id)\n inserted += 1\n }\n for (const successor of this.record(curr).successors()) {\n const successorId = nodeId(successor)\n if (!visited.has(successorId)) {\n active.push(successor, flipNode(successor))\n visited.add(successorId)\n }\n }\n }\n return inserted\n }\n\n async extractSnarls(snarls: SnarlOutput) {\n let inserted = 0\n for (const [start, end] of await this.overlappingSnarls(snarls)) {\n inserted += await this.betweenNodes(start, end)\n }\n return inserted\n }\n\n private async overlappingSnarls(snarls: SnarlOutput) {\n const result: [number, number][] = []\n if (snarls !== 'none') {\n let foundLink = false\n for (const handle of this.sortedHandles()) {\n const record = this.record(handle)\n const next = record.next\n if (next !== undefined) {\n foundLink = true\n if (this.hasHandle(next)) {\n if (edgeIsCanonical(handle, next)) {\n result.push([handle, next])\n }\n } else if (\n snarls === 'overlapping' &&\n this.isSnarlEntryInSubgraph(record)\n ) {\n result.push([handle, next])\n }\n }\n }\n if (\n !foundLink &&\n snarls === 'overlapping' &&\n (await this.db.hasChainLinks())\n ) {\n const covering = await this.findCoveringSnarl()\n if (covering) {\n result.push(covering)\n }\n }\n }\n return result\n }\n\n private isSnarlEntryInSubgraph(record: GbzRecord) {\n const successors = record.successors()\n const first = successors.find(handle => this.hasHandle(handle))\n return first === undefined\n ? false\n : successors.length > 1 ||\n this.record(flipNode(first)).successors().length > 1\n }\n\n private recordReader(onFetch?: () => void) {\n const outside = new Map<number, GbzRecord>()\n return async (handle: number) => {\n const inside = this.records.get(handle)\n if (inside) {\n return inside\n }\n let record = outside.get(handle)\n if (!record) {\n record = await this.db.getRecord(handle)\n onFetch?.()\n if (!record) {\n throw new Error(`Node record ${handle} is missing from the database`)\n }\n outside.set(handle, record)\n }\n return record\n }\n }\n\n private async findCoveringSnarl() {\n const read = this.recordReader()\n const isSnarlEntry = async (record: GbzRecord) => {\n const successors = record.successors()\n const first = successors[0]\n return first === undefined\n ? false\n : successors.length > 1 ||\n (await read(flipNode(first))).successors().length > 1\n }\n const classify = async (handle: number): Promise<HandleType> => {\n const reverse = await read(flipNode(handle))\n return reverse.next !== undefined\n ? (await isSnarlEntry(reverse))\n ? { kind: 'snarl-exit', snarl: [flipNode(handle), reverse.next] }\n : { kind: 'chain' }\n : (await read(handle)).next !== undefined\n ? { kind: 'chain' }\n : { kind: 'regular' }\n }\n const visited = new Set<number>()\n const queue = this.sortedHandles().flatMap(handle =>\n this.record(handle).successors(),\n )\n let result: [number, number] | undefined\n let done = false\n while (!done && queue.length > 0) {\n const handle = queue.shift()!\n const id = nodeId(handle)\n if (!this.hasHandle(handle) && !visited.has(id)) {\n visited.add(id)\n const type = await classify(handle)\n if (type.kind === 'snarl-exit') {\n result = type.snarl\n done = true\n } else if (type.kind === 'chain') {\n done = true\n } else {\n for (const orientation of ['forward', 'reverse'] as const) {\n queue.push(\n ...(await read(encodeNode(id, orientation))).successors(),\n )\n }\n }\n }\n }\n return result\n }\n\n extractPaths(reference: ReferencePath | undefined, output: HaplotypeOutput) {\n this.clearPaths()\n if (output === 'none') {\n return\n }\n const refPos = reference?.position\n this.refPath = reference?.name\n this.refHandle = reference?.handle\n const handles = this.sortedHandles()\n const count = handles.length\n const indexOf = new Map<number, number>()\n handles.forEach((handle, i) => indexOf.set(handle, i))\n // One flat pair for the whole subgraph, indexed by rowStart[node] + offset,\n // rather than an Int32Array per node. walk() reads a successor on every one\n // of a window's steps \u2014 9.9M of them at MHC class II \u2014 and through an array\n // of forty thousand small buffers each of those is a pointer chase into\n // scattered memory. The per-node arrays die before the walking starts.\n const rowStart = new Int32Array(count + 1)\n const seqLen = new Int32Array(count)\n const rows: { nodes: Int32Array; offsets: Int32Array }[] = []\n for (let i = 0; i < count; i++) {\n const record = this.record(handles[i]!)\n const row = record.gbwt().decompressArrays()\n seqLen[i] = record.sequenceLen\n rows.push(row)\n rowStart[i + 1] = rowStart[i]! + row.nodes.length\n }\n const positions = rowStart[count]!\n const nextIndex = new Int32Array(positions)\n const nextOffset = new Int32Array(positions)\n const hasPredecessor = new Uint8Array(positions)\n for (let i = 0; i < count; i++) {\n const row = rows[i]!\n nextIndex.set(row.nodes, rowStart[i])\n nextOffset.set(row.offsets, rowStart[i])\n }\n rows.length = 0\n for (let k = 0; k < positions; k++) {\n const j = indexOf.get(nextIndex[k]!)\n if (j === undefined) {\n nextIndex[k] = -1\n } else {\n nextIndex[k] = j\n hasPredecessor[rowStart[j]! + nextOffset[k]!] = 1\n }\n }\n const refIndex =\n refPos === undefined ? undefined : indexOf.get(refPos.handle)\n const refGbwtOffset = refPos?.gbwtOffset\n let refOffset: number | undefined\n const walk = (i: number, offset: number, path: number[] | undefined) => {\n const offsets: number[] = []\n let steps = 0\n let len = 0\n let refAt = -1\n let cur = i\n let off = offset\n for (;;) {\n if (cur === refIndex && off === refGbwtOffset) {\n refAt = steps\n }\n if (path) {\n path.push(handles[cur]!)\n offsets.push(off)\n }\n steps += 1\n len += seqLen[cur]!\n const at = rowStart[cur]! + off\n const next = nextIndex[at]!\n if (next < 0) {\n break\n }\n off = nextOffset[at]!\n cur = next\n }\n return { offsets, len, refAt, last: cur }\n }\n const keep = (\n path: number[],\n offsets: number[],\n len: number,\n refAt: number,\n ) => {\n if (refAt >= 0) {\n this.refId = this.paths.length\n refOffset = refAt\n }\n this.paths.push({\n path,\n offsets,\n len,\n weight: undefined,\n identity: undefined,\n })\n }\n const twinsExpected = new Int32Array(count)\n const refMayStartReversed =\n refIndex !== undefined && isReverse(handles[refIndex]!)\n for (let i = 0; i < count; i++) {\n const first = handles[i]!\n if (!isReverse(first)) {\n const from = rowStart[i]!\n const degree = rowStart[i + 1]! - from\n for (let offset = 0; offset < degree; offset++) {\n if (hasPredecessor[from + offset] === 0) {\n const path: number[] = []\n const { offsets, len, refAt, last } = walk(i, offset, path)\n const lastHandle = handles[last]!\n if (refAt >= 0 || pathEndsAreCanonical(first, lastHandle)) {\n keep(path, offsets, len, refAt)\n if (!isReverse(lastHandle)) {\n const twinRecord = indexOf.get(flipNode(lastHandle))!\n twinsExpected[twinRecord] = twinsExpected[twinRecord]! + 1\n }\n } else {\n this.twinStarts.add(posKey({ node: first, offset }))\n }\n }\n }\n }\n }\n for (let i = 0; i < count; i++) {\n const first = handles[i]!\n if (isReverse(first)) {\n const from = rowStart[i]!\n const degree = rowStart[i + 1]! - from\n let startCount = 0\n for (let offset = 0; offset < degree; offset++) {\n if (hasPredecessor[from + offset] === 0) {\n startCount += 1\n }\n }\n const allTwins = !refMayStartReversed && startCount === twinsExpected[i]\n for (let offset = 0; offset < degree; offset++) {\n if (hasPredecessor[from + offset] === 0) {\n const bare = allTwins ? undefined : walk(i, offset, undefined)\n if (\n bare &&\n (bare.refAt >= 0 ||\n pathEndsAreCanonical(first, handles[bare.last]))\n ) {\n const path: number[] = []\n const { offsets, len, refAt } = walk(i, offset, path)\n keep(path, offsets, len, refAt)\n } else {\n this.twinStarts.add(posKey({ node: first, offset }))\n }\n }\n }\n }\n }\n if (refPos) {\n if (refOffset === undefined || this.refId === undefined) {\n this.clearPaths()\n throw new Error('Could not find the reference path')\n }\n const info = this.paths[this.refId]!\n let before = refPos.nodeOffset\n for (const handle of info.path.slice(0, refOffset)) {\n before += this.record(handle).sequenceLen\n }\n const start = refPos.seqOffset - before\n this.refInterval = [start, start + info.len]\n info.identity = {\n pathHandle: reference.handle,\n name: reference.name,\n orientation: 'forward',\n hapStart: start,\n hapEnd: start + info.len,\n }\n }\n if (output === 'distinct') {\n this.distinctPaths()\n } else if (output === 'reference-only') {\n if (this.refId === undefined) {\n throw new Error('Reference path is required for reference-only output')\n }\n this.paths = [this.paths[this.refId]!]\n this.refId = 0\n }\n }\n\n private distinctPaths() {\n const refPath =\n this.refId === undefined ? undefined : this.paths[this.refId]!.path\n this.paths.sort((x, y) => comparePaths(x.path, y.path) || x.len - y.len)\n const merged: PathInfo[] = []\n let refId: number | undefined\n for (const info of this.paths) {\n const last = merged[merged.length - 1]\n if (last && comparePaths(last.path, info.path) === 0) {\n last.weight = (last.weight ?? 0) + 1\n } else {\n if (refPath && comparePaths(info.path, refPath) === 0) {\n refId = merged.length\n }\n merged.push({ ...info, weight: 1 })\n }\n }\n this.paths = merged\n this.refId = refId\n }\n\n // Narrows an identified subgraph to the reference walk and the named walks\n // `wanted` accepts, and drops every node only the discarded walks visited,\n // so a cut for a chosen set draws that set's private sequence and nothing\n // else's. Unresolved walks are discarded with the rest.\n keepHaplotypes(wanted: (name: PathName) => boolean) {\n const refInfo =\n this.refId === undefined ? undefined : this.paths[this.refId]\n const kept = this.paths.filter(\n (info, index) =>\n index === this.refId ||\n (info.identity !== undefined && wanted(info.identity.name)),\n )\n const visited = new Set<number>()\n for (const info of kept) {\n for (const handle of info.path) {\n visited.add(nodeId(handle))\n }\n }\n for (const handle of [...this.records.keys()]) {\n if (!visited.has(nodeId(handle))) {\n this.records.delete(handle)\n }\n }\n this.paths = kept\n this.refId = refInfo === undefined ? undefined : kept.indexOf(refInfo)\n }\n\n // Builds the window for a chosen set from the companion's anchor rows: the\n // reference walk through the window from the anchor the index names for the\n // multiple of the spacing at or before the window, and for every wanted path\n // visiting that anchor node, the path's own walk from its row through the\n // window, named without a chain walk. Returns the reason the caller has to\n // fall back to the sampled route instead, or undefined when the subgraph is\n // complete.\n async walkHaplotypesFromAnchor(\n reference: ReferencePath,\n len: number,\n spacing: number,\n wanted: (name: PathName) => boolean,\n context: number,\n ) {\n const windowStart = reference.position.seqOffset\n const windowEnd = windowStart + len\n const anchorOffset = Math.floor(windowStart / spacing) * spacing\n const margin = Math.min(spacing, ANCHOR_WALK_MARGIN)\n const bound = 4 * (spacing + len) + margin\n const stats: AnchorWalkStats = {\n spacing,\n anchorOffset,\n anchorNodeOffset: -1,\n anchorHandle: -1,\n referenceSteps: 0,\n rows: 0,\n walks: [],\n graphFetches: 0,\n scans: [],\n scanRows: 0,\n fallback: undefined,\n ms: { reference: 0, rows: 0, walks: 0, scan: 0, sampled: 0 },\n }\n this.stats.anchorWalk = stats\n let clock = performance.now()\n const lap = () => {\n const now = performance.now()\n const elapsed = now - clock\n clock = now\n return elapsed\n }\n this.clearPaths()\n this.records.clear()\n const read = this.recordReader(() => {\n stats.graphFetches += 1\n })\n const named = await this.db.haplotypeAnchor(reference.handle, anchorOffset)\n if (named === undefined) {\n throw new Error(\n `The haplotype index names no anchor for ${formatPathName(reference.name, reference.name.fragment)} at offset ${anchorOffset}; it was not built with anchors at ${spacing} bp for this graph`,\n )\n }\n stats.anchorNodeOffset = named.pathOffset\n const indexed = await this.prefetchReferenceRange(\n reference.handle,\n named.pathOffset,\n windowEnd + margin,\n )\n if (!indexed) {\n throw new Error(\n `Path ${formatPathName(reference.name, reference.name.fragment)} has not been indexed for random access`,\n )\n }\n const reach = await this.walkReference(\n read,\n indexed,\n named,\n windowStart,\n windowEnd,\n windowEnd + margin,\n )\n const { anchor, refOffsetOf, refHandles, windowSteps } = reach\n stats.anchorHandle = anchor.pos.node\n stats.referenceSteps = reach.steps\n this.walkedBp = len\n const refPath: number[] = []\n const refOffsets: number[] = []\n let refLen = 0\n for (const step of windowSteps) {\n await this.ensureNode(nodeId(step.pos.node))\n refPath.push(step.pos.node)\n refOffsets.push(step.pos.offset)\n refLen += this.record(step.pos.node).sequenceLen\n }\n const firstStep = windowSteps[0]\n if (firstStep === undefined) {\n throw new Error('The reference walk has no node in the window')\n }\n this.refPath = reference.name\n this.refHandle = reference.handle\n this.refInterval = [firstStep.refOffset, firstStep.refOffset + refLen]\n this.refId = 0\n this.paths.push({\n path: refPath,\n offsets: refOffsets,\n len: refLen,\n weight: undefined,\n identity: {\n pathHandle: reference.handle,\n name: reference.name,\n orientation: 'forward',\n hapStart: firstStep.refOffset,\n hapEnd: firstStep.refOffset + refLen,\n },\n })\n stats.ms.reference = lap()\n const rows = await this.db.haplotypeSamplesAtNode(anchor.pos.node)\n stats.rows = rows.length\n stats.ms.rows = lap()\n const ownRow = rows.find(\n row =>\n row.offset === anchor.pos.offset &&\n row.pathHandle === reference.handle &&\n row.pathOffset === anchor.offset,\n )\n if (ownRow === undefined) {\n throw new Error(\n `The haplotype index has no anchor row for ${formatPathName(reference.name, reference.name.fragment)} at offset ${anchor.offset} (node ${nodeId(anchor.pos.node)}); it was not built with anchors at ${spacing} bp for this graph`,\n )\n }\n const pathsByHandle = await this.db.pathsByHandle()\n const nameOf = (pathHandle: number) => {\n const path = pathsByHandle.get(pathHandle)\n if (!path) {\n throw new Error(`Path ${pathHandle} is missing from the database`)\n }\n return path.name\n }\n const handled = new Set<number>([reference.handle])\n const visitsByPath = new Map<number, HaplotypeSample[]>()\n for (const row of rows) {\n if (row !== ownRow && wanted(nameOf(row.pathHandle))) {\n const visits = visitsByPath.get(row.pathHandle)\n if (visits) {\n visits.push(row)\n } else {\n visitsByPath.set(row.pathHandle, [row])\n }\n }\n }\n // A path through a duplicated stretch visits the anchor node more than\n // once, and only one visit is followed by the window. GBWT rows sit in\n // the order of the sequence before them, so the visit nearest the\n // reference's own row is tried first, and the path fails only when no\n // visit reaches the window's end.\n let fallback: string | undefined\n for (const [pathHandle, visits] of visitsByPath) {\n if (fallback === undefined) {\n const nearest = (row: HaplotypeSample) =>\n Math.abs(row.offset - ownRow.offset)\n visits.sort((x, y) => nearest(x) - nearest(y))\n let reason: string | undefined\n for (const visit of visits) {\n if (!handled.has(pathHandle)) {\n reason = await this.walkAndKeep(\n read,\n visit,\n 'anchor',\n nameOf(pathHandle),\n refOffsetOf,\n windowEnd,\n bound,\n context,\n handled,\n stats,\n )\n }\n }\n if (!handled.has(pathHandle)) {\n fallback = reason\n }\n }\n }\n stats.ms.walks = lap()\n const unwalked =\n fallback === undefined\n ? await this.samplesOfUnwalkedContigs(\n refPath,\n refOffsetOf,\n refHandles,\n wanted,\n handled,\n nameOf,\n stats,\n )\n : new Map<number, HaplotypeSample[]>()\n stats.ms.scan = lap()\n if (unwalked.size > 0) {\n await this.mapReferenceBefore(\n read,\n reference.handle,\n Math.max(0, named.pathOffset - 2 * spacing),\n named.pathOffset,\n refOffsetOf,\n refHandles,\n )\n for (const [pathHandle, samples] of unwalked) {\n if (fallback === undefined) {\n const name = nameOf(pathHandle)\n let entry: HaplotypeSample | undefined\n for (const sample of samples) {\n entry ??= await this.entryBefore(\n read,\n sample,\n refOffsetOf,\n refHandles,\n this.refInterval[0],\n bound,\n )\n }\n fallback =\n entry === undefined\n ? `no sample of ${formatPathName(name, name.fragment)} on the window's nodes runs with the reference`\n : await this.walkAndKeep(\n read,\n entry,\n 'sample',\n name,\n refOffsetOf,\n windowEnd,\n bound,\n context,\n handled,\n stats,\n )\n }\n }\n stats.ms.sampled = lap()\n }\n stats.fallback = fallback\n return fallback\n }\n\n private async walkAndKeep(\n read: (handle: number) => Promise<GbzRecord>,\n row: HaplotypeSample,\n from: 'anchor' | 'sample',\n name: PathName,\n refOffsetOf: Map<number, number>,\n windowEnd: number,\n bound: number,\n context: number,\n handled: Set<number>,\n stats: AnchorWalkStats,\n ) {\n const walked = await this.walkFromRow(\n read,\n row,\n name,\n refOffsetOf,\n this.refInterval![0],\n windowEnd,\n bound,\n context,\n )\n stats.walks.push({\n pathHandle: row.pathHandle,\n from,\n steps: walked.steps,\n pieces: walked.infos.length,\n end: walked.end,\n })\n let reason: string | undefined\n // A walk that wrote nothing is as unusable as one that ran to the bound,\n // and it is the same silence: its contig ends between the anchor and the\n // window, so walking forward never reaches the window and the sampled scan\n // looks only at the reference's own nodes. Either way the caller falls back\n // to the route that reads the window's nodes directly.\n if (walked.end === 'bound' || walked.infos.length === 0) {\n reason = `${formatPathName(name, row.pathOffset)} walked ${walked.steps} steps from its ${from} without writing a walk through the window (${walked.end})`\n } else {\n handled.add(row.pathHandle)\n this.paths.push(...walked.infos)\n }\n return reason\n }\n\n // Adds the reference nodes of an earlier stretch to the map, so a walk\n // back from a sample can stop on the reference before the window even\n // when the contig rejoined it before the anchor.\n private async mapReferenceBefore(\n read: (handle: number) => Promise<GbzRecord>,\n pathHandle: number,\n fromOffset: number,\n toOffset: number,\n refOffsetOf: Map<number, number>,\n refHandles: Set<number>,\n ) {\n const indexed = await this.prefetchReferenceRange(\n pathHandle,\n fromOffset,\n toOffset,\n )\n let pos: Pos | undefined = indexed?.pos\n let offset = indexed?.pathOffset ?? toOffset\n while (pos !== undefined && pos.node !== ENDMARKER && offset < toOffset) {\n this.signal?.throwIfAborted()\n const record = await read(pos.node)\n const id = nodeId(pos.node)\n if (!refOffsetOf.has(id)) {\n refOffsetOf.set(id, offset)\n refHandles.add(pos.node)\n }\n offset += record.sequenceLen\n pos = record.gbwt().lf(pos.offset)\n }\n }\n\n // Whether a per-path sample's orientation of its path runs the reference's\n // way. A sample on a mapped reference node says so by its handle; from one\n // on another node the path is followed forward to the first mapped node.\n // Both orientations of a path are sampled, so the wrong one is simply\n // skipped in favour of a sample of the other.\n private async runsWithReference(\n read: (handle: number) => Promise<GbzRecord>,\n sample: HaplotypeSample,\n refOffsetOf: Map<number, number>,\n refHandles: Set<number>,\n bound: number,\n ) {\n let pos: Pos | undefined = { node: sample.node, offset: sample.offset }\n let walked = 0\n let verdict: boolean | undefined\n while (verdict === undefined) {\n this.signal?.throwIfAborted()\n if (pos === undefined || pos.node === ENDMARKER || walked > bound) {\n verdict = false\n } else if (refOffsetOf.has(nodeId(pos.node))) {\n verdict = refHandles.has(pos.node)\n } else {\n const record = await read(pos.node)\n walked += record.sequenceLen\n pos = record.gbwt().lf(pos.offset)\n }\n }\n return verdict\n }\n\n // Walks back from a per-path sample on one of the window's nodes, through\n // the bidirectional GBWT, to the first reference node before the window or\n // the contig's start, and returns that position as a row an anchored walk\n // can start from; undefined for a sample whose orientation runs against the\n // reference, since walking on from it would leave the window backwards. A\n // sample the bound is reached from lies in a private stretch longer than\n // the bound, so the walk starts at the sample itself: what came before it\n // shares nothing with the reference in reach.\n private async entryBefore(\n read: (handle: number) => Promise<GbzRecord>,\n sample: HaplotypeSample,\n refOffsetOf: Map<number, number>,\n refHandles: Set<number>,\n windowStart: number,\n bound: number,\n ): Promise<HaplotypeSample | undefined> {\n const sampleLen = (await read(sample.node)).sequenceLen\n const rowAt = async (\n pos: Pos,\n bpBack: number,\n ): Promise<HaplotypeSample> => {\n const len = (await read(pos.node)).sequenceLen\n return {\n node: pos.node,\n offset: pos.offset,\n pathHandle: sample.pathHandle,\n orientation: sample.orientation,\n pathOffset:\n sample.orientation === 'forward'\n ? sample.pathOffset - bpBack\n : sample.pathOffset + sampleLen + bpBack - len,\n }\n }\n let pos: Pos = { node: sample.node, offset: sample.offset }\n let bpBack = 0\n let entry: HaplotypeSample | undefined\n let done = !(await this.runsWithReference(\n read,\n sample,\n refOffsetOf,\n refHandles,\n bound,\n ))\n while (!done) {\n this.signal?.throwIfAborted()\n const refOffset = refOffsetOf.get(nodeId(pos.node))\n if (refOffset !== undefined && refOffset < windowStart) {\n entry = await rowAt(pos, bpBack)\n done = true\n } else if (bpBack > bound) {\n entry = { ...sample }\n done = true\n } else {\n const flipped = await read(flipNode(pos.node))\n const predecessor = flipped.gbwt().predecessorAt(pos.offset)\n if (predecessor === undefined) {\n entry = await rowAt(pos, bpBack)\n done = true\n } else {\n const record = await read(predecessor)\n const offset = record.gbwt().offsetTo(pos)\n if (offset === undefined) {\n throw new Error(\n `No offset in ${predecessor} leads to ${pos.node}:${pos.offset}`,\n )\n }\n pos = { node: predecessor, offset }\n bpBack += record.sequenceLen\n }\n }\n }\n return entry\n }\n\n // Walks the reference from an indexed position at or before the named\n // anchor to the end of the mapped stretch past the window, without adding\n // those nodes to the subgraph: what comes back is the anchor node's\n // position, every mapped node's reference offset and handle, and the\n // window's steps.\n private async walkReference(\n read: (handle: number) => Promise<GbzRecord>,\n indexed: IndexedPosition,\n named: HaplotypeAnchor,\n windowStart: number,\n windowEnd: number,\n mappedEnd: number,\n ) {\n const refOffsetOf = new Map<number, number>()\n const refHandles = new Set<number>()\n const windowSteps: { pos: Pos; refOffset: number }[] = []\n let anchor: { pos: Pos; offset: number } | undefined\n let pos: Pos | undefined = indexed.pos\n let offset = indexed.pathOffset\n let steps = 0\n while (pos !== undefined && pos.node !== ENDMARKER && offset < mappedEnd) {\n this.signal?.throwIfAborted()\n const record = await read(pos.node)\n const end = offset + record.sequenceLen\n if (anchor === undefined && offset === named.pathOffset) {\n if (pos.node !== named.node) {\n throw new Error(\n `The reference walk reaches node ${nodeId(pos.node)} at offset ${offset} where the haplotype index names node ${nodeId(named.node)} as the anchor`,\n )\n }\n anchor = { pos, offset }\n }\n if (anchor !== undefined) {\n steps += 1\n const id = nodeId(pos.node)\n if (!refOffsetOf.has(id)) {\n refOffsetOf.set(id, offset)\n refHandles.add(pos.node)\n }\n if (offset < windowEnd && end > windowStart) {\n windowSteps.push({ pos, refOffset: offset })\n }\n }\n offset = end\n pos = record.gbwt().lf(pos.offset)\n }\n if (anchor === undefined) {\n throw new Error(\n `The reference walk from offset ${indexed.pathOffset} never starts a node at the anchor offset ${named.pathOffset}`,\n )\n }\n return { anchor, refOffsetOf, refHandles, windowSteps, steps }\n }\n\n // One path's walk from its anchor row: forward with lf() until it lands on\n // a reference node inside the window, then every node until it lands on a\n // reference node at or past the window's end. A private stretch longer\n // than the context cuts the walk into pieces, as leaving the subgraph does\n // on the sampled route, and its nodes stay out of the cut; the pieces are\n // joined again by the alignment where they are monotone. Trailing private\n // steps are dropped, so a walk off the reference's end carries none.\n private async walkFromRow(\n read: (handle: number) => Promise<GbzRecord>,\n row: HaplotypeSample,\n name: PathName,\n refOffsetOf: Map<number, number>,\n windowStart: number,\n windowEnd: number,\n bound: number,\n context: number,\n ): Promise<{\n steps: number\n end: AnchorWalkEnd\n infos: PathInfo[]\n }> {\n const startLen = (await read(row.node)).sequenceLen\n const base =\n row.orientation === 'forward' ? row.pathOffset : row.pathOffset + startLen\n const pieces: WalkStep[][] = []\n let piece: WalkStep[] = []\n let pending: WalkStep[] = []\n let pendingBp = 0\n let counter = 0\n let steps = 0\n let startBp: number | undefined\n let end: AnchorWalkEnd | undefined\n let pos: Pos | undefined = { node: row.node, offset: row.offset }\n while (end === undefined) {\n this.signal?.throwIfAborted()\n if (pos === undefined || pos.node === ENDMARKER) {\n end =\n startBp === undefined ? 'before the window' : 'ended in the window'\n } else if (counter > bound) {\n end = 'bound'\n } else {\n const refOffset = refOffsetOf.get(nodeId(pos.node))\n const inWindow = startBp !== undefined\n if (refOffset !== undefined && refOffset >= windowEnd) {\n end = inWindow ? 'through the window' : 'past the window'\n } else {\n if (\n !inWindow &&\n refOffset !== undefined &&\n refOffset >= windowStart\n ) {\n startBp = counter\n }\n const record = await read(pos.node)\n if (startBp !== undefined) {\n const step = { pos, at: counter, len: record.sequenceLen }\n if (refOffset === undefined) {\n pending.push(step)\n pendingBp += step.len\n } else {\n // A run of steps the reference does not carry is the walk's own\n // sequence, so it is kept however long it runs: a repeat\n // expansion is nothing else. A run that rejoins the reference\n // BEFORE the window went somewhere else and came back, and a\n // long one of those starts a new piece rather than drawing the\n // detour.\n if (pendingBp > context && refOffset < windowStart) {\n pieces.push(piece)\n piece = []\n } else {\n piece.push(...pending)\n }\n pending = []\n pendingBp = 0\n piece.push(step)\n }\n }\n steps += 1\n counter += record.sequenceLen\n pos = record.gbwt().lf(pos.offset)\n }\n }\n }\n pieces.push(piece)\n const infos: PathInfo[] = []\n for (const steps of pieces) {\n const first = steps[0]\n const last = steps[steps.length - 1]\n if (first !== undefined && last !== undefined) {\n const path: number[] = []\n const offsets: number[] = []\n let len = 0\n for (const step of steps) {\n await this.ensureNode(nodeId(step.pos.node))\n path.push(step.pos.node)\n offsets.push(step.pos.offset)\n len += step.len\n }\n const from = first.at\n const to = last.at + last.len\n infos.push({\n path,\n offsets,\n len,\n weight: undefined,\n identity:\n row.orientation === 'forward'\n ? {\n pathHandle: row.pathHandle,\n name,\n orientation: 'forward',\n hapStart: base + from,\n hapEnd: base + to,\n }\n : {\n pathHandle: row.pathHandle,\n name,\n orientation: 'reverse',\n hapStart: base - to,\n hapEnd: base - from,\n },\n })\n }\n }\n return { steps, end, infos }\n }\n\n // A wanted contig that bypassed the anchor node, or starts inside the\n // window, has no row at the anchor. Its per-path samples on the window's\n // nodes are how the sampled route finds it, so those are scanned, and the\n // candidate samples of each wanted path no anchor row walked come back:\n // those on a reference node in the reference's own direction first, then\n // those on other nodes, whose direction a probe settles; a sample on the\n // flipped handle of a reference node runs against it and is left out.\n private async samplesOfUnwalkedContigs(\n refPath: number[],\n refOffsetOf: Map<number, number>,\n refHandles: Set<number>,\n wanted: (name: PathName) => boolean,\n handled: Set<number>,\n nameOf: (pathHandle: number) => PathName,\n stats: AnchorWalkStats,\n ) {\n const runs = handleRuns([...refPath].sort((a, b) => a - b))\n stats.scans = runs\n const unwalked = new Map<number, HaplotypeSample[]>()\n for (const [first, last] of runs) {\n const samples = await this.db.haplotypeSamplesInRange(first, last)\n stats.scanRows += samples.length\n for (const sample of samples) {\n const onReference = refOffsetOf.has(nodeId(sample.node))\n if (\n !handled.has(sample.pathHandle) &&\n (!onReference || refHandles.has(sample.node)) &&\n wanted(nameOf(sample.pathHandle))\n ) {\n const candidates = unwalked.get(sample.pathHandle) ?? []\n if (onReference) {\n candidates.unshift(sample)\n } else {\n candidates.push(sample)\n }\n unwalked.set(sample.pathHandle, candidates)\n }\n }\n }\n return unwalked\n }\n\n async identifyPaths() {\n if (!this.db.hasHaplotypeIndex) {\n throw new Error(\n 'The database has no HaplotypeSamples table; run gbz-haplotype-index on it',\n )\n }\n const interval = (await this.db.haplotypeSampleInterval()) ?? 4096\n const runs = handleRuns(this.sortedHandles())\n if (runs.length === 0) {\n return\n }\n const samples = new Map<string, HaplotypeSample>()\n for (const [first, last] of runs) {\n for (const sample of await this.db.haplotypeSamplesInRange(first, last)) {\n samples.set(posKey(sample), sample)\n }\n }\n const scanned = (handle: number) => {\n let lo = 0\n let hi = runs.length - 1\n while (lo < hi) {\n const mid = (lo + hi + 1) >> 1\n if (runs[mid]![0] <= handle) {\n lo = mid\n } else {\n hi = mid - 1\n }\n }\n const run = runs[lo]!\n return run[0] <= handle && handle <= run[1]\n }\n const starts = new Map<string, number>()\n this.paths.forEach((info, index) => {\n if (info.path.length > 0 && index !== this.refId) {\n starts.set(posKey(pathPosition(info, 0)), index)\n }\n })\n const identification = this.stats.identification\n identification.interval = interval\n identification.scans = runs\n identification.windowSamples = samples.size\n this.paths.forEach((info, index) => {\n if (index !== this.refId) {\n identification.fragmentLengths.push(info.len)\n }\n })\n const readRecord = this.recordReader(() => {\n this.stats.identificationFetches += 1\n identification.graphFetches += 1\n })\n const recordAt = (handle: number) => {\n identification.graphLookups += 1\n return readRecord(handle)\n }\n const sampleAt = async (pos: Pos, chain: ChainRecord) => {\n if (scanned(pos.node)) {\n return samples.get(posKey(pos))\n }\n this.stats.identificationFetches += 1\n identification.companionSeeks += 1\n chain.seeks += 1\n const sample = await this.db.haplotypeSampleAt(pos.node, pos.offset)\n if (!sample) {\n identification.companionMisses += 1\n }\n return sample\n }\n const names = new Map<number, PathName>()\n const nameOf = async (pathHandle: number) => {\n let name = names.get(pathHandle)\n if (!name) {\n const path = await this.db.getPath(pathHandle)\n if (!path) {\n throw new Error(`Path ${pathHandle} is missing from the database`)\n }\n name = path.name\n names.set(pathHandle, name)\n }\n return name\n }\n const anchorFromSample = (\n sample: HaplotypeSample,\n counter: number,\n nodeLen: number,\n ): Anchor =>\n sample.orientation === 'forward'\n ? {\n pathHandle: sample.pathHandle,\n orientation: 'forward',\n base: sample.pathOffset - counter,\n }\n : {\n pathHandle: sample.pathHandle,\n orientation: 'reverse',\n base: sample.pathOffset + counter + nodeLen,\n }\n const anchorFromIdentity = (\n identity: PathIdentity,\n counter: number,\n ): Anchor =>\n identity.orientation === 'forward'\n ? {\n pathHandle: identity.pathHandle,\n orientation: 'forward',\n base: identity.hapStart - counter,\n }\n : {\n pathHandle: identity.pathHandle,\n orientation: 'reverse',\n base: identity.hapEnd + counter,\n }\n\n for (let start = 0; start < this.paths.length; start++) {\n const startInfo = this.paths[start]!\n if (start === this.refId || startInfo.identity) {\n continue\n }\n const chain: { index: number; startBp: number }[] = []\n const visited = new Set<number>()\n const record: ChainRecord = {\n fragments: 0,\n steps: 0,\n seeks: 0,\n reentries: 0,\n twinLandings: 0,\n end: 'endmarker',\n pathHandle: undefined,\n }\n identification.chains.push(record)\n let anchor: Anchor | undefined\n let counter = 0\n let current: number | undefined = start\n let pos: Pos | undefined\n while (anchor === undefined) {\n this.signal?.throwIfAborted()\n if (current !== undefined) {\n if (visited.has(current)) {\n record.end = 'cycle'\n break\n }\n visited.add(current)\n const info = this.paths[current]!\n chain.push({ index: current, startBp: counter })\n record.fragments += 1\n let bp = counter\n for (let k = 0; k < info.path.length; k++) {\n const position = pathPosition(info, k)\n const sample = samples.get(posKey(position))\n const nodeLen = this.record(position.node).sequenceLen\n if (sample) {\n anchor = anchorFromSample(sample, bp, nodeLen)\n break\n }\n bp += nodeLen\n }\n counter += info.len\n if (anchor) {\n record.end = 'in-fragment sample'\n break\n }\n const last = pathPosition(info, info.path.length - 1)\n pos = this.record(last.node).gbwt().lf(last.offset)\n current = undefined\n }\n if (pos === undefined || pos.node === ENDMARKER) {\n record.end = 'endmarker'\n break\n }\n const key = posKey(pos)\n const known = starts.get(key)\n if (known !== undefined) {\n const identity = this.paths[known]!.identity\n if (identity) {\n anchor = anchorFromIdentity(identity, counter)\n record.end = 'identified sibling'\n break\n }\n current = known\n continue\n }\n if (this.records.has(pos.node)) {\n record.reentries += 1\n }\n if (this.twinStarts.has(key)) {\n record.twinLandings += 1\n }\n const sample = await sampleAt(pos, record)\n const node = await recordAt(pos.node)\n if (sample) {\n anchor = anchorFromSample(sample, counter, node.sequenceLen)\n record.end = 'out-of-window sample'\n break\n }\n this.stats.identificationSteps += 1\n record.steps += 1\n if (\n counter - (chain[chain.length - 1] as { startBp: number }).startBp >\n 4 * interval + 4 * node.sequenceLen\n ) {\n record.end = 'bound'\n break\n }\n counter += node.sequenceLen\n pos = node.gbwt().lf(pos.offset)\n }\n if (anchor) {\n record.pathHandle = anchor.pathHandle\n const name = await nameOf(anchor.pathHandle)\n for (const { index, startBp } of chain) {\n const info = this.paths[index]!\n info.identity =\n anchor.orientation === 'forward'\n ? {\n pathHandle: anchor.pathHandle,\n name,\n orientation: 'forward',\n hapStart: anchor.base + startBp,\n hapEnd: anchor.base + startBp + info.len,\n }\n : {\n pathHandle: anchor.pathHandle,\n name,\n orientation: 'reverse',\n hapStart: anchor.base - startBp - info.len,\n hapEnd: anchor.base - startBp,\n }\n }\n }\n }\n }\n\n private refIndex(ref: number[]) {\n if (this.refIndexCache === undefined) {\n const index = new Map<number, number[]>()\n ref.forEach((handle, i) => {\n const occurrences = index.get(handle)\n if (occurrences) {\n occurrences.push(i)\n } else {\n index.set(handle, [i])\n }\n })\n this.refIndexCache = index\n }\n return this.refIndexCache\n }\n\n private refPrefix(ref: number[]) {\n if (this.refPrefixCache === undefined) {\n const prefix = [0]\n ref.forEach((handle, i) => {\n prefix.push(prefix[i]! + this.record(handle).sequenceLen)\n })\n this.refPrefixCache = prefix\n }\n return this.refPrefixCache\n }\n\n private orderedMatches(path: number[], ref: number[]): Matches | undefined {\n const index = this.refIndex(ref)\n const pathAt = new Int32Array(path.length)\n const refAt = new Int32Array(path.length)\n let count = 0\n let last = -1\n for (let i = 0; i < path.length; i++) {\n const occurrences = index.get(path[i]!)\n if (occurrences) {\n const j = firstAbove(occurrences, last)\n if (j === undefined) {\n return undefined\n }\n pathAt[count] = i\n refAt[count] = j\n count += 1\n last = j\n }\n }\n return { pathAt, refAt, count }\n }\n\n private pathLen(path: number[]) {\n let total = 0\n for (const handle of path) {\n total += this.record(handle).sequenceLen\n }\n return total\n }\n\n private prefixMatches(path: number[], ref: number[]) {\n let result = 0\n let pi = 0\n let ri = 0\n let pb = 0\n let rb = 0\n while (pi < path.length && ri < ref.length) {\n const a = this.record(path[pi]!).sequence\n const b = this.record(ref[ri]!).sequence\n while (pb < a.length && rb < b.length) {\n if (a[pb] !== b[rb]) {\n return result\n }\n pb += 1\n rb += 1\n result += 1\n }\n if (pb === a.length) {\n pi += 1\n pb = 0\n }\n if (rb === b.length) {\n ri += 1\n rb = 0\n }\n }\n return result\n }\n\n private suffixMatches(path: number[], ref: number[]) {\n let result = 0\n let pi = 0\n let ri = 0\n let pb = 0\n let rb = 0\n while (pi < path.length && ri < ref.length) {\n const a = this.record(path[path.length - pi - 1]!).sequence\n const b = this.record(ref[ref.length - ri - 1]!).sequence\n while (pb < a.length && rb < b.length) {\n if (a[a.length - pb - 1] !== b[b.length - rb - 1]) {\n return result\n }\n pb += 1\n rb += 1\n result += 1\n }\n if (pb === a.length) {\n pi += 1\n pb = 0\n }\n if (rb === b.length) {\n ri += 1\n rb = 0\n }\n }\n return result\n }\n\n private align(path: number[], ref: number[], edits: Edit[]) {\n const pathLen = this.pathLen(path)\n const refLen = this.pathLen(ref)\n const prefix = this.prefixMatches(path, ref)\n let suffix = this.suffixMatches(path, ref)\n if (prefix + suffix > pathLen) {\n suffix = pathLen - prefix\n }\n if (prefix + suffix > refLen) {\n suffix = refLen - prefix\n }\n appendEdit(edits, 'M', prefix)\n appendGap(edits, pathLen - prefix - suffix, refLen - prefix - suffix)\n appendEdit(edits, 'M', suffix)\n }\n\n private sharedWeight(path: number[], ref: number[]) {\n const index = this.refIndex(ref)\n let weight = 0\n for (const handle of path) {\n if (index.has(handle)) {\n weight += this.record(handle).sequenceLen\n }\n }\n return weight\n }\n\n private editsAgainst(path: number[], ref: number[]) {\n const ordered = this.orderedMatches(path, ref)\n if (ordered) {\n this.stats.orderedAlignments += 1\n } else {\n this.stats.lcsAlignments += 1\n }\n const lcs =\n ordered ??\n asMatches(\n weightedLcs(path, ref, handle => this.record(handle).sequenceLen)[0],\n )\n const edits: Edit[] = []\n const refPrefix = this.refPrefix(ref)\n const alignGap = (\n pathFrom: number,\n pathTo: number,\n refFrom: number,\n refTo: number,\n ) => {\n if (pathFrom === pathTo) {\n appendEdit(edits, 'D', refPrefix[refTo]! - refPrefix[refFrom]!)\n } else if (refFrom === refTo) {\n appendEdit(edits, 'I', this.pathLen(path.slice(pathFrom, pathTo)))\n } else {\n this.align(\n path.slice(pathFrom, pathTo),\n ref.slice(refFrom, refTo),\n edits,\n )\n }\n }\n let matched = 0\n let pathOffset = 0\n let refOffset = 0\n for (let m = 0; m < lcs.count; m++) {\n const nextPath = lcs.pathAt[m]!\n const nextRef = lcs.refAt[m]!\n // Adjacent matches are the overwhelming majority of a walk's steps, and\n // for those alignGap has nothing to append; only the gaps are worth a\n // call.\n if (pathOffset !== nextPath || refOffset !== nextRef) {\n alignGap(pathOffset, nextPath, refOffset, nextRef)\n }\n const nodeLen = this.record(path[nextPath]!).sequenceLen\n appendEdit(edits, 'M', nodeLen)\n matched += nodeLen\n pathOffset = nextPath + 1\n refOffset = nextRef + 1\n }\n alignGap(pathOffset, path.length, refOffset, ref.length)\n return { edits, matched }\n }\n\n private alignment(pathIndex: number) {\n const info = this.paths[pathIndex]\n if (this.refId === undefined || pathIndex === this.refId || !info) {\n return undefined\n }\n const ref = this.paths[this.refId]!.path\n let result: { edits: Edit[]; flipped: boolean }\n if (pathIsCanonical(ref)) {\n // A walk against a canonical reference has nothing to gain from being\n // flipped, so neither bound is worth the pass over its steps that\n // measuring one costs.\n result = {\n edits: this.editsAgainst(info.path, ref).edits,\n flipped: false,\n }\n } else {\n const flippedPath = info.path.map(handle => flipNode(handle)).reverse()\n const forwardBound = this.sharedWeight(info.path, ref)\n const flippedBound = this.sharedWeight(flippedPath, ref)\n if (flippedBound === 0) {\n result = {\n edits: this.editsAgainst(info.path, ref).edits,\n flipped: false,\n }\n } else if (forwardBound === 0) {\n result = {\n edits: this.editsAgainst(flippedPath, ref).edits,\n flipped: true,\n }\n } else {\n const forward = this.editsAgainst(info.path, ref)\n const flipped = this.editsAgainst(flippedPath, ref)\n result =\n flipped.matched > forward.matched\n ? { edits: flipped.edits, flipped: true }\n : { edits: forward.edits, flipped: false }\n }\n }\n return result\n }\n\n alignToRef(pathIndex: number) {\n return this.alignment(pathIndex)\n ?.edits.map(([op, len]) => `${len}${op}`)\n .join('')\n }\n\n alignments(): HaplotypeAlignment[] {\n const reference = this.referenceInterval\n if (this.refId === undefined || !reference) {\n throw new Error('Alignments need a reference path')\n }\n const ref = this.paths[this.refId]!.path\n const refTotal = this.refPrefix(ref)[ref.length]!\n const fragments: FragmentAlignment[] = []\n this.paths.forEach((info, index) => {\n if (index === this.refId) {\n return\n }\n const { edits, flipped } = this.alignment(index)!\n let first = 0\n let leading = 0\n while (first < edits.length && edits[first]![0] === 'D') {\n leading += edits[first]![1]\n first += 1\n }\n let last = edits.length\n let trailing = 0\n while (last > first && edits[last - 1]![0] === 'D') {\n trailing += edits[last - 1]![1]\n last -= 1\n }\n const identity = info.identity\n const alongReference = identity\n ? (identity.orientation === 'forward') !== flipped\n : !flipped\n fragments.push({\n strand: alongReference ? '+' : '-',\n refStart: reference.start + leading,\n refEnd: reference.start + refTotal - trailing,\n edits: edits.slice(first, last),\n weight: info.weight,\n path: info.path,\n start: pathPosition(info, 0),\n identity:\n identity === undefined\n ? undefined\n : {\n pathHandle: identity.pathHandle,\n name: identity.name,\n hapStart: identity.name.fragment + identity.hapStart,\n hapEnd: identity.name.fragment + identity.hapEnd,\n walkForward: identity.orientation === 'forward',\n },\n })\n })\n return joinSiblings(fragments).map(fragment => {\n const { edits, identity, ...rest } = fragment\n const span: AlignmentSpan = { ...rest, cigar: cigarOf(edits) }\n return identity\n ? {\n ...span,\n resolved: true,\n name: identity.name,\n label: formatPathName(\n { ...identity.name, fragment: identity.hapStart },\n identity.hapEnd,\n ),\n pathHandle: identity.pathHandle,\n hapStart: identity.hapStart,\n hapEnd: identity.hapEnd,\n }\n : { ...span, resolved: false }\n })\n }\n\n // One haplotype's walks aligned to another's, on both haplotypes' own\n // coordinates, with the bases between two shared nodes compared. The\n // reference path is a named walk like any other, on either side. With no\n // query, every other named walk in the window is one.\n pairAlignments(opts: PairAlignmentOptions): PairAlignment[] {\n const { target, query, maxGap } = opts\n const walks = this.paths.flatMap(info => {\n const { identity } = info\n return identity\n ? [\n {\n name: identity.name,\n start: identity.name.fragment + identity.hapStart,\n steps: haplotypeOrderedPath(info, identity),\n },\n ]\n : []\n })\n const names = (haplotype: HaplotypeRef) => (name: PathName) =>\n name.sample === haplotype.sample && name.haplotype === haplotype.haplotype\n const isTarget = names(target)\n const isQuery = query ? names(query) : (name: PathName) => !isTarget(name)\n const sequenceOf = (id: number) =>\n this.record(encodeNode(id, 'forward')).sequence\n return walks\n .filter(walk => isTarget(walk.name))\n .flatMap(targetWalk =>\n walks\n .filter(walk => isQuery(walk.name))\n .flatMap(queryWalk =>\n pairAlignments(\n queryWalk.steps,\n targetWalk.steps,\n sequenceOf,\n maxGap === undefined ? {} : { maxGap },\n ).map(chain => ({\n query: queryWalk.name,\n queryStart: queryWalk.start + chain.queryStart,\n queryEnd: queryWalk.start + chain.queryEnd,\n strand: chain.strand,\n target: targetWalk.name,\n targetStart: targetWalk.start + chain.targetStart,\n targetEnd: targetWalk.start + chain.targetEnd,\n cigar: pairCigar(chain.edits),\n matches: chain.edits.reduce(\n (sum, [op, len]) => sum + (op === '=' ? len : 0),\n 0,\n ),\n columns: chain.edits.reduce((sum, [, len]) => sum + len, 0),\n sharedBases: chain.sharedBases,\n })),\n ),\n )\n }\n\n private canonicalEdges(id: number) {\n const edges: [number, number, number][] = []\n for (const orientation of ['forward', 'reverse'] as const) {\n const handle = encodeNode(id, orientation)\n for (const successor of this.record(handle).successors()) {\n if (this.hasHandle(successor) && edgeIsCanonical(handle, successor)) {\n edges.push([\n orientation === 'reverse' ? 1 : 0,\n nodeId(successor),\n isReverse(successor) ? 1 : 0,\n ])\n }\n }\n }\n edges.sort((a, b) => a[0] - b[0] || a[1] - b[1] || a[2] - b[2])\n return edges.filter(\n (edge, i) =>\n i === 0 ||\n edge[0] !== edges[i - 1]![0] ||\n edge[1] !== edges[i - 1]![1] ||\n edge[2] !== edges[i - 1]![2],\n )\n }\n\n async stableName() {\n const encoder = new TextEncoder()\n const chunks: Uint8Array[] = []\n for (const handle of this.sortedHandles()) {\n if (!isReverse(handle)) {\n const id = nodeId(handle)\n let text = `S\\t${id}\\t${this.record(handle).sequence}\\n`\n for (const [fromReverse, toId, toReverse] of this.canonicalEdges(id)) {\n text += `L\\t${id}\\t${fromReverse ? '-' : '+'}\\t${toId}\\t${toReverse ? '-' : '+'}\\n`\n }\n chunks.push(encoder.encode(text))\n }\n }\n return sha256Hex(chunks)\n }\n\n async toGFA(opts: SubgraphOutputOptions = {}) {\n const cigar = opts.cigar ?? false\n const lines = [\n this.refPath ? `H\\tVN:Z:1.1\\tRS:Z:${this.refPath.sample}` : 'H\\tVN:Z:1.1',\n ...gfaHeaderLines(\n subgraphName(await this.stableName(), await this.db.graphName()),\n ),\n ]\n const handles = this.sortedHandles()\n for (const handle of handles) {\n if (!isReverse(handle)) {\n lines.push(`S\\t${nodeId(handle)}\\t${this.record(handle).sequence}`)\n }\n }\n const sign = (handle: number) => (isReverse(handle) ? '-' : '+')\n for (const handle of handles) {\n for (const successor of this.record(handle).successors()) {\n if (this.hasHandle(successor) && edgeIsCanonical(handle, successor)) {\n lines.push(\n `L\\t${nodeId(handle)}\\t${sign(handle)}\\t${nodeId(successor)}\\t${sign(successor)}\\t0M`,\n )\n }\n }\n }\n const walk = (\n info: PathInfo,\n identity: PathIdentity | undefined,\n name: PathName,\n end: number,\n cigarString: string | undefined,\n ) => {\n const steps = haplotypeOrderedPath(info, identity)\n .map(handle => `${isReverse(handle) ? '<' : '>'}${nodeId(handle)}`)\n .join('')\n const weight = info.weight === undefined ? '' : `\\tWT:i:${info.weight}`\n const cg = cigarString === undefined ? '' : `\\tCG:Z:${cigarString}`\n return `W\\t${name.sample}\\t${name.haplotype}\\t${name.contig}\\t${name.fragment}\\t${end}\\t${steps}${weight}${cg}`\n }\n const contig = this.refPath?.contig ?? 'unknown'\n if (this.refId !== undefined && this.refPath && this.refInterval) {\n lines.push(\n walk(\n this.paths[this.refId]!,\n undefined,\n {\n ...this.refPath,\n fragment: this.refPath.fragment + this.refInterval[0],\n },\n this.refPath.fragment + this.refInterval[1],\n undefined,\n ),\n )\n }\n let haplotype = 1\n this.paths.forEach((info, index) => {\n if (index !== this.refId) {\n const resolved = opts.names === 'resolved' ? info.identity : undefined\n const cigarString = cigar ? this.alignToRef(index) : undefined\n lines.push(\n resolved\n ? walk(\n info,\n resolved,\n {\n ...resolved.name,\n fragment: resolved.name.fragment + resolved.hapStart,\n },\n resolved.name.fragment + resolved.hapEnd,\n cigarString,\n )\n : walk(\n info,\n undefined,\n { sample: 'unknown', contig, haplotype, fragment: 0 },\n info.len,\n cigarString,\n ),\n )\n haplotype += 1\n }\n })\n return `${lines.join('\\n')}\\n`\n }\n\n // The reference walk first under the interval it covers, then one entry per\n // haplotype in extraction order. Both outputs read this so a name, a weight\n // or a CIGAR cannot mean one thing in the upstream JSON and another in the\n // compact form.\n private outputPaths(opts: SubgraphOutputOptions) {\n const cigar = opts.cigar ?? false\n const entries: {\n info: PathInfo\n identity: PathIdentity | undefined\n name: string\n cigar: string | undefined\n }[] = []\n const contig = this.refPath?.contig ?? 'unknown'\n if (this.refId !== undefined && this.refPath && this.refInterval) {\n const start = {\n ...this.refPath,\n fragment: this.refPath.fragment + this.refInterval[0],\n }\n entries.push({\n info: this.paths[this.refId]!,\n identity: undefined,\n name: formatPathName(\n start,\n this.refPath.fragment + this.refInterval[1],\n ),\n cigar: undefined,\n })\n }\n let haplotype = 1\n this.paths.forEach((info, index) => {\n if (index === this.refId) {\n return\n }\n const identity = opts.names === 'resolved' ? info.identity : undefined\n entries.push({\n info,\n identity,\n name: identity\n ? formatPathName(\n {\n ...identity.name,\n fragment: identity.name.fragment + identity.hapStart,\n },\n identity.name.fragment + identity.hapEnd,\n )\n : formatPathName(\n { sample: 'unknown', contig, haplotype, fragment: 0 },\n info.len,\n ),\n cigar: cigar ? this.alignToRef(index) : undefined,\n })\n haplotype += 1\n })\n return entries\n }\n\n private *outputEdges() {\n for (const handle of this.sortedHandles()) {\n for (const successor of this.record(handle).successors()) {\n if (this.hasHandle(successor) && edgeIsCanonical(handle, successor)) {\n yield [handle, successor] as const\n }\n }\n }\n }\n\n toSubgraphJson(opts: SubgraphOutputOptions = {}): SubgraphJson {\n const nodes = this.sortedHandles()\n .filter(handle => !isReverse(handle))\n .map(handle => ({\n id: String(nodeId(handle)),\n sequence: this.record(handle).sequence,\n }))\n const edges: SubgraphJson['edges'] = []\n for (const [from, to] of this.outputEdges()) {\n edges.push({\n from: String(nodeId(from)),\n from_is_reverse: isReverse(from),\n to: String(nodeId(to)),\n to_is_reverse: isReverse(to),\n })\n }\n const paths = this.outputPaths(opts).map(entry =>\n jsonPath(entry.info, entry.identity, entry.name, entry.cigar),\n )\n return { nodes, edges, paths }\n }\n\n // The same subgraph as typed arrays of GBWT handles. toSubgraphJson spends\n // an object and a stringified id on every step of every walk, which a\n // 200 kb human window has about 350,000 of; this hands back the numbers the\n // extraction already holds, so it survives a structured clone into a worker\n // for about the cost of the memcpy rather than of rebuilding the objects.\n // Measured on HPRC chr20 CHM13#0#chr20 30.0-30.2 Mb, 5,943 nodes and 178\n // haplotypes: 295 ms to clone the upstream shape against 1.9 ms for this one.\n //\n // Packing the other two fields the way bam-js packs NUMERIC_SEQ and\n // NUMERIC_CIGAR was measured on the same window and rejected, because what\n // pays there is a long per-record field and both of these are short. Node\n // sequences average 34 bp: base-6 bytes plus offsets are 2.86x smaller but\n // cost more to build than to hand over the cached strings (1.07 ms against\n // 0.95 ms all in), and a consumer drawing the graph wants the strings for\n // every node anyway. CIGARs average 323 chars over 17,555 total ops: packing\n // them into one Int32Array per path is 1.7 ms against 2.4 ms to join the\n // strings, but then clones SLOWER (0.20 ms against 0.09 ms) because 178 small\n // typed arrays cost more than 178 strings. Steps are the only field here long\n // enough to be worth it. The CIGAR phase is 103 ms of edit computation and\n // 2 ms of string building, so neither field is where that time goes.\n toCompactSubgraph(opts: SubgraphOutputOptions = {}): CompactSubgraph {\n const forward = this.sortedHandles().filter(handle => !isReverse(handle))\n const nodeIds = new Int32Array(forward.length)\n const nodeSequences: string[] = []\n forward.forEach((handle, i) => {\n nodeIds[i] = nodeId(handle)\n nodeSequences.push(this.record(handle).sequence)\n })\n const edgeHandles: number[] = []\n for (const [from, to] of this.outputEdges()) {\n edgeHandles.push(from, to)\n }\n return {\n nodeIds,\n nodeSequences,\n edges: Int32Array.from(edgeHandles),\n paths: this.outputPaths(opts).map(entry => ({\n name: entry.name,\n weight: entry.info.weight,\n cigar: entry.cigar,\n steps: Int32Array.from(\n haplotypeOrderedPath(entry.info, entry.identity),\n ),\n })),\n }\n }\n}\n\n// The buffers a CompactSubgraph owns outright, for the transfer list of a\n// postMessage that hands it to another thread. Transferring detaches them, so\n// the sending side must not read the subgraph afterwards.\nexport function compactSubgraphTransferables(subgraph: CompactSubgraph) {\n return [\n subgraph.nodeIds.buffer,\n subgraph.edges.buffer,\n ...subgraph.paths.map(path => path.steps.buffer),\n ]\n}\n\n// A named walk lists its steps in the haplotype's own direction, as the W line\n// spec and the start..end coordinates beside it require. extractPaths keeps\n// whichever twin of a walk is canonical, which is a property of the handles\n// and not of the haplotype, so the kept walk runs against the haplotype for\n// about half of them; identification records which.\nfunction haplotypeOrderedPath(\n info: PathInfo,\n identity: PathIdentity | undefined,\n) {\n return identity?.orientation === 'reverse'\n ? info.path.map(handle => flipNode(handle)).reverse()\n : info.path\n}\n\nfunction jsonPath(\n info: PathInfo,\n identity: PathIdentity | undefined,\n name: string,\n cigar: string | undefined,\n): SubgraphPath {\n return {\n name,\n ...(info.weight === undefined ? {} : { weight: info.weight }),\n ...(cigar === undefined ? {} : { cigar }),\n path: haplotypeOrderedPath(info, identity).map(handle => ({\n id: String(nodeId(handle)),\n is_reverse: isReverse(handle),\n })),\n }\n}\n\nfunction comparePaths(a: number[], b: number[]) {\n const n = Math.min(a.length, b.length)\n for (let i = 0; i < n; i++) {\n const x = a[i]!\n const y = b[i]!\n if (x !== y) {\n return x < y ? -1 : 1\n }\n }\n return a.length - b.length\n}\n\nfunction appendEdit(edits: Edit[], op: EditOp, len: number) {\n if (len === 0) {\n return\n }\n const last = edits[edits.length - 1]\n if (last?.[0] === op) {\n last[1] += len\n } else {\n edits.push([op, len])\n }\n}\n\nfunction gapPenalty(len: number) {\n return len === 0 ? 0 : 6 + (len - 1)\n}\n\nfunction appendGap(edits: Edit[], pathMiddle: number, refMiddle: number) {\n if (pathMiddle === 0) {\n appendEdit(edits, 'D', refMiddle)\n } else if (refMiddle === 0) {\n appendEdit(edits, 'I', pathMiddle)\n } else {\n const mismatch = Math.min(pathMiddle, refMiddle)\n const mismatchIndel =\n 4 * mismatch +\n gapPenalty(pathMiddle - mismatch) +\n gapPenalty(refMiddle - mismatch)\n const insertionDeletion = gapPenalty(pathMiddle) + gapPenalty(refMiddle)\n if (mismatchIndel <= insertionDeletion) {\n appendEdit(edits, 'M', mismatch)\n appendEdit(edits, 'I', pathMiddle - mismatch)\n appendEdit(edits, 'D', refMiddle - mismatch)\n } else {\n appendEdit(edits, 'I', pathMiddle)\n appendEdit(edits, 'D', refMiddle)\n }\n }\n}\n\nfunction cigarOf(edits: Edit[]) {\n return edits.map(([op, len]) => `${len}${op}`).join('')\n}\n", "import { pathNameFor } from './pathName.ts'\nimport { Subgraph, SubgraphLimitError } from './subgraph.ts'\n\nimport type { GBZBase } from './db.ts'\nimport type { PathName, PathQuery } from './pathName.ts'\nimport type { HaplotypeOutput, SnarlOutput } from './subgraph.ts'\n\nexport type { PathQuery } from './pathName.ts'\n\nexport interface QueryOptions {\n context?: number | undefined\n haplotypes?: HaplotypeOutput | undefined\n snarls?: SnarlOutput | undefined\n limit?: number | undefined\n signal?: AbortSignal | undefined\n}\n\nexport async function subgraphAtOffset(\n db: GBZBase,\n query: PathQuery,\n offset: number,\n opts: QueryOptions = {},\n) {\n const subgraph = new Subgraph(db, opts)\n const reference = await subgraph.pathPosition(pathNameFor(query, offset))\n await subgraph.aroundPosition(\n reference.position.handle,\n reference.position.nodeOffset,\n opts.context ?? 100,\n )\n await subgraph.extractSnarls(opts.snarls ?? 'none')\n subgraph.extractPaths(reference, opts.haplotypes ?? 'all')\n return subgraph\n}\n\nexport async function subgraphInInterval(\n db: GBZBase,\n query: PathQuery,\n start: number,\n end: number,\n opts: QueryOptions = {},\n) {\n const subgraph = new Subgraph(db, opts)\n try {\n const reference = await subgraph.pathPosition(pathNameFor(query, start))\n await subgraph.prefetchReferenceWalk(reference, end - start)\n await subgraph.aroundInterval(\n reference.position,\n end - start,\n opts.context ?? 100,\n )\n await subgraph.extractSnarls(opts.snarls ?? 'none')\n subgraph.extractPaths(reference, opts.haplotypes ?? 'all')\n } catch (error) {\n throw error instanceof SubgraphLimitError && error.windowBp === undefined\n ? new SubgraphLimitError(error.limit, {\n windowBp: end - start,\n walkedBp: subgraph.referenceWalkedBp ?? 0,\n })\n : error\n }\n return subgraph\n}\n\nexport interface HaplotypeQueryOptions extends QueryOptions {\n keep: (name: PathName) => boolean\n}\n\n// The window for a chosen set of haplotypes. With a companion that carries\n// anchor rows the set's walks come from the anchor node before the window\n// and nothing else is extracted or identified; without one, or when a wanted\n// contig starts inside the window, it is the sampled route narrowed after\n// identification, which is what a caller without `keep` gets.\nexport async function subgraphForHaplotypes(\n db: GBZBase,\n query: PathQuery,\n start: number,\n end: number,\n opts: HaplotypeQueryOptions,\n) {\n if (!db.hasHaplotypeIndex) {\n throw new Error(\n 'keep needs the haplotype index: this database cannot name its walks',\n )\n }\n const spacing = await db.haplotypeAnchorSpacing()\n let anchored: Subgraph | undefined\n let fallback: string | undefined\n if (spacing !== undefined && (opts.haplotypes ?? 'all') === 'all') {\n const subgraph = new Subgraph(db, opts)\n try {\n const reference = await subgraph.pathPosition(pathNameFor(query, start))\n fallback = await subgraph.walkHaplotypesFromAnchor(\n reference,\n end - start,\n spacing,\n opts.keep,\n opts.context ?? 100,\n )\n } catch (error) {\n throw error instanceof SubgraphLimitError && error.windowBp === undefined\n ? new SubgraphLimitError(error.limit, {\n windowBp: end - start,\n walkedBp: subgraph.referenceWalkedBp ?? 0,\n })\n : error\n }\n if (fallback === undefined) {\n anchored = subgraph\n } else {\n fallback = `${fallback}; identified from the per-path samples instead`\n const sampled = await subgraphInInterval(db, query, start, end, opts)\n await sampled.identifyPaths()\n sampled.keepHaplotypes(opts.keep)\n sampled.stats.anchorWalk = subgraph.stats.anchorWalk\n if (sampled.stats.anchorWalk) {\n sampled.stats.anchorWalk.fallback = fallback\n }\n anchored = sampled\n }\n } else {\n anchored = await subgraphInInterval(db, query, start, end, opts)\n await anchored.identifyPaths()\n anchored.keepHaplotypes(opts.keep)\n }\n return anchored\n}\n\nexport async function subgraphAroundNodes(\n db: GBZBase,\n nodes: number[],\n opts: QueryOptions = {},\n) {\n const haplotypes = opts.haplotypes ?? 'all'\n const snarls = opts.snarls ?? 'none'\n if (haplotypes === 'reference-only') {\n throw new Error('Cannot output a reference path in a node-based query')\n }\n if (snarls === 'overlapping' && nodes.length > 1) {\n throw new Error(\n 'Overlapping snarls cannot be extracted for a node-based query with multiple nodes',\n )\n }\n const subgraph = new Subgraph(db, opts)\n await subgraph.aroundNodes(nodes, opts.context ?? 100)\n await subgraph.extractSnarls(snarls)\n subgraph.extractPaths(undefined, haplotypes)\n return subgraph\n}\n\nexport async function subgraphBetween(\n db: GBZBase,\n start: number,\n end: number,\n opts: Pick<QueryOptions, 'haplotypes' | 'limit' | 'signal'> = {},\n) {\n const haplotypes = opts.haplotypes ?? 'all'\n if (haplotypes === 'reference-only') {\n throw new Error('Cannot output a reference path in a node-based query')\n }\n const subgraph = new Subgraph(db, opts)\n await subgraph.betweenNodes(start, end)\n subgraph.extractPaths(undefined, haplotypes)\n return subgraph\n}\n", "export type SqlValue = null | number | string | Uint8Array\n\nexport function readVarint(\n bytes: Uint8Array,\n offset: number,\n): [value: number, next: number] {\n let value = 0\n for (let i = 0; i < 8; i++) {\n const byte = bytes[offset + i]\n if (byte === undefined) {\n throw new Error('SQLite varint runs past the end of the buffer')\n }\n value = value * 128 + (byte & 0x7f)\n if ((byte & 0x80) === 0) {\n return [value, offset + i + 1]\n }\n }\n const last = bytes[offset + 8]\n if (last === undefined) {\n throw new Error('SQLite varint runs past the end of the buffer')\n }\n value = value * 256 + last\n if (!Number.isSafeInteger(value)) {\n throw new Error('SQLite varint exceeds the safe integer range')\n }\n return [value, offset + 9]\n}\n\nfunction readSignedInt(view: DataView, offset: number, width: number) {\n switch (width) {\n case 1:\n return view.getInt8(offset)\n case 2:\n return view.getInt16(offset)\n case 3:\n return (view.getInt8(offset) << 16) | view.getUint16(offset + 1)\n case 4:\n return view.getInt32(offset)\n case 6:\n return view.getInt16(offset) * 4294967296 + view.getUint32(offset + 2)\n default: {\n const big = view.getBigInt64(offset)\n if (\n big > BigInt(Number.MAX_SAFE_INTEGER) ||\n big < BigInt(Number.MIN_SAFE_INTEGER)\n ) {\n throw new Error(`SQLite integer ${big} exceeds the safe integer range`)\n }\n return Number(big)\n }\n }\n}\n\nconst decoder = new TextDecoder()\n\nexport function decodeRecord(payload: Uint8Array): SqlValue[] {\n const [headerSize, firstType] = readVarint(payload, 0)\n const types: number[] = []\n let offset = firstType\n while (offset < headerSize) {\n const [type, next] = readVarint(payload, offset)\n types.push(type)\n offset = next\n }\n const view = new DataView(\n payload.buffer,\n payload.byteOffset,\n payload.byteLength,\n )\n let body = headerSize\n return types.map(type => {\n if (type === 0) {\n return null\n }\n if (type >= 1 && type <= 6) {\n const width = type <= 4 ? type : type === 5 ? 6 : 8\n const value = readSignedInt(view, body, width)\n body += width\n return value\n }\n if (type === 7) {\n const value = view.getFloat64(body)\n body += 8\n return value\n }\n if (type === 8) {\n return 0\n }\n if (type === 9) {\n return 1\n }\n if (type >= 12) {\n const length = (type - 12) >> 1\n const slice = payload.subarray(body, body + length)\n body += length\n return type % 2 === 0 ? slice : decoder.decode(slice)\n }\n throw new Error(`SQLite serial type ${type} is reserved`)\n })\n}\n", "import { decodeRecord, readVarint } from './record.ts'\n\nimport type { Pager } from './pager.ts'\nimport type { SqlValue } from './record.ts'\n\nconst INTERIOR_INDEX = 0x02\nconst INTERIOR_TABLE = 0x05\nconst LEAF_INDEX = 0x0a\nconst LEAF_TABLE = 0x0d\n\ninterface PageHeader {\n type: number\n cellCount: number\n rightChild: number\n cellPointers: number\n}\n\nfunction readUint16(page: Uint8Array, offset: number) {\n return page[offset]! * 256 + page[offset + 1]!\n}\n\nfunction readUint32(page: Uint8Array, offset: number) {\n return (\n page[offset]! * 16777216 +\n page[offset + 1]! * 65536 +\n page[offset + 2]! * 256 +\n page[offset + 3]!\n )\n}\n\nfunction readHeader(page: Uint8Array, start: number): PageHeader {\n const type = page[start]\n if (\n type !== INTERIOR_INDEX &&\n type !== INTERIOR_TABLE &&\n type !== LEAF_INDEX &&\n type !== LEAF_TABLE\n ) {\n throw new Error(`SQLite page has unknown b-tree type ${type}`)\n }\n const interior = type === INTERIOR_INDEX || type === INTERIOR_TABLE\n return {\n type,\n cellCount: readUint16(page, start + 3),\n rightChild: interior ? readUint32(page, start + 8) : 0,\n cellPointers: start + (interior ? 12 : 8),\n }\n}\n\nfunction cellOffset(page: Uint8Array, header: PageHeader, index: number) {\n return readUint16(page, header.cellPointers + 2 * index)\n}\n\ninterface IndexCell {\n values: SqlValue[]\n leftChild: number\n}\n\nconst MAX_DECODED_INDEX_PAGES = 4096\n\nconst PREFETCH_PAGE_LIMIT = 4096\n\nexport class BTree {\n private readonly usable: number\n private pager: Pager\n private decodedIndexPages = new Map<number, (IndexCell | undefined)[]>()\n private tableDepths = new Map<number, Promise<number>>()\n\n constructor(pager: Pager, reservedBytes: number) {\n this.pager = pager\n this.usable = pager.pageSize - reservedBytes\n }\n\n private localPayloadSize(total: number, isIndex: boolean) {\n const usable = this.usable\n const maxLocal = isIndex\n ? Math.floor(((usable - 12) * 64) / 255) - 23\n : usable - 35\n if (total <= maxLocal) {\n return total\n }\n const minLocal = Math.floor(((usable - 12) * 32) / 255) - 23\n const spill = minLocal + ((total - minLocal) % (usable - 4))\n return spill <= maxLocal ? spill : minLocal\n }\n\n private async payload(\n page: Uint8Array,\n offset: number,\n total: number,\n isIndex: boolean,\n ) {\n const local = this.localPayloadSize(total, isIndex)\n if (local === total) {\n return page.subarray(offset, offset + total)\n }\n const result = new Uint8Array(total)\n result.set(page.subarray(offset, offset + local), 0)\n let filled = local\n let next = readUint32(page, offset + local)\n while (next !== 0 && filled < total) {\n const overflow = await this.pager.page(next)\n const chunk = overflow.subarray(\n 4,\n 4 + Math.min(this.usable - 4, total - filled),\n )\n result.set(chunk, filled)\n filled += chunk.length\n next = readUint32(overflow, 0)\n }\n if (filled !== total) {\n throw new Error(\n 'SQLite overflow chain ended before the payload was complete',\n )\n }\n return result\n }\n\n private async pageAt(pageNumber: number) {\n const page = await this.pager.page(pageNumber)\n return { page, header: readHeader(page, pageNumber === 1 ? 100 : 0) }\n }\n\n private tableDepth(root: number, towards: number) {\n let depth = this.tableDepths.get(root)\n if (!depth) {\n depth = (async () => {\n let pageNumber = root\n for (let level = 0; ; level++) {\n const { page, header } = await this.pageAt(pageNumber)\n if (header.type === LEAF_TABLE) {\n return level\n }\n if (header.type !== INTERIOR_TABLE) {\n throw new Error('SQLite table b-tree contains an index page')\n }\n const child = this.childIndexFor(page, header, towards)\n pageNumber =\n child === header.cellCount\n ? header.rightChild\n : readUint32(page, cellOffset(page, header, child))\n }\n })()\n this.tableDepths.set(root, depth)\n depth.catch(() => this.tableDepths.delete(root))\n }\n return depth\n }\n\n private childIndexFor(page: Uint8Array, header: PageHeader, rowid: number) {\n let low = 0\n let high = header.cellCount\n while (low < high) {\n const mid = (low + high) >> 1\n const [key] = readVarint(page, cellOffset(page, header, mid) + 4)\n if (key < rowid) {\n low = mid + 1\n } else {\n high = mid\n }\n }\n return low\n }\n\n async prefetchRowidRange(root: number, lo: number, hi: number) {\n const leafLevel = await this.tableDepth(root, lo)\n let pages = [root]\n for (let level = 0; level < leafLevel; level++) {\n const decoded = await Promise.all(pages.map(n => this.pageAt(n)))\n const children: number[] = []\n decoded.forEach(({ page, header }, i) => {\n const from = i === 0 ? this.childIndexFor(page, header, lo) : 0\n const to =\n i === decoded.length - 1\n ? this.childIndexFor(page, header, hi)\n : header.cellCount\n for (let c = from; c <= to; c++) {\n children.push(\n c === header.cellCount\n ? header.rightChild\n : readUint32(page, cellOffset(page, header, c)),\n )\n }\n })\n if (children.length > PREFETCH_PAGE_LIMIT) {\n return false\n }\n this.pager.prefetch(children)\n pages = children\n }\n return true\n }\n\n async tableRowid(\n root: number,\n rowid: number,\n ): Promise<SqlValue[] | undefined> {\n let pageNumber = root\n for (;;) {\n const { page, header } = await this.pageAt(pageNumber)\n if (header.type === LEAF_TABLE) {\n let low = 0\n let high = header.cellCount\n while (low < high) {\n const mid = (low + high) >> 1\n const offset = cellOffset(page, header, mid)\n const [size, afterSize] = readVarint(page, offset)\n const [key, afterKey] = readVarint(page, afterSize)\n if (key === rowid) {\n return decodeRecord(await this.payload(page, afterKey, size, false))\n }\n if (key < rowid) {\n low = mid + 1\n } else {\n high = mid\n }\n }\n return undefined\n }\n if (header.type !== INTERIOR_TABLE) {\n throw new Error('SQLite table b-tree contains an index page')\n }\n let low = 0\n let high = header.cellCount\n while (low < high) {\n const mid = (low + high) >> 1\n const offset = cellOffset(page, header, mid)\n const [key] = readVarint(page, offset + 4)\n if (key < rowid) {\n low = mid + 1\n } else {\n high = mid\n }\n }\n pageNumber =\n low === header.cellCount\n ? header.rightChild\n : readUint32(page, cellOffset(page, header, low))\n }\n }\n\n async *tableScan(\n root: number,\n ): AsyncGenerator<{ rowid: number; values: SqlValue[] }> {\n const { page, header } = await this.pageAt(root)\n if (header.type === LEAF_TABLE) {\n for (let i = 0; i < header.cellCount; i++) {\n const offset = cellOffset(page, header, i)\n const [size, afterSize] = readVarint(page, offset)\n const [rowid, afterKey] = readVarint(page, afterSize)\n yield {\n rowid,\n values: decodeRecord(await this.payload(page, afterKey, size, false)),\n }\n }\n } else {\n const children: number[] = []\n for (let i = 0; i < header.cellCount; i++) {\n children.push(readUint32(page, cellOffset(page, header, i)))\n }\n children.push(header.rightChild)\n this.pager.prefetch(children)\n for (const child of children) {\n yield* this.tableScan(child)\n }\n }\n }\n\n private decodedCells(pageNumber: number, header: PageHeader) {\n let cells = this.decodedIndexPages.get(pageNumber)\n if (cells) {\n this.decodedIndexPages.delete(pageNumber)\n } else {\n cells = new Array<IndexCell | undefined>(header.cellCount)\n if (this.decodedIndexPages.size >= MAX_DECODED_INDEX_PAGES) {\n const oldest = this.decodedIndexPages.keys().next().value\n if (oldest !== undefined) {\n this.decodedIndexPages.delete(oldest)\n }\n }\n }\n this.decodedIndexPages.set(pageNumber, cells)\n return cells\n }\n\n private async indexCell(\n pageNumber: number,\n page: Uint8Array,\n header: PageHeader,\n index: number,\n ): Promise<IndexCell> {\n const cells = this.decodedCells(pageNumber, header)\n let cell = cells[index]\n if (!cell) {\n const offset = cellOffset(page, header, index)\n const interior = header.type === INTERIOR_INDEX\n const [size, afterSize] = readVarint(page, interior ? offset + 4 : offset)\n cell = {\n values: decodeRecord(await this.payload(page, afterSize, size, true)),\n leftChild: interior ? readUint32(page, offset) : 0,\n }\n cells[index] = cell\n }\n return cell\n }\n\n async *indexScanFrom(\n root: number,\n low: number[],\n ): AsyncGenerator<SqlValue[]> {\n const { page, header } = await this.pageAt(root)\n let first = 0\n let high = header.cellCount\n while (first < high) {\n const mid = (first + high) >> 1\n const cell = await this.indexCell(root, page, header, mid)\n if (compareKey(cell.values, low) < 0) {\n first = mid + 1\n } else {\n high = mid\n }\n }\n for (let i = first; i < header.cellCount; i++) {\n const cell = await this.indexCell(root, page, header, i)\n if (header.type === INTERIOR_INDEX) {\n yield* this.indexScanFrom(cell.leftChild, low)\n }\n yield cell.values\n }\n if (header.type === INTERIOR_INDEX) {\n yield* this.indexScanFrom(header.rightChild, low)\n }\n }\n\n async indexSeekLE(\n root: number,\n key: number[],\n ): Promise<SqlValue[] | undefined> {\n let best: SqlValue[] | undefined\n let pageNumber = root\n for (;;) {\n const { page, header } = await this.pageAt(pageNumber)\n let low = 0\n let high = header.cellCount\n let child = 0\n while (low < high) {\n const mid = (low + high) >> 1\n const cell = await this.indexCell(pageNumber, page, header, mid)\n if (compareKey(cell.values, key) <= 0) {\n best = cell.values\n low = mid + 1\n } else {\n child = cell.leftChild\n high = mid\n }\n }\n if (header.type === LEAF_INDEX) {\n return best\n }\n pageNumber = low === header.cellCount ? header.rightChild : child\n }\n }\n}\n\nfunction compareKey(values: SqlValue[], key: number[]) {\n for (let i = 0; i < key.length; i++) {\n const a = values[i]\n const b = key[i]\n if (typeof a !== 'number' || b === undefined) {\n throw new Error('SQLite index key is not numeric')\n }\n if (a !== b) {\n return a < b ? -1 : 1\n }\n }\n return 0\n}\n", "import type { ByteSource } from '../filehandle.ts'\n\nexport interface PagerOptions {\n blockSize?: number\n maxBlocks?: number\n}\n\nexport class Pager {\n private blocks = new Map<number, Promise<Uint8Array>>()\n private readonly blockSize: number\n private readonly maxBlocks: number\n bytesFetched = 0\n fetches = 0\n\n private source: ByteSource\n readonly pageSize: number\n private fileSize: number\n\n constructor(\n source: ByteSource,\n pageSize: number,\n fileSize: number,\n opts: PagerOptions = {},\n ) {\n this.source = source\n this.pageSize = pageSize\n this.fileSize = fileSize\n const requested = opts.blockSize ?? 65536\n this.blockSize = Math.max(\n pageSize,\n Math.ceil(requested / pageSize) * pageSize,\n )\n this.maxBlocks = opts.maxBlocks ?? 256\n }\n\n private async read(length: number, start: number) {\n let attempt = 0\n for (;;) {\n try {\n const bytes = await this.source.read(length, start)\n this.bytesFetched += bytes.length\n return bytes\n } catch (error) {\n attempt += 1\n if (attempt >= 3) {\n throw error\n }\n await new Promise(resolve => setTimeout(resolve, 200 * attempt))\n }\n }\n }\n\n seed(index: number, bytes: Uint8Array) {\n if (\n bytes.length ===\n Math.min(this.blockSize, this.fileSize - index * this.blockSize)\n ) {\n this.blocks.set(index, Promise.resolve(bytes))\n }\n }\n\n private block(index: number) {\n const cached = this.blocks.get(index)\n if (cached) {\n this.blocks.delete(index)\n this.blocks.set(index, cached)\n return cached\n }\n const start = index * this.blockSize\n const length = Math.min(this.blockSize, this.fileSize - start)\n const pending = this.read(length, start)\n this.fetches += 1\n this.blocks.set(index, pending)\n this.forgetOnFailure(pending, [index])\n this.evict()\n return pending\n }\n\n prefetch(pageNumbers: number[]) {\n const wanted = [\n ...new Set(\n pageNumbers.map(pageNumber =>\n Math.floor(((pageNumber - 1) * this.pageSize) / this.blockSize),\n ),\n ),\n ]\n .filter(index => !this.blocks.has(index))\n .sort((a, b) => a - b)\n let runStart = 0\n while (runStart < wanted.length) {\n let runEnd = runStart + 1\n while (\n runEnd < wanted.length &&\n wanted[runEnd] === wanted[runEnd - 1]! + 1\n ) {\n runEnd += 1\n }\n this.fetchRun(wanted[runStart]!, runEnd - runStart)\n runStart = runEnd\n }\n }\n\n private fetchRun(firstIndex: number, count: number) {\n const start = firstIndex * this.blockSize\n const length = Math.min(count * this.blockSize, this.fileSize - start)\n const pending = this.read(length, start)\n this.fetches += 1\n const indexes: number[] = []\n for (let i = 0; i < count; i++) {\n const within = i * this.blockSize\n indexes.push(firstIndex + i)\n this.blocks.set(\n firstIndex + i,\n pending.then(bytes => bytes.subarray(within, within + this.blockSize)),\n )\n }\n this.forgetOnFailure(pending, indexes)\n this.evict()\n }\n\n private forgetOnFailure(pending: Promise<Uint8Array>, indexes: number[]) {\n pending.catch(() => {\n for (const index of indexes) {\n this.blocks.delete(index)\n }\n })\n }\n\n private evict() {\n while (this.blocks.size > this.maxBlocks) {\n const oldest = this.blocks.keys().next().value\n if (oldest === undefined) {\n break\n }\n this.blocks.delete(oldest)\n }\n }\n\n async page(pageNumber: number) {\n const offset = (pageNumber - 1) * this.pageSize\n if (pageNumber < 1 || offset + this.pageSize > this.fileSize) {\n throw new Error(`SQLite page ${pageNumber} is outside the file`)\n }\n const bytes = await this.block(Math.floor(offset / this.blockSize))\n const within = offset % this.blockSize\n return bytes.subarray(within, within + this.pageSize)\n }\n}\n", "import { BTree } from './btree.ts'\nimport { Pager } from './pager.ts'\n\nimport type { ByteSource } from '../filehandle.ts'\nimport type { PagerOptions } from './pager.ts'\nimport type { SqlValue } from './record.ts'\n\nexport interface SqliteObject {\n type: string\n name: string\n tableName: string\n rootPage: number\n sql: string\n}\n\nexport class SqliteDatabase {\n readonly pager: Pager\n readonly btree: BTree\n readonly objects: Map<string, SqliteObject>\n\n private constructor(\n pager: Pager,\n btree: BTree,\n objects: Map<string, SqliteObject>,\n ) {\n this.pager = pager\n this.btree = btree\n this.objects = objects\n }\n\n static async open(source: ByteSource, opts: PagerOptions = {}) {\n const { size } = await source.stat()\n const firstBlock = await source.read(\n Math.min(opts.blockSize ?? 65536, size),\n 0,\n )\n const header = firstBlock.subarray(0, 100)\n const magic = new TextDecoder().decode(header.subarray(0, 15))\n if (magic !== 'SQLite format 3') {\n throw new Error('Not a SQLite database')\n }\n const view = new DataView(\n header.buffer,\n header.byteOffset,\n header.byteLength,\n )\n const rawPageSize = view.getUint16(16)\n const pageSize = rawPageSize === 1 ? 65536 : rawPageSize\n const reserved = header[20] ?? 0\n const encoding = view.getUint32(56)\n if (encoding !== 1) {\n throw new Error(`SQLite text encoding ${encoding} is not UTF-8`)\n }\n const pager = new Pager(source, pageSize, size, opts)\n pager.seed(0, firstBlock)\n pager.fetches += 1\n pager.bytesFetched += firstBlock.length\n const btree = new BTree(pager, reserved)\n const objects = new Map<string, SqliteObject>()\n for await (const { values } of btree.tableScan(1)) {\n const [type, name, tableName, rootPage, sql] = values\n if (\n typeof type === 'string' &&\n typeof name === 'string' &&\n typeof tableName === 'string' &&\n typeof rootPage === 'number'\n ) {\n objects.set(name, {\n type,\n name,\n tableName,\n rootPage,\n sql: typeof sql === 'string' ? sql : '',\n })\n }\n }\n return new SqliteDatabase(pager, btree, objects)\n }\n\n rootPage(name: string) {\n const object = this.objects.get(name)\n if (!object) {\n throw new Error(`SQLite database has no object named ${name}`)\n }\n return object.rootPage\n }\n\n indexOn(tableName: string) {\n const index = [...this.objects.values()].find(\n o => o.type === 'index' && o.tableName === tableName,\n )\n if (!index) {\n throw new Error(`SQLite table ${tableName} has no index`)\n }\n return index.rootPage\n }\n\n byRowid(table: string, rowid: number) {\n return this.btree.tableRowid(this.rootPage(table), rowid)\n }\n\n prefetchRows(table: string, lo: number, hi: number) {\n return this.btree.prefetchRowidRange(this.rootPage(table), lo, hi)\n }\n\n scan(table: string) {\n return this.btree.tableScan(this.rootPage(table))\n }\n\n indexSeekLE(table: string, key: number[]): Promise<SqlValue[] | undefined> {\n return this.btree.indexSeekLE(this.indexOn(table), key)\n }\n\n indexScanFrom(table: string, low: number[]) {\n return this.btree.indexScanFrom(this.indexOn(table), low)\n }\n\n has(name: string) {\n return this.objects.has(name)\n }\n}\n", "import { ENDMARKER, nodeId, nodeOrientation } from './gbwt/node.ts'\nimport { GbwtRecord, decompressEdges } from './gbwt/record.ts'\nimport { decodeSequence, encodedSequenceLength } from './gbwt/sequence.ts'\nimport { graphNameFromTags } from './graphName.ts'\nimport { formatPathName, pathNameFor, toPathQuery } from './pathName.ts'\nimport { subgraphForHaplotypes, subgraphInInterval } from './query.ts'\nimport { SqliteDatabase } from './sqlite/database.ts'\n\nimport type { ByteSource } from './filehandle.ts'\nimport type { Pos } from './gbwt/record.ts'\nimport type { GraphName } from './graphName.ts'\nimport type { PathName, PathRef } from './pathName.ts'\nimport type { QueryOptions } from './query.ts'\nimport type { PagerOptions } from './sqlite/pager.ts'\nimport type { SqlValue } from './sqlite/record.ts'\nimport type { HaplotypeAlignment } from './subgraph.ts'\n\nexport const SCHEMA_VERSION = 'GBZ-base version 4'\n\nexport interface PathFragment {\n path: GbzPath\n start: number\n end: number\n}\n\nexport interface RangeOptions extends QueryOptions {\n keep?: ((name: PathName) => boolean) | undefined\n}\n\nexport interface AlignmentOptions extends Pick<\n RangeOptions,\n 'context' | 'limit' | 'signal' | 'keep'\n> {\n haplotypes?: 'all' | 'distinct' | undefined\n}\n\nexport class ForwardOnlyIndexError extends Error {\n override name = 'ForwardOnlyIndexError'\n\n constructor() {\n super(\n 'the haplotype index was written with --forward-only, which cannot name the walks stored against their reference (about half of them); rebuild it with gbz-haplotype-index without --forward-only',\n )\n }\n}\n\nexport class SchemaVersionError extends Error {\n override name = 'SchemaVersionError'\n\n readonly found: string | undefined\n\n constructor(found: string | undefined) {\n super(\n found === undefined\n ? `not a gbz-base database: its Tags table has no version`\n : `unsupported database schema \"${found}\"; this reader understands \"${SCHEMA_VERSION}\"`,\n )\n this.found = found\n }\n}\n\nexport interface IndexedPosition {\n pathOffset: number\n pos: Pos\n}\n\nexport interface HaplotypeSample {\n node: number\n offset: number\n pathHandle: number\n orientation: 'forward' | 'reverse'\n pathOffset: number\n}\n\nexport interface HaplotypeAnchor {\n node: number\n pathOffset: number\n}\n\nexport interface GbzPath {\n handle: number\n fwStart: Pos\n revStart: Pos\n name: PathName\n isIndexed: boolean\n}\n\nexport class GbzRecord {\n readonly sequenceLen: number\n readonly handle: number\n readonly edges: Pos[]\n readonly bwt: Uint8Array\n readonly encodedSequence: Uint8Array\n readonly next: number | undefined\n private decoded: string | undefined\n\n constructor(\n handle: number,\n edges: Pos[],\n bwt: Uint8Array,\n encodedSequence: Uint8Array,\n next: number | undefined,\n ) {\n this.handle = handle\n this.edges = edges\n this.bwt = bwt\n this.encodedSequence = encodedSequence\n this.next = next\n this.sequenceLen = encodedSequenceLength(encodedSequence)\n }\n\n get id() {\n return nodeId(this.handle)\n }\n\n get orientation() {\n return nodeOrientation(this.handle)\n }\n\n get sequence() {\n this.decoded ??= decodeSequence(this.encodedSequence)\n return this.decoded\n }\n\n successors() {\n return this.edges.filter(e => e.node !== ENDMARKER).map(e => e.node)\n }\n\n gbwt() {\n if (this.edges.length === 0) {\n throw new Error(`GBWT record for handle ${this.handle} is empty`)\n }\n return new GbwtRecord(this.edges, this.bwt)\n }\n}\n\nfunction num(value: SqlValue | undefined, what: string) {\n if (typeof value !== 'number') {\n throw new Error(`${what} is not a number in the database`)\n }\n return value\n}\n\nfunction str(value: SqlValue | undefined, what: string) {\n if (typeof value !== 'string') {\n throw new Error(`${what} is not text in the database`)\n }\n return value\n}\n\nfunction blob(value: SqlValue | undefined, what: string) {\n if (!(value instanceof Uint8Array)) {\n throw new Error(`${what} is not a blob in the database`)\n }\n return value\n}\n\nfunction rowToPath(rowid: number, values: SqlValue[]): GbzPath {\n return {\n handle: rowid,\n fwStart: {\n node: num(values[1], 'Paths.fw_node'),\n offset: num(values[2], 'Paths.fw_offset'),\n },\n revStart: {\n node: num(values[3], 'Paths.rev_node'),\n offset: num(values[4], 'Paths.rev_offset'),\n },\n name: {\n sample: str(values[5], 'Paths.sample'),\n contig: str(values[6], 'Paths.contig'),\n haplotype: num(values[7], 'Paths.haplotype'),\n fragment: num(values[8], 'Paths.fragment'),\n },\n isIndexed: num(values[9], 'Paths.is_indexed') !== 0,\n }\n}\n\nexport interface OpenOptions extends PagerOptions {\n haplotypeIndex?: ByteSource\n}\n\nasync function readTags(sqlite: SqliteDatabase) {\n const tags = new Map<string, string>()\n for await (const { values } of sqlite.scan('Tags')) {\n tags.set(str(values[0], 'Tags.key'), str(values[1], 'Tags.value'))\n }\n return tags\n}\n\nexport class GBZBase {\n private tagCache: Promise<Map<string, string>> | undefined\n private pathCache: Promise<GbzPath[]> | undefined\n private pathMapCache: Promise<Map<number, GbzPath>> | undefined\n private indexTags: Map<string, string> | undefined\n\n readonly sqlite: SqliteDatabase\n readonly index: SqliteDatabase\n\n private constructor(sqlite: SqliteDatabase, index: SqliteDatabase) {\n this.sqlite = sqlite\n this.index = index\n }\n\n static async open(source: ByteSource, opts: OpenOptions = {}) {\n const { haplotypeIndex, ...pagerOptions } = opts\n const sqlite = await SqliteDatabase.open(source, pagerOptions)\n for (const table of ['Tags', 'Nodes', 'Paths', 'ReferenceIndex']) {\n sqlite.rootPage(table)\n }\n const index = haplotypeIndex\n ? await SqliteDatabase.open(haplotypeIndex, pagerOptions)\n : sqlite\n const db = new GBZBase(sqlite, index)\n const version = await db.tag('version')\n if (version !== SCHEMA_VERSION) {\n throw new SchemaVersionError(version)\n }\n if (haplotypeIndex) {\n for (const table of ['Tags', 'HaplotypeSamples', 'HaplotypeLengths']) {\n index.rootPage(table)\n }\n db.indexTags = await readTags(index)\n const indexed = db.indexTags.get('haplotype_index_paths')\n const paths = await db.tag('paths')\n if (indexed !== paths) {\n throw new Error(\n `haplotype index was built for ${indexed ?? 'an unknown number of'} paths but the graph has ${paths}`,\n )\n }\n const indexedNodes = db.indexTags.get('haplotype_index_nodes')\n const nodes = await db.tag('nodes')\n if (indexedNodes !== undefined && indexedNodes !== nodes) {\n throw new Error(\n `haplotype index was built for a graph with ${indexedNodes} nodes but this one has ${nodes}`,\n )\n }\n }\n if (db.hasHaplotypeIndex) {\n const orientations = await db.haplotypeIndexTag(\n 'haplotype_index_orientations',\n )\n if (orientations === 'forward') {\n throw new ForwardOnlyIndexError()\n }\n }\n return db\n }\n\n tags() {\n this.tagCache ??= readTags(this.sqlite)\n return this.tagCache\n }\n\n async tag(key: string) {\n return (await this.tags()).get(key)\n }\n\n prefetchRecords(lo: number, hi: number) {\n return this.sqlite.prefetchRows('Nodes', lo, hi)\n }\n\n async getRecord(handle: number) {\n const row = await this.sqlite.byRowid('Nodes', handle)\n if (!row) {\n return undefined\n }\n const next = row[4]\n return new GbzRecord(\n handle,\n decompressEdges(blob(row[1], 'Nodes.edges')),\n blob(row[2], 'Nodes.bwt'),\n blob(row[3], 'Nodes.sequence'),\n typeof next === 'number' ? next : undefined,\n )\n }\n\n paths() {\n this.pathCache ??= (async () => {\n const paths: GbzPath[] = []\n for await (const { rowid, values } of this.sqlite.scan('Paths')) {\n paths.push(rowToPath(rowid, values))\n }\n return paths\n })()\n return this.pathCache\n }\n\n async getPath(handle: number) {\n const row = await this.sqlite.byRowid('Paths', handle)\n return row ? rowToPath(handle, row) : undefined\n }\n\n pathsByHandle() {\n this.pathMapCache ??= this.paths().then(\n paths => new Map(paths.map(path => [path.handle, path])),\n )\n return this.pathMapCache\n }\n\n async findPath(name: PathName) {\n const candidates = (await this.paths()).filter(\n p =>\n p.name.sample === name.sample &&\n p.name.contig === name.contig &&\n p.name.haplotype === name.haplotype &&\n p.name.fragment <= name.fragment,\n )\n return candidates.sort((a, b) => b.name.fragment - a.name.fragment)[0]\n }\n\n async pathsForSample(sample: string) {\n return (await this.paths()).filter(p => p.name.sample === sample)\n }\n\n private async pathsNamed(ref: PathRef) {\n const name = pathNameFor(toPathQuery(ref), 0)\n return (await this.paths())\n .filter(\n p =>\n p.name.sample === name.sample &&\n p.name.contig === name.contig &&\n p.name.haplotype === name.haplotype,\n )\n .sort((a, b) => a.name.fragment - b.name.fragment)\n }\n\n async hasPath(ref: PathRef) {\n return (await this.pathsNamed(ref)).length > 0\n }\n\n private pathLengths = new Map<number, Promise<number>>()\n\n pathLength(handle: number) {\n let length = this.pathLengths.get(handle)\n if (!length) {\n length = this.walkPathLength(handle)\n this.pathLengths.set(handle, length)\n length.catch(() => this.pathLengths.delete(handle))\n }\n return length\n }\n\n private async walkPathLength(handle: number) {\n const indexed = this.hasHaplotypeIndex\n ? await this.haplotypeLength(handle)\n : undefined\n if (indexed === undefined) {\n const last = await this.indexedPosition(handle, Number.MAX_SAFE_INTEGER)\n if (!last) {\n const path = await this.getPath(handle)\n throw new Error(\n `Path ${path ? formatPathName(path.name, path.name.fragment) : handle} has not been indexed for random access`,\n )\n }\n let length = last.pathOffset\n let pos = last.pos\n for (;;) {\n const record = await this.getRecord(pos.node)\n if (!record) {\n throw new Error(`Node ${pos.node} does not exist in the graph`)\n }\n length += record.sequenceLen\n const next = record.gbwt().lf(pos.offset)\n if (!next || next.node === ENDMARKER) {\n return length\n }\n pos = next\n }\n }\n return indexed\n }\n\n async pathFragmentsForRange(\n ref: PathRef,\n start: number,\n end: number,\n ): Promise<PathFragment[]> {\n if (end <= start) {\n return []\n }\n const ordered = await this.pathsNamed(ref)\n const covering = ordered.filter(p => p.name.fragment <= start).slice(-1)\n const within = ordered.filter(\n p => p.name.fragment > start && p.name.fragment < end,\n )\n const fragments = await Promise.all(\n [...covering, ...within].map(async path => ({\n path,\n start: path.name.fragment,\n end: path.name.fragment + (await this.pathLength(path.handle)),\n })),\n )\n return fragments.filter(f => start < f.end)\n }\n\n private async subgraphForFragment(\n fragment: PathFragment,\n start: number,\n end: number,\n opts: RangeOptions,\n ) {\n const { keep, ...queryOptions } = opts\n if (keep !== undefined && !this.hasHaplotypeIndex) {\n throw new Error(\n 'keep needs the haplotype index: this database cannot name its walks',\n )\n }\n const { sample, contig, haplotype } = fragment.path.name\n const query = { sample, contig, haplotype }\n const from = Math.max(start, fragment.start)\n const to = Math.min(end, fragment.end)\n const haplotypes = opts.haplotypes ?? 'all'\n const named = haplotypes === 'all' || haplotypes === 'distinct'\n let subgraph\n if (keep !== undefined && haplotypes === 'all') {\n subgraph = await subgraphForHaplotypes(this, query, from, to, {\n ...queryOptions,\n keep,\n })\n } else {\n subgraph = await subgraphInInterval(this, query, from, to, queryOptions)\n if (this.hasHaplotypeIndex && named) {\n await subgraph.identifyPaths()\n if (keep !== undefined) {\n subgraph.keepHaplotypes(keep)\n }\n }\n }\n return subgraph\n }\n\n async getSubgraphForRange(\n ref: PathRef,\n start: number,\n end: number,\n opts: RangeOptions = {},\n ) {\n const [fragment] = await this.pathFragmentsForRange(ref, start, end)\n return fragment\n ? this.subgraphForFragment(fragment, start, end, opts)\n : undefined\n }\n\n async getAlignmentsForRange(\n ref: PathRef,\n start: number,\n end: number,\n opts: AlignmentOptions = {},\n ) {\n const result: HaplotypeAlignment[] = []\n for (const fragment of await this.pathFragmentsForRange(ref, start, end)) {\n const subgraph = await this.subgraphForFragment(\n fragment,\n start,\n end,\n opts,\n )\n result.push(...subgraph.alignments())\n }\n return result\n }\n\n async graphName() {\n const gbzTags = new Map<string, string>()\n for (const [key, value] of await this.tags()) {\n if (key.startsWith('gbz_')) {\n gbzTags.set(key.slice('gbz_'.length), value)\n }\n }\n let name: GraphName = {\n name: undefined,\n subgraph: new Map(),\n translation: new Map(),\n }\n try {\n name = graphNameFromTags(gbzTags)\n } catch {\n // upstream falls back to an empty name when the tags do not parse\n }\n return name\n }\n\n async hasChainLinks() {\n const links = await this.tag('chain_links')\n return links !== undefined && Number(links) > 0\n }\n\n get hasHaplotypeIndex() {\n return (\n this.index.has('HaplotypeSamples') && this.index.has('HaplotypeLengths')\n )\n }\n\n private async haplotypeIndexTag(key: string) {\n return this.indexTags ? this.indexTags.get(key) : await this.tag(key)\n }\n\n async haplotypeSampleInterval() {\n const value = await this.haplotypeIndexTag('haplotype_index_interval')\n return value === undefined ? undefined : Number(value)\n }\n\n async haplotypeAnchorSpacing() {\n const value =\n this.hasHaplotypeIndex && this.index.has('HaplotypeAnchors')\n ? await this.haplotypeIndexTag('haplotype_index_anchor_spacing')\n : undefined\n return value === undefined ? undefined : Number(value)\n }\n\n async haplotypeAnchor(\n pathHandle: number,\n anchorOffset: number,\n ): Promise<HaplotypeAnchor | undefined> {\n const key = await this.index.indexSeekLE('HaplotypeAnchors', [\n pathHandle,\n anchorOffset,\n ])\n const row =\n key?.[0] === pathHandle && key[1] === anchorOffset\n ? await this.index.byRowid(\n 'HaplotypeAnchors',\n num(key[2], 'HaplotypeAnchors rowid'),\n )\n : undefined\n return row\n ? {\n node: num(row[2], 'HaplotypeAnchors.node_handle'),\n pathOffset: num(row[3], 'HaplotypeAnchors.path_offset'),\n }\n : undefined\n }\n\n haplotypeSamplesAtNode(handle: number) {\n return this.haplotypeSamplesInRange(handle, handle)\n }\n\n private sampleFromRow(values: SqlValue[]): HaplotypeSample {\n return {\n node: num(values[0], 'HaplotypeSamples.node_handle'),\n offset: num(values[1], 'HaplotypeSamples.node_offset'),\n pathHandle: num(values[2], 'HaplotypeSamples.path_handle'),\n orientation:\n num(values[3], 'HaplotypeSamples.orientation') === 0\n ? 'forward'\n : 'reverse',\n pathOffset: num(values[4], 'HaplotypeSamples.path_offset'),\n }\n }\n\n async haplotypeSamplesInRange(minHandle: number, maxHandle: number) {\n const samples: HaplotypeSample[] = []\n for await (const key of this.index.indexScanFrom('HaplotypeSamples', [\n minHandle,\n 0,\n ])) {\n const node = num(key[0], 'HaplotypeSamples.node_handle')\n if (node > maxHandle) {\n break\n }\n const row = await this.index.byRowid(\n 'HaplotypeSamples',\n num(key[2], 'HaplotypeSamples rowid'),\n )\n if (row) {\n samples.push(this.sampleFromRow(row))\n }\n }\n return samples\n }\n\n async haplotypeSampleAt(node: number, offset: number) {\n const key = await this.index.indexSeekLE('HaplotypeSamples', [node, offset])\n if (key?.[0] !== node || key[1] !== offset) {\n return undefined\n }\n const row = await this.index.byRowid(\n 'HaplotypeSamples',\n num(key[2], 'HaplotypeSamples rowid'),\n )\n return row ? this.sampleFromRow(row) : undefined\n }\n\n async haplotypeLength(pathHandle: number) {\n const row = await this.index.byRowid('HaplotypeLengths', pathHandle)\n return row ? num(row[1], 'HaplotypeLengths.length') : undefined\n }\n\n private async indexedRow(rowid: number): Promise<IndexedPosition> {\n const row = await this.sqlite.byRowid('ReferenceIndex', rowid)\n if (!row) {\n throw new Error('ReferenceIndex row referenced by its index is missing')\n }\n return {\n pathOffset: num(row[1], 'ReferenceIndex.path_offset'),\n pos: {\n node: num(row[2], 'ReferenceIndex.node_handle'),\n offset: num(row[3], 'ReferenceIndex.node_offset'),\n },\n }\n }\n\n private async indexedRowid(pathHandle: number, pathOffset: number) {\n const key = await this.sqlite.indexSeekLE('ReferenceIndex', [\n pathHandle,\n pathOffset,\n ])\n return key?.[0] === pathHandle\n ? num(key[2], 'ReferenceIndex rowid')\n : undefined\n }\n\n async indexedPosition(\n pathHandle: number,\n pathOffset: number,\n ): Promise<IndexedPosition | undefined> {\n const rowid = await this.indexedRowid(pathHandle, pathOffset)\n return rowid === undefined ? undefined : this.indexedRow(rowid)\n }\n\n async indexedPositionsBetween(\n pathHandle: number,\n fromOffset: number,\n toOffset: number,\n ) {\n const [first, last] = await Promise.all([\n this.indexedRowid(pathHandle, fromOffset),\n this.indexedRowid(pathHandle, toOffset),\n ])\n const positions: IndexedPosition[] = []\n if (first !== undefined && last !== undefined) {\n await this.sqlite.prefetchRows('ReferenceIndex', first, last + 1)\n for (let rowid = first; rowid <= last; rowid++) {\n positions.push(await this.indexedRow(rowid))\n }\n }\n return positions\n }\n}\n", "import { GBZBase } from '@gmod/gbz-base'\nimport { cachedSetup } from '@jbrowse/core/data_adapters/BaseAdapter'\nimport { updateStatus } from '@jbrowse/core/util'\nimport { openLocation } from '@jbrowse/core/util/io'\nimport { ObservableCreate } from '@jbrowse/core/util/rxjs'\n\nimport {\n assemblyByPanSNPrefix,\n panSNMatchesPrefix,\n panSNSample,\n resolvePanSNPrefix,\n} from '../pansn.ts'\nimport { ComparativeAdapterBase } from '../synteny/ComparativeAdapterBase.ts'\nimport SyntenyFeature from '../synteny/SyntenyFeature.ts'\n\nimport type { GbzBaseSyntenyAdapterConfig } from './configSchema.ts'\nimport type { SubgraphAdapterOptions } from '../GetSubgraph.ts'\nimport type {\n HaplotypeAlignment,\n HaplotypeRef,\n PairAlignment,\n PathName,\n PathQuery,\n} from '@gmod/gbz-base'\nimport type { BaseOptions } from '@jbrowse/core/data_adapters/BaseAdapter'\nimport type { Feature, SimpleFeatureSerialized } from '@jbrowse/core/util'\nimport type { FileLocation, Region } from '@jbrowse/core/util/types'\nimport type { ComparativeOptions } from '@jbrowse/synteny-core'\n\nexport class NoHaplotypeIndexError extends Error {\n override name = 'NoHaplotypeIndexError'\n\n constructor() {\n super(\n 'this .gbz.db has no HaplotypeSamples/HaplotypeLengths tables, so its walks cannot be named; run gbz-haplotype-index (from @gmod/gbz-base) over it first',\n )\n }\n}\n\nexport class NoReferenceSampleError extends Error {\n override name = 'NoReferenceSampleError'\n\n constructor(anchor: string, referenceSamples: string[]) {\n super(\n referenceSamples.length === 0\n ? `the graph names no reference sample (gbwt_reference_samples) and the anchor \"${anchor}\" maps to none; set referenceSample`\n : `the anchor \"${anchor}\" is none of the graph's reference samples (${referenceSamples.join(', ')}); set referenceSample or map it through assemblyNameToPanSN`,\n )\n }\n}\n\nexport function haplotypePrefix(name: Pick<PathName, 'sample' | 'haplotype'>) {\n return `${name.sample}#${name.haplotype}`\n}\n\nexport interface GbzHaplotype {\n prefix: string\n sample: string\n haplotype: number\n contigs: string[]\n isReference: boolean\n}\n\n/**\n * One lane the header declares, in the shape MultiWaySyntenyDisplay's lane\n * picker reads: `name` is the lane's assembly name, the same string the\n * fetched features' mates carry, `label` its PanSN prefix and `group` its\n * sample, so a diploid sample's two lanes sit together\n */\nexport interface GbzHeaderLane {\n name: string\n label: string\n group: string\n}\n\n/**\n * `haplotypes` narrows a fetch to the lanes listed: PanSN prefixes at sample\n * (`HG002`) or haplotype (`HG002#1`) depth, or assembly names the config maps\n * to one; undefined is every haplotype.\n *\n * `queryAssemblyName` with `targetAssemblyName`, on a window of the anchor,\n * asks for that pair of lanes aligned to each other inside the window.\n */\nexport interface GbzFeatureOptions extends ComparativeOptions {\n haplotypes?: string[]\n queryAssemblyName?: string\n}\n\nexport class PairTargetError extends Error {\n override name = 'PairTargetError'\n\n constructor(queryAssemblyName: string) {\n super(\n `a pair query names both lanes: queryAssemblyName ${queryAssemblyName} came without a targetAssemblyName`,\n )\n }\n}\n\nfunction haplotypeWanted(name: PathName, wanted: string[] | undefined) {\n const prefix = haplotypePrefix(name)\n return (\n wanted === undefined ||\n wanted.some(candidate => panSNMatchesPrefix(prefix, candidate))\n )\n}\n\nexport class HaplotypeWindowError extends Error {\n override name = 'HaplotypeWindowError'\n\n constructor(assemblyName: string, anchor: string) {\n super(\n `the graph is cut on its reference, ${anchor}; a window on ${assemblyName} has no reference coordinates to cut at. Open the graph from a ${anchor} view, and find this haplotype's lane there`,\n )\n }\n}\n\nexport class NodeLimitError extends Error {\n override name = 'NodeLimitError'\n\n constructor(limit: number, windowBp: number, fitsBp: number) {\n super(\n `this ${windowBp.toLocaleString()} bp window reads more than nodeLimit (${limit.toLocaleString()}) graph nodes; zoom in to about ${fitsBp.toLocaleString()} bp or raise nodeLimit`,\n )\n }\n}\n\n/**\n * gbz-base reports the node limit with how far along the reference the walk\n * had got when it tripped; a window that fits is that far, with a margin, or\n * half the window when the limit tripped while extending past the reference.\n */\nexport function nodeLimitError(\n error: unknown,\n limit: number,\n windowBp: number,\n) {\n const isLimit =\n error instanceof Error &&\n (error.name === 'SubgraphLimitError' ||\n /^Subgraph size limit of \\d+ nodes exceeded/.test(error.message))\n if (!isLimit) {\n return undefined\n } else {\n const walked = (error as { walkedBp?: unknown }).walkedBp\n const fits =\n typeof walked === 'number' && walked > 0\n ? Math.floor(walked * 0.8)\n : Math.floor(windowBp / 2)\n return new NodeLimitError(limit, windowBp, Math.max(fits, 1))\n }\n}\n\n/**\n * The lane a haplotype draws on: the JBrowse assembly the config maps to it at\n * haplotype or sample depth, else its own PanSN prefix. The fallback stays at\n * haplotype depth, unlike the multi-genome PAF adapters', because a diploid\n * sample's two walks are two lanes here.\n */\nexport function laneAssemblyName(\n asmByPrefix: Record<string, string>,\n name: Pick<PathName, 'sample' | 'haplotype'>,\n) {\n const prefix = haplotypePrefix(name)\n return asmByPrefix[prefix] ?? asmByPrefix[name.sample] ?? prefix\n}\n\nexport function resolveReferenceSample({\n configured,\n anchorPrefix,\n referenceSamples,\n}: {\n configured: string\n anchorPrefix: string\n referenceSamples: string[]\n}) {\n const fromAnchor = panSNSample(anchorPrefix)\n if (configured !== '') {\n return configured\n } else if (referenceSamples.includes(fromAnchor)) {\n return fromAnchor\n } else if (referenceSamples.length === 1) {\n return referenceSamples[0]!\n } else {\n throw new NoReferenceSampleError(anchorPrefix, referenceSamples)\n }\n}\n\n/**\n * The id of one haplotype fragment: the walk's GBWT position at its first node\n * in the window, which is a property of the graph, so the same fragment gets\n * the same id on a refetch of the same window and the display's hover and\n * selection survive it. `clipToRegion` suffixes the window.\n */\nfunction fragmentId(name: PathName, alignment: HaplotypeAlignment) {\n return `${haplotypePrefix(name)}#${name.contig}@${alignment.start.node}.${alignment.start.offset}`\n}\n\nexport function fragmentFeature({\n alignment,\n assemblyName,\n refName,\n lane,\n}: {\n alignment: HaplotypeAlignment\n assemblyName: string\n refName: string\n lane: string\n}) {\n const { refStart, refEnd, strand, cigar } = alignment\n if (!alignment.resolved || refEnd <= refStart) {\n return undefined\n } else {\n const { name, hapStart, hapEnd } = alignment\n const id = fragmentId(name, alignment)\n const data: SimpleFeatureSerialized = {\n uniqueId: id,\n assemblyName,\n refName,\n start: refStart,\n end: refEnd,\n type: 'match',\n strand: strand === '-' ? -1 : 1,\n CIGAR: cigar,\n syntenyId: id,\n mate: {\n refName: name.contig,\n start: hapStart,\n end: hapEnd,\n assemblyName: lane,\n },\n }\n return new SyntenyFeature(data)\n }\n}\n\n/**\n * One record of a lane pair, on the target walk's own contig with the query\n * walk as its mate. gbz-base writes the CIGAR along the target, a `D` being\n * target bases the query lacks, which is the side a JBrowse feature is, so it\n * passes through unchanged.\n */\nexport function pairFeature({\n pair,\n lane,\n mateLane,\n}: {\n pair: PairAlignment\n lane: string\n mateLane: string\n}) {\n const id = `${haplotypePrefix(pair.target)}#${pair.target.contig}:${pair.targetStart}-${pair.targetEnd}|${haplotypePrefix(pair.query)}#${pair.query.contig}:${pair.queryStart}-${pair.queryEnd}`\n return new SyntenyFeature({\n uniqueId: id,\n assemblyName: lane,\n refName: pair.target.contig,\n start: pair.targetStart,\n end: pair.targetEnd,\n type: 'match',\n strand: pair.strand === '-' ? -1 : 1,\n CIGAR: pair.cigar,\n syntenyId: id,\n identity: pair.matches / Math.max(pair.columns, 1),\n numMatches: pair.matches,\n blockLen: pair.columns,\n mate: {\n refName: pair.query.contig,\n start: pair.queryStart,\n end: pair.queryEnd,\n assemblyName: mateLane,\n },\n })\n}\n\nexport default class GbzBaseSyntenyAdapter extends ComparativeAdapterBase<GbzBaseSyntenyAdapterConfig> {\n private graph = cachedSetup({\n label: 'Opening pangenome database',\n setup: async () => {\n const indexLocation: FileLocation = this.getConf('haplotypeIndexLocation')\n const hasCompanion = !('uri' in indexLocation) || indexLocation.uri !== ''\n const db = await GBZBase.open(\n openLocation(this.getConf('gbzDbLocation'), this.pluginManager),\n hasCompanion\n ? {\n haplotypeIndex: openLocation(indexLocation, this.pluginManager),\n }\n : {},\n )\n const anchor = this.getConf('assemblyNames')[0]\n if (anchor === undefined) {\n throw new Error(\n 'GbzBaseSyntenyAdapter needs assemblyNames: its first entry is the assembly the reference sample is loaded as',\n )\n }\n const referenceSamples = ((await db.tag('gbwt_reference_samples')) ?? '')\n .split(/\\s+/)\n .filter(sample => sample !== '')\n const referenceSample = resolveReferenceSample({\n configured: this.getConf('referenceSample'),\n anchorPrefix: resolvePanSNPrefix(this, anchor),\n referenceSamples,\n })\n return { db, anchor, referenceSample, referenceSamples }\n },\n })\n\n /**\n * The indexed reference path a window on `refName` resolves against, or\n * undefined when the reference sample has no indexed path by that contig.\n * gbz-base spans the path's fragments itself from here.\n */\n private async referenceQuery(\n refName: string,\n opts: BaseOptions,\n ): Promise<PathQuery | undefined> {\n const { db, referenceSample } = await this.graph(opts)\n const path = (await db.paths()).find(\n p =>\n p.isIndexed &&\n p.name.sample === referenceSample &&\n p.name.contig === refName,\n )\n return path\n ? {\n sample: path.name.sample,\n contig: refName,\n haplotype: path.name.haplotype,\n }\n : undefined\n }\n\n /**\n * Every haplotype the graph carries a walk for, `sample#haplotype` with its\n * contigs, from the Paths scan the adapter already makes; the lane picker's\n * source list. Reference samples are included and flagged.\n */\n async getHaplotypes(opts: BaseOptions = {}): Promise<GbzHaplotype[]> {\n const { db, referenceSamples } = await this.graph(opts)\n const byPrefix = new Map<string, GbzHaplotype>()\n for (const path of await db.paths()) {\n const prefix = haplotypePrefix(path.name)\n const entry = byPrefix.get(prefix)\n if (entry) {\n if (!entry.contigs.includes(path.name.contig)) {\n entry.contigs.push(path.name.contig)\n }\n } else {\n byPrefix.set(prefix, {\n prefix,\n sample: path.name.sample,\n haplotype: path.name.haplotype,\n contigs: [path.name.contig],\n isReference: referenceSamples.includes(path.name.sample),\n })\n }\n }\n return [...byPrefix.values()]\n }\n\n /**\n * `lanes` is every haplotype but the reference sample's own, which is the\n * anchor rather than a lane, declared up front so the display can offer the\n * whole graph's haplotypes before a fetch has placed any of them.\n */\n async getHeader(opts: BaseOptions = {}) {\n const { anchor, referenceSample, referenceSamples } = await this.graph(opts)\n const asmByPrefix = assemblyByPanSNPrefix(this)\n const lanes: GbzHeaderLane[] = []\n for (const haplotype of await this.getHaplotypes(opts)) {\n if (haplotype.sample !== referenceSample) {\n lanes.push({\n name: laneAssemblyName(asmByPrefix, haplotype),\n label: haplotype.prefix,\n group: haplotype.sample,\n })\n }\n }\n return {\n hasCoarseTier: false,\n anchorAssemblyName: anchor,\n referenceSample,\n referenceSamples,\n lanes,\n }\n }\n\n async getRefNames(opts: BaseOptions = {}) {\n const { db, anchor, referenceSample } = await this.graph(opts)\n const { assemblyName } = opts\n const prefix =\n assemblyName === anchor\n ? undefined\n : resolvePanSNPrefix(this, assemblyName)\n const contigs = (await db.paths())\n .filter(path =>\n assemblyName === anchor\n ? path.isIndexed && path.name.sample === referenceSample\n : panSNMatchesPrefix(haplotypePrefix(path.name), prefix),\n )\n .map(path => path.name.contig)\n return [...new Set(contigs)]\n }\n\n /**\n * The predicate gbz-base builds a window for, from the lanes a fetch asks\n * for. With a companion that carries anchor rows the reader walks only the\n * wanted haplotypes from the anchor before the window and never names the\n * rest; without them it names every walk and drops the ones the predicate\n * rejects. Either way a cut holds those walks, the reference, and the nodes\n * they visit. Undefined when every haplotype is wanted.\n */\n //\n // `targetPrefix` is a pairwise view's one lane, and it belongs in here: left\n // to filter what came back, it handed gbz-base no predicate, and every\n // haplotype in the graph was walked for one to be kept.\n private keepPredicate(\n haplotypes: string[] | undefined,\n targetPrefix?: string,\n ) {\n const wantedPrefixes =\n haplotypes === undefined || haplotypes.length === 0\n ? undefined\n : haplotypes.map(lane => resolvePanSNPrefix(this, lane))\n return wantedPrefixes === undefined && targetPrefix === undefined\n ? undefined\n : (name: PathName) =>\n haplotypeWanted(name, wantedPrefixes) &&\n (targetPrefix === undefined ||\n panSNMatchesPrefix(haplotypePrefix(name), targetPrefix))\n }\n\n /**\n * The graph view's cut of the window: the reference walk, every top-level\n * snarl contained in it, and one W line per haplotype walk, PanSN-named\n * when the database (or its companion) carries the haplotype index and\n * `unknown#N` otherwise. The reference walk is the first W line, which is\n * the one the view anchors on by default. With `haplotypes` the W lines are\n * that set's and the nodes those walks visit, the reference walk kept.\n *\n * Only a window on the anchor can be cut: a haplotype lane's coordinates\n * are its own contig's, and the graph is indexed for random access on the\n * reference sample's paths alone.\n */\n async getSubgraph(region: Region, opts: SubgraphAdapterOptions = {}) {\n const { db, anchor } = await this.graph()\n const { assemblyName, refName, start, end } = region\n if (assemblyName !== anchor) {\n throw new HaplotypeWindowError(assemblyName, anchor)\n }\n const query = await this.referenceQuery(refName, {})\n const nodeLimit: number = this.getConf('nodeLimit')\n const keep = this.keepPredicate(opts.haplotypes)\n const subgraph = query\n ? await db\n .getSubgraphForRange(query, start, end, {\n context: this.getConf('context'),\n snarls: this.getConf('subgraphSnarls'),\n haplotypes: 'all',\n limit: nodeLimit,\n signal: opts.signal,\n ...(keep === undefined ? {} : { keep }),\n })\n .catch((error: unknown) => {\n throw nodeLimitError(error, nodeLimit, end - start) ?? error\n })\n : undefined\n return subgraph ? subgraph.toGFA({ names: 'resolved' }) : ''\n }\n\n private async laneHaplotypes(\n assemblyName: string,\n opts: BaseOptions,\n ): Promise<HaplotypeRef[]> {\n const prefix = resolvePanSNPrefix(this, assemblyName)\n return (await this.getHaplotypes(opts)).filter(haplotype =>\n panSNMatchesPrefix(haplotype.prefix, prefix),\n )\n }\n\n /**\n * The window split wherever the reference sample's contig starts another\n * fragment, so each piece lies inside one: getSubgraphForRange cuts the\n * first fragment alone, where getAlignmentsForRange walks them all\n */\n private async referencePieces(\n refName: string,\n start: number,\n end: number,\n opts: BaseOptions,\n ) {\n const { db, referenceSample } = await this.graph(opts)\n const inside = (await db.paths())\n .filter(\n path =>\n path.isIndexed &&\n path.name.sample === referenceSample &&\n path.name.contig === refName &&\n path.name.fragment > start &&\n path.name.fragment < end,\n )\n .map(path => path.name.fragment)\n const bounds = [start, ...[...new Set(inside)].sort((a, b) => a - b), end]\n return bounds.slice(1).map((pieceEnd, i) => ({\n start: bounds[i]!,\n end: pieceEnd,\n }))\n }\n\n private async anchorFeatures(region: Region, opts: GbzFeatureOptions) {\n const { db } = await this.graph(opts)\n const { assemblyName, refName, start, end } = region\n const targetPrefix = resolvePanSNPrefix(this, opts.targetAssemblyName)\n const asmByPrefix = assemblyByPanSNPrefix(this)\n const keep = this.keepPredicate(opts.haplotypes, targetPrefix)\n const query = await this.referenceQuery(refName, opts)\n const nodeLimit: number = this.getConf('nodeLimit')\n const alignments = query\n ? await updateStatus(\n `Reading graph ${refName}:${start.toLocaleString()}-${end.toLocaleString()}`,\n opts.statusCallback,\n () =>\n db\n .getAlignmentsForRange(query, start, end, {\n context: this.getConf('context'),\n haplotypes: 'all',\n limit: nodeLimit,\n signal: opts.signal,\n ...(keep === undefined ? {} : { keep }),\n })\n .catch((error: unknown) => {\n throw nodeLimitError(error, nodeLimit, end - start) ?? error\n }),\n )\n : []\n return alignments.flatMap(alignment => {\n const feature = alignment.resolved\n ? fragmentFeature({\n alignment,\n assemblyName,\n refName,\n lane: laneAssemblyName(asmByPrefix, alignment.name),\n })\n : undefined\n return feature === undefined ? [] : [feature]\n })\n }\n\n /**\n * The two lanes' walks cut out of the anchor window alone, and each walk\n * of the query lane aligned to each walk of the target lane. The records\n * sit on the query lane's contigs, the lane the display draws on top.\n *\n * Only a cut walked from the haplotype index's anchor rows holds each walk\n * whole. The sampled cut leaves a walk in pieces wherever it strays past the\n * context, and pieces align only in part, so without anchor rows, or when\n * the anchor walk of any reference fragment in the window fell back, the\n * pair answers nothing and the display composes it through the reference.\n */\n private async pairFeatures(\n region: Region,\n queryAssemblyName: string,\n opts: GbzFeatureOptions,\n ) {\n const { targetAssemblyName } = opts\n if (targetAssemblyName === undefined) {\n throw new PairTargetError(queryAssemblyName)\n }\n const { db } = await this.graph(opts)\n const { refName, start, end } = region\n const featureSide = await this.laneHaplotypes(queryAssemblyName, opts)\n const mateSide = await this.laneHaplotypes(targetAssemblyName, opts)\n const kept = [...featureSide, ...mateSide]\n const query = await this.referenceQuery(refName, opts)\n const nodeLimit: number = this.getConf('nodeLimit')\n const anchored = (await db.haplotypeAnchorSpacing()) !== undefined\n const cut = (reference: PathQuery, piece: { start: number; end: number }) =>\n db\n .getSubgraphForRange(reference, piece.start, piece.end, {\n context: this.getConf('context'),\n haplotypes: 'all',\n limit: nodeLimit,\n signal: opts.signal,\n keep: name =>\n kept.some(\n haplotype =>\n haplotype.sample === name.sample &&\n haplotype.haplotype === name.haplotype,\n ),\n })\n .catch((error: unknown) => {\n throw nodeLimitError(error, nodeLimit, end - start) ?? error\n })\n const subgraphs =\n query && anchored && featureSide.length > 0 && mateSide.length > 0\n ? (\n await updateStatus(\n `Aligning ${queryAssemblyName} to ${targetAssemblyName}`,\n opts.statusCallback,\n async () =>\n Promise.all(\n (await this.referencePieces(refName, start, end, opts)).map(\n piece => cut(query, piece),\n ),\n ),\n )\n ).filter(subgraph => subgraph !== undefined)\n : []\n const whole = subgraphs.every(subgraph => {\n const walk = subgraph.stats.anchorWalk\n return walk !== undefined && walk.fallback === undefined\n })\n return whole\n ? subgraphs.flatMap(subgraph =>\n featureSide.flatMap(target =>\n mateSide.flatMap(mate =>\n subgraph.pairAlignments({ target, query: mate }).map(pair =>\n pairFeature({\n pair,\n lane: queryAssemblyName,\n mateLane: targetAssemblyName,\n }),\n ),\n ),\n ),\n )\n : []\n }\n\n getFeatures(region: Region, opts: GbzFeatureOptions = {}) {\n return ObservableCreate<Feature>(async observer => {\n const { db, anchor } = await this.graph(opts)\n if (!db.hasHaplotypeIndex) {\n throw new NoHaplotypeIndexError()\n }\n // the graph is indexed on its reference alone, so a window on a\n // haplotype lane has no answer: a lane pair is read inside the anchor's\n if (region.assemblyName === anchor) {\n const features =\n opts.queryAssemblyName === undefined\n ? await this.anchorFeatures(region, opts)\n : await this.pairFeatures(region, opts.queryAssemblyName, opts)\n for (const feature of features) {\n observer.next(feature)\n }\n }\n observer.complete()\n }, opts.signal)\n }\n}\n", "import { BaseFeatureDataAdapter } from '@jbrowse/core/data_adapters/BaseAdapter'\nimport { createStatusFanOut } from '@jbrowse/core/util'\nimport { from } from 'rxjs'\nimport { map, mergeMap, toArray } from 'rxjs/operators'\n\nimport { clipFeatureToRegion } from './clipFeatureToRegion.ts'\n\nimport type { AnyConfigurationModel } from '@jbrowse/core/configuration'\nimport type { Feature } from '@jbrowse/core/util'\nimport type { AugmentedRegion as Region } from '@jbrowse/core/util/types'\nimport type { ComparativeOptions } from '@jbrowse/synteny-core'\n\n/**\n * What every adapter in this plugin answers the same way.\n *\n * `hasDataForRefName` is true unconditionally because deciding it properly is a\n * `getFeatures` \u2014 and it has to be true, or BaseFeatureDataAdapter filters the\n * track out and `getFeatures` is never called at all. Eight adapters carried\n * that method and its three-line explanation verbatim.\n *\n * Only the answers that do not depend on config live here. Anything reading a\n * slot stays in the concrete adapter, for the reason `getAssemblyNamesFromConf`\n * documents: a base generic over the config cannot prove a slot name to\n * `getConf`, so hoisting a read costs the typing that makes it worth having.\n */\nexport abstract class ComparativeAdapterBase<\n CONF extends AnyConfigurationModel = AnyConfigurationModel,\n> extends BaseFeatureDataAdapter<CONF> {\n public static capabilities = ['getFeatures', 'getRefNames']\n\n /**\n * Whether a record's two intervals are the aligned extents of one alignment,\n * which `clipToRegion` may cut at a region edge on both axes, or two genes,\n * whose extents are the genes and stay whole however the region falls.\n */\n protected readonly recordsAreAlignments: boolean = true\n\n async hasDataForRefName() {\n return true\n }\n\n /**\n * `clipToRegion` and `splitAtGapBp` are honoured here and nowhere below:\n * `getFeatures` never sees them. A record on another assembly than the\n * region's, such as a lane pair read inside an anchor window, is in no\n * coordinates the region states, so it is split at its gaps and clipped to\n * its own extent.\n *\n * Emission is in region order, not arrival order, as core's base does: the\n * multi-way display's lane sort tie-breaks on first appearance in this list,\n * and its weights tie exactly, so arrival order would decide the stack.\n */\n getFeaturesInMultipleRegions(\n regions: Region[],\n opts: ComparativeOptions = {},\n ) {\n const { clipToRegion, splitAtGapBp, ...rest } = opts\n const clip = clipToRegion && this.recordsAreAlignments\n const slot = createStatusFanOut(rest.statusCallback)\n return from(regions).pipe(\n mergeMap((region, index) =>\n this.getFeatures(region, { ...rest, statusCallback: slot() }).pipe(\n mergeMap((feature): Feature[] =>\n clip\n ? clipFeatureToRegion(\n feature,\n feature.get('assemblyName') === region.assemblyName\n ? region\n : { start: feature.get('start'), end: feature.get('end') },\n splitAtGapBp,\n )\n : [feature],\n ),\n toArray(),\n map(features => ({ index, features })),\n ),\n ),\n toArray(),\n mergeMap(chunks =>\n chunks\n .sort((a, b) => a.index - b.index)\n .flatMap(chunk => chunk.features),\n ),\n )\n }\n}\n", "/******************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\n/* global Reflect, Promise, SuppressedError, Symbol, Iterator */\n\nvar extendStatics = function(d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n};\n\nexport function __extends(d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nexport var __assign = function() {\n __assign = Object.assign || function __assign(t) {\n for (var s, i = 1, n = arguments.length; i < n; i++) {\n s = arguments[i];\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n }\n return t;\n }\n return __assign.apply(this, arguments);\n}\n\nexport function __rest(s, e) {\n var t = {};\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n t[p] = s[p];\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n t[p[i]] = s[p[i]];\n }\n return t;\n}\n\nexport function __decorate(decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\n\nexport function __param(paramIndex, decorator) {\n return function (target, key) { decorator(target, key, paramIndex); }\n}\n\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\n var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n var _, done = false;\n for (var i = decorators.length - 1; i >= 0; i--) {\n var context = {};\n for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\n var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\n if (kind === \"accessor\") {\n if (result === void 0) continue;\n if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n if (_ = accept(result.get)) descriptor.get = _;\n if (_ = accept(result.set)) descriptor.set = _;\n if (_ = accept(result.init)) initializers.unshift(_);\n }\n else if (_ = accept(result)) {\n if (kind === \"field\") initializers.unshift(_);\n else descriptor[key] = _;\n }\n }\n if (target) Object.defineProperty(target, contextIn.name, descriptor);\n done = true;\n};\n\nexport function __runInitializers(thisArg, initializers, value) {\n var useValue = arguments.length > 2;\n for (var i = 0; i < initializers.length; i++) {\n value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n }\n return useValue ? value : void 0;\n};\n\nexport function __propKey(x) {\n return typeof x === \"symbol\" ? x : \"\".concat(x);\n};\n\nexport function __setFunctionName(f, name, prefix) {\n if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\n};\n\nexport function __metadata(metadataKey, metadataValue) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\n\nexport function __awaiter(thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P || (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments || [])).next());\n });\n}\n\nexport function __generator(thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === \"function\" ? Iterator : Object).prototype);\n return g.next = verb(0), g[\"throw\"] = verb(1), g[\"return\"] = verb(2), typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (g && (g = 0, op[0] && (_ = 0)), _) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n}\n\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n var desc = Object.getOwnPropertyDescriptor(m, k);\n if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n desc = { enumerable: true, get: function() { return m[k]; } };\n }\n Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n o[k2] = m[k];\n});\n\nexport function __exportStar(m, o) {\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\n\nexport function __values(o) {\n var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n if (m) return m.call(o);\n if (o && typeof o.length === \"number\") return {\n next: function () {\n if (o && i >= o.length) o = void 0;\n return { value: o && o[i++], done: !o };\n }\n };\n throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\n\nexport function __read(o, n) {\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n if (!m) return o;\n var i = m.call(o), r, ar = [], e;\n try {\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n }\n catch (error) { e = { error: error }; }\n finally {\n try {\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\n }\n finally { if (e) throw e.error; }\n }\n return ar;\n}\n\n/** @deprecated */\nexport function __spread() {\n for (var ar = [], i = 0; i < arguments.length; i++)\n ar = ar.concat(__read(arguments[i]));\n return ar;\n}\n\n/** @deprecated */\nexport function __spreadArrays() {\n for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n for (var r = Array(s), k = 0, i = 0; i < il; i++)\n for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n r[k] = a[j];\n return r;\n}\n\nexport function __spreadArray(to, from, pack) {\n if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n if (ar || !(i in from)) {\n if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n ar[i] = from[i];\n }\n }\n return to.concat(ar || Array.prototype.slice.call(from));\n}\n\nexport function __await(v) {\n return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\n\nexport function __asyncGenerator(thisArg, _arguments, generator) {\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n var g = generator.apply(thisArg, _arguments || []), i, q = [];\n return i = Object.create((typeof AsyncIterator === \"function\" ? AsyncIterator : Object).prototype), verb(\"next\"), verb(\"throw\"), verb(\"return\", awaitReturn), i[Symbol.asyncIterator] = function () { return this; }, i;\n function awaitReturn(f) { return function (v) { return Promise.resolve(v).then(f, reject); }; }\n function verb(n, f) { if (g[n]) { i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; if (f) i[n] = f(i[n]); } }\n function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n function fulfill(value) { resume(\"next\", value); }\n function reject(value) { resume(\"throw\", value); }\n function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n}\n\nexport function __asyncDelegator(o) {\n var i, p;\n return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\n}\n\nexport function __asyncValues(o) {\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n var m = o[Symbol.asyncIterator], i;\n return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\n function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\n function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n}\n\nexport function __makeTemplateObject(cooked, raw) {\n if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n return cooked;\n};\n\nvar __setModuleDefault = Object.create ? (function(o, v) {\n Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n o[\"default\"] = v;\n};\n\nvar ownKeys = function(o) {\n ownKeys = Object.getOwnPropertyNames || function (o) {\n var ar = [];\n for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n return ar;\n };\n return ownKeys(o);\n};\n\nexport function __importStar(mod) {\n if (mod && mod.__esModule) return mod;\n var result = {};\n if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n __setModuleDefault(result, mod);\n return result;\n}\n\nexport function __importDefault(mod) {\n return (mod && mod.__esModule) ? mod : { default: mod };\n}\n\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\n\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\n if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n}\n\nexport function __classPrivateFieldIn(state, receiver) {\n if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\n return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\nexport function __addDisposableResource(env, value, async) {\n if (value !== null && value !== void 0) {\n if (typeof value !== \"object\" && typeof value !== \"function\") throw new TypeError(\"Object expected.\");\n var dispose, inner;\n if (async) {\n if (!Symbol.asyncDispose) throw new TypeError(\"Symbol.asyncDispose is not defined.\");\n dispose = value[Symbol.asyncDispose];\n }\n if (dispose === void 0) {\n if (!Symbol.dispose) throw new TypeError(\"Symbol.dispose is not defined.\");\n dispose = value[Symbol.dispose];\n if (async) inner = dispose;\n }\n if (typeof dispose !== \"function\") throw new TypeError(\"Object not disposable.\");\n if (inner) dispose = function() { try { inner.call(this); } catch (e) { return Promise.reject(e); } };\n env.stack.push({ value: value, dispose: dispose, async: async });\n }\n else if (async) {\n env.stack.push({ async: true });\n }\n return value;\n}\n\nvar _SuppressedError = typeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\n var e = new Error(message);\n return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\n};\n\nexport function __disposeResources(env) {\n function fail(e) {\n env.error = env.hasError ? new _SuppressedError(e, env.error, \"An error was suppressed during disposal.\") : e;\n env.hasError = true;\n }\n var r, s = 0;\n function next() {\n while (r = env.stack.pop()) {\n try {\n if (!r.async && s === 1) return s = 0, env.stack.push(r), Promise.resolve().then(next);\n if (r.dispose) {\n var result = r.dispose.call(r.value);\n if (r.async) return s |= 2, Promise.resolve(result).then(next, function(e) { fail(e); return next(); });\n }\n else s |= 1;\n }\n catch (e) {\n fail(e);\n }\n }\n if (s === 1) return env.hasError ? Promise.reject(env.error) : Promise.resolve();\n if (env.hasError) throw env.error;\n }\n return next();\n}\n\nexport function __rewriteRelativeImportExtension(path, preserveJsx) {\n if (typeof path === \"string\" && /^\\.\\.?\\//.test(path)) {\n return path.replace(/\\.(tsx)$|((?:\\.d)?)((?:\\.[^./]+?)?)\\.([cm]?)ts$/i, function (m, tsx, d, ext, cm) {\n return tsx ? preserveJsx ? \".jsx\" : \".js\" : d && (!ext || !cm) ? m : (d + ext + \".\" + cm.toLowerCase() + \"js\");\n });\n }\n return path;\n}\n\nexport default {\n __extends,\n __assign,\n __rest,\n __decorate,\n __param,\n __esDecorate,\n __runInitializers,\n __propKey,\n __setFunctionName,\n __metadata,\n __awaiter,\n __generator,\n __createBinding,\n __exportStar,\n __values,\n __read,\n __spread,\n __spreadArrays,\n __spreadArray,\n __await,\n __asyncGenerator,\n __asyncDelegator,\n __asyncValues,\n __makeTemplateObject,\n __importStar,\n __importDefault,\n __classPrivateFieldGet,\n __classPrivateFieldSet,\n __classPrivateFieldIn,\n __addDisposableResource,\n __disposeResources,\n __rewriteRelativeImportExtension,\n};\n", "/**\n * Returns true if the object is a function.\n * @param value The value to check\n */\nexport function isFunction(value: any): value is (...args: any[]) => any {\n return typeof value === 'function';\n}\n", "/**\n * Used to create Error subclasses until the community moves away from ES5.\n *\n * This is because compiling from TypeScript down to ES5 has issues with subclassing Errors\n * as well as other built-in types: https://github.com/Microsoft/TypeScript/issues/12123\n *\n * @param createImpl A factory function to create the actual constructor implementation. The returned\n * function should be a named function that calls `_super` internally.\n */\nexport function createErrorClass<T>(createImpl: (_super: any) => any): T {\n const _super = (instance: any) => {\n Error.call(instance);\n instance.stack = new Error().stack;\n };\n\n const ctorFunc = createImpl(_super);\n ctorFunc.prototype = Object.create(Error.prototype);\n ctorFunc.prototype.constructor = ctorFunc;\n return ctorFunc;\n}\n", "import { createErrorClass } from './createErrorClass';\n\nexport interface UnsubscriptionError extends Error {\n readonly errors: any[];\n}\n\nexport interface UnsubscriptionErrorCtor {\n /**\n * @deprecated Internal implementation detail. Do not construct error instances.\n * Cannot be tagged as internal: https://github.com/ReactiveX/rxjs/issues/6269\n */\n new (errors: any[]): UnsubscriptionError;\n}\n\n/**\n * An error thrown when one or more errors have occurred during the\n * `unsubscribe` of a {@link Subscription}.\n */\nexport const UnsubscriptionError: UnsubscriptionErrorCtor = createErrorClass(\n (_super) =>\n function UnsubscriptionErrorImpl(this: any, errors: (Error | string)[]) {\n _super(this);\n this.message = errors\n ? `${errors.length} errors occurred during unsubscription:\n${errors.map((err, i) => `${i + 1}) ${err.toString()}`).join('\\n ')}`\n : '';\n this.name = 'UnsubscriptionError';\n this.errors = errors;\n }\n);\n", "/**\n * Removes an item from an array, mutating it.\n * @param arr The array to remove the item from\n * @param item The item to remove\n */\nexport function arrRemove<T>(arr: T[] | undefined | null, item: T) {\n if (arr) {\n const index = arr.indexOf(item);\n 0 <= index && arr.splice(index, 1);\n }\n}\n", "import { isFunction } from './util/isFunction';\nimport { UnsubscriptionError } from './util/UnsubscriptionError';\nimport { SubscriptionLike, TeardownLogic, Unsubscribable } from './types';\nimport { arrRemove } from './util/arrRemove';\n\n/**\n * Represents a disposable resource, such as the execution of an Observable. A\n * Subscription has one important method, `unsubscribe`, that takes no argument\n * and just disposes the resource held by the subscription.\n *\n * Additionally, subscriptions may be grouped together through the `add()`\n * method, which will attach a child Subscription to the current Subscription.\n * When a Subscription is unsubscribed, all its children (and its grandchildren)\n * will be unsubscribed as well.\n */\nexport class Subscription implements SubscriptionLike {\n public static EMPTY = (() => {\n const empty = new Subscription();\n empty.closed = true;\n return empty;\n })();\n\n /**\n * A flag to indicate whether this Subscription has already been unsubscribed.\n */\n public closed = false;\n\n private _parentage: Subscription[] | Subscription | null = null;\n\n /**\n * The list of registered finalizers to execute upon unsubscription. Adding and removing from this\n * list occurs in the {@link #add} and {@link #remove} methods.\n */\n private _finalizers: Exclude<TeardownLogic, void>[] | null = null;\n\n /**\n * @param initialTeardown A function executed first as part of the finalization\n * process that is kicked off when {@link #unsubscribe} is called.\n */\n constructor(private initialTeardown?: () => void) {}\n\n /**\n * Disposes the resources held by the subscription. May, for instance, cancel\n * an ongoing Observable execution or cancel any other type of work that\n * started when the Subscription was created.\n */\n unsubscribe(): void {\n let errors: any[] | undefined;\n\n if (!this.closed) {\n this.closed = true;\n\n // Remove this from it's parents.\n const { _parentage } = this;\n if (_parentage) {\n this._parentage = null;\n if (Array.isArray(_parentage)) {\n for (const parent of _parentage) {\n parent.remove(this);\n }\n } else {\n _parentage.remove(this);\n }\n }\n\n const { initialTeardown: initialFinalizer } = this;\n if (isFunction(initialFinalizer)) {\n try {\n initialFinalizer();\n } catch (e) {\n errors = e instanceof UnsubscriptionError ? e.errors : [e];\n }\n }\n\n const { _finalizers } = this;\n if (_finalizers) {\n this._finalizers = null;\n for (const finalizer of _finalizers) {\n try {\n execFinalizer(finalizer);\n } catch (err) {\n errors = errors ?? [];\n if (err instanceof UnsubscriptionError) {\n errors = [...errors, ...err.errors];\n } else {\n errors.push(err);\n }\n }\n }\n }\n\n if (errors) {\n throw new UnsubscriptionError(errors);\n }\n }\n }\n\n /**\n * Adds a finalizer to this subscription, so that finalization will be unsubscribed/called\n * when this subscription is unsubscribed. If this subscription is already {@link #closed},\n * because it has already been unsubscribed, then whatever finalizer is passed to it\n * will automatically be executed (unless the finalizer itself is also a closed subscription).\n *\n * Closed Subscriptions cannot be added as finalizers to any subscription. Adding a closed\n * subscription to a any subscription will result in no operation. (A noop).\n *\n * Adding a subscription to itself, or adding `null` or `undefined` will not perform any\n * operation at all. (A noop).\n *\n * `Subscription` instances that are added to this instance will automatically remove themselves\n * if they are unsubscribed. Functions and {@link Unsubscribable} objects that you wish to remove\n * will need to be removed manually with {@link #remove}\n *\n * @param teardown The finalization logic to add to this subscription.\n */\n add(teardown: TeardownLogic): void {\n // Only add the finalizer if it's not undefined\n // and don't add a subscription to itself.\n if (teardown && teardown !== this) {\n if (this.closed) {\n // If this subscription is already closed,\n // execute whatever finalizer is handed to it automatically.\n execFinalizer(teardown);\n } else {\n if (teardown instanceof Subscription) {\n // We don't add closed subscriptions, and we don't add the same subscription\n // twice. Subscription unsubscribe is idempotent.\n if (teardown.closed || teardown._hasParent(this)) {\n return;\n }\n teardown._addParent(this);\n }\n (this._finalizers = this._finalizers ?? []).push(teardown);\n }\n }\n }\n\n /**\n * Checks to see if a this subscription already has a particular parent.\n * This will signal that this subscription has already been added to the parent in question.\n * @param parent the parent to check for\n */\n private _hasParent(parent: Subscription) {\n const { _parentage } = this;\n return _parentage === parent || (Array.isArray(_parentage) && _parentage.includes(parent));\n }\n\n /**\n * Adds a parent to this subscription so it can be removed from the parent if it\n * unsubscribes on it's own.\n *\n * NOTE: THIS ASSUMES THAT {@link _hasParent} HAS ALREADY BEEN CHECKED.\n * @param parent The parent subscription to add\n */\n private _addParent(parent: Subscription) {\n const { _parentage } = this;\n this._parentage = Array.isArray(_parentage) ? (_parentage.push(parent), _parentage) : _parentage ? [_parentage, parent] : parent;\n }\n\n /**\n * Called on a child when it is removed via {@link #remove}.\n * @param parent The parent to remove\n */\n private _removeParent(parent: Subscription) {\n const { _parentage } = this;\n if (_parentage === parent) {\n this._parentage = null;\n } else if (Array.isArray(_parentage)) {\n arrRemove(_parentage, parent);\n }\n }\n\n /**\n * Removes a finalizer from this subscription that was previously added with the {@link #add} method.\n *\n * Note that `Subscription` instances, when unsubscribed, will automatically remove themselves\n * from every other `Subscription` they have been added to. This means that using the `remove` method\n * is not a common thing and should be used thoughtfully.\n *\n * If you add the same finalizer instance of a function or an unsubscribable object to a `Subscription` instance\n * more than once, you will need to call `remove` the same number of times to remove all instances.\n *\n * All finalizer instances are removed to free up memory upon unsubscription.\n *\n * @param teardown The finalizer to remove from this subscription\n */\n remove(teardown: Exclude<TeardownLogic, void>): void {\n const { _finalizers } = this;\n _finalizers && arrRemove(_finalizers, teardown);\n\n if (teardown instanceof Subscription) {\n teardown._removeParent(this);\n }\n }\n}\n\nexport const EMPTY_SUBSCRIPTION = Subscription.EMPTY;\n\nexport function isSubscription(value: any): value is Subscription {\n return (\n value instanceof Subscription ||\n (value && 'closed' in value && isFunction(value.remove) && isFunction(value.add) && isFunction(value.unsubscribe))\n );\n}\n\nfunction execFinalizer(finalizer: Unsubscribable | (() => void)) {\n if (isFunction(finalizer)) {\n finalizer();\n } else {\n finalizer.unsubscribe();\n }\n}\n", "import { Subscriber } from './Subscriber';\nimport { ObservableNotification } from './types';\n\n/**\n * The {@link GlobalConfig} object for RxJS. It is used to configure things\n * like how to react on unhandled errors.\n */\nexport const config: GlobalConfig = {\n onUnhandledError: null,\n onStoppedNotification: null,\n Promise: undefined,\n useDeprecatedSynchronousErrorHandling: false,\n useDeprecatedNextContext: false,\n};\n\n/**\n * The global configuration object for RxJS, used to configure things\n * like how to react on unhandled errors. Accessible via {@link config}\n * object.\n */\nexport interface GlobalConfig {\n /**\n * A registration point for unhandled errors from RxJS. These are errors that\n * cannot were not handled by consuming code in the usual subscription path. For\n * example, if you have this configured, and you subscribe to an observable without\n * providing an error handler, errors from that subscription will end up here. This\n * will _always_ be called asynchronously on another job in the runtime. This is because\n * we do not want errors thrown in this user-configured handler to interfere with the\n * behavior of the library.\n */\n onUnhandledError: ((err: any) => void) | null;\n\n /**\n * A registration point for notifications that cannot be sent to subscribers because they\n * have completed, errored or have been explicitly unsubscribed. By default, next, complete\n * and error notifications sent to stopped subscribers are noops. However, sometimes callers\n * might want a different behavior. For example, with sources that attempt to report errors\n * to stopped subscribers, a caller can configure RxJS to throw an unhandled error instead.\n * This will _always_ be called asynchronously on another job in the runtime. This is because\n * we do not want errors thrown in this user-configured handler to interfere with the\n * behavior of the library.\n */\n onStoppedNotification: ((notification: ObservableNotification<any>, subscriber: Subscriber<any>) => void) | null;\n\n /**\n * The promise constructor used by default for {@link Observable#toPromise toPromise} and {@link Observable#forEach forEach}\n * methods.\n *\n * @deprecated As of version 8, RxJS will no longer support this sort of injection of a\n * Promise constructor. If you need a Promise implementation other than native promises,\n * please polyfill/patch Promise as you see appropriate. Will be removed in v8.\n */\n Promise?: PromiseConstructorLike;\n\n /**\n * If true, turns on synchronous error rethrowing, which is a deprecated behavior\n * in v6 and higher. This behavior enables bad patterns like wrapping a subscribe\n * call in a try/catch block. It also enables producer interference, a nasty bug\n * where a multicast can be broken for all observers by a downstream consumer with\n * an unhandled error. DO NOT USE THIS FLAG UNLESS IT'S NEEDED TO BUY TIME\n * FOR MIGRATION REASONS.\n *\n * @deprecated As of version 8, RxJS will no longer support synchronous throwing\n * of unhandled errors. All errors will be thrown on a separate call stack to prevent bad\n * behaviors described above. Will be removed in v8.\n */\n useDeprecatedSynchronousErrorHandling: boolean;\n\n /**\n * If true, enables an as-of-yet undocumented feature from v5: The ability to access\n * `unsubscribe()` via `this` context in `next` functions created in observers passed\n * to `subscribe`.\n *\n * This is being removed because the performance was severely problematic, and it could also cause\n * issues when types other than POJOs are passed to subscribe as subscribers, as they will likely have\n * their `this` context overwritten.\n *\n * @deprecated As of version 8, RxJS will no longer support altering the\n * context of next functions provided as part of an observer to Subscribe. Instead,\n * you will have access to a subscription or a signal or token that will allow you to do things like\n * unsubscribe and test closed status. Will be removed in v8.\n */\n useDeprecatedNextContext: boolean;\n}\n", "import type { TimerHandle } from './timerHandle';\ntype SetTimeoutFunction = (handler: () => void, timeout?: number, ...args: any[]) => TimerHandle;\ntype ClearTimeoutFunction = (handle: TimerHandle) => void;\n\ninterface TimeoutProvider {\n setTimeout: SetTimeoutFunction;\n clearTimeout: ClearTimeoutFunction;\n delegate:\n | {\n setTimeout: SetTimeoutFunction;\n clearTimeout: ClearTimeoutFunction;\n }\n | undefined;\n}\n\nexport const timeoutProvider: TimeoutProvider = {\n // When accessing the delegate, use the variable rather than `this` so that\n // the functions can be called without being bound to the provider.\n setTimeout(handler: () => void, timeout?: number, ...args) {\n const { delegate } = timeoutProvider;\n if (delegate?.setTimeout) {\n return delegate.setTimeout(handler, timeout, ...args);\n }\n return setTimeout(handler, timeout, ...args);\n },\n clearTimeout(handle) {\n const { delegate } = timeoutProvider;\n return (delegate?.clearTimeout || clearTimeout)(handle as any);\n },\n delegate: undefined,\n};\n", "import { config } from '../config';\nimport { timeoutProvider } from '../scheduler/timeoutProvider';\n\n/**\n * Handles an error on another job either with the user-configured {@link onUnhandledError},\n * or by throwing it on that new job so it can be picked up by `window.onerror`, `process.on('error')`, etc.\n *\n * This should be called whenever there is an error that is out-of-band with the subscription\n * or when an error hits a terminal boundary of the subscription and no error handler was provided.\n *\n * @param err the error to report\n */\nexport function reportUnhandledError(err: any) {\n timeoutProvider.setTimeout(() => {\n const { onUnhandledError } = config;\n if (onUnhandledError) {\n // Execute the user-configured error handler.\n onUnhandledError(err);\n } else {\n // Throw so it is picked up by the runtime's uncaught error mechanism.\n throw err;\n }\n });\n}\n", "/* tslint:disable:no-empty */\nexport function noop() { }\n", "import { CompleteNotification, NextNotification, ErrorNotification } from './types';\n\n/**\n * A completion object optimized for memory use and created to be the\n * same \"shape\" as other notifications in v8.\n * @internal\n */\nexport const COMPLETE_NOTIFICATION = (() => createNotification('C', undefined, undefined) as CompleteNotification)();\n\n/**\n * Internal use only. Creates an optimized error notification that is the same \"shape\"\n * as other notifications.\n * @internal\n */\nexport function errorNotification(error: any): ErrorNotification {\n return createNotification('E', undefined, error) as any;\n}\n\n/**\n * Internal use only. Creates an optimized next notification that is the same \"shape\"\n * as other notifications.\n * @internal\n */\nexport function nextNotification<T>(value: T) {\n return createNotification('N', value, undefined) as NextNotification<T>;\n}\n\n/**\n * Ensures that all notifications created internally have the same \"shape\" in v8.\n *\n * TODO: This is only exported to support a crazy legacy test in `groupBy`.\n * @internal\n */\nexport function createNotification(kind: 'N' | 'E' | 'C', value: any, error: any) {\n return {\n kind,\n value,\n error,\n };\n}\n", "import { config } from '../config';\n\nlet context: { errorThrown: boolean; error: any } | null = null;\n\n/**\n * Handles dealing with errors for super-gross mode. Creates a context, in which\n * any synchronously thrown errors will be passed to {@link captureError}. Which\n * will record the error such that it will be rethrown after the call back is complete.\n * TODO: Remove in v8\n * @param cb An immediately executed function.\n */\nexport function errorContext(cb: () => void) {\n if (config.useDeprecatedSynchronousErrorHandling) {\n const isRoot = !context;\n if (isRoot) {\n context = { errorThrown: false, error: null };\n }\n cb();\n if (isRoot) {\n const { errorThrown, error } = context!;\n context = null;\n if (errorThrown) {\n throw error;\n }\n }\n } else {\n // This is the general non-deprecated path for everyone that\n // isn't crazy enough to use super-gross mode (useDeprecatedSynchronousErrorHandling)\n cb();\n }\n}\n\n/**\n * Captures errors only in super-gross mode.\n * @param err the error to capture\n */\nexport function captureError(err: any) {\n if (config.useDeprecatedSynchronousErrorHandling && context) {\n context.errorThrown = true;\n context.error = err;\n }\n}\n", "import { isFunction } from './util/isFunction';\nimport { Observer, ObservableNotification } from './types';\nimport { isSubscription, Subscription } from './Subscription';\nimport { config } from './config';\nimport { reportUnhandledError } from './util/reportUnhandledError';\nimport { noop } from './util/noop';\nimport { nextNotification, errorNotification, COMPLETE_NOTIFICATION } from './NotificationFactories';\nimport { timeoutProvider } from './scheduler/timeoutProvider';\nimport { captureError } from './util/errorContext';\n\n/**\n * Implements the {@link Observer} interface and extends the\n * {@link Subscription} class. While the {@link Observer} is the public API for\n * consuming the values of an {@link Observable}, all Observers get converted to\n * a Subscriber, in order to provide Subscription-like capabilities such as\n * `unsubscribe`. Subscriber is a common type in RxJS, and crucial for\n * implementing operators, but it is rarely used as a public API.\n */\nexport class Subscriber<T> extends Subscription implements Observer<T> {\n /**\n * A static factory for a Subscriber, given a (potentially partial) definition\n * of an Observer.\n * @param next The `next` callback of an Observer.\n * @param error The `error` callback of an\n * Observer.\n * @param complete The `complete` callback of an\n * Observer.\n * @return A Subscriber wrapping the (partially defined)\n * Observer represented by the given arguments.\n * @deprecated Do not use. Will be removed in v8. There is no replacement for this\n * method, and there is no reason to be creating instances of `Subscriber` directly.\n * If you have a specific use case, please file an issue.\n */\n static create<T>(next?: (x?: T) => void, error?: (e?: any) => void, complete?: () => void): Subscriber<T> {\n return new SafeSubscriber(next, error, complete);\n }\n\n /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n protected isStopped: boolean = false;\n /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n protected destination: Subscriber<any> | Observer<any>; // this `any` is the escape hatch to erase extra type param (e.g. R)\n\n /**\n * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n * There is no reason to directly create an instance of Subscriber. This type is exported for typings reasons.\n */\n constructor(destination?: Subscriber<any> | Observer<any>) {\n super();\n if (destination) {\n this.destination = destination;\n // Automatically chain subscriptions together here.\n // if destination is a Subscription, then it is a Subscriber.\n if (isSubscription(destination)) {\n destination.add(this);\n }\n } else {\n this.destination = EMPTY_OBSERVER;\n }\n }\n\n /**\n * The {@link Observer} callback to receive notifications of type `next` from\n * the Observable, with a value. The Observable may call this method 0 or more\n * times.\n * @param value The `next` value.\n */\n next(value: T): void {\n if (this.isStopped) {\n handleStoppedNotification(nextNotification(value), this);\n } else {\n this._next(value!);\n }\n }\n\n /**\n * The {@link Observer} callback to receive notifications of type `error` from\n * the Observable, with an attached `Error`. Notifies the Observer that\n * the Observable has experienced an error condition.\n * @param err The `error` exception.\n */\n error(err?: any): void {\n if (this.isStopped) {\n handleStoppedNotification(errorNotification(err), this);\n } else {\n this.isStopped = true;\n this._error(err);\n }\n }\n\n /**\n * The {@link Observer} callback to receive a valueless notification of type\n * `complete` from the Observable. Notifies the Observer that the Observable\n * has finished sending push-based notifications.\n */\n complete(): void {\n if (this.isStopped) {\n handleStoppedNotification(COMPLETE_NOTIFICATION, this);\n } else {\n this.isStopped = true;\n this._complete();\n }\n }\n\n unsubscribe(): void {\n if (!this.closed) {\n this.isStopped = true;\n super.unsubscribe();\n this.destination = null!;\n }\n }\n\n protected _next(value: T): void {\n this.destination.next(value);\n }\n\n protected _error(err: any): void {\n try {\n this.destination.error(err);\n } finally {\n this.unsubscribe();\n }\n }\n\n protected _complete(): void {\n try {\n this.destination.complete();\n } finally {\n this.unsubscribe();\n }\n }\n}\n\n/**\n * This bind is captured here because we want to be able to have\n * compatibility with monoid libraries that tend to use a method named\n * `bind`. In particular, a library called Monio requires this.\n */\nconst _bind = Function.prototype.bind;\n\nfunction bind<Fn extends (...args: any[]) => any>(fn: Fn, thisArg: any): Fn {\n return _bind.call(fn, thisArg);\n}\n\n/**\n * Internal optimization only, DO NOT EXPOSE.\n * @internal\n */\nclass ConsumerObserver<T> implements Observer<T> {\n constructor(private partialObserver: Partial<Observer<T>>) {}\n\n next(value: T): void {\n const { partialObserver } = this;\n if (partialObserver.next) {\n try {\n partialObserver.next(value);\n } catch (error) {\n handleUnhandledError(error);\n }\n }\n }\n\n error(err: any): void {\n const { partialObserver } = this;\n if (partialObserver.error) {\n try {\n partialObserver.error(err);\n } catch (error) {\n handleUnhandledError(error);\n }\n } else {\n handleUnhandledError(err);\n }\n }\n\n complete(): void {\n const { partialObserver } = this;\n if (partialObserver.complete) {\n try {\n partialObserver.complete();\n } catch (error) {\n handleUnhandledError(error);\n }\n }\n }\n}\n\nexport class SafeSubscriber<T> extends Subscriber<T> {\n constructor(\n observerOrNext?: Partial<Observer<T>> | ((value: T) => void) | null,\n error?: ((e?: any) => void) | null,\n complete?: (() => void) | null\n ) {\n super();\n\n let partialObserver: Partial<Observer<T>>;\n if (isFunction(observerOrNext) || !observerOrNext) {\n // The first argument is a function, not an observer. The next\n // two arguments *could* be observers, or they could be empty.\n partialObserver = {\n next: (observerOrNext ?? undefined) as ((value: T) => void) | undefined,\n error: error ?? undefined,\n complete: complete ?? undefined,\n };\n } else {\n // The first argument is a partial observer.\n let context: any;\n if (this && config.useDeprecatedNextContext) {\n // This is a deprecated path that made `this.unsubscribe()` available in\n // next handler functions passed to subscribe. This only exists behind a flag\n // now, as it is *very* slow.\n context = Object.create(observerOrNext);\n context.unsubscribe = () => this.unsubscribe();\n partialObserver = {\n next: observerOrNext.next && bind(observerOrNext.next, context),\n error: observerOrNext.error && bind(observerOrNext.error, context),\n complete: observerOrNext.complete && bind(observerOrNext.complete, context),\n };\n } else {\n // The \"normal\" path. Just use the partial observer directly.\n partialObserver = observerOrNext;\n }\n }\n\n // Wrap the partial observer to ensure it's a full observer, and\n // make sure proper error handling is accounted for.\n this.destination = new ConsumerObserver(partialObserver);\n }\n}\n\nfunction handleUnhandledError(error: any) {\n if (config.useDeprecatedSynchronousErrorHandling) {\n captureError(error);\n } else {\n // Ideal path, we report this as an unhandled error,\n // which is thrown on a new call stack.\n reportUnhandledError(error);\n }\n}\n\n/**\n * An error handler used when no error handler was supplied\n * to the SafeSubscriber -- meaning no error handler was supplied\n * do the `subscribe` call on our observable.\n * @param err The error to handle\n */\nfunction defaultErrorHandler(err: any) {\n throw err;\n}\n\n/**\n * A handler for notifications that cannot be sent to a stopped subscriber.\n * @param notification The notification being sent.\n * @param subscriber The stopped subscriber.\n */\nfunction handleStoppedNotification(notification: ObservableNotification<any>, subscriber: Subscriber<any>) {\n const { onStoppedNotification } = config;\n onStoppedNotification && timeoutProvider.setTimeout(() => onStoppedNotification(notification, subscriber));\n}\n\n/**\n * The observer used as a stub for subscriptions where the user did not\n * pass any arguments to `subscribe`. Comes with the default error handling\n * behavior.\n */\nexport const EMPTY_OBSERVER: Readonly<Observer<any>> & { closed: true } = {\n closed: true,\n next: noop,\n error: defaultErrorHandler,\n complete: noop,\n};\n", "/**\n * Symbol.observable or a string \"@@observable\". Used for interop\n *\n * @deprecated We will no longer be exporting this symbol in upcoming versions of RxJS.\n * Instead polyfill and use Symbol.observable directly *or* use https://www.npmjs.com/package/symbol-observable\n */\nexport const observable: string | symbol = (() => (typeof Symbol === 'function' && Symbol.observable) || '@@observable')();\n", "/**\n * This function takes one parameter and just returns it. Simply put,\n * this is like `<T>(x: T): T => x`.\n *\n * ## Examples\n *\n * This is useful in some cases when using things like `mergeMap`\n *\n * ```ts\n * import { interval, take, map, range, mergeMap, identity } from 'rxjs';\n *\n * const source$ = interval(1000).pipe(take(5));\n *\n * const result$ = source$.pipe(\n * map(i => range(i)),\n * mergeMap(identity) // same as mergeMap(x => x)\n * );\n *\n * result$.subscribe({\n * next: console.log\n * });\n * ```\n *\n * Or when you want to selectively apply an operator\n *\n * ```ts\n * import { interval, take, identity } from 'rxjs';\n *\n * const shouldLimit = () => Math.random() < 0.5;\n *\n * const source$ = interval(1000);\n *\n * const result$ = source$.pipe(shouldLimit() ? take(5) : identity);\n *\n * result$.subscribe({\n * next: console.log\n * });\n * ```\n *\n * @param x Any value that is returned by this function\n * @returns The value passed as the first parameter to this function\n */\nexport function identity<T>(x: T): T {\n return x;\n}\n", "import { identity } from './identity';\nimport { UnaryFunction } from '../types';\n\nexport function pipe(): typeof identity;\nexport function pipe<T, A>(fn1: UnaryFunction<T, A>): UnaryFunction<T, A>;\nexport function pipe<T, A, B>(fn1: UnaryFunction<T, A>, fn2: UnaryFunction<A, B>): UnaryFunction<T, B>;\nexport function pipe<T, A, B, C>(fn1: UnaryFunction<T, A>, fn2: UnaryFunction<A, B>, fn3: UnaryFunction<B, C>): UnaryFunction<T, C>;\nexport function pipe<T, A, B, C, D>(\n fn1: UnaryFunction<T, A>,\n fn2: UnaryFunction<A, B>,\n fn3: UnaryFunction<B, C>,\n fn4: UnaryFunction<C, D>\n): UnaryFunction<T, D>;\nexport function pipe<T, A, B, C, D, E>(\n fn1: UnaryFunction<T, A>,\n fn2: UnaryFunction<A, B>,\n fn3: UnaryFunction<B, C>,\n fn4: UnaryFunction<C, D>,\n fn5: UnaryFunction<D, E>\n): UnaryFunction<T, E>;\nexport function pipe<T, A, B, C, D, E, F>(\n fn1: UnaryFunction<T, A>,\n fn2: UnaryFunction<A, B>,\n fn3: UnaryFunction<B, C>,\n fn4: UnaryFunction<C, D>,\n fn5: UnaryFunction<D, E>,\n fn6: UnaryFunction<E, F>\n): UnaryFunction<T, F>;\nexport function pipe<T, A, B, C, D, E, F, G>(\n fn1: UnaryFunction<T, A>,\n fn2: UnaryFunction<A, B>,\n fn3: UnaryFunction<B, C>,\n fn4: UnaryFunction<C, D>,\n fn5: UnaryFunction<D, E>,\n fn6: UnaryFunction<E, F>,\n fn7: UnaryFunction<F, G>\n): UnaryFunction<T, G>;\nexport function pipe<T, A, B, C, D, E, F, G, H>(\n fn1: UnaryFunction<T, A>,\n fn2: UnaryFunction<A, B>,\n fn3: UnaryFunction<B, C>,\n fn4: UnaryFunction<C, D>,\n fn5: UnaryFunction<D, E>,\n fn6: UnaryFunction<E, F>,\n fn7: UnaryFunction<F, G>,\n fn8: UnaryFunction<G, H>\n): UnaryFunction<T, H>;\nexport function pipe<T, A, B, C, D, E, F, G, H, I>(\n fn1: UnaryFunction<T, A>,\n fn2: UnaryFunction<A, B>,\n fn3: UnaryFunction<B, C>,\n fn4: UnaryFunction<C, D>,\n fn5: UnaryFunction<D, E>,\n fn6: UnaryFunction<E, F>,\n fn7: UnaryFunction<F, G>,\n fn8: UnaryFunction<G, H>,\n fn9: UnaryFunction<H, I>\n): UnaryFunction<T, I>;\nexport function pipe<T, A, B, C, D, E, F, G, H, I>(\n fn1: UnaryFunction<T, A>,\n fn2: UnaryFunction<A, B>,\n fn3: UnaryFunction<B, C>,\n fn4: UnaryFunction<C, D>,\n fn5: UnaryFunction<D, E>,\n fn6: UnaryFunction<E, F>,\n fn7: UnaryFunction<F, G>,\n fn8: UnaryFunction<G, H>,\n fn9: UnaryFunction<H, I>,\n ...fns: UnaryFunction<any, any>[]\n): UnaryFunction<T, unknown>;\n\n/**\n * pipe() can be called on one or more functions, each of which can take one argument (\"UnaryFunction\")\n * and uses it to return a value.\n * It returns a function that takes one argument, passes it to the first UnaryFunction, and then\n * passes the result to the next one, passes that result to the next one, and so on. \n */\nexport function pipe(...fns: Array<UnaryFunction<any, any>>): UnaryFunction<any, any> {\n return pipeFromArray(fns);\n}\n\n/** @internal */\nexport function pipeFromArray<T, R>(fns: Array<UnaryFunction<T, R>>): UnaryFunction<T, R> {\n if (fns.length === 0) {\n return identity as UnaryFunction<any, any>;\n }\n\n if (fns.length === 1) {\n return fns[0];\n }\n\n return function piped(input: T): R {\n return fns.reduce((prev: any, fn: UnaryFunction<T, R>) => fn(prev), input as any);\n };\n}\n", "import { Operator } from './Operator';\nimport { SafeSubscriber, Subscriber } from './Subscriber';\nimport { isSubscription, Subscription } from './Subscription';\nimport { TeardownLogic, OperatorFunction, Subscribable, Observer } from './types';\nimport { observable as Symbol_observable } from './symbol/observable';\nimport { pipeFromArray } from './util/pipe';\nimport { config } from './config';\nimport { isFunction } from './util/isFunction';\nimport { errorContext } from './util/errorContext';\n\n/**\n * A representation of any set of values over any amount of time. This is the most basic building block\n * of RxJS.\n */\nexport class Observable<T> implements Subscribable<T> {\n /**\n * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n */\n source: Observable<any> | undefined;\n\n /**\n * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n */\n operator: Operator<any, T> | undefined;\n\n /**\n * @param subscribe The function that is called when the Observable is\n * initially subscribed to. This function is given a Subscriber, to which new values\n * can be `next`ed, or an `error` method can be called to raise an error, or\n * `complete` can be called to notify of a successful completion.\n */\n constructor(subscribe?: (this: Observable<T>, subscriber: Subscriber<T>) => TeardownLogic) {\n if (subscribe) {\n this._subscribe = subscribe;\n }\n }\n\n // HACK: Since TypeScript inherits static properties too, we have to\n // fight against TypeScript here so Subject can have a different static create signature\n /**\n * Creates a new Observable by calling the Observable constructor\n * @param subscribe the subscriber function to be passed to the Observable constructor\n * @return A new observable.\n * @deprecated Use `new Observable()` instead. Will be removed in v8.\n */\n static create: (...args: any[]) => any = <T>(subscribe?: (subscriber: Subscriber<T>) => TeardownLogic) => {\n return new Observable<T>(subscribe);\n };\n\n /**\n * Creates a new Observable, with this Observable instance as the source, and the passed\n * operator defined as the new observable's operator.\n * @param operator the operator defining the operation to take on the observable\n * @return A new observable with the Operator applied.\n * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n * If you have implemented an operator using `lift`, it is recommended that you create an\n * operator by simply returning `new Observable()` directly. See \"Creating new operators from\n * scratch\" section here: https://rxjs.dev/guide/operators\n */\n lift<R>(operator?: Operator<T, R>): Observable<R> {\n const observable = new Observable<R>();\n observable.source = this;\n observable.operator = operator;\n return observable;\n }\n\n subscribe(observerOrNext?: Partial<Observer<T>> | ((value: T) => void)): Subscription;\n /** @deprecated Instead of passing separate callback arguments, use an observer argument. Signatures taking separate callback arguments will be removed in v8. Details: https://rxjs.dev/deprecations/subscribe-arguments */\n subscribe(next?: ((value: T) => void) | null, error?: ((error: any) => void) | null, complete?: (() => void) | null): Subscription;\n /**\n * Invokes an execution of an Observable and registers Observer handlers for notifications it will emit.\n *\n * <span class=\"informal\">Use it when you have all these Observables, but still nothing is happening.</span>\n *\n * `subscribe` is not a regular operator, but a method that calls Observable's internal `subscribe` function. It\n * might be for example a function that you passed to Observable's constructor, but most of the time it is\n * a library implementation, which defines what will be emitted by an Observable, and when it be will emitted. This means\n * that calling `subscribe` is actually the moment when Observable starts its work, not when it is created, as it is often\n * the thought.\n *\n * Apart from starting the execution of an Observable, this method allows you to listen for values\n * that an Observable emits, as well as for when it completes or errors. You can achieve this in two\n * of the following ways.\n *\n * The first way is creating an object that implements {@link Observer} interface. It should have methods\n * defined by that interface, but note that it should be just a regular JavaScript object, which you can create\n * yourself in any way you want (ES6 class, classic function constructor, object literal etc.). In particular, do\n * not attempt to use any RxJS implementation details to create Observers - you don't need them. Remember also\n * that your object does not have to implement all methods. If you find yourself creating a method that doesn't\n * do anything, you can simply omit it. Note however, if the `error` method is not provided and an error happens,\n * it will be thrown asynchronously. Errors thrown asynchronously cannot be caught using `try`/`catch`. Instead,\n * use the {@link onUnhandledError} configuration option or use a runtime handler (like `window.onerror` or\n * `process.on('error)`) to be notified of unhandled errors. Because of this, it's recommended that you provide\n * an `error` method to avoid missing thrown errors.\n *\n * The second way is to give up on Observer object altogether and simply provide callback functions in place of its methods.\n * This means you can provide three functions as arguments to `subscribe`, where the first function is equivalent\n * of a `next` method, the second of an `error` method and the third of a `complete` method. Just as in case of an Observer,\n * if you do not need to listen for something, you can omit a function by passing `undefined` or `null`,\n * since `subscribe` recognizes these functions by where they were placed in function call. When it comes\n * to the `error` function, as with an Observer, if not provided, errors emitted by an Observable will be thrown asynchronously.\n *\n * You can, however, subscribe with no parameters at all. This may be the case where you're not interested in terminal events\n * and you also handled emissions internally by using operators (e.g. using `tap`).\n *\n * Whichever style of calling `subscribe` you use, in both cases it returns a Subscription object.\n * This object allows you to call `unsubscribe` on it, which in turn will stop the work that an Observable does and will clean\n * up all resources that an Observable used. Note that cancelling a subscription will not call `complete` callback\n * provided to `subscribe` function, which is reserved for a regular completion signal that comes from an Observable.\n *\n * Remember that callbacks provided to `subscribe` are not guaranteed to be called asynchronously.\n * It is an Observable itself that decides when these functions will be called. For example {@link of}\n * by default emits all its values synchronously. Always check documentation for how given Observable\n * will behave when subscribed and if its default behavior can be modified with a `scheduler`.\n *\n * #### Examples\n *\n * Subscribe with an {@link guide/observer Observer}\n *\n * ```ts\n * import { of } from 'rxjs';\n *\n * const sumObserver = {\n * sum: 0,\n * next(value) {\n * console.log('Adding: ' + value);\n * this.sum = this.sum + value;\n * },\n * error() {\n * // We actually could just remove this method,\n * // since we do not really care about errors right now.\n * },\n * complete() {\n * console.log('Sum equals: ' + this.sum);\n * }\n * };\n *\n * of(1, 2, 3) // Synchronously emits 1, 2, 3 and then completes.\n * .subscribe(sumObserver);\n *\n * // Logs:\n * // 'Adding: 1'\n * // 'Adding: 2'\n * // 'Adding: 3'\n * // 'Sum equals: 6'\n * ```\n *\n * Subscribe with functions ({@link deprecations/subscribe-arguments deprecated})\n *\n * ```ts\n * import { of } from 'rxjs'\n *\n * let sum = 0;\n *\n * of(1, 2, 3).subscribe(\n * value => {\n * console.log('Adding: ' + value);\n * sum = sum + value;\n * },\n * undefined,\n * () => console.log('Sum equals: ' + sum)\n * );\n *\n * // Logs:\n * // 'Adding: 1'\n * // 'Adding: 2'\n * // 'Adding: 3'\n * // 'Sum equals: 6'\n * ```\n *\n * Cancel a subscription\n *\n * ```ts\n * import { interval } from 'rxjs';\n *\n * const subscription = interval(1000).subscribe({\n * next(num) {\n * console.log(num)\n * },\n * complete() {\n * // Will not be called, even when cancelling subscription.\n * console.log('completed!');\n * }\n * });\n *\n * setTimeout(() => {\n * subscription.unsubscribe();\n * console.log('unsubscribed!');\n * }, 2500);\n *\n * // Logs:\n * // 0 after 1s\n * // 1 after 2s\n * // 'unsubscribed!' after 2.5s\n * ```\n *\n * @param observerOrNext Either an {@link Observer} with some or all callback methods,\n * or the `next` handler that is called for each value emitted from the subscribed Observable.\n * @param error A handler for a terminal event resulting from an error. If no error handler is provided,\n * the error will be thrown asynchronously as unhandled.\n * @param complete A handler for a terminal event resulting from successful completion.\n * @return A subscription reference to the registered handlers.\n */\n subscribe(\n observerOrNext?: Partial<Observer<T>> | ((value: T) => void) | null,\n error?: ((error: any) => void) | null,\n complete?: (() => void) | null\n ): Subscription {\n const subscriber = isSubscriber(observerOrNext) ? observerOrNext : new SafeSubscriber(observerOrNext, error, complete);\n\n errorContext(() => {\n const { operator, source } = this;\n subscriber.add(\n operator\n ? // We're dealing with a subscription in the\n // operator chain to one of our lifted operators.\n operator.call(subscriber, source)\n : source\n ? // If `source` has a value, but `operator` does not, something that\n // had intimate knowledge of our API, like our `Subject`, must have\n // set it. We're going to just call `_subscribe` directly.\n this._subscribe(subscriber)\n : // In all other cases, we're likely wrapping a user-provided initializer\n // function, so we need to catch errors and handle them appropriately.\n this._trySubscribe(subscriber)\n );\n });\n\n return subscriber;\n }\n\n /** @internal */\n protected _trySubscribe(sink: Subscriber<T>): TeardownLogic {\n try {\n return this._subscribe(sink);\n } catch (err) {\n // We don't need to return anything in this case,\n // because it's just going to try to `add()` to a subscription\n // above.\n sink.error(err);\n }\n }\n\n /**\n * Used as a NON-CANCELLABLE means of subscribing to an observable, for use with\n * APIs that expect promises, like `async/await`. You cannot unsubscribe from this.\n *\n * **WARNING**: Only use this with observables you *know* will complete. If the source\n * observable does not complete, you will end up with a promise that is hung up, and\n * potentially all of the state of an async function hanging out in memory. To avoid\n * this situation, look into adding something like {@link timeout}, {@link take},\n * {@link takeWhile}, or {@link takeUntil} amongst others.\n *\n * #### Example\n *\n * ```ts\n * import { interval, take } from 'rxjs';\n *\n * const source$ = interval(1000).pipe(take(4));\n *\n * async function getTotal() {\n * let total = 0;\n *\n * await source$.forEach(value => {\n * total += value;\n * console.log('observable -> ' + value);\n * });\n *\n * return total;\n * }\n *\n * getTotal().then(\n * total => console.log('Total: ' + total)\n * );\n *\n * // Expected:\n * // 'observable -> 0'\n * // 'observable -> 1'\n * // 'observable -> 2'\n * // 'observable -> 3'\n * // 'Total: 6'\n * ```\n *\n * @param next A handler for each value emitted by the observable.\n * @return A promise that either resolves on observable completion or\n * rejects with the handled error.\n */\n forEach(next: (value: T) => void): Promise<void>;\n\n /**\n * @param next a handler for each value emitted by the observable\n * @param promiseCtor a constructor function used to instantiate the Promise\n * @return a promise that either resolves on observable completion or\n * rejects with the handled error\n * @deprecated Passing a Promise constructor will no longer be available\n * in upcoming versions of RxJS. This is because it adds weight to the library, for very\n * little benefit. If you need this functionality, it is recommended that you either\n * polyfill Promise, or you create an adapter to convert the returned native promise\n * to whatever promise implementation you wanted. Will be removed in v8.\n */\n forEach(next: (value: T) => void, promiseCtor: PromiseConstructorLike): Promise<void>;\n\n forEach(next: (value: T) => void, promiseCtor?: PromiseConstructorLike): Promise<void> {\n promiseCtor = getPromiseCtor(promiseCtor);\n\n return new promiseCtor<void>((resolve, reject) => {\n const subscriber = new SafeSubscriber<T>({\n next: (value) => {\n try {\n next(value);\n } catch (err) {\n reject(err);\n subscriber.unsubscribe();\n }\n },\n error: reject,\n complete: resolve,\n });\n this.subscribe(subscriber);\n }) as Promise<void>;\n }\n\n /** @internal */\n protected _subscribe(subscriber: Subscriber<any>): TeardownLogic {\n return this.source?.subscribe(subscriber);\n }\n\n /**\n * An interop point defined by the es7-observable spec https://github.com/zenparsing/es-observable\n * @return This instance of the observable.\n */\n [Symbol_observable]() {\n return this;\n }\n\n /* tslint:disable:max-line-length */\n pipe(): Observable<T>;\n pipe<A>(op1: OperatorFunction<T, A>): Observable<A>;\n pipe<A, B>(op1: OperatorFunction<T, A>, op2: OperatorFunction<A, B>): Observable<B>;\n pipe<A, B, C>(op1: OperatorFunction<T, A>, op2: OperatorFunction<A, B>, op3: OperatorFunction<B, C>): Observable<C>;\n pipe<A, B, C, D>(\n op1: OperatorFunction<T, A>,\n op2: OperatorFunction<A, B>,\n op3: OperatorFunction<B, C>,\n op4: OperatorFunction<C, D>\n ): Observable<D>;\n pipe<A, B, C, D, E>(\n op1: OperatorFunction<T, A>,\n op2: OperatorFunction<A, B>,\n op3: OperatorFunction<B, C>,\n op4: OperatorFunction<C, D>,\n op5: OperatorFunction<D, E>\n ): Observable<E>;\n pipe<A, B, C, D, E, F>(\n op1: OperatorFunction<T, A>,\n op2: OperatorFunction<A, B>,\n op3: OperatorFunction<B, C>,\n op4: OperatorFunction<C, D>,\n op5: OperatorFunction<D, E>,\n op6: OperatorFunction<E, F>\n ): Observable<F>;\n pipe<A, B, C, D, E, F, G>(\n op1: OperatorFunction<T, A>,\n op2: OperatorFunction<A, B>,\n op3: OperatorFunction<B, C>,\n op4: OperatorFunction<C, D>,\n op5: OperatorFunction<D, E>,\n op6: OperatorFunction<E, F>,\n op7: OperatorFunction<F, G>\n ): Observable<G>;\n pipe<A, B, C, D, E, F, G, H>(\n op1: OperatorFunction<T, A>,\n op2: OperatorFunction<A, B>,\n op3: OperatorFunction<B, C>,\n op4: OperatorFunction<C, D>,\n op5: OperatorFunction<D, E>,\n op6: OperatorFunction<E, F>,\n op7: OperatorFunction<F, G>,\n op8: OperatorFunction<G, H>\n ): Observable<H>;\n pipe<A, B, C, D, E, F, G, H, I>(\n op1: OperatorFunction<T, A>,\n op2: OperatorFunction<A, B>,\n op3: OperatorFunction<B, C>,\n op4: OperatorFunction<C, D>,\n op5: OperatorFunction<D, E>,\n op6: OperatorFunction<E, F>,\n op7: OperatorFunction<F, G>,\n op8: OperatorFunction<G, H>,\n op9: OperatorFunction<H, I>\n ): Observable<I>;\n pipe<A, B, C, D, E, F, G, H, I>(\n op1: OperatorFunction<T, A>,\n op2: OperatorFunction<A, B>,\n op3: OperatorFunction<B, C>,\n op4: OperatorFunction<C, D>,\n op5: OperatorFunction<D, E>,\n op6: OperatorFunction<E, F>,\n op7: OperatorFunction<F, G>,\n op8: OperatorFunction<G, H>,\n op9: OperatorFunction<H, I>,\n ...operations: OperatorFunction<any, any>[]\n ): Observable<unknown>;\n /* tslint:enable:max-line-length */\n\n /**\n * Used to stitch together functional operators into a chain.\n *\n * ## Example\n *\n * ```ts\n * import { interval, filter, map, scan } from 'rxjs';\n *\n * interval(1000)\n * .pipe(\n * filter(x => x % 2 === 0),\n * map(x => x + x),\n * scan((acc, x) => acc + x)\n * )\n * .subscribe(x => console.log(x));\n * ```\n *\n * @return The Observable result of all the operators having been called\n * in the order they were passed in.\n */\n pipe(...operations: OperatorFunction<any, any>[]): Observable<any> {\n return pipeFromArray(operations)(this);\n }\n\n /* tslint:disable:max-line-length */\n /** @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise */\n toPromise(): Promise<T | undefined>;\n /** @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise */\n toPromise(PromiseCtor: typeof Promise): Promise<T | undefined>;\n /** @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise */\n toPromise(PromiseCtor: PromiseConstructorLike): Promise<T | undefined>;\n /* tslint:enable:max-line-length */\n\n /**\n * Subscribe to this Observable and get a Promise resolving on\n * `complete` with the last emission (if any).\n *\n * **WARNING**: Only use this with observables you *know* will complete. If the source\n * observable does not complete, you will end up with a promise that is hung up, and\n * potentially all of the state of an async function hanging out in memory. To avoid\n * this situation, look into adding something like {@link timeout}, {@link take},\n * {@link takeWhile}, or {@link takeUntil} amongst others.\n *\n * @param [promiseCtor] a constructor function used to instantiate\n * the Promise\n * @return A Promise that resolves with the last value emit, or\n * rejects on an error. If there were no emissions, Promise\n * resolves with undefined.\n * @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise\n */\n toPromise(promiseCtor?: PromiseConstructorLike): Promise<T | undefined> {\n promiseCtor = getPromiseCtor(promiseCtor);\n\n return new promiseCtor((resolve, reject) => {\n let value: T | undefined;\n this.subscribe(\n (x: T) => (value = x),\n (err: any) => reject(err),\n () => resolve(value)\n );\n }) as Promise<T | undefined>;\n }\n}\n\n/**\n * Decides between a passed promise constructor from consuming code,\n * A default configured promise constructor, and the native promise\n * constructor and returns it. If nothing can be found, it will throw\n * an error.\n * @param promiseCtor The optional promise constructor to passed by consuming code\n */\nfunction getPromiseCtor(promiseCtor: PromiseConstructorLike | undefined) {\n return promiseCtor ?? config.Promise ?? Promise;\n}\n\nfunction isObserver<T>(value: any): value is Observer<T> {\n return value && isFunction(value.next) && isFunction(value.error) && isFunction(value.complete);\n}\n\nfunction isSubscriber<T>(value: any): value is Subscriber<T> {\n return (value && value instanceof Subscriber) || (isObserver(value) && isSubscription(value));\n}\n", "import { Observable } from '../Observable';\nimport { Subscriber } from '../Subscriber';\nimport { OperatorFunction } from '../types';\nimport { isFunction } from './isFunction';\n\n/**\n * Used to determine if an object is an Observable with a lift function.\n */\nexport function hasLift(source: any): source is { lift: InstanceType<typeof Observable>['lift'] } {\n return isFunction(source?.lift);\n}\n\n/**\n * Creates an `OperatorFunction`. Used to define operators throughout the library in a concise way.\n * @param init The logic to connect the liftedSource to the subscriber at the moment of subscription.\n */\nexport function operate<T, R>(\n init: (liftedSource: Observable<T>, subscriber: Subscriber<R>) => (() => void) | void\n): OperatorFunction<T, R> {\n return (source: Observable<T>) => {\n if (hasLift(source)) {\n return source.lift(function (this: Subscriber<R>, liftedSource: Observable<T>) {\n try {\n return init(liftedSource, this);\n } catch (err) {\n this.error(err);\n }\n });\n }\n throw new TypeError('Unable to lift unknown Observable type');\n };\n}\n", "import { Subscriber } from '../Subscriber';\n\n/**\n * Creates an instance of an `OperatorSubscriber`.\n * @param destination The downstream subscriber.\n * @param onNext Handles next values, only called if this subscriber is not stopped or closed. Any\n * error that occurs in this function is caught and sent to the `error` method of this subscriber.\n * @param onError Handles errors from the subscription, any errors that occur in this handler are caught\n * and send to the `destination` error handler.\n * @param onComplete Handles completion notification from the subscription. Any errors that occur in\n * this handler are sent to the `destination` error handler.\n * @param onFinalize Additional teardown logic here. This will only be called on teardown if the\n * subscriber itself is not already closed. This is called after all other teardown logic is executed.\n */\nexport function createOperatorSubscriber<T>(\n destination: Subscriber<any>,\n onNext?: (value: T) => void,\n onComplete?: () => void,\n onError?: (err: any) => void,\n onFinalize?: () => void\n): Subscriber<T> {\n return new OperatorSubscriber(destination, onNext, onComplete, onError, onFinalize);\n}\n\n/**\n * A generic helper for allowing operators to be created with a Subscriber and\n * use closures to capture necessary state from the operator function itself.\n */\nexport class OperatorSubscriber<T> extends Subscriber<T> {\n /**\n * Creates an instance of an `OperatorSubscriber`.\n * @param destination The downstream subscriber.\n * @param onNext Handles next values, only called if this subscriber is not stopped or closed. Any\n * error that occurs in this function is caught and sent to the `error` method of this subscriber.\n * @param onError Handles errors from the subscription, any errors that occur in this handler are caught\n * and send to the `destination` error handler.\n * @param onComplete Handles completion notification from the subscription. Any errors that occur in\n * this handler are sent to the `destination` error handler.\n * @param onFinalize Additional finalization logic here. This will only be called on finalization if the\n * subscriber itself is not already closed. This is called after all other finalization logic is executed.\n * @param shouldUnsubscribe An optional check to see if an unsubscribe call should truly unsubscribe.\n * NOTE: This currently **ONLY** exists to support the strange behavior of {@link groupBy}, where unsubscription\n * to the resulting observable does not actually disconnect from the source if there are active subscriptions\n * to any grouped observable. (DO NOT EXPOSE OR USE EXTERNALLY!!!)\n */\n constructor(\n destination: Subscriber<any>,\n onNext?: (value: T) => void,\n onComplete?: () => void,\n onError?: (err: any) => void,\n private onFinalize?: () => void,\n private shouldUnsubscribe?: () => boolean\n ) {\n // It's important - for performance reasons - that all of this class's\n // members are initialized and that they are always initialized in the same\n // order. This will ensure that all OperatorSubscriber instances have the\n // same hidden class in V8. This, in turn, will help keep the number of\n // hidden classes involved in property accesses within the base class as\n // low as possible. If the number of hidden classes involved exceeds four,\n // the property accesses will become megamorphic and performance penalties\n // will be incurred - i.e. inline caches won't be used.\n //\n // The reasons for ensuring all instances have the same hidden class are\n // further discussed in this blog post from Benedikt Meurer:\n // https://benediktmeurer.de/2018/03/23/impact-of-polymorphism-on-component-based-frameworks-like-react/\n super(destination);\n this._next = onNext\n ? function (this: OperatorSubscriber<T>, value: T) {\n try {\n onNext(value);\n } catch (err) {\n destination.error(err);\n }\n }\n : super._next;\n this._error = onError\n ? function (this: OperatorSubscriber<T>, err: any) {\n try {\n onError(err);\n } catch (err) {\n // Send any errors that occur down stream.\n destination.error(err);\n } finally {\n // Ensure finalization.\n this.unsubscribe();\n }\n }\n : super._error;\n this._complete = onComplete\n ? function (this: OperatorSubscriber<T>) {\n try {\n onComplete();\n } catch (err) {\n // Send any errors that occur down stream.\n destination.error(err);\n } finally {\n // Ensure finalization.\n this.unsubscribe();\n }\n }\n : super._complete;\n }\n\n unsubscribe() {\n if (!this.shouldUnsubscribe || this.shouldUnsubscribe()) {\n const { closed } = this;\n super.unsubscribe();\n // Execute additional teardown if we have any and we didn't already do so.\n !closed && this.onFinalize?.();\n }\n }\n}\n", "export const isArrayLike = (<T>(x: any): x is ArrayLike<T> => x && typeof x.length === 'number' && typeof x !== 'function');", "import { isFunction } from \"./isFunction\";\n\n/**\n * Tests to see if the object is \"thennable\".\n * @param value the object to test\n */\nexport function isPromise(value: any): value is PromiseLike<any> {\n return isFunction(value?.then);\n}\n", "import { InteropObservable } from '../types';\nimport { observable as Symbol_observable } from '../symbol/observable';\nimport { isFunction } from './isFunction';\n\n/** Identifies an input as being Observable (but not necessary an Rx Observable) */\nexport function isInteropObservable(input: any): input is InteropObservable<any> {\n return isFunction(input[Symbol_observable]);\n}\n", "import { isFunction } from './isFunction';\n\nexport function isAsyncIterable<T>(obj: any): obj is AsyncIterable<T> {\n return Symbol.asyncIterator && isFunction(obj?.[Symbol.asyncIterator]);\n}\n", "/**\n * Creates the TypeError to throw if an invalid object is passed to `from` or `scheduled`.\n * @param input The object that was passed.\n */\nexport function createInvalidObservableTypeError(input: any) {\n // TODO: We should create error codes that can be looked up, so this can be less verbose.\n return new TypeError(\n `You provided ${\n input !== null && typeof input === 'object' ? 'an invalid object' : `'${input}'`\n } where a stream was expected. You can provide an Observable, Promise, ReadableStream, Array, AsyncIterable, or Iterable.`\n );\n}\n", "export function getSymbolIterator(): symbol {\n if (typeof Symbol !== 'function' || !Symbol.iterator) {\n return '@@iterator' as any;\n }\n\n return Symbol.iterator;\n}\n\nexport const iterator = getSymbolIterator();\n", "import { iterator as Symbol_iterator } from '../symbol/iterator';\nimport { isFunction } from './isFunction';\n\n/** Identifies an input as being an Iterable */\nexport function isIterable(input: any): input is Iterable<any> {\n return isFunction(input?.[Symbol_iterator]);\n}\n", "import { ReadableStreamLike } from '../types';\nimport { isFunction } from './isFunction';\n\nexport async function* readableStreamLikeToAsyncGenerator<T>(readableStream: ReadableStreamLike<T>): AsyncGenerator<T> {\n const reader = readableStream.getReader();\n try {\n while (true) {\n const { value, done } = await reader.read();\n if (done) {\n return;\n }\n yield value!;\n }\n } finally {\n reader.releaseLock();\n }\n}\n\nexport function isReadableStreamLike<T>(obj: any): obj is ReadableStreamLike<T> {\n // We don't want to use instanceof checks because they would return\n // false for instances from another Realm, like an <iframe>.\n return isFunction(obj?.getReader);\n}\n", "import { isArrayLike } from '../util/isArrayLike';\nimport { isPromise } from '../util/isPromise';\nimport { Observable } from '../Observable';\nimport { ObservableInput, ObservedValueOf, ReadableStreamLike } from '../types';\nimport { isInteropObservable } from '../util/isInteropObservable';\nimport { isAsyncIterable } from '../util/isAsyncIterable';\nimport { createInvalidObservableTypeError } from '../util/throwUnobservableError';\nimport { isIterable } from '../util/isIterable';\nimport { isReadableStreamLike, readableStreamLikeToAsyncGenerator } from '../util/isReadableStreamLike';\nimport { Subscriber } from '../Subscriber';\nimport { isFunction } from '../util/isFunction';\nimport { reportUnhandledError } from '../util/reportUnhandledError';\nimport { observable as Symbol_observable } from '../symbol/observable';\n\nexport function innerFrom<O extends ObservableInput<any>>(input: O): Observable<ObservedValueOf<O>>;\nexport function innerFrom<T>(input: ObservableInput<T>): Observable<T> {\n if (input instanceof Observable) {\n return input;\n }\n if (input != null) {\n if (isInteropObservable(input)) {\n return fromInteropObservable(input);\n }\n if (isArrayLike(input)) {\n return fromArrayLike(input);\n }\n if (isPromise(input)) {\n return fromPromise(input);\n }\n if (isAsyncIterable(input)) {\n return fromAsyncIterable(input);\n }\n if (isIterable(input)) {\n return fromIterable(input);\n }\n if (isReadableStreamLike(input)) {\n return fromReadableStreamLike(input);\n }\n }\n\n throw createInvalidObservableTypeError(input);\n}\n\n/**\n * Creates an RxJS Observable from an object that implements `Symbol.observable`.\n * @param obj An object that properly implements `Symbol.observable`.\n */\nexport function fromInteropObservable<T>(obj: any) {\n return new Observable((subscriber: Subscriber<T>) => {\n const obs = obj[Symbol_observable]();\n if (isFunction(obs.subscribe)) {\n return obs.subscribe(subscriber);\n }\n // Should be caught by observable subscribe function error handling.\n throw new TypeError('Provided object does not correctly implement Symbol.observable');\n });\n}\n\n/**\n * Synchronously emits the values of an array like and completes.\n * This is exported because there are creation functions and operators that need to\n * make direct use of the same logic, and there's no reason to make them run through\n * `from` conditionals because we *know* they're dealing with an array.\n * @param array The array to emit values from\n */\nexport function fromArrayLike<T>(array: ArrayLike<T>) {\n return new Observable((subscriber: Subscriber<T>) => {\n // Loop over the array and emit each value. Note two things here:\n // 1. We're making sure that the subscriber is not closed on each loop.\n // This is so we don't continue looping over a very large array after\n // something like a `take`, `takeWhile`, or other synchronous unsubscription\n // has already unsubscribed.\n // 2. In this form, reentrant code can alter that array we're looping over.\n // This is a known issue, but considered an edge case. The alternative would\n // be to copy the array before executing the loop, but this has\n // performance implications.\n for (let i = 0; i < array.length && !subscriber.closed; i++) {\n subscriber.next(array[i]);\n }\n subscriber.complete();\n });\n}\n\nexport function fromPromise<T>(promise: PromiseLike<T>) {\n return new Observable((subscriber: Subscriber<T>) => {\n promise\n .then(\n (value) => {\n if (!subscriber.closed) {\n subscriber.next(value);\n subscriber.complete();\n }\n },\n (err: any) => subscriber.error(err)\n )\n .then(null, reportUnhandledError);\n });\n}\n\nexport function fromIterable<T>(iterable: Iterable<T>) {\n return new Observable((subscriber: Subscriber<T>) => {\n for (const value of iterable) {\n subscriber.next(value);\n if (subscriber.closed) {\n return;\n }\n }\n subscriber.complete();\n });\n}\n\nexport function fromAsyncIterable<T>(asyncIterable: AsyncIterable<T>) {\n return new Observable((subscriber: Subscriber<T>) => {\n process(asyncIterable, subscriber).catch((err) => subscriber.error(err));\n });\n}\n\nexport function fromReadableStreamLike<T>(readableStream: ReadableStreamLike<T>) {\n return fromAsyncIterable(readableStreamLikeToAsyncGenerator(readableStream));\n}\n\nasync function process<T>(asyncIterable: AsyncIterable<T>, subscriber: Subscriber<T>) {\n for await (const value of asyncIterable) {\n subscriber.next(value);\n // A side-effect may have closed our subscriber,\n // check before the next iteration.\n if (subscriber.closed) {\n return;\n }\n }\n subscriber.complete();\n}\n", "import { Subscription } from '../Subscription';\nimport { SchedulerAction, SchedulerLike } from '../types';\n\nexport function executeSchedule(\n parentSubscription: Subscription,\n scheduler: SchedulerLike,\n work: () => void,\n delay: number,\n repeat: true\n): void;\nexport function executeSchedule(\n parentSubscription: Subscription,\n scheduler: SchedulerLike,\n work: () => void,\n delay?: number,\n repeat?: false\n): Subscription;\n\nexport function executeSchedule(\n parentSubscription: Subscription,\n scheduler: SchedulerLike,\n work: () => void,\n delay = 0,\n repeat = false\n): Subscription | void {\n const scheduleSubscription = scheduler.schedule(function (this: SchedulerAction<any>) {\n work();\n if (repeat) {\n parentSubscription.add(this.schedule(null, delay));\n } else {\n this.unsubscribe();\n }\n }, delay);\n\n parentSubscription.add(scheduleSubscription);\n\n if (!repeat) {\n // Because user-land scheduler implementations are unlikely to properly reuse\n // Actions for repeat scheduling, we can't trust that the returned subscription\n // will control repeat subscription scenarios. So we're trying to avoid using them\n // incorrectly within this library.\n return scheduleSubscription;\n }\n}\n", "/** @prettier */\nimport { MonoTypeOperatorFunction, SchedulerLike } from '../types';\nimport { executeSchedule } from '../util/executeSchedule';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\n/**\n * Re-emits all notifications from source Observable with specified scheduler.\n *\n * <span class=\"informal\">Ensure a specific scheduler is used, from outside of an Observable.</span>\n *\n * `observeOn` is an operator that accepts a scheduler as a first parameter, which will be used to reschedule\n * notifications emitted by the source Observable. It might be useful, if you do not have control over\n * internal scheduler of a given Observable, but want to control when its values are emitted nevertheless.\n *\n * Returned Observable emits the same notifications (nexted values, complete and error events) as the source Observable,\n * but rescheduled with provided scheduler. Note that this doesn't mean that source Observables internal\n * scheduler will be replaced in any way. Original scheduler still will be used, but when the source Observable emits\n * notification, it will be immediately scheduled again - this time with scheduler passed to `observeOn`.\n * An anti-pattern would be calling `observeOn` on Observable that emits lots of values synchronously, to split\n * that emissions into asynchronous chunks. For this to happen, scheduler would have to be passed into the source\n * Observable directly (usually into the operator that creates it). `observeOn` simply delays notifications a\n * little bit more, to ensure that they are emitted at expected moments.\n *\n * As a matter of fact, `observeOn` accepts second parameter, which specifies in milliseconds with what delay notifications\n * will be emitted. The main difference between {@link delay} operator and `observeOn` is that `observeOn`\n * will delay all notifications - including error notifications - while `delay` will pass through error\n * from source Observable immediately when it is emitted. In general it is highly recommended to use `delay` operator\n * for any kind of delaying of values in the stream, while using `observeOn` to specify which scheduler should be used\n * for notification emissions in general.\n *\n * ## Example\n *\n * Ensure values in subscribe are called just before browser repaint\n *\n * ```ts\n * import { interval, observeOn, animationFrameScheduler } from 'rxjs';\n *\n * const someDiv = document.createElement('div');\n * someDiv.style.cssText = 'width: 200px;background: #09c';\n * document.body.appendChild(someDiv);\n * const intervals = interval(10); // Intervals are scheduled\n * // with async scheduler by default...\n * intervals.pipe(\n * observeOn(animationFrameScheduler) // ...but we will observe on animationFrame\n * ) // scheduler to ensure smooth animation.\n * .subscribe(val => {\n * someDiv.style.height = val + 'px';\n * });\n * ```\n *\n * @see {@link delay}\n *\n * @param scheduler Scheduler that will be used to reschedule notifications from source Observable.\n * @param delay Number of milliseconds that states with what delay every notification should be rescheduled.\n * @return A function that returns an Observable that emits the same\n * notifications as the source Observable, but with provided scheduler.\n */\nexport function observeOn<T>(scheduler: SchedulerLike, delay = 0): MonoTypeOperatorFunction<T> {\n return operate((source, subscriber) => {\n source.subscribe(\n createOperatorSubscriber(\n subscriber,\n (value) => executeSchedule(subscriber, scheduler, () => subscriber.next(value), delay),\n () => executeSchedule(subscriber, scheduler, () => subscriber.complete(), delay),\n (err) => executeSchedule(subscriber, scheduler, () => subscriber.error(err), delay)\n )\n );\n });\n}\n", "import { MonoTypeOperatorFunction, SchedulerLike } from '../types';\nimport { operate } from '../util/lift';\n\n/**\n * Asynchronously subscribes Observers to this Observable on the specified {@link SchedulerLike}.\n *\n * With `subscribeOn` you can decide what type of scheduler a specific Observable will be using when it is subscribed to.\n *\n * Schedulers control the speed and order of emissions to observers from an Observable stream.\n *\n * \n *\n * ## Example\n *\n * Given the following code:\n *\n * ```ts\n * import { of, merge } from 'rxjs';\n *\n * const a = of(1, 2, 3);\n * const b = of(4, 5, 6);\n *\n * merge(a, b).subscribe(console.log);\n *\n * // Outputs\n * // 1\n * // 2\n * // 3\n * // 4\n * // 5\n * // 6\n * ```\n *\n * Both Observable `a` and `b` will emit their values directly and synchronously once they are subscribed to.\n *\n * If we instead use the `subscribeOn` operator declaring that we want to use the {@link asyncScheduler} for values emitted by Observable `a`:\n *\n * ```ts\n * import { of, subscribeOn, asyncScheduler, merge } from 'rxjs';\n *\n * const a = of(1, 2, 3).pipe(subscribeOn(asyncScheduler));\n * const b = of(4, 5, 6);\n *\n * merge(a, b).subscribe(console.log);\n *\n * // Outputs\n * // 4\n * // 5\n * // 6\n * // 1\n * // 2\n * // 3\n * ```\n *\n * The reason for this is that Observable `b` emits its values directly and synchronously like before\n * but the emissions from `a` are scheduled on the event loop because we are now using the {@link asyncScheduler} for that specific Observable.\n *\n * @param scheduler The {@link SchedulerLike} to perform subscription actions on.\n * @param delay A delay to pass to the scheduler to delay subscriptions\n * @return A function that returns an Observable modified so that its\n * subscriptions happen on the specified {@link SchedulerLike}.\n */\nexport function subscribeOn<T>(scheduler: SchedulerLike, delay: number = 0): MonoTypeOperatorFunction<T> {\n return operate((source, subscriber) => {\n subscriber.add(scheduler.schedule(() => source.subscribe(subscriber), delay));\n });\n}\n", "import { innerFrom } from '../observable/innerFrom';\nimport { observeOn } from '../operators/observeOn';\nimport { subscribeOn } from '../operators/subscribeOn';\nimport { InteropObservable, SchedulerLike } from '../types';\n\nexport function scheduleObservable<T>(input: InteropObservable<T>, scheduler: SchedulerLike) {\n return innerFrom(input).pipe(subscribeOn(scheduler), observeOn(scheduler));\n}\n", "import { innerFrom } from '../observable/innerFrom';\nimport { observeOn } from '../operators/observeOn';\nimport { subscribeOn } from '../operators/subscribeOn';\nimport { SchedulerLike } from '../types';\n\nexport function schedulePromise<T>(input: PromiseLike<T>, scheduler: SchedulerLike) {\n return innerFrom(input).pipe(subscribeOn(scheduler), observeOn(scheduler));\n}\n", "import { Observable } from '../Observable';\nimport { SchedulerLike } from '../types';\n\nexport function scheduleArray<T>(input: ArrayLike<T>, scheduler: SchedulerLike) {\n return new Observable<T>((subscriber) => {\n // The current array index.\n let i = 0;\n // Start iterating over the array like on a schedule.\n return scheduler.schedule(function () {\n if (i === input.length) {\n // If we have hit the end of the array like in the\n // previous job, we can complete.\n subscriber.complete();\n } else {\n // Otherwise let's next the value at the current index,\n // then increment our index.\n subscriber.next(input[i++]);\n // If the last emission didn't cause us to close the subscriber\n // (via take or some side effect), reschedule the job and we'll\n // make another pass.\n if (!subscriber.closed) {\n this.schedule();\n }\n }\n });\n });\n}\n", "import { Observable } from '../Observable';\nimport { SchedulerLike } from '../types';\nimport { iterator as Symbol_iterator } from '../symbol/iterator';\nimport { isFunction } from '../util/isFunction';\nimport { executeSchedule } from '../util/executeSchedule';\n\n/**\n * Used in {@link scheduled} to create an observable from an Iterable.\n * @param input The iterable to create an observable from\n * @param scheduler The scheduler to use\n */\nexport function scheduleIterable<T>(input: Iterable<T>, scheduler: SchedulerLike) {\n return new Observable<T>((subscriber) => {\n let iterator: Iterator<T, T>;\n\n // Schedule the initial creation of the iterator from\n // the iterable. This is so the code in the iterable is\n // not called until the scheduled job fires.\n executeSchedule(subscriber, scheduler, () => {\n // Create the iterator.\n iterator = (input as any)[Symbol_iterator]();\n\n executeSchedule(\n subscriber,\n scheduler,\n () => {\n let value: T;\n let done: boolean | undefined;\n try {\n // Pull the value out of the iterator\n ({ value, done } = iterator.next());\n } catch (err) {\n // We got an error while pulling from the iterator\n subscriber.error(err);\n return;\n }\n\n if (done) {\n // If it is \"done\" we just complete. This mimics the\n // behavior of JavaScript's `for..of` consumption of\n // iterables, which will not emit the value from an iterator\n // result of `{ done: true: value: 'here' }`.\n subscriber.complete();\n } else {\n // The iterable is not done, emit the value.\n subscriber.next(value);\n }\n },\n 0,\n true\n );\n });\n\n // During finalization, if we see this iterator has a `return` method,\n // then we know it is a Generator, and not just an Iterator. So we call\n // the `return()` function. This will ensure that any `finally { }` blocks\n // inside of the generator we can hit will be hit properly.\n return () => isFunction(iterator?.return) && iterator.return();\n });\n}\n", "import { SchedulerLike } from '../types';\nimport { Observable } from '../Observable';\nimport { executeSchedule } from '../util/executeSchedule';\n\nexport function scheduleAsyncIterable<T>(input: AsyncIterable<T>, scheduler: SchedulerLike) {\n if (!input) {\n throw new Error('Iterable cannot be null');\n }\n return new Observable<T>((subscriber) => {\n executeSchedule(subscriber, scheduler, () => {\n const iterator = input[Symbol.asyncIterator]();\n executeSchedule(\n subscriber,\n scheduler,\n () => {\n iterator.next().then((result) => {\n if (result.done) {\n // This will remove the subscriptions from\n // the parent subscription.\n subscriber.complete();\n } else {\n subscriber.next(result.value);\n }\n });\n },\n 0,\n true\n );\n });\n });\n}\n", "import { SchedulerLike, ReadableStreamLike } from '../types';\nimport { Observable } from '../Observable';\nimport { scheduleAsyncIterable } from './scheduleAsyncIterable';\nimport { readableStreamLikeToAsyncGenerator } from '../util/isReadableStreamLike';\n\nexport function scheduleReadableStreamLike<T>(input: ReadableStreamLike<T>, scheduler: SchedulerLike): Observable<T> {\n return scheduleAsyncIterable(readableStreamLikeToAsyncGenerator(input), scheduler);\n}\n", "import { scheduleObservable } from './scheduleObservable';\nimport { schedulePromise } from './schedulePromise';\nimport { scheduleArray } from './scheduleArray';\nimport { scheduleIterable } from './scheduleIterable';\nimport { scheduleAsyncIterable } from './scheduleAsyncIterable';\nimport { isInteropObservable } from '../util/isInteropObservable';\nimport { isPromise } from '../util/isPromise';\nimport { isArrayLike } from '../util/isArrayLike';\nimport { isIterable } from '../util/isIterable';\nimport { ObservableInput, SchedulerLike } from '../types';\nimport { Observable } from '../Observable';\nimport { isAsyncIterable } from '../util/isAsyncIterable';\nimport { createInvalidObservableTypeError } from '../util/throwUnobservableError';\nimport { isReadableStreamLike } from '../util/isReadableStreamLike';\nimport { scheduleReadableStreamLike } from './scheduleReadableStreamLike';\n\n/**\n * Converts from a common {@link ObservableInput} type to an observable where subscription and emissions\n * are scheduled on the provided scheduler.\n *\n * @see {@link from}\n * @see {@link of}\n *\n * @param input The observable, array, promise, iterable, etc you would like to schedule\n * @param scheduler The scheduler to use to schedule the subscription and emissions from\n * the returned observable.\n */\nexport function scheduled<T>(input: ObservableInput<T>, scheduler: SchedulerLike): Observable<T> {\n if (input != null) {\n if (isInteropObservable(input)) {\n return scheduleObservable(input, scheduler);\n }\n if (isArrayLike(input)) {\n return scheduleArray(input, scheduler);\n }\n if (isPromise(input)) {\n return schedulePromise(input, scheduler);\n }\n if (isAsyncIterable(input)) {\n return scheduleAsyncIterable(input, scheduler);\n }\n if (isIterable(input)) {\n return scheduleIterable(input, scheduler);\n }\n if (isReadableStreamLike(input)) {\n return scheduleReadableStreamLike(input, scheduler);\n }\n }\n throw createInvalidObservableTypeError(input);\n}\n", "import { Observable } from '../Observable';\nimport { ObservableInput, SchedulerLike, ObservedValueOf } from '../types';\nimport { scheduled } from '../scheduled/scheduled';\nimport { innerFrom } from './innerFrom';\n\nexport function from<O extends ObservableInput<any>>(input: O): Observable<ObservedValueOf<O>>;\n/** @deprecated The `scheduler` parameter will be removed in v8. Use `scheduled`. Details: https://rxjs.dev/deprecations/scheduler-argument */\nexport function from<O extends ObservableInput<any>>(input: O, scheduler: SchedulerLike | undefined): Observable<ObservedValueOf<O>>;\n\n/**\n * Creates an Observable from an Array, an array-like object, a Promise, an iterable object, or an Observable-like object.\n *\n * <span class=\"informal\">Converts almost anything to an Observable.</span>\n *\n * \n *\n * `from` converts various other objects and data types into Observables. It also converts a Promise, an array-like, or an\n * <a href=\"https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#iterable\" target=\"_blank\">iterable</a>\n * object into an Observable that emits the items in that promise, array, or iterable. A String, in this context, is treated\n * as an array of characters. Observable-like objects (contains a function named with the ES2015 Symbol for Observable) can also be\n * converted through this operator.\n *\n * ## Examples\n *\n * Converts an array to an Observable\n *\n * ```ts\n * import { from } from 'rxjs';\n *\n * const array = [10, 20, 30];\n * const result = from(array);\n *\n * result.subscribe(x => console.log(x));\n *\n * // Logs:\n * // 10\n * // 20\n * // 30\n * ```\n *\n * Convert an infinite iterable (from a generator) to an Observable\n *\n * ```ts\n * import { from, take } from 'rxjs';\n *\n * function* generateDoubles(seed) {\n * let i = seed;\n * while (true) {\n * yield i;\n * i = 2 * i; // double it\n * }\n * }\n *\n * const iterator = generateDoubles(3);\n * const result = from(iterator).pipe(take(10));\n *\n * result.subscribe(x => console.log(x));\n *\n * // Logs:\n * // 3\n * // 6\n * // 12\n * // 24\n * // 48\n * // 96\n * // 192\n * // 384\n * // 768\n * // 1536\n * ```\n *\n * With `asyncScheduler`\n *\n * ```ts\n * import { from, asyncScheduler } from 'rxjs';\n *\n * console.log('start');\n *\n * const array = [10, 20, 30];\n * const result = from(array, asyncScheduler);\n *\n * result.subscribe(x => console.log(x));\n *\n * console.log('end');\n *\n * // Logs:\n * // 'start'\n * // 'end'\n * // 10\n * // 20\n * // 30\n * ```\n *\n * @see {@link fromEvent}\n * @see {@link fromEventPattern}\n *\n * @param input A subscription object, a Promise, an Observable-like,\n * an Array, an iterable, or an array-like object to be converted.\n * @param scheduler An optional {@link SchedulerLike} on which to schedule the emission of values.\n * @return An Observable converted from {@link ObservableInput}.\n */\nexport function from<T>(input: ObservableInput<T>, scheduler?: SchedulerLike): Observable<T> {\n return scheduler ? scheduled(input, scheduler) : innerFrom(input);\n}\n", "import { OperatorFunction } from '../types';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\nexport function map<T, R>(project: (value: T, index: number) => R): OperatorFunction<T, R>;\n/** @deprecated Use a closure instead of a `thisArg`. Signatures accepting a `thisArg` will be removed in v8. */\nexport function map<T, R, A>(project: (this: A, value: T, index: number) => R, thisArg: A): OperatorFunction<T, R>;\n\n/**\n * Applies a given `project` function to each value emitted by the source\n * Observable, and emits the resulting values as an Observable.\n *\n * <span class=\"informal\">Like [Array.prototype.map()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map),\n * it passes each source value through a transformation function to get\n * corresponding output values.</span>\n *\n * \n *\n * Similar to the well known `Array.prototype.map` function, this operator\n * applies a projection to each value and emits that projection in the output\n * Observable.\n *\n * ## Example\n *\n * Map every click to the `clientX` position of that click\n *\n * ```ts\n * import { fromEvent, map } from 'rxjs';\n *\n * const clicks = fromEvent<PointerEvent>(document, 'click');\n * const positions = clicks.pipe(map(ev => ev.clientX));\n *\n * positions.subscribe(x => console.log(x));\n * ```\n *\n * @see {@link mapTo}\n * @see {@link pluck}\n *\n * @param project The function to apply to each `value` emitted by the source\n * Observable. The `index` parameter is the number `i` for the i-th emission\n * that has happened since the subscription, starting from the number `0`.\n * @param thisArg An optional argument to define what `this` is in the\n * `project` function.\n * @return A function that returns an Observable that emits the values from the\n * source Observable transformed by the given `project` function.\n */\nexport function map<T, R>(project: (value: T, index: number) => R, thisArg?: any): OperatorFunction<T, R> {\n return operate((source, subscriber) => {\n // The index of the value from the source. Used with projection.\n let index = 0;\n // Subscribe to the source, all errors and completions are sent along\n // to the consumer.\n source.subscribe(\n createOperatorSubscriber(subscriber, (value: T) => {\n // Call the projection function with the appropriate this context,\n // and send the resulting value to the consumer.\n subscriber.next(project.call(thisArg, value, index++));\n })\n );\n });\n}\n", "import { Observable } from '../Observable';\nimport { innerFrom } from '../observable/innerFrom';\nimport { Subscriber } from '../Subscriber';\nimport { ObservableInput, SchedulerLike } from '../types';\nimport { executeSchedule } from '../util/executeSchedule';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\n/**\n * A process embodying the general \"merge\" strategy. This is used in\n * `mergeMap` and `mergeScan` because the logic is otherwise nearly identical.\n * @param source The original source observable\n * @param subscriber The consumer subscriber\n * @param project The projection function to get our inner sources\n * @param concurrent The number of concurrent inner subscriptions\n * @param onBeforeNext Additional logic to apply before nexting to our consumer\n * @param expand If `true` this will perform an \"expand\" strategy, which differs only\n * in that it recurses, and the inner subscription must be schedule-able.\n * @param innerSubScheduler A scheduler to use to schedule inner subscriptions,\n * this is to support the expand strategy, mostly, and should be deprecated\n */\nexport function mergeInternals<T, R>(\n source: Observable<T>,\n subscriber: Subscriber<R>,\n project: (value: T, index: number) => ObservableInput<R>,\n concurrent: number,\n onBeforeNext?: (innerValue: R) => void,\n expand?: boolean,\n innerSubScheduler?: SchedulerLike,\n additionalFinalizer?: () => void\n) {\n // Buffered values, in the event of going over our concurrency limit\n const buffer: T[] = [];\n // The number of active inner subscriptions.\n let active = 0;\n // An index to pass to our accumulator function\n let index = 0;\n // Whether or not the outer source has completed.\n let isComplete = false;\n\n /**\n * Checks to see if we can complete our result or not.\n */\n const checkComplete = () => {\n // If the outer has completed, and nothing is left in the buffer,\n // and we don't have any active inner subscriptions, then we can\n // Emit the state and complete.\n if (isComplete && !buffer.length && !active) {\n subscriber.complete();\n }\n };\n\n // If we're under our concurrency limit, just start the inner subscription, otherwise buffer and wait.\n const outerNext = (value: T) => (active < concurrent ? doInnerSub(value) : buffer.push(value));\n\n const doInnerSub = (value: T) => {\n // If we're expanding, we need to emit the outer values and the inner values\n // as the inners will \"become outers\" in a way as they are recursively fed\n // back to the projection mechanism.\n expand && subscriber.next(value as any);\n\n // Increment the number of active subscriptions so we can track it\n // against our concurrency limit later.\n active++;\n\n // A flag used to show that the inner observable completed.\n // This is checked during finalization to see if we should\n // move to the next item in the buffer, if there is on.\n let innerComplete = false;\n\n // Start our inner subscription.\n innerFrom(project(value, index++)).subscribe(\n createOperatorSubscriber(\n subscriber,\n (innerValue) => {\n // `mergeScan` has additional handling here. For example\n // taking the inner value and updating state.\n onBeforeNext?.(innerValue);\n\n if (expand) {\n // If we're expanding, then just recurse back to our outer\n // handler. It will emit the value first thing.\n outerNext(innerValue as any);\n } else {\n // Otherwise, emit the inner value.\n subscriber.next(innerValue);\n }\n },\n () => {\n // Flag that we have completed, so we know to check the buffer\n // during finalization.\n innerComplete = true;\n },\n // Errors are passed to the destination.\n undefined,\n () => {\n // During finalization, if the inner completed (it wasn't errored or\n // cancelled), then we want to try the next item in the buffer if\n // there is one.\n if (innerComplete) {\n // We have to wrap this in a try/catch because it happens during\n // finalization, possibly asynchronously, and we want to pass\n // any errors that happen (like in a projection function) to\n // the outer Subscriber.\n try {\n // INNER SOURCE COMPLETE\n // Decrement the active count to ensure that the next time\n // we try to call `doInnerSub`, the number is accurate.\n active--;\n // If we have more values in the buffer, try to process those\n // Note that this call will increment `active` ahead of the\n // next conditional, if there were any more inner subscriptions\n // to start.\n while (buffer.length && active < concurrent) {\n const bufferedValue = buffer.shift()!;\n // Particularly for `expand`, we need to check to see if a scheduler was provided\n // for when we want to start our inner subscription. Otherwise, we just start\n // are next inner subscription.\n if (innerSubScheduler) {\n executeSchedule(subscriber, innerSubScheduler, () => doInnerSub(bufferedValue));\n } else {\n doInnerSub(bufferedValue);\n }\n }\n // Check to see if we can complete, and complete if so.\n checkComplete();\n } catch (err) {\n subscriber.error(err);\n }\n }\n }\n )\n );\n };\n\n // Subscribe to our source observable.\n source.subscribe(\n createOperatorSubscriber(subscriber, outerNext, () => {\n // Outer completed, make a note of it, and check to see if we can complete everything.\n isComplete = true;\n checkComplete();\n })\n );\n\n // Additional finalization (for when the destination is torn down).\n // Other finalization is added implicitly via subscription above.\n return () => {\n additionalFinalizer?.();\n };\n}\n", "import { ObservableInput, OperatorFunction, ObservedValueOf } from '../types';\nimport { map } from './map';\nimport { innerFrom } from '../observable/innerFrom';\nimport { operate } from '../util/lift';\nimport { mergeInternals } from './mergeInternals';\nimport { isFunction } from '../util/isFunction';\n\n/* tslint:disable:max-line-length */\nexport function mergeMap<T, O extends ObservableInput<any>>(\n project: (value: T, index: number) => O,\n concurrent?: number\n): OperatorFunction<T, ObservedValueOf<O>>;\n/** @deprecated The `resultSelector` parameter will be removed in v8. Use an inner `map` instead. Details: https://rxjs.dev/deprecations/resultSelector */\nexport function mergeMap<T, O extends ObservableInput<any>>(\n project: (value: T, index: number) => O,\n resultSelector: undefined,\n concurrent?: number\n): OperatorFunction<T, ObservedValueOf<O>>;\n/** @deprecated The `resultSelector` parameter will be removed in v8. Use an inner `map` instead. Details: https://rxjs.dev/deprecations/resultSelector */\nexport function mergeMap<T, R, O extends ObservableInput<any>>(\n project: (value: T, index: number) => O,\n resultSelector: (outerValue: T, innerValue: ObservedValueOf<O>, outerIndex: number, innerIndex: number) => R,\n concurrent?: number\n): OperatorFunction<T, R>;\n/* tslint:enable:max-line-length */\n\n/**\n * Projects each source value to an Observable which is merged in the output\n * Observable.\n *\n * <span class=\"informal\">Maps each value to an Observable, then flattens all of\n * these inner Observables using {@link mergeAll}.</span>\n *\n * \n *\n * Returns an Observable that emits items based on applying a function that you\n * supply to each item emitted by the source Observable, where that function\n * returns an Observable, and then merging those resulting Observables and\n * emitting the results of this merger.\n *\n * ## Example\n *\n * Map and flatten each letter to an Observable ticking every 1 second\n *\n * ```ts\n * import { of, mergeMap, interval, map } from 'rxjs';\n *\n * const letters = of('a', 'b', 'c');\n * const result = letters.pipe(\n * mergeMap(x => interval(1000).pipe(map(i => x + i)))\n * );\n *\n * result.subscribe(x => console.log(x));\n *\n * // Results in the following:\n * // a0\n * // b0\n * // c0\n * // a1\n * // b1\n * // c1\n * // continues to list a, b, c every second with respective ascending integers\n * ```\n *\n * @see {@link concatMap}\n * @see {@link exhaustMap}\n * @see {@link merge}\n * @see {@link mergeAll}\n * @see {@link mergeMapTo}\n * @see {@link mergeScan}\n * @see {@link switchMap}\n *\n * @param project A function that, when applied to an item emitted by the source\n * Observable, returns an Observable.\n * @param concurrent Maximum number of `ObservableInput`s being subscribed to concurrently.\n * @return A function that returns an Observable that emits the result of\n * applying the projection function (and the optional deprecated\n * `resultSelector`) to each item emitted by the source Observable and merging\n * the results of the Observables obtained from this transformation.\n */\nexport function mergeMap<T, R, O extends ObservableInput<any>>(\n project: (value: T, index: number) => O,\n resultSelector?: ((outerValue: T, innerValue: ObservedValueOf<O>, outerIndex: number, innerIndex: number) => R) | number,\n concurrent: number = Infinity\n): OperatorFunction<T, ObservedValueOf<O> | R> {\n if (isFunction(resultSelector)) {\n // DEPRECATED PATH\n return mergeMap((a, i) => map((b: any, ii: number) => resultSelector(a, b, i, ii))(innerFrom(project(a, i))), concurrent);\n } else if (typeof resultSelector === 'number') {\n concurrent = resultSelector;\n }\n\n return operate((source, subscriber) => mergeInternals(source, subscriber, project, concurrent));\n}\n", "import { Observable } from '../Observable';\nimport { Subscriber } from '../Subscriber';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\n/**\n * A basic scan operation. This is used for `scan` and `reduce`.\n * @param accumulator The accumulator to use\n * @param seed The seed value for the state to accumulate\n * @param hasSeed Whether or not a seed was provided\n * @param emitOnNext Whether or not to emit the state on next\n * @param emitBeforeComplete Whether or not to emit the before completion\n */\n\nexport function scanInternals<V, A, S>(\n accumulator: (acc: V | A | S, value: V, index: number) => A,\n seed: S,\n hasSeed: boolean,\n emitOnNext: boolean,\n emitBeforeComplete?: undefined | true\n) {\n return (source: Observable<V>, subscriber: Subscriber<any>) => {\n // Whether or not we have state yet. This will only be\n // false before the first value arrives if we didn't get\n // a seed value.\n let hasState = hasSeed;\n // The state that we're tracking, starting with the seed,\n // if there is one, and then updated by the return value\n // from the accumulator on each emission.\n let state: any = seed;\n // An index to pass to the accumulator function.\n let index = 0;\n\n // Subscribe to our source. All errors and completions are passed through.\n source.subscribe(\n createOperatorSubscriber(\n subscriber,\n (value) => {\n // Always increment the index.\n const i = index++;\n // Set the state\n state = hasState\n ? // We already have state, so we can get the new state from the accumulator\n accumulator(state, value, i)\n : // We didn't have state yet, a seed value was not provided, so\n\n // we set the state to the first value, and mark that we have state now\n ((hasState = true), value);\n\n // Maybe send it to the consumer.\n emitOnNext && subscriber.next(state);\n },\n // If an onComplete was given, call it, otherwise\n // just pass through the complete notification to the consumer.\n emitBeforeComplete &&\n (() => {\n hasState && subscriber.next(state);\n subscriber.complete();\n })\n )\n );\n };\n}\n", "import { scanInternals } from './scanInternals';\nimport { OperatorFunction } from '../types';\nimport { operate } from '../util/lift';\n\nexport function reduce<V, A = V>(accumulator: (acc: A | V, value: V, index: number) => A): OperatorFunction<V, V | A>;\nexport function reduce<V, A>(accumulator: (acc: A, value: V, index: number) => A, seed: A): OperatorFunction<V, A>;\nexport function reduce<V, A, S = A>(accumulator: (acc: A | S, value: V, index: number) => A, seed: S): OperatorFunction<V, A>;\n\n/**\n * Applies an accumulator function over the source Observable, and returns the\n * accumulated result when the source completes, given an optional seed value.\n *\n * <span class=\"informal\">Combines together all values emitted on the source,\n * using an accumulator function that knows how to join a new source value into\n * the accumulation from the past.</span>\n *\n * \n *\n * Like\n * [Array.prototype.reduce()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce),\n * `reduce` applies an `accumulator` function against an accumulation and each\n * value of the source Observable (from the past) to reduce it to a single\n * value, emitted on the output Observable. Note that `reduce` will only emit\n * one value, only when the source Observable completes. It is equivalent to\n * applying operator {@link scan} followed by operator {@link last}.\n *\n * Returns an Observable that applies a specified `accumulator` function to each\n * item emitted by the source Observable. If a `seed` value is specified, then\n * that value will be used as the initial value for the accumulator. If no seed\n * value is specified, the first item of the source is used as the seed.\n *\n * ## Example\n *\n * Count the number of click events that happened in 5 seconds\n *\n * ```ts\n * import { fromEvent, takeUntil, interval, map, reduce } from 'rxjs';\n *\n * const clicksInFiveSeconds = fromEvent(document, 'click')\n * .pipe(takeUntil(interval(5000)));\n *\n * const ones = clicksInFiveSeconds.pipe(map(() => 1));\n * const seed = 0;\n * const count = ones.pipe(reduce((acc, one) => acc + one, seed));\n *\n * count.subscribe(x => console.log(x));\n * ```\n *\n * @see {@link count}\n * @see {@link expand}\n * @see {@link mergeScan}\n * @see {@link scan}\n *\n * @param accumulator The accumulator function called on each source value.\n * @param seed The initial accumulation value.\n * @return A function that returns an Observable that emits a single value that\n * is the result of accumulating the values emitted by the source Observable.\n */\nexport function reduce<V, A>(accumulator: (acc: V | A, value: V, index: number) => A, seed?: any): OperatorFunction<V, V | A> {\n return operate(scanInternals(accumulator, seed, arguments.length >= 2, false, true));\n}\n", "import { reduce } from './reduce';\nimport { OperatorFunction } from '../types';\nimport { operate } from '../util/lift';\n\nconst arrReducer = (arr: any[], value: any) => (arr.push(value), arr);\n\n/**\n * Collects all source emissions and emits them as an array when the source completes.\n *\n * <span class=\"informal\">Get all values inside an array when the source completes</span>\n *\n * \n *\n * `toArray` will wait until the source Observable completes before emitting\n * the array containing all emissions. When the source Observable errors no\n * array will be emitted.\n *\n * ## Example\n *\n * ```ts\n * import { interval, take, toArray } from 'rxjs';\n *\n * const source = interval(1000);\n * const example = source.pipe(\n * take(10),\n * toArray()\n * );\n *\n * example.subscribe(value => console.log(value));\n *\n * // output: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\n * ```\n *\n * @return A function that returns an Observable that emits an array of items\n * emitted by the source Observable when source completes.\n */\nexport function toArray<T>(): OperatorFunction<T, T[]> {\n // Because arrays are mutable, and we're mutating the array in this\n // reducer process, we have to encapsulate the creation of the initial\n // array within this `operate` function.\n return operate((source, subscriber) => {\n reduce(arrReducer, [] as T[])(source).subscribe(subscriber);\n });\n}\n", "import { CIGAR_D, CIGAR_I, CIGAR_M, CIGAR_N, CIGAR_RUN, } from './cigarConstants.js';\n/**\n * #api\n * Fold a CIGAR into a coarse CIGAR whose straight lines stay within `gap` of\n * the alignment's own path. An indel longer than half the gap keeps its letter\n * and length (D/N/I); a shorter one is absorbed into the match run around it,\n * and a run whose two axes advanced by different amounts is written\n * `<own>:<mate>M`, a square run `<n>M`. `=`/`X` count as M. `ownLen`/`mateLen`\n * are the totals each axis consumed, for the caller to check against the row's\n * coordinate columns.\n *\n * The bound: a run is closed before a folded indel would push its running\n * skew (own minus mate) past half the gap, and no folded indel is longer than\n * that, so inside a run the skew never exceeds half the gap and the line\n * between the run's corners is never more than the gap off the path. That is\n * what lets a reader interpolate within a run, and it costs a new run only\n * where the two genomes' small indels are lopsided.\n */\nexport function coarsenCigar(cigar, gap) {\n const skewBound = gap / 2;\n let ops = '';\n let ownLen = 0;\n let mateLen = 0;\n let gapCount = 0;\n let opCount = 0;\n let runOwn = 0;\n let runMate = 0;\n // a run with nothing on one side is the indel it amounts to, and is written\n // as one, so a reader never meets a zero-sided run\n const flushRun = () => {\n if (runOwn > 0 || runMate > 0) {\n ops +=\n runOwn === runMate\n ? `${runOwn}M`\n : runOwn === 0\n ? `${runMate}I`\n : runMate === 0\n ? `${runOwn}D`\n : `${runOwn}:${runMate}M`;\n opCount++;\n runOwn = 0;\n runMate = 0;\n }\n };\n const keep = (len, op) => {\n flushRun();\n ops += `${len}${op}`;\n gapCount++;\n opCount++;\n };\n const fold = (own, mate) => {\n if (Math.abs(runOwn + own - runMate - mate) > skewBound) {\n flushRun();\n }\n runOwn += own;\n runMate += mate;\n };\n let len = 0;\n for (let i = 0, l = cigar.length; i < l; i++) {\n const code = cigar.charCodeAt(i);\n if (code >= 48 && code <= 57) {\n len = len * 10 + code - 48;\n }\n else {\n const op = cigar[i];\n if (op === 'M' || op === '=' || op === 'X') {\n runOwn += len;\n runMate += len;\n ownLen += len;\n mateLen += len;\n }\n else if (op === 'D' || op === 'N') {\n ownLen += len;\n if (len > skewBound) {\n keep(len, op);\n }\n else {\n fold(len, 0);\n }\n }\n else if (op === 'I') {\n mateLen += len;\n if (len > skewBound) {\n keep(len, op);\n }\n else {\n fold(0, len);\n }\n }\n len = 0;\n }\n }\n flushRun();\n return { ops, ownLen, mateLen, gapCount, opCount };\n}\nfunction parseCoarseOps(s) {\n const out = [];\n let len = 0;\n let ownBeforeColon;\n for (let i = 0, l = s.length; i < l; i++) {\n const code = s.charCodeAt(i);\n if (code >= 48 && code <= 57) {\n len = len * 10 + code - 48;\n }\n else if (code === 58) {\n ownBeforeColon = len;\n len = 0;\n }\n else {\n // the alphabet is M I D N plus the run; a reader also takes =/X as M and\n // steps over clips and padding, which a writer never emits\n const op = s[i];\n if (op === 'M' || op === '=' || op === 'X') {\n out.push({\n own: ownBeforeColon === undefined ? len : ownBeforeColon,\n mate: len,\n op: 'M',\n });\n }\n else if (op === 'I') {\n out.push({ own: 0, mate: len, op });\n }\n else if (op === 'D' || op === 'N') {\n out.push({ own: len, mate: 0, op });\n }\n ownBeforeColon = undefined;\n len = 0;\n }\n }\n return out;\n}\nfunction serializeCoarseOps(ops) {\n let s = '';\n for (const { own, mate, op } of ops) {\n s +=\n op === 'M'\n ? own === mate\n ? `${own}M`\n : `${own}:${mate}M`\n : `${op === 'I' ? mate : own}${op}`;\n }\n return s;\n}\n// N keeps its axis as well as its letter, matching `swapIndelCigar`, which\n// swaps only D<->I\nfunction swapAxes({ own, mate, op }) {\n return op === 'N'\n ? { own, mate, op }\n : {\n own: mate,\n mate: own,\n op: op === 'D' ? 'I' : op === 'I' ? 'D' : op,\n };\n}\n/**\n * #api\n * The coarse CIGAR seen from the other axis on the plus strand: the two lengths\n * of every run trade places and D<->I swap, op order untouched. The twin of\n * `swapIndelCigar`.\n */\nexport function swapCoarseCigar(s) {\n return serializeCoarseOps(parseCoarseOps(s).map(swapAxes));\n}\n/**\n * #api\n * The coarse CIGAR seen from the other axis on the minus strand: swapped as\n * `swapCoarseCigar` does, and in reverse op order. The twin of `flipCigar`.\n */\nexport function flipCoarseCigar(s) {\n return serializeCoarseOps(parseCoarseOps(s).map(swapAxes).reverse());\n}\n/**\n * #api\n * The coarse CIGAR as a plain CIGAR over the row's own axis, for a walk that\n * places mismatches by reference position: a run keeps only its own length, a\n * run with no own length is the insertion it amounts to, and one with no mate\n * length the deletion. Kept indels are exact, so they land where the fine\n * tier's would.\n */\nexport function coarseCigarOwnAxis(s) {\n let out = '';\n for (const { own, mate, op } of parseCoarseOps(s)) {\n out +=\n op === 'M'\n ? own === 0\n ? `${mate}I`\n : mate === 0\n ? `${own}D`\n : `${own}M`\n : `${op === 'I' ? mate : own}${op}`;\n }\n return out;\n}\n// The packed form keeps 28 bits of length, so a longer op is written as several\n// words that sum to it. A run is split with both axes in proportion.\nconst MAX_PACKED_LEN = 2 ** 28 - 1;\nfunction pushPacked(out, len, code) {\n for (let rest = len; rest > 0; rest -= MAX_PACKED_LEN) {\n out.push(((Math.min(rest, MAX_PACKED_LEN) << 4) | code) >>> 0);\n }\n}\nfunction pushRun(out, own, mate) {\n if (own === mate) {\n pushPacked(out, own, CIGAR_M);\n }\n else {\n const chunks = Math.ceil(Math.max(own, mate) / MAX_PACKED_LEN);\n for (let i = 0; i < chunks; i++) {\n const o = Math.floor((own * (i + 1)) / chunks) - Math.floor((own * i) / chunks);\n const m = Math.floor((mate * (i + 1)) / chunks) - Math.floor((mate * i) / chunks);\n out.push(((o << 4) | CIGAR_RUN) >>> 0, ((m << 4) | CIGAR_RUN) >>> 0);\n }\n }\n}\n/**\n * #api\n * Parse a coarse CIGAR into the packed `(len << 4) | op` form\n * `visitCigarRenderedSegments` walks. A square run packs as one `CIGAR_M`\n * word; an unequal run as a `CIGAR_RUN` word pair, own axis first.\n */\nexport function parseCoarseCigar(s) {\n const out = [];\n for (const { own, mate, op } of parseCoarseOps(s)) {\n if (op === 'M') {\n pushRun(out, own, mate);\n }\n else if (op === 'I') {\n pushPacked(out, mate, CIGAR_I);\n }\n else {\n pushPacked(out, own, op === 'N' ? CIGAR_N : CIGAR_D);\n }\n }\n return Uint32Array.from(out);\n}\n", "import { DELETION_TYPE, INSERTION_TYPE, MISMATCH_TYPE, SKIP_TYPE, } from './mismatchCallback.js';\nfunction isDigit(code) {\n return code >= 48 && code <= 57;\n}\nfunction isBaseChar(ch) {\n return ch !== undefined && /[A-Za-z]/.test(ch);\n}\nfunction scanBases(cs, start) {\n let i = start;\n while (i < cs.length && isBaseChar(cs[i])) {\n i++;\n }\n return i;\n}\nfunction scanDigits(cs, start) {\n let i = start;\n let value = 0;\n while (i < cs.length && isDigit(cs.charCodeAt(i))) {\n value = value * 10 + (cs.charCodeAt(i) - 48);\n i++;\n }\n return { value, next: i };\n}\n/**\n * Walk a minimap2 `cs` difference string\n * (https://github.com/lh3/minimap2#cs), calling `callback` once per operation.\n *\n * Short form is `:N` match run, `*ab` substitution (ref base a, query base b),\n * `+seq` insertion, `-seq` deletion; long form adds `=SEQ` match runs; `~ab12cd`\n * is a 12 bp intron between the given splice motifs. A character belonging to\n * none of those is skipped, so a truncated or extended string still walks to the\n * end rather than throwing.\n *\n * `refLen`/`queryLen` are the bases the operation consumes on each sequence, and\n * `[seqStart, seqEnd)` bounds its operand *within `cs`* \u2014 the bases for `=`/`+`/\n * `-`, the two substituted bases for `*`, the digits for `:`, the whole motif\n * for `~`. Offsets rather than a substring because the mismatch walk runs per\n * feature per frame, and only two of six ops ever need the text.\n *\n * **One walker, because four disagreed.** This replaces a copy in each of\n * `csToCigar`, `flipCs`, `forEachCsMismatch` and the (now removed) `visitCsOps`,\n * and every one of the divergences was silent: two of them dropped `~` and then\n * mis-scanned the rest of the string, one ignored `=SEQ` entirely and so never\n * advanced the reference across a long-form match run, and the three that\n * scanned `+`/`-` operands disagreed on where one ends.\n */\nexport function forEachCsOp(cs, callback) {\n let i = 0;\n while (i < cs.length) {\n const c = cs[i];\n if (c === ':') {\n const { value, next } = scanDigits(cs, i + 1);\n callback(':', value, value, i + 1, next);\n i = next;\n }\n else if (c === '=') {\n const next = scanBases(cs, i + 1);\n const len = next - i - 1;\n callback('=', len, len, i + 1, next);\n i = next;\n }\n else if (c === '*') {\n callback('*', 1, 1, i + 1, Math.min(i + 3, cs.length));\n i += 3;\n }\n else if (c === '+' || c === '-') {\n const next = scanBases(cs, i + 1);\n const len = next - i - 1;\n callback(c, c === '-' ? len : 0, c === '+' ? len : 0, i + 1, next);\n i = next;\n }\n else if (c === '~') {\n // the length sits between two 2-base splice motifs\n const { value, next } = scanDigits(cs, i + 3);\n const end = Math.min(next + 2, cs.length);\n callback('~', value, 0, i + 1, end);\n i = end;\n }\n else {\n i++;\n }\n }\n}\n/**\n * Rewrite a cs string from the target perspective to the query perspective (for\n * a synteny view anchored on the query assembly): `*ab` -> `*ba`, `+seq` ->\n * `-seq`, `-seq` -> `+seq`, match runs unchanged.\n *\n * Undefined when the string states something the query perspective cannot: an\n * intron is a gap in the *reference*, and flipped it becomes a gap in the query\n * with no sequence to write for it, which cs has no way to express. Callers fall\n * back to the CIGAR there, the same as they already do for reverse-strand\n * alignments (which additionally need a reverse-complement).\n */\nexport function flipCs(cs) {\n // The one op with no query-perspective form, and cs writes it nowhere else \u2014\n // operands are base letters. Answered before the walk so the rewrite below is\n // total.\n if (cs.includes('~')) {\n return undefined;\n }\n let result = '';\n forEachCsOp(cs, (op, refLen, _queryLen, seqStart, seqEnd) => {\n if (op === ':') {\n result += `:${refLen}`;\n }\n else if (op === '=') {\n result += `=${cs.slice(seqStart, seqEnd)}`;\n }\n else if (op === '*') {\n result += `*${cs[seqStart + 1] ?? ''}${cs[seqStart] ?? ''}`;\n }\n else {\n result += `${op === '+' ? '-' : '+'}${cs.slice(seqStart, seqEnd)}`;\n }\n });\n return result;\n}\n/**\n * Walk a cs string and drive a {@link MismatchCallback} (the contract BAM/CRAM\n * features use), emitting per-base substitutions with their real query base plus\n * insertions, deletions and introns. Offsets are relative to the reference\n * (feature) start; `windowStart`/`windowEnd` (also reference-relative) clip the\n * output.\n */\nexport function forEachCsMismatch(cs, callback, windowStart, windowEnd) {\n const lo = windowStart ?? Number.NEGATIVE_INFINITY;\n const hi = windowEnd ?? Number.POSITIVE_INFINITY;\n let ref = 0;\n forEachCsOp(cs, (op, refLen, queryLen, seqStart, seqEnd) => {\n if (op === '*') {\n if (ref >= lo && ref < hi) {\n callback(MISMATCH_TYPE, ref, 1, cs[seqStart + 1] ?? '', -1, 0, 0);\n }\n }\n else if (op === '+') {\n if (ref >= lo && ref <= hi) {\n const seq = cs.slice(seqStart, seqEnd);\n callback(INSERTION_TYPE, ref, queryLen, seq, -1, 0, queryLen);\n }\n }\n else if (op === '-' || op === '~') {\n if (ref < hi && ref + refLen > lo) {\n // an intron is a reference gap the read skips rather than deletes, and\n // the two draw differently\n const type = op === '-' ? DELETION_TYPE : SKIP_TYPE;\n callback(type, ref, refLen, '', -1, 0, 0);\n }\n }\n ref += refLen;\n });\n}\n", "import { CIGAR_D, CIGAR_EQ, CIGAR_H, CIGAR_I, CIGAR_M, CIGAR_N, CIGAR_S, CIGAR_X, } from './cigarConstants.js';\n// Handles packed NUMERIC_CIGAR format from @gmod/bam\n// Format: Uint32Array where each value is (length << 4) | opIndex\n// opIndex is 0-8: M=0, I=1, D=2, N=3, S=4, H=5, P=6, ==7, X=8\nexport function cigarToMismatches2(ops, seq, ref, qual) {\n let roffset = 0;\n let soffset = 0;\n const mismatches = [];\n const hasRefAndSeq = ref && seq;\n for (let i = 0, l = ops.length; i < l; i++) {\n const packed = ops[i];\n const len = packed >>> 4;\n const op = packed & 0xf;\n if (op === CIGAR_M || op === CIGAR_EQ) {\n if (hasRefAndSeq) {\n for (let j = 0; j < len; j++) {\n if ((seq.charCodeAt(soffset + j) | 0x20) !==\n (ref.charCodeAt(roffset + j) | 0x20)) {\n mismatches.push({\n start: roffset + j,\n type: 'mismatch',\n base: seq[soffset + j],\n altbase: ref[roffset + j],\n length: 1,\n });\n }\n }\n }\n soffset += len;\n roffset += len;\n }\n else if (op === CIGAR_I) {\n mismatches.push({\n start: roffset,\n type: 'insertion',\n insertlen: len,\n insertedBases: seq?.slice(soffset, soffset + len),\n length: 0,\n });\n soffset += len;\n }\n else if (op === CIGAR_D) {\n mismatches.push({\n start: roffset,\n type: 'deletion',\n length: len,\n });\n roffset += len;\n }\n else if (op === CIGAR_N) {\n mismatches.push({\n start: roffset,\n type: 'skip',\n length: len,\n });\n roffset += len;\n }\n else if (op === CIGAR_X) {\n for (let j = 0; j < len; j++) {\n mismatches.push({\n start: roffset + j,\n type: 'mismatch',\n base: seq?.[soffset + j] || 'X',\n qual: qual?.[soffset + j],\n length: 1,\n });\n }\n soffset += len;\n roffset += len;\n }\n else if (op === CIGAR_H) {\n mismatches.push({\n start: roffset,\n type: 'hardclip',\n cliplen: len,\n length: 1,\n });\n }\n else if (op === CIGAR_S) {\n mismatches.push({\n start: roffset,\n type: 'softclip',\n cliplen: len,\n length: 1,\n });\n soffset += len;\n }\n }\n return mismatches;\n}\n", "import { CIGAR_D, CIGAR_H, CIGAR_I, CIGAR_N, CIGAR_P, CIGAR_S, } from './cigarConstants.js';\n// Handles packed NUMERIC_CIGAR format from @gmod/bam\n// Format: Uint32Array where each value is (length << 4) | opIndex\n// opIndex is 0-8: M=0, I=1, D=2, N=3, S=4, H=5, P=6, ==7, X=8\nexport function mdToMismatches2(mdstring, ops, cigarMismatches, seq, qual) {\n if (!ops) {\n return [];\n }\n const mismatchRecords = [];\n const opsLength = ops.length;\n const seqLength = seq.length;\n const hasQual = qual !== undefined;\n // only check for skips if cigarMismatches has any\n const cigarLength = cigarMismatches.length;\n let hasSkips = false;\n for (let k = 0; k < cigarLength; k++) {\n if (cigarMismatches[k].type === 'skip') {\n hasSkips = true;\n break;\n }\n }\n let currStart = 0;\n let lastCigar = 0;\n let lastTemplateOffset = 0;\n let lastRefOffset = 0;\n let lastSkipPos = 0;\n // parse the MD string manually for better performance\n let i = 0;\n const len = mdstring.length;\n while (i < len) {\n const char = mdstring.charCodeAt(i);\n if (char >= 48 && char <= 57) {\n // digit (0-9)\n let num = 0;\n while (i < len) {\n const c = mdstring.charCodeAt(i);\n if (c >= 48 && c <= 57) {\n num = num * 10 + (c - 48);\n i++;\n }\n else {\n break;\n }\n }\n currStart += num;\n }\n else if (char === 94) {\n // '^' - deletion\n i++;\n while (i < len && mdstring.charCodeAt(i) >= 65) {\n // skip deleted bases (A-Z, a-z)\n i++;\n currStart++;\n }\n }\n else if (char >= 65) {\n // letter (mismatch)\n const letter = mdstring[i];\n i++;\n // handle skips in cigar\n if (hasSkips && cigarLength > 0) {\n for (let k = lastSkipPos; k < cigarLength; k++) {\n const mismatch = cigarMismatches[k];\n if (mismatch.type === 'skip' && currStart >= mismatch.start) {\n currStart += mismatch.length;\n lastSkipPos = k + 1;\n }\n }\n }\n // find position in read that corresponds to currStart\n let templateOffset = lastTemplateOffset;\n let refOffset = lastRefOffset;\n // Packed format: each element is (length << 4) | opIndex\n for (let j = lastCigar; j < opsLength && refOffset <= currStart; j++, lastCigar = j) {\n const packed = ops[j];\n const len = packed >>> 4;\n const op = packed & 0xf;\n if (op === CIGAR_S || op === CIGAR_I) {\n templateOffset += len;\n }\n else if (op === CIGAR_D || op === CIGAR_P || op === CIGAR_N) {\n refOffset += len;\n }\n else if (op !== CIGAR_H) {\n templateOffset += len;\n refOffset += len;\n }\n }\n lastTemplateOffset = templateOffset;\n lastRefOffset = refOffset;\n const s = templateOffset - (refOffset - currStart);\n const base = s < seqLength ? seq[s] : 'X';\n mismatchRecords.push({\n start: currStart,\n base,\n qual: hasQual ? qual[s] : undefined,\n altbase: letter,\n length: 1,\n type: 'mismatch',\n });\n currStart++;\n }\n else {\n i++;\n }\n }\n return mismatchRecords;\n}\n", "import { CIGAR_D, CIGAR_H, CIGAR_I, CIGAR_N, CIGAR_S, } from './cigarConstants.js';\nimport { cigarToMismatches2 } from './cigarToMismatches2.js';\nimport { mdToMismatches2 } from './mdToMismatches2.js';\n// CIGAR operation char codes to indices (from BAM spec)\nconst CIGAR_CODE_TO_INDEX = {\n 77: 0, // M\n 73: 1, // I\n 68: 2, // D\n 78: 3, // N\n 83: 4, // S\n 72: 5, // H\n 80: 6, // P\n 61: 7, // =\n 88: 8, // X\n};\n/**\n * #api\n * Parses a CIGAR string to an alternating `[length, op, ...]` string array.\n */\nexport function parseCigar(s = '') {\n let currLen = '';\n const ret = [];\n for (let i = 0, l = s.length; i < l; i++) {\n const c = s[i];\n if (c >= '0' && c <= '9') {\n currLen = currLen + c;\n }\n else {\n ret.push(currLen, c);\n currLen = '';\n }\n }\n return ret;\n}\n/**\n * #api\n * Parses a CIGAR string to a packed number array where each value is\n * `(length << 4) | opIndex`.\n */\nexport function parseCigar2(s = '') {\n let currLen = 0;\n const ret = [];\n for (let i = 0, l = s.length; i < l; i++) {\n const code = s.charCodeAt(i);\n if (code >= 48 && code <= 57) {\n currLen = currLen * 10 + (code - 48);\n }\n else {\n const opIndex = CIGAR_CODE_TO_INDEX[code];\n ret.push((currLen << 4) | opIndex);\n currLen = 0;\n }\n }\n return ret;\n}\n/**\n * #api\n * Same encoding as `parseCigar2` but writes into a packed `Uint32Array` \u2014\n * matches the NUMERIC_CIGAR format that BAM/CRAM adapters emit, so consumers can\n * use a single typed-array code path.\n */\nexport function parseCigar2Typed(s = '') {\n let opCount = 0;\n for (let i = 0, l = s.length; i < l; i++) {\n const code = s.charCodeAt(i);\n if (code < 48 || code > 57) {\n opCount++;\n }\n }\n const out = new Uint32Array(opCount);\n let currLen = 0;\n let j = 0;\n for (let i = 0, l = s.length; i < l; i++) {\n const code = s.charCodeAt(i);\n if (code >= 48 && code <= 57) {\n currLen = currLen * 10 + (code - 48);\n }\n else {\n out[j++] = (currLen << 4) | CIGAR_CODE_TO_INDEX[code];\n currLen = 0;\n }\n }\n return out;\n}\n/**\n * #api\n * Computes the list of mismatches (SNVs, indels, clips, skips) for a read from\n * its CIGAR, optional MD tag, sequence, reference, and quality.\n */\nexport function getMismatches(cigar, md, seq, ref, qual) {\n const ops = parseCigar2(cigar);\n const mismatches = cigar ? cigarToMismatches2(ops, seq, ref, qual) : [];\n if (md && seq) {\n return mismatches.concat(mdToMismatches2(md, ops, mismatches, seq, qual));\n }\n return mismatches;\n}\n// All three lengths in one pass over already-parsed ops: callers that want more\n// than one (featurizeSA wants all three) would otherwise re-scan and re-allocate\n// the op array per length.\nfunction cigarLengths(ops) {\n let lengthOnRef = 0;\n let length = 0;\n let lengthSansClipping = 0;\n for (let i = 0, l = ops.length; i < l; i++) {\n const op = ops[i];\n const opIdx = op & 0xf;\n const len = op >>> 4;\n const clipping = opIdx === CIGAR_H || opIdx === CIGAR_S;\n const refOnly = opIdx === CIGAR_D || opIdx === CIGAR_N;\n if (!clipping && opIdx !== CIGAR_I) {\n lengthOnRef += len;\n }\n if (!refOnly) {\n length += len;\n }\n if (!clipping && !refOnly) {\n lengthSansClipping += len;\n }\n }\n return { lengthOnRef, length, lengthSansClipping };\n}\n/**\n * #api\n * Length the read spans on the reference (sum of M/=/X/D/N ops).\n */\nexport function getLengthOnRef(cigar) {\n return cigarLengths(parseCigar2(cigar)).lengthOnRef;\n}\n/**\n * #api\n * Length of the read sequence (sum of all ops except D/N).\n */\nexport function getLength(cigar) {\n return cigarLengths(parseCigar2(cigar)).length;\n}\nexport function getLengthSansClipping(cigar) {\n return cigarLengths(parseCigar2(cigar)).lengthSansClipping;\n}\n// clip at the end of the CIGAR string = start of a reverse-strand read,\n// clip at the start of the CIGAR string = start of a forward-strand read\nexport function getClip(cigar, strand) {\n if (!cigar) {\n return 0;\n }\n if (strand === -1) {\n const last = cigar.length - 1;\n const op = cigar[last];\n if (op === 'S' || op === 'H') {\n let i = last;\n while (i > 0 && cigar[i - 1] >= '0' && cigar[i - 1] <= '9') {\n i--;\n }\n return +cigar.slice(i, last);\n }\n return 0;\n }\n else {\n let i = 0;\n while (cigar[i] >= '0' && cigar[i] <= '9') {\n i++;\n }\n const op = cigar[i];\n return (op === 'S' || op === 'H') && i > 0 ? +cigar.slice(0, i) : 0;\n }\n}\n// numeric analog of getClip: reads the start-clip length straight off a packed\n// NUMERIC_CIGAR (each entry = (length << 4) | opIndex) without serializing to a\n// CIGAR string. Reverse-strand reads clip at the CIGAR tail, forward at the head.\nexport function clipLengthAtStartOfReadNumeric(cigar, strand) {\n const len = cigar.length;\n if (len === 0) {\n return 0;\n }\n const packed = strand === -1 ? cigar[len - 1] : cigar[0];\n const op = packed & 0xf;\n return op === CIGAR_S || op === CIGAR_H ? packed >>> 4 : 0;\n}\n// produces a list of \"feature-like\" object from parsing supplementary\n// alignments in the SA tag\n//\n// @param normalize - used specifically in the linear-read-vs-ref context, it\n// flips features around relative to the original feature. other contexts of\n// usage can keep this false\nexport function featurizeSA(SA, id, strand, readName, normalize) {\n return SA === undefined\n ? []\n : featurizeSAEntries(splitSA(SA), id, strand, readName, normalize);\n}\n/**\n * #api\n * The `;`-separated alignment records of an SA tag, empties dropped \u2014 the input\n * `featurizeSAEntries` expects.\n */\nexport function splitSA(SA) {\n return SA.split(';').filter(aln => !!aln);\n}\n/**\n * #api\n * featurizeSA over pre-split entries (see splitSA). Lets a caller filter the\n * entries first \u2014 e.g. deduplicating the records repeated across a split read's\n * segments \u2014 without paying to split and rejoin the tag around the filter.\n */\nexport function featurizeSAEntries(entries, id, strand, readName, normalize) {\n const strandNum = strand ?? 1;\n return entries.map((aln, index) => {\n const ret = aln.split(',');\n const saRef = ret[0];\n const saStart = ret[1];\n const saStrand = ret[2];\n const saCigar = ret[3];\n const saOps = parseCigar2(saCigar);\n const { lengthOnRef: saLengthOnRef, length: saLength, lengthSansClipping: saLengthSansClipping, } = cigarLengths(saOps);\n const saStrandNormalized = saStrand === '-' ? -1 : 1;\n const effectiveStrand = normalize\n ? strandNum === saStrandNormalized\n ? 1\n : -1\n : saStrandNormalized;\n const saClipPos = clipLengthAtStartOfReadNumeric(saOps, effectiveStrand);\n const saRealStart = +saStart - 1;\n return {\n refName: saRef,\n start: saRealStart,\n end: saRealStart + saLengthOnRef,\n seqLength: saLength,\n clipLengthAtStartOfRead: saClipPos,\n CIGAR: saCigar,\n strand: effectiveStrand,\n uniqueId: `${id}_SA${index}`,\n mate: {\n start: saClipPos,\n end: saClipPos + saLengthSansClipping,\n refName: readName,\n },\n };\n });\n}\n", "import { CIGAR_D, CIGAR_EQ, CIGAR_I, CIGAR_M, CIGAR_N, CIGAR_RUN, CIGAR_X, parseCigar2Typed, parseCoarseCigar, } from '@jbrowse/cigar-utils';\n// Per-perspective PIF/PAF CIGAR consumption, matching buildSyntenyGeometry's\n// walk: bp1 (query / v1 side) advances on M/=/X and D/N; bp2 (target / v2 side)\n// advances on M/=/X and I. The D<->I asymmetry is the pre-swap the PIF t-line\n// carries, so a clip produced here stays consistent when it feeds back through\n// the same convention.\n//\n// Spelled as ENUMERATED op sets, so H/S/P advance NEITHER axis. That is the\n// convention every other walk in the tree uses \u2014 `visitCigarRenderedSegments`\n// (the walk this clip's own output is re-walked by, which has no branch for them\n// at all) and `findPosInCigar`, whose header says so explicitly. Written as\n// `op !== CIGAR_I` / `op !== CIGAR_D && op !== CIGAR_N` these advanced BOTH axes\n// on a clip, which stays invisible only because a PAF/PIF CIGAR carries none. A\n// BAM-sourced one does: \"Linear read vs ref\" hands the read's raw CIGAR through\n// verbatim while putting the mate in read coordinates that already EXCLUDE the\n// clip (`buildReadVsRefFeatures`, `clipLengthAtStartOfRead`). So a leading\n// `100S` walked the re-anchored block 100bp along both axes past where the block\n// says it starts, and since `clipLargeBlockToWindow` fires once a block exceeds\n// 4x the window \u2014 ~1bp/px on a 20kb read segment, an ordinary inspection zoom \u2014\n// every CIGAR tile and marker on it landed 100bp short of the ribbon it sits in,\n// which in transparent-indels mode is a hole at the trailing end.\n//\n// Bitmasks in `((1 << op) & MASK)` form, the idiom `CIGAR_INDEL_MASK` already\n// carries in this directory (buildSyntenyGeometry's `cigarSegmentKind`), so\n// membership is one test rather than a chain of five. Built from the op\n// constants rather than written as literals: the point of the fix is that the\n// SET is the thing to read, and `0b110001101` hides it. Deliberately local \u2014\n// `visitCigarRenderedSegments` is the authority here and it branches per op to\n// decide WHICH axis, so a mask does not fit it, and a shared one it could not\n// use would just be a second statement of the same convention.\nconst V1_OPS = (1 << CIGAR_M) |\n (1 << CIGAR_EQ) |\n (1 << CIGAR_X) |\n (1 << CIGAR_D) |\n (1 << CIGAR_N);\nconst V2_OPS = (1 << CIGAR_M) | (1 << CIGAR_EQ) | (1 << CIGAR_X) | (1 << CIGAR_I);\nconst MATCH_OPS = (1 << CIGAR_M) | (1 << CIGAR_EQ) | (1 << CIGAR_X);\nfunction consumesQuery(op) {\n return ((1 << op) & V1_OPS) !== 0;\n}\nfunction consumesTarget(op) {\n return ((1 << op) & V2_OPS) !== 0;\n}\nfunction isMatchOp(op) {\n return ((1 << op) & MATCH_OPS) !== 0;\n}\n// Trim a synteny feature + its CIGAR to a query-space window\n// [winStart, winEnd], returning the re-anchored coords + trimmed CIGAR, or\n// undefined if the block doesn't overlap the window.\n//\n// **`winStart`/`winEnd` MUST be integer bp**, and both callers snap them \u2014\n// outward in `clipLargeBlockToWindow` (a viewport bound), inward in\n// `executeSyntenyFeaturesAndPositions`' trim path (a region-containment bound).\n// A fractional window breaks the output two ways at once: the boundary ops are\n// trimmed to it and then packed through `(cHi - cLo) << 4`, whose ToInt32\n// TRUNCATES the length (a 0.6bp remnant becomes a zero-length op), while\n// `start`/`end` come back carrying the fraction in full. The block's declared\n// span then exceeds what its own CIGAR walks, and since the base trapezoid is\n// drawn from the corners while the tiles are walked from the ops, the\n// difference shows in transparent-indels mode as unpainted ribbon at the\n// trailing end. Not asserted here \u2014 this runs per feature over a whole-genome\n// PAF \u2014 so it is the callers' invariant to keep.\n//\n// A single alignment block can span far beyond the viewport \u2014 a whole UCSC\n// liftOver chain is one ~20 Mb feature. Its base ribbon is drawn as one *linear*\n// trapezoid across that span, which cannot follow megabases of indels, so at\n// high zoom the ribbon lands off-screen and nothing renders. Re-anchoring the\n// block to just its visible slice (accurate coords + a short CIGAR) restores it.\n//\n// Walk direction MUST match buildSyntenyGeometry, which walks the query (v1)\n// axis forward in GENOMIC order for BOTH strands and flips only the target (v2)\n// axis. So the query walk here is always start->end; only the target counts\n// down for a - strand block, entering at mateEnd. Within a match op the target\n// maps to the query as target(q) = bp2 + (q - bp1) * revTarget, using the op's\n// walk-entry positions. (buildSyntenyGeometry re-derives its rev1 from the cumBp\n// order of the endpoints, so a reversed display region walks the same file-order\n// CIGAR the other way in cumBp space \u2014 still forward in genomic query bp, so\n// this reassembly stays valid.)\n//\n// Walking the query backward for - strand (as an earlier version did) mirrors\n// every indel's query position within the window: the trimmed CIGAR is\n// reassembled in file order and re-walked forward by buildSyntenyGeometry, so a\n// deletion lands at its mirror-image position (wrong side of the ribbon).\nexport function clipSyntenyFeature(cigar, start, mateStart, mateEnd, strand, winStart, winEnd) {\n const revTarget = strand === -1 ? -1 : 1;\n let bp1 = start;\n let bp2 = strand === -1 ? mateEnd : mateStart;\n const out = [];\n let qLo = Infinity;\n let qHi = -Infinity;\n let tLo = Infinity;\n let tHi = -Infinity;\n const extendTarget = (a, b) => {\n tLo = Math.min(tLo, a, b);\n tHi = Math.max(tHi, a, b);\n };\n for (let k = 0; k < cigar.length; k++) {\n const packed = cigar[k];\n const len = packed >>> 4;\n const op = packed & 0xf;\n // a CIGAR_RUN pair advances the query by its first word and the target by\n // its second, mapping the two in proportion along the run\n const isRun = op === CIGAR_RUN;\n const qAdv = isRun || consumesQuery(op) ? len : 0;\n const tAdv = isRun ? cigar[++k] >>> 4 : consumesTarget(op) ? len : 0;\n const bp1Next = bp1 + qAdv;\n const bp2Next = bp2 + tAdv * revTarget;\n const opQLo = bp1;\n const opQHi = bp1Next;\n if (opQHi >= winStart && opQLo <= winEnd) {\n if (qAdv > 0) {\n // Query-consuming op (match, run or D/N): trim to the window in query\n // space.\n const cLo = Math.max(opQLo, winStart);\n const cHi = Math.min(opQHi, winEnd);\n if (cHi > cLo) {\n qLo = Math.min(qLo, cLo);\n qHi = Math.max(qHi, cHi);\n if (isRun) {\n const ratio = tAdv / len;\n const keptOwn = cHi - cLo;\n const keptMate = Math.round(keptOwn * ratio);\n const tEntry = Math.round(bp2 + (cLo - bp1) * ratio * revTarget);\n out.push((keptOwn << 4) | CIGAR_RUN, (keptMate << 4) | CIGAR_RUN);\n extendTarget(tEntry, tEntry + keptMate * revTarget);\n }\n else {\n out.push(((cHi - cLo) << 4) | op);\n if (isMatchOp(op)) {\n // matches map target 1:1: target(q) = bp2 + (q - bp1) * revTarget\n extendTarget(bp2 + (cLo - bp1) * revTarget, bp2 + (cHi - bp1) * revTarget);\n }\n else {\n // D/N consume no target, so it stays a point at bp2\n extendTarget(bp2, bp2);\n }\n }\n }\n }\n else if (tAdv > 0) {\n // I (or a run with no query span): target-consuming gap at a single\n // query position; keep it whole\n if (isRun) {\n out.push(packed, cigar[k]);\n }\n else {\n out.push(packed);\n }\n qLo = Math.min(qLo, bp1);\n qHi = Math.max(qHi, bp1);\n extendTarget(bp2, bp2Next);\n }\n // An op consuming NEITHER axis (H/S/P) is dropped rather than falling into\n // the arm above. It carries no coordinate on either axis, so keeping it\n // would extend qLo/qHi to a position the alignment does not occupy \u2014 and\n // on a hard clip sitting exactly at winEnd, with the preceding match\n // trimmed to nothing, that arm is the ONLY thing that collects, so the\n // clip alone would come back as a zero-width block. The walk this output\n // feeds (visitCigarRenderedSegments) has no branch for these ops either.\n }\n bp1 = bp1Next;\n bp2 = bp2Next;\n // Query ascends monotonically, so every later op has opQLo >= bp1 > winEnd\n // and cannot overlap the window \u2014 whether or not anything has been collected\n // yet. This used to also require `out.length`, which disabled the break for\n // the one input that walks longest: a block lying entirely to the RIGHT of\n // the window never collects an op, so it read every op of a multi-megabyte\n // chain to conclude what the first op already said.\n if (bp1 > winEnd) {\n break;\n }\n }\n if (out.length === 0) {\n return undefined;\n }\n return {\n start: qLo,\n end: qHi,\n mateStart: tLo,\n mateEnd: tHi,\n cigar: Uint32Array.from(out),\n };\n}\nfunction isGapOp(op) {\n return op === CIGAR_I || op === CIGAR_D || op === CIGAR_N;\n}\n/**\n * The gap-free runs of a block: the block cut at every insertion or deletion\n * of `gapBp` or more, each run re-anchored on both axes with its own ops, in\n * the shape {@link clipSyntenyFeature} answers with so a run can then be\n * clipped to a window like any block. Cut BEFORE the clip rather than after\n * it, because a clip trims a gap straddling the window edge to the part\n * inside, and a 25 kb deletion 9 kb of which is in view is still a gap. The\n * walk is the clip's own \u2014 query forward, target down for a - strand block\n * from `mateEnd` \u2014 and a run's `mateStart`/`mateEnd` are its target extent\n * in ascending order. A run is only what aligned: one holding no match or\n * coarse-run op (a stretch that is deletions alone) is dropped, and a gap at\n * either edge of the block leaves no empty run behind it.\n *\n * Wanted by a display that draws a clipped record as one straight placement\n * and has no CIGAR left to consult: a chain carrying a 25 kb indel inside the\n * window drew as one ribbon, and what it draws now is one placement per run.\n * The coarse tier keeps every indel longer than half its bound as its own op,\n * so a `gapBp` at that bound splits the same way on either tier.\n */\nexport function splitSyntenyFeatureAtGaps(cigar, start, mateStart, mateEnd, strand, gapBp) {\n const revTarget = strand === -1 ? -1 : 1;\n const runs = [];\n let bp1 = start;\n let bp2 = strand === -1 ? mateEnd : mateStart;\n let run;\n let aligned = false;\n const close = () => {\n if (run !== undefined && aligned && run.qHi > run.qLo) {\n runs.push({\n start: run.qLo,\n end: run.qHi,\n mateStart: run.tLo,\n mateEnd: run.tHi,\n cigar: Uint32Array.from(run.ops),\n });\n }\n run = undefined;\n aligned = false;\n };\n for (let k = 0; k < cigar.length; k++) {\n const packed = cigar[k];\n const len = packed >>> 4;\n const op = packed & 0xf;\n const isRun = op === CIGAR_RUN;\n const second = isRun ? cigar[++k] : undefined;\n const qAdv = isRun || consumesQuery(op) ? len : 0;\n const tAdv = second !== undefined ? second >>> 4 : consumesTarget(op) ? len : 0;\n const bp2Next = bp2 + tAdv * revTarget;\n if (isGapOp(op) && len >= gapBp) {\n close();\n }\n else if (qAdv > 0 || tAdv > 0) {\n if (run === undefined) {\n run = { qLo: bp1, qHi: bp1, tLo: bp2, tHi: bp2, ops: [] };\n }\n run.qHi = bp1 + qAdv;\n run.tLo = Math.min(run.tLo, bp2, bp2Next);\n run.tHi = Math.max(run.tHi, bp2, bp2Next);\n run.ops.push(packed);\n if (second !== undefined) {\n run.ops.push(second);\n }\n aligned = aligned || isRun || isMatchOp(op);\n }\n bp1 += qAdv;\n bp2 = bp2Next;\n }\n close();\n return runs;\n}\n// Worker glue over clipSyntenyFeature: gate on size + resolve the v1 region the\n// fetch window is over, convert the window to that region's local bp, parse\n// the CIGAR (or the coarse tier's fold of it) and clip. Returns undefined\n// (leave the block untouched) unless it is a block with an alignment string\n// more than `spanRatio`x the window on a clippable region. The clip\n// itself is region-orientation-agnostic (it walks genomic query bp forward), and\n// buildSyntenyGeometry re-derives its rev1 from the cumBp order of the clipped\n// endpoints \u2014 so a reversed v1 region only changes the cumBp->local-bp window\n// mapping below, not the clip or the downstream projection.\nexport function clipLargeBlockToWindow({ v1Index, refName, start, end, mateStart, mateEnd, strand, cigar, coarseCigar, winCumLo, winCumHi, windowSpan, spanRatio, }) {\n if ((!cigar && !coarseCigar) || end - start <= spanRatio * windowSpan) {\n return undefined;\n }\n // Re-anchor to the region this refName's fetch window falls in. A refName\n // can be displayed at several loci at once \u2014 e.g. a dispersed gene duplication\n // shows the same contig in multiple regions \u2014 so pick the region whose cumBp\n // span overlaps the window most (for the common single-region case, just that\n // region; no overlap = the block is off-screen, leave it untouched). Assumes\n // the same-refName regions are genomically DISJOINT (which the duplication\n // case is): the downstream projection re-resolves the clipped coords with\n // findRegionEntry, which picks the region their span overlaps MOST \u2014 the same\n // region we clipped to only when the genomic ranges don't overlap. Overlapping\n // copies of one locus would need a region index threaded through.\n const entries = v1Index.entries.get(refName) ?? [];\n let r0;\n let bestOverlap = 0;\n for (const e of entries) {\n const regLo = e.bpBefore;\n const regHi = e.bpBefore + (e.region.end - e.region.start);\n const overlap = Math.min(winCumHi, regHi) - Math.max(winCumLo, regLo);\n if (overlap > bestOverlap) {\n bestOverlap = overlap;\n r0 = e;\n }\n }\n if (!r0) {\n return undefined;\n }\n // Snap the window to integer bp (widen outward). winCumLo/Hi come off a\n // fetch window snapped to a pixel-derived grid, so they can carry a sub-bp\n // fraction. The\n // window is only a coarse \"which ops to include\" bound, but the clip trims\n // the boundary match op to start exactly at winStart \u2014 a fractional winStart\n // makes the whole re-anchored block's coords fractional (the op lengths stay\n // integer), rigidly shifting every tile/indel off the true integer-bp grid by\n // that fraction. At several px/bp that reads as indels landing mid-basepair,\n // misaligned vs the exact-bp LGVSyntenyDisplay. Flooring/ceiling keeps the\n // clipped block on the alignment's integer grid; the <1bp widening is well\n // inside the pan buffer.\n //\n // Invert bpToCumBp for this region's orientation. Forward: local =\n // cumBp - bpBefore + start (monotonic up). Reversed: local =\n // end - (cumBp - bpBefore) (monotonic down), so the low/high cumBp bounds map\n // to the high/low local bp \u2014 winStart takes winCumHi and winEnd winCumLo.\n //\n // Clamped to the region, because the cumBp window spans every displayed\n // region and this maps it through one of them: on a multi-region view the\n // window is wider than the region it is being expressed in, so an unclamped\n // winStart lands outside and the re-anchored block keeps an endpoint the\n // projection cannot place.\n const { region, bpBefore } = r0;\n const clampToRegion = (bp) => Math.min(Math.max(bp, region.start), region.end);\n const winStart = clampToRegion(region.reversed\n ? Math.floor(region.end - (winCumHi - bpBefore))\n : Math.floor(winCumLo - bpBefore + region.start));\n const winEnd = clampToRegion(region.reversed\n ? Math.ceil(region.end - (winCumLo - bpBefore))\n : Math.ceil(winCumHi - bpBefore + region.start));\n // A block that doesn't reach the window keeps no op \u2014 every op the walk below\n // retains has to overlap [winStart, winEnd], and the walk only ever moves\n // forward from `start` \u2014 so answer that here, before parsing a multi-megabyte\n // CIGAR string, which is exactly the size of block that reaches this function\n // at all. The window is the fetch window, so a fetched block reaches it\n // unless the same refName is displayed at several loci and the block belongs\n // to another of them.\n if (end < winStart || start > winEnd) {\n return undefined;\n }\n const ops = cigar\n ? parseCigar2Typed(cigar)\n : coarseCigar\n ? parseCoarseCigar(coarseCigar)\n : undefined;\n return ops\n ? clipSyntenyFeature(ops, start, mateStart, mateEnd, strand, winStart, winEnd)\n : undefined;\n}\n", "import { parseCigar2Typed, parseCoarseCigar } from '@jbrowse/cigar-utils';\nexport function getCigar(feature) {\n const cigar = feature.get('CIGAR');\n return typeof cigar === 'string' ? cigar : undefined;\n}\nexport function getCoarseCigar(feature) {\n const coarse = feature.get('coarseCigar');\n return typeof coarse === 'string' ? coarse : undefined;\n}\nexport function hasAlignmentString(feature) {\n return (getCigar(feature) !== undefined || getCoarseCigar(feature) !== undefined);\n}\n// the per-base CIGAR when the record carries one, else the coarse tier's fold\nexport function getAlignmentOps(feature) {\n const cigar = getCigar(feature);\n const coarse = cigar === undefined ? getCoarseCigar(feature) : undefined;\n return cigar !== undefined\n ? parseCigar2Typed(cigar)\n : coarse !== undefined\n ? parseCoarseCigar(coarse)\n : undefined;\n}\n", "export { bpToCumBp, buildBpRegionIndex, cumBpAtGenomicCoord, cumBpInEntry, findRegionEntry, regionsCumBpSpan, } from './bpRegionIndex.js';\nexport { multiGenomePAFTypes, mcscanBlocksTypes, mcscanTypes, pairwiseTypes, syntenyTypes, } from './syntenyTypes.js';\nexport { clampBlockToRegions } from './clampBlockToRegions.js';\nexport { clipLargeBlockToWindow, clipSyntenyFeature, splitSyntenyFeatureAtGaps, } from './clipSyntenyFeature.js';\nexport { getAlignmentOps, getCigar, getCoarseCigar, hasAlignmentString, } from './featureAlignmentOps.js';\nexport { UNNAMED, makeStringDict, unnamedNameId } from './stringDict.js';\nexport { PAN_BUFFER_PX, syntenyFetchRegions, syntenyPanBufferPx, } from './syntenyFetchWindow.js';\nexport { fetchWindowSignature, regionSignature } from './regionSignature.js';\nexport { bucketBpPerPx } from './bpPerPxBucket.js';\nexport { coarseWalkIsApproximate, effectiveCoarseThreshold, getCoarseBpPerPxThreshold, lodMenuItems, lodTierAt, readLodTierInfo, resolveLodTier, trackHasLodTiers, } from './lodTier.js';\nexport { LodTierInfoMixin, installLodTierInfoFetch, } from './LodTierInfoMixin.js';\nexport { extractAlignmentData } from './extractAlignmentData.js';\n// Promoted to core (a pure signature compare, no synteny deps); re-exported here\n// so the comparative-view consumers keep importing it from @jbrowse/synteny-core.\nexport { isDataCurrent } from '@jbrowse/core/util';\n// Promoted to core: a third surface owner needed it (the breakpoint split\n// view's overlay), and its model is eager, so reaching it through this barrel\n// would have dragged the chunk behind these components onto every page.\nexport { installClearHoverOnSurfaceMove } from '@jbrowse/core/util/installClearHoverOnSurfaceMove';\nexport { installAssemblySwapCheck } from './detectSwappedAssemblies.js';\n// Promoted to core (depends only on core); re-exported here so the\n// comparative-view consumers keep importing it from @jbrowse/synteny-core.\nexport { createAbortRotation } from '@jbrowse/core/util';\nexport { getAdapterToCanonicalRefNameMap, renameRegionsForAdapter, } from './renameRegionsForAdapter.js';\nexport { adapterAssemblyNames, regionsInAssemblyNamespace, } from './regionsInAssemblyNamespace.js';\nexport { renameDictLane } from './renameDictLane.js';\nexport { SYNTENY_LANES, canonicalizeSyntenyDictLanes, packSyntenyLanes, syntenyLaneFields, } from './syntenyLaneSchema.js';\nexport { getCanonicalRefNameFn } from './getCanonicalRefNameFn.js';\nexport { installComparativeFetchAutorun } from './installComparativeFetchAutorun.js';\nexport { releaseTemporaryAssemblies } from './releaseTemporaryAssemblies.js';\nexport { runDiagonalize } from './runDiagonalize.js';\nexport { prepareDiagonalizeAdapter } from './prepareDiagonalizeAdapter.js';\nexport { legendChipColor, colorSchemes, defaultCigarColors, getQueryColor, hashString, strandCigarColors, } from './colorUtils.js';\nexport { bandGroundColor, bandInk } from './bandGround.js';\nexport { assignTrackColors, syntenyTrackPalette } from './trackColors.js';\nexport { TrackColorsMixin, orderAttributeLabels, widenAttributeRanges, } from './TrackColorsMixin.js';\nexport { colorByMenuItems } from './colorByMenuItems.js';\nexport { colorByMenuTargetFor } from './colorByMenuTarget.js';\nexport { SYNTENY_COLOR_SCALES, SYNTENY_VIEW_FIELDS, syntenyColorConfigSchema, } from './syntenyColorConfigSchema.js';\nexport { paintedField, syntenyColorFor } from './syntenyColorBy.js';\n// the palette button itself, not just the menu inside it \u2014 the two headers had a\n// copy each and only one of them said which mode it was in\nexport { default as ColorBySelector } from './ColorBySelector.js';\nexport { default as ComparativeTooltip } from './ComparativeTooltip.js';\nexport { COLOR_COLUMN, PRESET_ATTRIBUTES, colorableColumns, createAttributeChannels, declaredAttributes, featureAttributeRanges, readAttribute, readChannelValue, writeAttribute, writeFeatureAttribute, writeFeatureChannels, } from './attributeChannels.js';\nexport { attributeTooltipLines, featureAttributes, } from './attributeTooltipLines.js';\nexport { comparativeTooltipLines } from './comparativeTooltipLines.js';\nexport { continuousRampConfig, presetRamp, dnDsRatio, isAttributeLabels, rampNorm, resolveCategoricalMode, resolveContinuousMode, } from './colorRamps.js';\nexport { MISSING_VALUE_COLOR, UNLABELLED_COLOR, categoricalColor, createComparativeColorFunction, makeCategoricalColorFunction, makeContinuousColorFunction, makeNameColorFunction, nameColorCss, paletteColorAt, } from './colorFunctions.js';\nexport { CIGAR_OP_D, CIGAR_OP_I, CIGAR_OP_N, NO_CIGAR_OPS, colorByFallbackNote, colorByShortLabel, colorByScale, getColorBySwatch, } from './colorLegend.js';\nexport { launchSyntenyView } from './launchSyntenyView.js';\nexport { default as HelpTooltip } from './HelpTooltip.js';\nexport { default as DiagonalizeLoadingScreen } from './DiagonalizeLoadingScreen.js';\nexport { default as DiagonalizeDialog } from './DiagonalizeDialog.js';\nexport { withDiagonalizeProgress } from './withDiagonalizeProgress.js';\nexport { DiagonalizeProgressMixin } from './DiagonalizeProgressMixin.js';\nexport { ImportFormSyntenyMixin } from './ImportFormSyntenyMixin.js';\nexport { ComparativeFetchMixin, swappedAssembliesWarning, } from './ComparativeFetchMixin.js';\nexport { comparativeDisplayPhase, comparativeSurfacePhase, comparativeSurfaceSettled, displaysSettled, } from './comparativeReadiness.js';\n// Warning rows named by the track that raised them, and the one report both\n// views open over them \u2014 shared so a report cannot say different things\n// depending on which comparative view you are in.\nexport { collectTrackWarnings } from './trackWarnings.js';\nexport { default as TrackWarningsDialog } from './TrackWarningsDialog.js';\n// The per-display fetch status both comparative views render, so a first load\n// looks the same in each \u2014 see the component for the drift it ends.\nexport { default as ComparativeFetchStatus } from './ComparativeFetchStatus.js';\nexport { MAX_MIN_LENGTH_BP, MIN_LENGTH_HELP } from './minLengthHelp.js';\nexport { COLOR_MODES, VALUE_MODES_LABEL } from './colorModes.js';\nexport { SETTINGS_SURFACE_LABELS } from './settingsSurfaces.js';\nexport { defaultSyntenyFileFormats } from './defaultSyntenyFileFormats.js';\nexport { connectedEndpoints, getConnectedAssemblies, getSyntenyTracks, isSyntenyTrack, pickSyntenyTrackId, sameAssemblySet, } from './getSyntenyTracks.js';\nexport { dotplotAxesFromRows, quickStartSyntenyTracks, syntenyTrackRows, } from './syntenyTrackRows.js';\nexport { default as ChromosomeFilter } from './ChromosomeFilter.js';\nexport { useChromosomeFilters } from './useChromosomeFilters.js';\nexport { defaultImportFormRows, useImportFormRows, } from './useImportFormRows.js';\nexport { default as ImportFormModeToggle } from './ImportFormModeToggle.js';\nexport { default as ImportFormModes } from './ImportFormModes.js';\nexport { default as QuickStartPanel } from './QuickStartPanel.js';\nexport { applyQuickStartSelections, useQuickStartState, } from './useQuickStartState.js';\nexport { default as PreConfiguredSyntenyTrackSelect } from './PreConfiguredSyntenyTrackSelect.js';\nexport { planSyntenyChain } from './planSyntenyChain.js';\nexport { resolveRowTrackAction, resolveSyntenyTrackActions, } from './resolveRowTrackAction.js';\nexport { blockedByUnfinishedUpload, syntenyPairStatuses, } from './syntenyPairStatuses.js';\n// Promoted to core (any feature listing tracks wants it, not just synteny);\n// re-exported here so the synteny/comparative consumers keep one import.\nexport { allSessionTracks } from '@jbrowse/core/util/tracks';\nexport { syntenyPairs } from './syntenyPairs.js';\nexport { remapImportFormSelections, remapSelectionsToPairs, } from './remapSelectionsToPairs.js';\nexport { applySyntenyTrackSelections } from './applySyntenyTrackSelections.js';\nexport { default as ImportFormSyntenyTrackPanel } from './ImportFormSyntenyTrackPanel.js';\nexport { default as NoSyntenyTrackMessage } from './NoSyntenyTrackMessage.js';\nexport { useImportFormSyntenyChoices } from './useImportFormSyntenyChoices.js';\nexport { default as ImportFormSyntenyChoiceRadioGroup } from './ImportFormSyntenyChoiceRadioGroup.js';\nexport { default as ImportFormOpenCustomTrack } from './ImportFormOpenCustomTrack.js';\nexport { default as ImportSyntenyOpenCustomTrack } from './ImportSyntenyOpenCustomTrack.js';\nexport { default as AnchorsSelector } from './AnchorsSelector.js';\nexport { default as PifGzSelector } from './PifGzSelector.js';\nexport { default as StandardFormatSelector } from './StandardFormatSelector.js';\nexport { default as SwapAssemblies } from './SwapAssemblies.js';\nexport { getMate } from './syntenyMate.js';\n", "import {\n DELETION_TYPE,\n INSERTION_TYPE,\n MISMATCH_TYPE,\n SKIP_TYPE,\n coarseCigarOwnAxis,\n forEachCsMismatch,\n getMismatches,\n} from '@jbrowse/cigar-utils'\nimport { SimpleFeature } from '@jbrowse/core/util'\n\nimport type { MismatchCallback, MismatchWindow } from '@jbrowse/cigar-utils'\nimport type { Feature } from '@jbrowse/core/util'\n\n// Implementing forEachMismatch lets synteny features flow through the alignments\n// GPU/Canvas2D mismatch pipeline (LGVSyntenyDisplay reuses it), rendering\n// per-base SNPs and indels. Prefer the cs tag (real query bases); fall back to\n// the CIGAR (positions only, no base identity for X ops).\nexport default class SyntenyFeature extends SimpleFeature {\n get(name: 'mismatches'): ReturnType<typeof getMismatches>\n get(name: 'refName'): string\n get(name: 'name' | 'type' | 'id' | 'source'): string | undefined\n get(name: 'start' | 'end' | 'clipLengthAtStartOfRead'): number\n get(name: 'phase'): 0 | 1 | 2 | undefined\n get(name: 'strand'): -1 | 0 | 1 | undefined\n get(name: 'score'): number | undefined\n get(name: 'subfeatures'): Feature[] | undefined\n get(name: string): unknown\n get(name: string): unknown {\n if (name === 'mismatches') {\n return getMismatches(this.walkableCigar)\n } else if (name === 'clipLengthAtStartOfRead') {\n return this.clipLengthAtStartOfRead\n } else if (name === 'name') {\n return super.get('name') ?? this.mate?.refName\n } else {\n return super.get(name)\n }\n }\n\n private get mate() {\n return super.get('mate') as { refName?: string; start?: number } | undefined\n }\n\n // The CIGAR, or on the coarse tier its fold read along this row's own axis,\n // so a kept indel places itself where the fine tier's would; the runs' mate\n // lengths mean nothing to a reference-anchored mismatch walk.\n private get walkableCigar() {\n const cigar = super.get('CIGAR')\n const coarse = super.get('coarseCigar')\n return typeof cigar === 'string'\n ? cigar\n : typeof coarse === 'string'\n ? coarseCigarOwnAxis(coarse)\n : undefined\n }\n\n // The block's offset along the other sequence, i.e. what a soft clip is to a\n // read: the position the alignments chain builder sorts a name's blocks by,\n // so a contig's blocks chain in contig order rather than fetch order. A PAF\n // CIGAR carries no clip of its own.\n get clipLengthAtStartOfRead() {\n return this.mate?.start ?? 0\n }\n\n forEachMismatch(callback: MismatchCallback, opts?: MismatchWindow) {\n const start = this.get('start')\n const ws = opts?.start === undefined ? undefined : opts.start - start\n const we = opts?.end === undefined ? undefined : opts.end - start\n const cs = this.get('cs') as string | undefined\n if (cs) {\n forEachCsMismatch(cs, callback, ws, we)\n } else {\n const lo = ws ?? Number.NEGATIVE_INFINITY\n const hi = we ?? Number.POSITIVE_INFINITY\n for (const m of getMismatches(this.walkableCigar)) {\n // Deletions and skips are spans, so one that starts left of the window\n // but reaches into it still draws \u2014 the overlap test the cs path and\n // BAM's forEachMismatchNumeric both apply. Clipping them on start\n // alone made a deletion larger than the viewport vanish exactly when\n // zoomed into it.\n const visible =\n m.type === 'deletion' || m.type === 'skip'\n ? m.start < hi && m.start + m.length > lo\n : m.start >= lo && m.start <= hi\n if (visible) {\n if (m.type === 'mismatch') {\n callback(\n MISMATCH_TYPE,\n m.start,\n m.length,\n m.base,\n m.qual ?? -1,\n 0,\n 0,\n )\n } else if (m.type === 'insertion') {\n callback(\n INSERTION_TYPE,\n m.start,\n m.length,\n m.insertedBases ?? '',\n -1,\n 0,\n m.insertlen,\n )\n } else if (m.type === 'deletion') {\n callback(DELETION_TYPE, m.start, m.length, '', -1, 0, 0)\n } else if (m.type === 'skip') {\n callback(SKIP_TYPE, m.start, m.length, '', -1, 0, 0)\n }\n }\n }\n }\n }\n}\n", "import {\n clipSyntenyFeature,\n getAlignmentOps,\n splitSyntenyFeatureAtGaps,\n} from '@jbrowse/synteny-core'\n\nimport SyntenyFeature from './SyntenyFeature.ts'\n\nimport type { Feature, SimpleFeatureSerialized } from '@jbrowse/core/util'\n\ninterface Interval {\n start: number\n end: number\n}\n\ninterface ClippedIntervals extends Interval {\n mateStart: number\n mateEnd: number\n}\n\nconst ALIGNMENT_STRING_FIELDS = ['CIGAR', 'cs', 'coarseCigar', 'cg', 'cr']\n\ntype SerializedMate = NonNullable<SimpleFeatureSerialized['mate']>\n\nfunction isMate(mate: unknown): mate is SerializedMate {\n return (\n typeof mate === 'object' &&\n mate !== null &&\n 'refName' in mate &&\n 'start' in mate &&\n 'end' in mate &&\n typeof mate.refName === 'string' &&\n typeof mate.start === 'number' &&\n typeof mate.end === 'number'\n )\n}\n\nfunction mateOf(feature: Feature) {\n const mate: unknown = feature.get('mate')\n return isMate(mate) ? mate : undefined\n}\n\n// A record with no alignment string maps its two intervals onto each other in\n// proportion, the way the synteny launch interpolates across such a block; a\n// reverse-strand record runs its mate from the far end.\nfunction interpolateClip(\n own: Interval,\n mate: Interval,\n strand: number,\n window: Interval,\n): ClippedIntervals | undefined {\n const lo = Math.max(own.start, window.start)\n const hi = Math.min(own.end, window.end)\n const ratio = (mate.end - mate.start) / Math.max(own.end - own.start, 1)\n const mateAt = (q: number) =>\n strand === -1\n ? mate.end - (q - own.start) * ratio\n : mate.start + (q - own.start) * ratio\n const a = Math.round(mateAt(lo))\n const b = Math.round(mateAt(hi))\n return hi > lo\n ? { start: lo, end: hi, mateStart: Math.min(a, b), mateEnd: Math.max(a, b) }\n : undefined\n}\n\n// A record inside the window is its own clip, and skips parsing its alignment\n// string, unless the runs are wanted, which only the string knows.\nfunction clipIntervals(\n feature: Feature,\n mate: Interval,\n window: Interval,\n splitAtGapBp: number | undefined,\n): ClippedIntervals[] {\n const own = { start: feature.get('start'), end: feature.get('end') }\n const strand = feature.get('strand') === -1 ? -1 : 1\n const inside = own.start >= window.start && own.end <= window.end\n const ops =\n inside && splitAtGapBp === undefined ? undefined : getAlignmentOps(feature)\n if (ops === undefined) {\n const clipped = inside\n ? { ...own, mateStart: mate.start, mateEnd: mate.end }\n : interpolateClip(own, mate, strand, window)\n return clipped === undefined ? [] : [clipped]\n } else {\n const runs =\n splitAtGapBp === undefined\n ? [{ ...own, mateStart: mate.start, mateEnd: mate.end, cigar: ops }]\n : splitSyntenyFeatureAtGaps(\n ops,\n own.start,\n mate.start,\n mate.end,\n strand,\n splitAtGapBp,\n )\n return runs.flatMap(run => {\n const clipped = clipSyntenyFeature(\n run.cigar,\n run.start,\n run.mateStart,\n run.mateEnd,\n strand,\n window.start,\n window.end,\n )\n return clipped === undefined ? [] : [clipped]\n })\n }\n}\n\nfunction clippedFeature(\n feature: Feature,\n mate: SerializedMate,\n clipped: ClippedIntervals,\n window: Interval,\n run: string,\n) {\n const suffix = `:${window.start}-${window.end}${run}`\n const source = feature.toJSON()\n const data: SimpleFeatureSerialized = {\n ...source,\n uniqueId: `${feature.id()}${suffix}`,\n start: clipped.start,\n end: clipped.end,\n mate: { ...mate, start: clipped.mateStart, end: clipped.mateEnd },\n }\n if (source.syntenyId !== undefined) {\n data.syntenyId = `${String(source.syntenyId)}${suffix}`\n }\n for (const field of ALIGNMENT_STRING_FIELDS) {\n delete data[field]\n }\n return new SyntenyFeature(data)\n}\n\n/**\n * The pieces of one pairwise record inside `window`, on both axes: none when\n * the record misses the window, one otherwise, and with `splitAtGapBp` one per\n * gap-free run of its alignment, numbered after the window suffix so each run\n * is its own feature and its own `syntenyId` group. A piece keeps every field\n * of the record except the alignment strings. A feature with no `mate` is not\n * a pairwise record and passes through whole.\n *\n * A copy of `@jbrowse/plugin-comparative-adapters`' own, which a runtime plugin\n * cannot import: the worker serves that package as a stub too.\n */\nexport function clipFeatureToRegion(\n feature: Feature,\n window: Interval,\n splitAtGapBp?: number,\n): Feature[] {\n const mate = mateOf(feature)\n if (mate === undefined) {\n return [feature]\n } else {\n const pieces = clipIntervals(feature, mate, window, splitAtGapBp)\n return pieces.map((piece, i) =>\n clippedFeature(\n feature,\n mate,\n piece,\n window,\n pieces.length > 1 ? `/${i}` : '',\n ),\n )\n }\n}\n"],
|
|
5
|
+
"mappings": "yTAAA,IAAAA,GAAAC,GAAA,CAAAC,GAAAC,KAAA,CAAAA,GAAO,QAAU,eAAe,mDAAmD,ICI7E,SAAUC,EAAWC,EAAYC,EAAwB,CAC7D,MAAO,GAAID,GAAMC,IAAgB,UAAY,EAAI,EACnD,CAEM,SAAUC,EAAOC,EAAc,CACnC,OAAO,KAAK,MAAMA,EAAS,CAAC,CAC9B,CAEM,SAAUC,GAAgBD,EAAc,CAC5C,OAAOA,EAAS,IAAM,EAAI,UAAY,SACxC,CAEM,SAAUE,EAAUF,EAAc,CACtC,OAAOA,EAAS,IAAM,CACxB,CAEM,SAAUG,EAASH,EAAc,CACrC,OAAOA,EAAS,IAAM,EAAIA,EAAS,EAAIA,EAAS,CAClD,CAIM,SAAUI,GAASC,EAAc,CACrC,OAAOA,IAAS,OAAS,QAAU,MACrC,CAEM,SAAUC,GAAUR,EAAwB,CAChD,OAAOA,IAAgB,UAAY,OAAS,OAC9C,CAEM,SAAUS,GAAST,EAAwB,CAC/C,OAAOA,IAAgB,UAAY,QAAU,MAC/C,CAEM,SAAUU,GAAiBH,EAAc,CAC7C,OAAOA,IAAS,OAAS,UAAY,SACvC,CAEM,SAAUI,GAAgBJ,EAAc,CAC5C,OAAOA,IAAS,QAAU,UAAY,SACxC,CAEM,SAAUK,GAAgBC,EAAcC,EAAU,CACtD,IAAMC,EAASd,EAAOY,CAAI,EACpBG,EAAOf,EAAOa,CAAE,EACtB,OAAOV,EAAUS,CAAI,EACjBG,EAAOD,GAAWC,IAASD,GAAU,CAACX,EAAUU,CAAE,EAClDE,GAAQD,CACd,CAEM,SAAUE,GAAgBC,EAAc,CAC5C,OAAOC,GAAqBD,EAAK,CAAC,EAAGA,EAAKA,EAAK,OAAS,CAAC,CAAC,CAC5D,CAEM,SAAUC,GACdC,EACAC,EAAwB,CAExB,OAAID,IAAU,QAAaC,IAAS,OAC3B,GAEFjB,EAAUgB,CAAK,IAAMhB,EAAUiB,CAAI,EACtC,CAACjB,EAAUgB,CAAK,EAChBR,GAAgBQ,EAAOC,CAAI,CACjC,CCpEM,IAAOC,GAAP,KAAqB,CACzB,OAAS,EACD,MAER,YAAYC,EAAiB,CAC3B,KAAK,MAAQA,CACf,CAEA,IAAI,MAAI,CACN,OAAO,KAAK,QAAU,KAAK,MAAM,MACnC,CAEA,MAAI,CACF,IAAMC,EAAQ,KAAK,MAAM,KAAK,MAAM,EACpC,GAAIA,IAAU,OAGd,YAAK,QAAU,EACRA,CACT,CAEA,KAAG,CACD,IAAIC,EAAQ,EACRC,EAAS,EACb,KAAO,KAAK,OAAS,KAAK,MAAM,QAAQ,CACtC,IAAMF,EAAQ,KAAK,MAAM,KAAK,MAAM,EAIpC,GAHA,KAAK,QAAU,EACfE,IAAWF,EAAQ,KAAQC,EAC3BA,GAAS,KACJD,EAAQ,OAAU,EACrB,OAAOE,CAEX,CAEF,GAQIC,GAAgB,IAChBC,GAAe,IAERC,GAAP,KAAgB,CACZ,OACA,MACA,UAER,YAAYN,EAAmBO,EAAa,CAC1C,KAAK,OAAS,IAAIR,GAAeC,CAAK,EACtC,KAAK,MAAQO,IAAU,EAAI,OAAO,iBAAmBA,EACrD,KAAK,UACH,KAAK,MAAQH,GAAgB,KAAK,MAAMC,GAAe,KAAK,KAAK,EAAI,CACzE,CAEA,MAAI,CACF,GAAI,KAAK,OAASD,GAAe,CAC/B,IAAMH,EAAQ,KAAK,OAAO,IAAG,EACvBO,EAAM,KAAK,OAAO,IAAG,EAC3B,OAAOP,IAAU,QAAaO,IAAQ,OAClC,OACA,CAAE,MAAAP,EAAO,IAAKO,EAAM,CAAC,CAC3B,CACA,IAAMC,EAAO,KAAK,OAAO,KAAI,EAC7B,GAAIA,IAAS,OACX,OAEF,IAAMR,EAAQQ,EAAO,KAAK,MACtBD,EAAM,KAAK,MAAMC,EAAO,KAAK,KAAK,EAAI,EAC1C,GAAID,IAAQ,KAAK,UAAW,CAC1B,IAAME,EAAQ,KAAK,OAAO,IAAG,EAC7B,GAAIA,IAAU,OACZ,OAEFF,GAAOE,CACT,CACA,MAAO,CAAE,MAAAT,EAAO,IAAAO,CAAG,CACrB,CAEA,EAAE,OAAO,QAAQ,GAAC,CAChB,QAASG,EAAM,KAAK,KAAI,EAAIA,IAAQ,OAAWA,EAAM,KAAK,KAAI,EAC5D,MAAMA,CAEV,GC7EI,SAAUC,GAAgBC,EAAiB,CAC/C,IAAMC,EAAS,IAAIC,GAAeF,CAAK,EACjCG,EAAQF,EAAO,IAAG,EACxB,GAAIE,IAAU,QAAaA,IAAU,EACnC,MAAO,CAAA,EAET,IAAMC,EAAe,CAAA,EACjBC,EAAO,EACX,QAASC,EAAI,EAAGA,EAAIH,EAAOG,IAAK,CAC9B,IAAMC,EAAQN,EAAO,IAAG,EAClBO,EAASP,EAAO,IAAG,EACzB,GAAIM,IAAU,QAAaC,IAAW,OACpC,MAAM,IAAI,MAAM,2BAA2B,EAE7CH,GAAQE,EACRH,EAAM,KAAK,CAAE,KAAMC,EAAM,OAAAG,CAAM,CAAE,CACnC,CACA,OAAOJ,CACT,CAEM,IAAOK,GAAP,KAAiB,CACZ,MACA,IAET,YAAYL,EAAcM,EAAe,CACvC,KAAK,MAAQN,EACb,KAAK,IAAMM,CACb,CAEA,MAAI,CACF,OAAO,IAAIC,GAAU,KAAK,IAAK,KAAK,MAAM,MAAM,CAClD,CAEQ,KAAKC,EAAY,CACvB,IAAMC,EAAO,KAAK,MAAMD,CAAI,EAC5B,GAAIC,IAAS,OACX,MAAM,IAAI,MACR,gCAAgCD,CAAI,OAAO,KAAK,MAAM,MAAM,EAAE,EAGlE,OAAOC,CACT,CAEA,GAAGP,EAAS,CACV,IAAMQ,EAAU,KAAK,MAAM,IAAIC,GAAKA,EAAE,MAAM,EACxCP,EAAS,EACb,QAAWQ,KAAO,KAAK,KAAI,EAAI,CAC7B,IAAMH,EAAO,KAAK,KAAKG,EAAI,KAAK,EAC1BC,EAAQH,EAAQE,EAAI,KAAK,EAC/B,GAAIR,EAASQ,EAAI,IAAMV,EACrB,OAAOO,EAAK,OAAS,EACjB,OACA,CAAE,KAAMA,EAAK,KAAM,OAAQI,GAASX,EAAIE,EAAO,EAErDM,EAAQE,EAAI,KAAK,EAAIC,EAAQD,EAAI,IACjCR,GAAUQ,EAAI,GAChB,CAEF,CAEQ,OAAOE,EAAY,CACzB,IAAIC,EAAM,EACNC,EAAO,KAAK,MAAM,OACtB,KAAOD,EAAMC,GAAM,CACjB,IAAMC,EAAOF,EAAMC,GAAS,EACtBP,EAAO,KAAK,MAAMQ,CAAG,EAC3B,GAAIR,EAAK,OAASK,EAChB,OAAOG,EAELR,EAAK,KAAOK,EACdC,EAAME,EAAM,EAEZD,EAAOC,CAEX,CAEF,CAEA,SAASC,EAAQ,CACf,GAAIA,EAAI,OAAS,EACf,OAEF,IAAMV,EAAO,KAAK,OAAOU,EAAI,IAAI,EACjC,GAAIV,IAAS,OACX,OAEF,IAAIW,EAAW,KAAK,MAAMX,CAAI,EAAG,OACjC,GAAIW,EAAWD,EAAI,OACjB,OAEF,IAAId,EAAS,EACb,QAAWQ,KAAO,KAAK,KAAI,EAEzB,GADAR,GAAUQ,EAAI,IACVA,EAAI,QAAUJ,IAGlBW,GAAYP,EAAI,IACZO,EAAWD,EAAI,QACjB,OAAOd,GAAUe,EAAWD,EAAI,OAItC,CAEA,cAAchB,EAAS,CACrB,IAAMkB,EAAS,KAAK,MAAM,IAAIT,IAAM,CAClC,KAAMA,EAAE,OAAS,EAAY,EAAYU,EAASV,EAAE,IAAI,EACxD,MAAO,GACP,EACF,QAAWC,KAAO,KAAK,KAAI,EAAI,CAC7B,IAAMU,EAAQF,EAAOR,EAAI,KAAK,EAC1BU,IACFA,EAAM,OAASV,EAAI,IAEvB,CACA,QAASJ,EAAO,EAAGA,EAAOY,EAAO,OAAQZ,IAAQ,CAC/C,IAAMP,EAAOmB,EAAOZ,EAAO,CAAC,EACtBe,EAAOH,EAAOZ,CAAI,EACpBgB,EAAOvB,EAAK,IAAI,IAAMuB,EAAOD,EAAK,IAAI,IACxCH,EAAOZ,EAAO,CAAC,EAAIe,EACnBH,EAAOZ,CAAI,EAAIP,EAEnB,CACA,IAAIG,EAAS,EACb,QAAWkB,KAASF,EAElB,GADAhB,GAAUkB,EAAM,MACZlB,EAASF,EACX,OAAOoB,EAAM,OAAS,EAAY,OAAYA,EAAM,IAI1D,CAEA,kBAAgB,CACd,IAAMZ,EAAU,KAAK,MAAM,IAAIC,GAAKA,EAAE,MAAM,EACxCc,EAAQ,EACZ,QAAWb,KAAO,KAAK,KAAI,EACzBa,GAASb,EAAI,IAEf,IAAMc,EAAQ,IAAI,WAAWD,CAAK,EAC5BE,EAAc,IAAI,WAAWF,CAAK,EACpCvB,EAAI,EACR,QAAWU,KAAO,KAAK,KAAI,EAAI,CAC7B,IAAMH,EAAO,KAAK,KAAKG,EAAI,KAAK,EAC5BR,EAASM,EAAQE,EAAI,KAAK,EAC9B,QAASgB,EAAI,EAAGA,EAAIhB,EAAI,IAAKgB,IAC3BF,EAAMxB,CAAC,EAAIO,EAAK,KAChBkB,EAAYzB,CAAC,EAAIE,EACjBA,GAAU,EACVF,GAAK,EAEPQ,EAAQE,EAAI,KAAK,EAAIR,CACvB,CACA,MAAO,CAAE,MAAAsB,EAAO,QAASC,CAAW,CACtC,CAEA,YAAU,CACR,IAAMjB,EAAU,KAAK,MAAM,IAAIC,GAAKA,EAAE,MAAM,EACtCkB,EAAgB,CAAA,EACtB,QAAWjB,KAAO,KAAK,KAAI,EAAI,CAC7B,IAAMH,EAAO,KAAK,KAAKG,EAAI,KAAK,EAChC,QAASgB,EAAI,EAAGA,EAAIhB,EAAI,IAAKgB,IAC3BC,EAAO,KAAK,CAAE,KAAMpB,EAAK,KAAM,OAAQC,EAAQE,EAAI,KAAK,CAAE,CAAE,EAC5DF,EAAQE,EAAI,KAAK,EAAIF,EAAQE,EAAI,KAAK,EAAK,CAE/C,CACA,OAAOiB,CACT,GC/KF,IAAMC,GAAS,CAAC,GAAI,IAAK,IAAK,IAAK,IAAK,GAAG,EAErC,SAAUC,GAAsBC,EAAmB,CACvD,IAAMC,EAAOD,EAAQA,EAAQ,OAAS,CAAC,EACvC,GAAIC,IAAS,OACX,MAAO,GAET,IAAIC,EAAQD,EACRE,EAAS,EACb,QAASC,EAAI,EAAGA,EAAI,GACdF,EAAQ,IAAM,EADGE,IAIrBF,EAAQ,KAAK,MAAMA,EAAQ,CAAC,EAC5BC,GAAU,EAEZ,MAAO,IAAKH,EAAQ,OAAS,GAAKG,CACpC,CAEM,SAAUE,GAAeL,EAAmB,CAChD,IAAIM,EAAS,GACb,QAAWC,KAAQP,EAAS,CAC1B,IAAIE,EAAQK,EACZ,QAASH,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,IAAMI,EAAOV,GAAOI,EAAQ,CAAC,EAC7B,GAAIM,IAAS,GACX,OAAOF,EAETJ,EAAQ,KAAK,MAAMA,EAAQ,CAAC,EAC5BI,GAAUE,CACZ,CACF,CACA,OAAOF,CACT,CAEA,IAAMG,GAAqC,CACzC,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,KAGC,SAAUC,GAAkBC,EAAgB,CAChD,IAAIL,EAAS,GACb,QAASF,EAAIO,EAAS,OAAS,EAAGP,GAAK,EAAGA,IACxCE,GAAUG,GAAWE,EAASP,CAAC,CAAE,GAAK,IAExC,OAAOE,CACT,CC3CA,SAASM,GAAmBC,EAA2BC,EAAY,CACjE,IAAMC,EAAgB,IAAI,IAC1B,GAAIF,IAAU,OACZ,QAAWG,KAAOH,EAAM,MAAM,GAAG,EAAG,CAClC,IAAMI,EAAQD,EAAI,MAAM,GAAG,EACrB,CAACE,EAAMC,CAAE,EAAIF,EACnB,GAAIA,EAAM,SAAW,GAAK,CAACC,GAAQ,CAACC,EAClC,MAAM,IAAI,MAAM,WAAWL,CAAI,kBAAkBE,CAAG,EAAE,EAExD,IAAII,EAAUL,EAAc,IAAIG,CAAI,EAC/BE,IACHA,EAAU,IAAI,IACdL,EAAc,IAAIG,EAAME,CAAO,GAEjCA,EAAQ,IAAID,CAAE,CAChB,CAEF,OAAOJ,CACT,CAEM,SAAUM,GAAkBC,EAAyB,CACzD,MAAO,CACL,KAAMA,EAAK,IAAI,SAAS,EACxB,SAAUV,GAAmBU,EAAK,IAAI,UAAU,EAAG,UAAU,EAC7D,YAAaV,GAAmBU,EAAK,IAAI,aAAa,EAAG,aAAa,EAE1E,CAEA,SAASC,GAAMC,EAAgCN,EAA8B,CAC3E,OAAW,CAACO,EAAKC,CAAM,IAAKR,EAAM,CAChC,IAAIE,EAAUI,EAAK,IAAIC,CAAG,EACrBL,IACHA,EAAU,IAAI,IACdI,EAAK,IAAIC,EAAKL,CAAO,GAEvB,QAAWO,KAASD,EAClBN,EAAQ,IAAIO,CAAK,CAErB,CACF,CAEM,SAAUC,GAAaC,EAAcC,EAAiB,CAC1D,IAAMC,EAAoB,CACxB,KAAAF,EACA,SAAU,IAAI,IACd,YAAa,IAAI,KAEnB,OAAIC,EAAO,OAAS,SAClBC,EAAO,SAAS,IAAIF,EAAM,IAAI,IAAI,CAACC,EAAO,IAAI,CAAC,CAAC,EAChDP,GAAMQ,EAAO,SAAUD,EAAO,QAAQ,EACtCP,GAAMQ,EAAO,YAAaD,EAAO,WAAW,GAEvCC,CACT,CAEA,SAASC,GAAcjB,EAAuC,CAC5D,MAAO,CAAC,GAAGA,EAAc,QAAO,CAAE,EAC/B,KAAK,CAAC,CAACkB,CAAC,EAAG,CAACC,CAAC,IAAOD,EAAIC,EAAI,GAAKD,EAAIC,EAAI,EAAI,CAAE,EAC/C,QAAQ,CAAC,CAAChB,EAAMiB,CAAG,IAAM,CAAC,GAAGA,CAAG,EAAE,KAAI,EAAG,IAAIhB,GAAM,CAACD,EAAMC,CAAE,CAAU,CAAC,CAC5E,CAEM,SAAUiB,GAAeC,EAAoB,CACjD,IAAMC,EAAkB,CAAA,EACpBD,EAAU,OAAS,QACrBC,EAAM,KAAK,UAAWD,EAAU,IAAI,EAAE,EAExC,OAAW,CAACE,EAAUC,CAAU,IAAKR,GAAcK,EAAU,QAAQ,EACnEC,EAAM,KAAK,UAAWC,CAAQ,IAAIC,CAAU,EAAE,EAEhD,OAAW,CAACtB,EAAMC,CAAE,IAAKa,GAAcK,EAAU,WAAW,EAC1DC,EAAM,KAAK,UAAWpB,CAAI,IAAIC,CAAE,EAAE,EAEpC,OAAOmB,CACT,CAEA,eAAsBG,GAAUC,EAAoB,CAClD,IAAMC,EAAQD,EAAO,OAAO,CAACE,EAAKC,IAAUD,EAAMC,EAAM,OAAQ,CAAC,EAC3DC,EAAQ,IAAI,WAAWH,CAAK,EAC9BI,EAAS,EACb,QAAWF,KAASH,EAClBI,EAAM,IAAID,EAAOE,CAAM,EACvBA,GAAUF,EAAM,OAElB,IAAMG,EAAS,MAAM,WAAW,OAAO,OAAO,OAAO,UAAWF,CAAK,EACrE,MAAO,CAAC,GAAG,IAAI,WAAWE,CAAM,CAAC,EAC9B,IAAIC,GAAQA,EAAK,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,EAC9C,KAAK,EAAE,CACZ,CC9EO,IAAMC,GAAiB,YAExB,SAAUC,EAAeC,EAAgBC,EAAW,CACxD,MAAO,GAAGD,EAAK,MAAM,IAAIA,EAAK,SAAS,IAAIA,EAAK,MAAM,IAAIA,EAAK,QAAQ,IAAIC,CAAG,GAChF,CAEA,IAAMC,GAAS,2CACTC,GAAc,6BAEd,SAAUC,GAAcJ,EAAY,CACxC,IAAMK,EAAQH,GAAO,KAAKF,CAAI,EAC9B,GAAIK,EACF,MAAO,CACL,OAAQA,EAAM,CAAC,EACf,UAAW,OAAOA,EAAM,CAAC,CAAC,EAC1B,OAAQA,EAAM,CAAC,GAGnB,IAAMC,EAAOH,GAAY,KAAKH,CAAI,EAClC,GAAIM,EACF,MAAO,CAAE,OAAQA,EAAK,CAAC,CAAE,EAE3B,MAAM,IAAI,MACR,IAAIN,CAAI,2EAA2E,CAEvF,CAEM,SAAUO,GAAYC,EAAY,CACtC,OAAO,OAAOA,GAAQ,SAAWJ,GAAcI,CAAG,EAAIA,CACxD,CAEM,SAAUC,GAAYC,EAAkBC,EAAgB,CAC5D,MAAO,CACL,OAAQD,EAAM,QAAUZ,GACxB,OAAQY,EAAM,OACd,UAAWA,EAAM,WAAa,EAC9B,SAAAC,EAEJ,CCnDA,SAASC,GAAWC,EAAqBC,EAAa,CACpD,IAAIC,EAAK,EACLC,EAAKH,EAAU,OACnB,KAAOE,EAAKC,GAAI,CACd,IAAMC,EAAOF,EAAKC,GAAO,EACrBH,EAAUI,CAAG,EAAKH,EACpBC,EAAKE,EAAM,EAEXD,EAAKC,CAET,CACA,OAAOF,CACT,CAEA,IAAMG,GAAN,KAAe,CACJ,OACQ,KAEjB,YAAYC,EAAe,CACzB,KAAK,OAAS,IAAI,aAAaA,CAAO,EACtC,KAAK,KAAO,IAAI,WAAWA,EAAU,CAAC,EAAE,KAAK,EAAE,CACjD,CAEA,WAAWC,EAAc,CACvB,IAAIC,EAAO,GACX,QAASC,EAAIF,EAAQE,EAAI,EAAGA,GAAKA,EAAI,CAACA,EAAG,CACvC,IAAMC,EAAY,KAAK,KAAKD,CAAC,EAE3BC,IAAc,KACbF,IAAS,IAAM,KAAK,OAAOE,CAAS,EAAK,KAAK,OAAOF,CAAI,KAE1DA,EAAOE,EAEX,CACA,OAAOF,CACT,CAEA,MAAMD,EAAgBN,EAAa,CACjC,KAAK,OAAOM,CAAM,EAAIN,EACtB,QAASQ,EAAIF,EAAS,EAAGE,EAAI,KAAK,KAAK,OAAQA,GAAKA,EAAI,CAACA,EAAG,CAC1D,IAAME,EAAS,KAAK,KAAKF,CAAC,GACtBE,IAAW,IAAMV,EAAQ,KAAK,OAAOU,CAAM,KAC7C,KAAK,KAAKF,CAAC,EAAIF,EAEnB,CACF,GAWIK,GAAN,KAAe,CACJ,MAA4B,CAAA,EACrC,MAAQ,EACS,EACA,EACA,OACA,YAAc,IAAI,IAEnC,YAAYC,EAAaC,EAAaC,EAAc,CAClD,KAAK,EAAIF,EACT,KAAK,EAAIC,EACT,KAAK,OAASC,EACdD,EAAE,QAAQ,CAACE,EAAGC,IAAK,CACjB,IAAMC,EAAO,KAAK,YAAY,IAAIF,CAAC,EAC/BE,EACFA,EAAK,KAAKD,CAAC,EAEX,KAAK,YAAY,IAAID,EAAG,CAACC,CAAC,CAAC,CAE/B,CAAC,CACH,CAEA,MAAME,EAAYC,EAAYC,EAAYC,EAAU,CAClD,IAAIC,EAAS,EACb,KACEJ,EAAKI,EAASH,GACdC,EAAKE,EAASD,GACd,KAAK,EAAEH,EAAKI,CAAM,IAAM,KAAK,EAAEF,EAAKE,CAAM,GAE1C,KAAK,MAAMJ,EAAKI,EAAQF,EAAKE,CAAM,EACnCA,GAAU,EAEZ,IAAIC,EAAS,EACb,KACEJ,EAAKI,EAASL,EAAKI,GACnBD,EAAKE,EAASH,EAAKE,GACnB,KAAK,EAAEH,EAAKI,EAAS,CAAC,IAAM,KAAK,EAAEF,EAAKE,EAAS,CAAC,GAElDA,GAAU,EAEZ,KAAK,YAAYL,EAAKI,EAAQH,EAAKI,EAAQH,EAAKE,EAAQD,EAAKE,CAAM,EACnE,QAASC,EAAID,EAAQC,EAAI,EAAGA,IAC1B,KAAK,MAAML,EAAKK,EAAGH,EAAKG,CAAC,CAE7B,CAEQ,MAAMC,EAAWT,EAAS,CAChC,KAAK,MAAM,KAAK,CAACS,EAAGT,CAAC,CAAC,EACtB,KAAK,OAAS,KAAK,OAAO,KAAK,EAAES,CAAC,CAAE,CACtC,CAEQ,YAAYP,EAAYC,EAAYC,EAAYC,EAAU,CAChE,GAAIH,IAAOC,GAAMC,IAAOC,EACtB,OAEF,IAAMK,EAAU,KAAK,WAAWR,EAAIC,EAAIC,EAAIC,CAAE,EAC9C,GAAIK,IAAY,EACd,OAEF,GAAIA,GAAWP,EAAKD,GAAMG,EAAKD,GAAK,CAClC,KAAK,MAAMF,EAAIC,EAAIC,EAAIC,EAAIK,CAAO,EAClC,MACF,CACA,IAAMvB,EAAOe,EAAKC,GAAO,EACnBQ,EAAQ,KAAK,MAAMT,EAAIf,EAAKgB,EAAIC,EAAIC,CAAE,EAC5C,KAAK,MAAMH,EAAIf,EAAKiB,EAAIO,CAAK,EAC7B,KAAK,MAAMxB,EAAKgB,EAAIQ,EAAON,CAAE,CAC/B,CAEQ,WAAWH,EAAYC,EAAYC,EAAYC,EAAU,CAC/D,IAAIO,EAAQ,EACZ,QAAS,EAAIV,EAAI,EAAIC,EAAI,IAAK,CAC5B,IAAMF,EAAO,KAAK,YAAY,IAAI,KAAK,EAAE,CAAC,CAAE,EACxCA,IACFW,GAAS9B,GAAWmB,EAAMI,CAAE,EAAIvB,GAAWmB,EAAMG,CAAE,EAEvD,CACA,OAAOQ,CACT,CAEQ,MACNC,EACAC,EACAC,EACAX,EACAC,EACAhB,EACA2B,EAAa,CAEb,QAASP,EAAII,EAAMJ,IAAMK,EAAIL,GAAKM,EAAM,CACtC,IAAMd,EAAO,KAAK,YAAY,IAAI,KAAK,EAAEQ,CAAC,CAAE,EAC5C,GAAI,CAACR,EACH,SAEF,IAAMgB,EAAI,KAAK,OAAO,KAAK,EAAER,CAAC,CAAE,EAC1BxB,EAAKH,GAAWmB,EAAMG,CAAE,EACxBlB,EAAKJ,GAAWmB,EAAMI,CAAE,EAC9B,QAASG,EAAI,EAAGA,EAAItB,EAAKD,EAAIuB,IAAK,CAChC,IAAMlB,EACJyB,IAAS,EAAId,EAAKf,EAAK,EAAIsB,CAAC,EAAKJ,EAAKC,EAAK,EAAIJ,EAAKhB,EAAKuB,CAAC,EACtDU,EAAS7B,EAAQ,WAAWC,CAAM,EAClCN,GAASkC,IAAW,GAAK,EAAI7B,EAAQ,OAAO6B,CAAM,GAAMD,EAC9D,GAAIjC,EAAQK,EAAQ,OAAOC,CAAM,IAC/BD,EAAQ,MAAMC,EAAQN,CAAK,EACvBgC,GAAO,CACT,IAAMG,EAAQH,EAAM,QACpBA,EAAM,IAAIG,CAAK,EAAIV,EACnBO,EAAM,OAAOG,CAAK,EAAI7B,EACtB0B,EAAM,SAASG,CAAK,EAClBD,IAAW,GAAK,GAAKF,EAAM,YAAYE,CAAM,EAC/CF,EAAM,YAAY1B,CAAM,EAAI6B,CAC9B,CAEJ,CACF,CACF,CAEQ,MACNjB,EACAC,EACAC,EACAC,EACAK,EAAe,CAEf,IAAMrB,EAAU,IAAID,GAAUiB,EAAKD,CAAE,EAC/BY,EAAe,CACnB,IAAK,IAAI,WAAWN,CAAO,EAC3B,OAAQ,IAAI,WAAWA,CAAO,EAC9B,SAAU,IAAI,WAAWA,CAAO,EAChC,YAAa,IAAI,WAAWL,EAAKD,CAAE,EACnC,MAAO,GAET,KAAK,MAAMF,EAAIC,EAAI,EAAGC,EAAIC,EAAIhB,EAAS2B,CAAK,EAC5C,IAAMI,EAAO/B,EAAQ,WAAWgB,EAAKD,CAAE,EACvC,GAAIgB,IAAS,GACX,OAEF,KAAK,OAAS/B,EAAQ,OAAO+B,CAAI,EACjC,IAAMC,EAA8B,CAAA,EACpC,QACMF,EAAQH,EAAM,YAAYI,CAAI,EAClCD,IAAU,GACVA,EAAQH,EAAM,SAASG,CAAK,EAE5BE,EAAQ,KAAK,CAACL,EAAM,IAAIG,CAAK,EAAIf,EAAKY,EAAM,OAAOG,CAAK,CAAE,CAAC,EAE7D,QAASX,EAAIa,EAAQ,OAAS,EAAGb,GAAK,EAAGA,IACvC,KAAK,MAAM,KAAKa,EAAQb,CAAC,CAAE,CAE/B,CAEQ,SACNK,EACAC,EACAC,EACAX,EACAC,EAAU,CAEV,IAAMhB,EAAU,IAAID,GAAUiB,EAAKD,CAAE,EACrC,KAAK,MAAMS,EAAMC,EAAIC,EAAMX,EAAIC,EAAIhB,CAAO,EAC1C,IAAME,EAAO,IAAI,aAAac,EAAKD,EAAK,CAAC,EACzC,QAASd,EAAS,EAAGA,EAASe,EAAKD,EAAId,IACrCC,EAAKD,EAAS,CAAC,EAAI,KAAK,IAAIC,EAAKD,CAAM,EAAID,EAAQ,OAAOC,CAAM,CAAE,EAEpE,OAAOC,CACT,CAEQ,MAAMW,EAAYf,EAAagB,EAAYC,EAAYC,EAAU,CACvE,IAAMiB,EAAQjB,EAAKD,EACbc,EAAS,KAAK,SAAShB,EAAIf,EAAK,EAAGiB,EAAIC,CAAE,EACzCkB,EAAQ,KAAK,SAASpB,EAAK,EAAGhB,EAAM,EAAG,GAAIiB,EAAIC,CAAE,EACnDM,EAAQ,EACRpB,EAAO,GACX,QAASiC,EAAI,EAAGA,GAAKF,EAAOE,IAAK,CAC/B,IAAMC,EAAWP,EAAOM,CAAC,EAAKD,EAAMD,EAAQE,CAAC,EACzCC,EAAWlC,IACbA,EAAOkC,EACPd,EAAQa,EAEZ,CACA,OAAOpB,EAAKO,CACd,GAGI,SAAUe,GACd9B,EACAC,EACAC,EAAc,CAEd,IAAM6B,EAAM,IAAIhC,GAAUC,EAAGC,EAAGC,CAAM,EACtC,OAAA6B,EAAI,MAAM,EAAG/B,EAAE,OAAQ,EAAGC,EAAE,MAAM,EAC3B,CAAC8B,EAAI,MAAOA,EAAI,KAAK,CAC9B,CC1NA,IAAMC,GAAoB,IACpBC,GAAoB,IACpBC,GAAiB,IACjBC,EAAO,GACPC,GAAuB,GAEvBC,GAAiB,EAGjBC,GAAQ,EACRC,GAAW,GACXC,EAAW,GACXC,GAAa,GACbC,GAAc,EAAE,GAAK,IAErBC,GAAW,EACXC,GAAY,EACZC,GAAW,EAEjB,SAASC,GAAWC,EAAmBC,EAAYC,EAAW,CAC5D,IAAMC,EAAOH,EAAM,GAAG,EAAE,EACpBE,EAAM,IACJC,IAAO,CAAC,IAAMF,EAChBE,EAAK,CAAC,GAAKD,EAEXF,EAAM,KAAK,CAACC,EAAIC,CAAG,CAAC,EAG1B,CAEA,SAASE,GAAKC,EAAkBC,EAAmBC,EAAgB,CACjE,OAAOF,GAAYE,GAAYF,GAAYC,EACvCV,GACAW,GAAYD,EACVR,GACAD,EACR,CAMA,SAASW,GAAgBC,EAAWC,EAAWV,EAAiB,CAC9D,IAAMW,EAAKF,EAAE,OACPG,EAAKF,EAAE,OACPG,EAAQD,EAAK,EACbE,EAAQ,IAAI,YAAYH,EAAK,GAAKE,CAAK,EACzCR,EAAW,IAAI,WAAWQ,CAAK,EAAE,KAAKlB,EAAW,EACjDW,EAAY,IAAI,WAAWO,CAAK,EAAE,KAAKlB,EAAW,EAClDY,EAAW,IAAI,WAAWM,CAAK,EAAE,KAAKlB,EAAW,EACrDU,EAAS,CAAC,EAAI,EACd,QAASU,EAAI,EAAGA,GAAKH,EAAIG,IACvBR,EAASQ,CAAC,EAAItB,GAAYsB,EAAI,GAAKrB,GACnCoB,EAAMC,CAAC,GAAKA,IAAM,EAAInB,GAAWE,KAAa,EAEhD,QAASkB,EAAI,EAAGA,GAAKL,EAAIK,IAAK,CAC5B,IAAMC,EAAe,IAAI,WAAWJ,CAAK,EAAE,KAAKlB,EAAW,EACrDuB,EAAgB,IAAI,WAAWL,CAAK,EAAE,KAAKlB,EAAW,EACtDwB,EAAe,IAAI,WAAWN,CAAK,EAAE,KAAKlB,EAAW,EAC3DuB,EAAc,CAAC,EAAIzB,GAAYuB,EAAI,GAAKtB,GACxCoB,EAAME,EAAIH,CAAK,GAAKG,IAAM,EAAIpB,GAAWC,KAAc,EACvD,IAAMuB,EAAKX,EAAE,WAAWO,EAAI,CAAC,EAC7B,QAASD,EAAI,EAAGA,GAAKH,EAAIG,IAAK,CAC5B,IAAMM,EAAejB,GACnBC,EAASU,EAAI,CAAC,EACdT,EAAUS,EAAI,CAAC,EACfR,EAASQ,EAAI,CAAC,CAAE,EAElBE,EAAaF,CAAC,EACZ,KAAK,IAAIV,EAASU,EAAI,CAAC,EAAIT,EAAUS,EAAI,CAAC,EAAIR,EAASQ,EAAI,CAAC,CAAE,GAC7DK,IAAOV,EAAE,WAAWK,EAAI,CAAC,EAAIxB,GAAQC,IACxC,IAAM8B,EAAgBlB,GACpBC,EAASU,CAAC,EAAKtB,EACfa,EAAUS,CAAC,EAAKrB,GAChBa,EAASQ,CAAC,EAAKtB,CAAQ,EAEzByB,EAAcH,CAAC,EAAI,KAAK,IACtBV,EAASU,CAAC,EAAKtB,EACfa,EAAUS,CAAC,EAAKrB,GAChBa,EAASQ,CAAC,EAAKtB,CAAQ,EAEzB,IAAM8B,EAAenB,GACnBa,EAAaF,EAAI,CAAC,EAAKtB,EACvByB,EAAcH,EAAI,CAAC,EAAKtB,EACxB0B,EAAaJ,EAAI,CAAC,EAAKrB,EAAU,EAEnCyB,EAAaJ,CAAC,EAAI,KAAK,IACrBE,EAAaF,EAAI,CAAC,EAAKtB,EACvByB,EAAcH,EAAI,CAAC,EAAKtB,EACxB0B,EAAaJ,EAAI,CAAC,EAAKrB,EAAU,EAEnCoB,EAAME,EAAIH,EAAQE,CAAC,EACjBM,EAAgBC,GAAiB,EAAMC,GAAgB,CAC3D,CACAlB,EAAWY,EACXX,EAAYY,EACZX,EAAWY,CACb,CACA,IAAMK,EAAgB,CAAA,EAClBR,EAAIL,EACJI,EAAIH,EACJa,EAAQrB,GAAKC,EAASO,CAAE,EAAIN,EAAUM,CAAE,EAAIL,EAASK,CAAE,CAAE,EAC7D,KAAOI,EAAI,GAAKD,EAAI,GAAG,CACrB,IAAMW,EAAQZ,EAAME,EAAIH,EAAQE,CAAC,GAAO,EAAIU,EAAU,EAClDA,IAAU7B,IACZ4B,EAAI,KAAKf,EAAEO,EAAI,CAAC,IAAMN,EAAEK,EAAI,CAAC,EAAI,IAAM,GAAG,EAC1CC,GAAK,EACLD,GAAK,GACIU,IAAU5B,IACnB2B,EAAI,KAAK,GAAG,EACZR,GAAK,IAELQ,EAAI,KAAK,GAAG,EACZT,GAAK,GAEPU,EAAQC,CACV,CACA,QAAWzB,KAAMuB,EAAI,QAAO,EAC1BzB,GAAWC,EAAOC,EAAI,CAAC,CAE3B,CAOA,SAAS0B,GAAaC,EAAYC,EAAU,CAC1C,IAAMC,EAAQ,KAAK,IAAIF,EAAKC,CAAE,EAQ9B,OANEC,IAAU,EACN,EACA,KAAK,IACH,CAACrC,GAAYqC,EAAQ,GAAKpC,GAC1B,CAACD,EAAW,GAAK,KAAK,KAAKqC,CAAK,CAAC,IAErB,KAAK,IAAIF,EAAIC,CAAE,EAAI,EAAI,CAACrC,GAAW,EACzD,CAMA,SAASuC,GAAaH,EAAYC,EAAU,CAC1C,IAAMC,EAAQ,KAAK,IAAIF,EAAKC,CAAE,EAC9B,OAAOC,IAAU,EAAI,EAAI,IAAO1C,EAAO0C,EAAQ,GAAM,KAAK,KAAKA,CAAK,CACtE,CAYA,SAASE,GAASC,EAAUP,EAAcQ,EAAU,CAClD,MAAO,CACL,GAAID,EAAI,GAAKP,EACb,GAAIO,EAAI,GAAKC,EACb,GAAID,EAAI,QAAUA,EAAI,GAAKC,EAAKD,EAAI,GAAKP,EACzC,GAAIO,EAAI,QAAUA,EAAI,GAAKP,EAAOO,EAAI,GAAKC,EAC3C,QAASD,EAAI,QAEjB,CAMA,SAASE,GAAcF,EAAUG,EAAmBC,EAAkB,CACpE,IAAMnC,EAAM+B,EAAI,GAAKA,EAAI,GACnBK,EAAsB,CAAA,EAC5B,OAAW,CAACC,EAAGC,CAAC,IAAKJ,EAAO,CAC1B,IAAMK,EAAK,KAAK,IAAI,EAAGF,EAAIN,EAAI,EAAE,EAC3BS,EAAK,KAAK,IAAIxC,EAAKsC,EAAIP,EAAI,EAAE,EAC/BQ,EAAKC,GACPJ,EAAQ,KAAK,CAACG,EAAIC,CAAE,CAAC,CAEzB,CACA,OAAW,CAACH,EAAGC,CAAC,IAAKH,EAAQ,CAC3B,IAAMI,EAAK,KAAK,IAAI,EAAGR,EAAI,QAAUA,EAAI,GAAKO,EAAID,EAAIN,EAAI,EAAE,EACtDS,EAAK,KAAK,IAAIxC,EAAK+B,EAAI,QAAUA,EAAI,GAAKM,EAAIC,EAAIP,EAAI,EAAE,EAC1DQ,EAAKC,GACPJ,EAAQ,KAAK,CAACG,EAAIC,CAAE,CAAC,CAEzB,CACA,GAAIJ,EAAQ,SAAW,EACrB,MAAO,CAACL,CAAG,EAEbK,EAAQ,KAAK,CAACK,EAAGC,IAAMD,EAAE,CAAC,EAAIC,EAAE,CAAC,CAAC,EAClC,IAAMC,EAAgB,CAAA,EAClBnB,EAAO,EACX,OAAW,CAACe,EAAIC,CAAE,IAAKJ,EACjBG,EAAKf,GAAQtC,GACfyD,EAAO,KAAKb,GAASC,EAAKP,EAAMe,CAAE,CAAC,EAErCf,EAAO,KAAK,IAAIA,EAAMgB,CAAE,EAE1B,OAAIxC,EAAMwB,GAAQtC,GAChByD,EAAO,KAAKb,GAASC,EAAKP,EAAMxB,CAAG,CAAC,EAE/B2C,CACT,CAOA,SAASC,GACPC,EACAC,EACAC,EACAC,EACAC,EAAY,IAAQ,CAEpB,IAAMC,EAAmB,CAAA,EACnBC,EAAa,CAAE,MAAO,CAAA,EAAkB,OAAQ,CAAA,CAAgB,EAChEC,EAAY,CAChB,QAAS,CAAE,MAAO,CAAA,EAAkB,OAAQ,CAAA,CAAgB,EAC5D,QAAS,CAAE,MAAO,CAAA,EAAkB,OAAQ,CAAA,CAAgB,GAE1DC,EAAO,CAAC,GAAGR,CAAI,EAAE,KAAK,CAACtC,EAAGC,IAAMD,EAAE,GAAKC,EAAE,IAAMD,EAAE,GAAKC,EAAE,EAAE,EAC9D,KAAO6C,EAAK,OAAS,GAAKH,EAAO,OAASD,GAAW,CACnD,IAAMK,EAAQD,EAAK,IAAItB,GAAOA,EAAI,GAAKA,EAAI,EAAE,EACvCwB,EAAO,IAAI,WAAWF,EAAK,MAAM,EAAE,KAAK,EAAE,EAC1CG,EAAQ,IAAI,WAAWH,EAAK,MAAM,EACxC,QAASxC,EAAI,EAAGA,EAAIwC,EAAK,OAAQxC,IAAK,CACpC,IAAM,EAAIwC,EAAKxC,CAAC,EACVb,EAAM,EAAE,GAAK,EAAE,GACrB,QAASc,EAAID,EAAI,EAAGC,GAAK,KAAK,IAAI,EAAGD,EAAI5B,EAAc,EAAG6B,IAAK,CAC7D,GAAIwC,EAAMxC,CAAC,EAAKd,GAAOsD,EAAMzC,CAAC,EAC5B,SAEF,IAAMN,EAAI8C,EAAKvC,CAAC,EAKhB,GAHEP,EAAE,UAAY,EAAE,SAChBA,EAAE,GAAK,EAAE,KACR,EAAE,QAAU,EAAE,GAAKA,EAAE,GAAKA,EAAE,GAAK,EAAE,IACxB,CACZ,IAAMkD,EAAO,KAAK,IAChB,EACAlD,EAAE,GAAK,EAAE,GACT,EAAE,QAAU,EAAE,GAAKA,EAAE,GAAKA,EAAE,GAAK,EAAE,EAAE,EAEjCmB,EAAK,EAAE,GAAK+B,EAAOlD,EAAE,GACrBoB,EAAK,EAAE,QAAUpB,EAAE,IAAM,EAAE,GAAKkD,GAAQ,EAAE,GAAKA,EAAOlD,EAAE,GAC9D,GAAIkD,EAAOzD,GAAO0B,GAAMoB,GAAUnB,GAAMmB,EAAQ,CAC9C,IAAMY,EAAYJ,EAAMxC,CAAC,EAAKd,EAAMyD,EAAOT,EAAStB,EAAIC,CAAE,EACtD+B,EAAYJ,EAAMzC,CAAC,IACrByC,EAAMzC,CAAC,EAAI6C,EACXH,EAAK1C,CAAC,EAAIC,EACV0C,EAAM3C,CAAC,EAAI4C,EAEf,CACF,CACF,CACF,CACA,IAAIE,EAAM,EACV,QAAS9C,EAAI,EAAGA,EAAIwC,EAAK,OAAQxC,IAC3ByC,EAAMzC,CAAC,EAAKyC,EAAMK,CAAG,IACvBA,EAAM9C,GAGV,IAAM+C,EAAgB,CAAA,EACtB,QAAS/C,EAAI8C,EAAK9C,GAAK,EAAGA,EAAI0C,EAAK1C,CAAC,EAClC+C,EAAM,KAAK,CAAE,IAAKP,EAAKxC,CAAC,EAAI,KAAM2C,EAAM3C,CAAC,CAAE,CAAE,EAO/C,GALA+C,EAAM,QAAO,EACGA,EAAM,OACpB,CAACC,EAAK,CAAE,IAAA9B,EAAK,KAAA0B,CAAI,IAAOI,EAAM9B,EAAI,GAAKA,EAAI,GAAK0B,EAChD,CAAC,EAEWV,EACZ,MAEFG,EAAO,KAAKU,CAAK,EAMjB,IAAME,EAAQF,EAAM,CAAC,EACf3D,EAAO2D,EAAM,GAAG,EAAE,EAClB,CAAE,QAAAG,CAAO,EAAKD,EAAM,IACpBE,EAAQD,EAAUX,EAAU,QAAUA,EAAU,QACtDY,EAAM,MAAM,KAAK,CAACF,EAAM,IAAI,GAAKA,EAAM,KAAM7D,EAAK,IAAI,EAAE,CAAC,EACzD+D,EAAM,OAAO,KACXD,EACI,CAAC9D,EAAK,IAAI,GAAI6D,EAAM,IAAI,GAAKA,EAAM,IAAI,EACvC,CAACA,EAAM,IAAI,GAAKA,EAAM,KAAM7D,EAAK,IAAI,EAAE,CAAC,EAE9C,OAAW,CAAE,IAAA8B,EAAK,KAAA0B,CAAI,IAAMG,EAC1BT,EAAW,MAAM,KAAK,CAACpB,EAAI,GAAK0B,EAAM1B,EAAI,EAAE,CAAC,EAC7CoB,EAAW,OAAO,KAChBpB,EAAI,QAAU,CAACA,EAAI,GAAIA,EAAI,GAAK0B,CAAI,EAAI,CAAC1B,EAAI,GAAK0B,EAAM1B,EAAI,EAAE,CAAC,EAGnEsB,EAAOA,EACJ,QAAQtB,GAAM,CACb,IAAMkC,EAAOlC,EAAI,QAAUqB,EAAU,QAAUA,EAAU,QACzD,OAAOnB,GACLF,EACA,CAAC,GAAGoB,EAAW,MAAO,GAAGc,EAAK,KAAK,EACnC,CAAC,GAAGd,EAAW,OAAQ,GAAGc,EAAK,MAAM,CAAC,CAE1C,CAAC,EACA,KAAK,CAACxB,EAAGC,IAAMD,EAAE,GAAKC,EAAE,IAAMD,EAAE,GAAKC,EAAE,EAAE,CAC9C,CACA,OAAOQ,CACT,CAIA,SAASgB,GAAgB3D,EAAWC,EAAS,CAC3C,IAAM2D,EAAQ,IAAI,IAClB,QAASC,EAAI,EAAGA,EAAIlF,GAAQsB,EAAE,OAAQ4D,IAAK,CACzC,IAAMC,EAAO7D,EAAE,MAAM4D,EAAGA,EAAIlF,CAAI,EAC1BoF,EAAOH,EAAM,IAAIE,CAAI,EACvBC,EACFA,EAAK,KAAKF,CAAC,EAEXD,EAAM,IAAIE,EAAM,CAACD,CAAC,CAAC,CAEvB,CACA,IAAMvB,EAAc,CAAA,EACd0B,EAAO,IAAI,IACjB,QAASzD,EAAI,EAAGA,EAAI5B,GAAQqB,EAAE,OAAQO,IAAK,CACzC,IAAM0D,EAAOL,EAAM,IAAI5D,EAAE,MAAMO,EAAGA,EAAI5B,CAAI,CAAC,EAC3C,GAAIsF,GAAQA,EAAK,QAAUrF,GACzB,QAAWiF,KAAKI,EAAM,CACpB,IAAMrE,EAAWiE,EAAItD,EACfiB,EAAMwC,EAAK,IAAIpE,CAAQ,EAC7B,GAAI4B,GAAOjB,GAAKiB,EAAI,GAClBA,EAAI,GAAKjB,EAAI5B,EACb6C,EAAI,GAAKqC,EAAIlF,MACR,CACL,IAAMuF,EAAU,CACd,GAAI3D,EACJ,GAAIA,EAAI5B,EACR,GAAIkF,EACJ,GAAIA,EAAIlF,EACR,QAAS,IAEXqF,EAAK,IAAIpE,EAAUsE,CAAO,EAC1B5B,EAAK,KAAK4B,CAAO,CACnB,CACF,CAEJ,CACA,OAAO5B,CACT,CAEA,SAAS6B,GAASnE,EAAWC,EAAS,CACpC,MAAO,CACL,GAAG0D,GAAgB3D,EAAGC,CAAC,EACvB,GAAG0D,GAAgB3D,EAAGoE,GAAkBnE,CAAC,CAAC,EAAE,IAAIuB,IAAQ,CACtD,GAAGA,EACH,GAAIvB,EAAE,OAASuB,EAAI,GACnB,GAAIvB,EAAE,OAASuB,EAAI,GACnB,QAAS,IACT,EAEN,CAKA,SAAS6C,GACPhB,EACArD,EACAC,EACAV,EACA+E,EAMS,CAET,IAAIC,EACJ,OAAW,CAAE,IAAA/C,EAAK,KAAA0B,CAAI,IAAMG,EAAO,CACjC,IAAMmB,EAAKhD,EAAI,GAAK0B,EACpB,GAAIqB,EAAU,CACZ,IAAME,EAAajD,EAAI,QAAUA,EAAI,GAAK0B,EAAOqB,EAAS,GACpDG,EAAWlD,EAAI,QAAU+C,EAAS,GAAK/C,EAAI,GAAK0B,EAChDtB,EAAS3B,EAAE,MAAMwE,EAAYC,CAAQ,EAC3CJ,EACEtE,EAAE,MAAMuE,EAAS,GAAIC,CAAE,EACvBhD,EAAI,QAAU4C,GAAkBxC,CAAM,EAAIA,EAC1CrC,EACAgF,EAAS,GACTE,CAAU,CAEd,CACAnF,GAAWC,EAAO,IAAKiC,EAAI,GAAKgD,CAAE,EAClCD,EAAW/C,CACb,CACF,CAIA,SAASmD,GAAW3E,EAAWC,EAAWV,EAAiB,CACrDS,EAAE,OAASC,EAAE,QAAUxB,GACzBsB,GAAgBC,EAAGC,EAAGV,CAAK,GAE3BD,GAAWC,EAAO,IAAKS,EAAE,MAAM,EAC/BV,GAAWC,EAAO,IAAKU,EAAE,MAAM,EAEnC,CAMA,SAAS2E,GAAQ5E,EAAWC,EAAWV,EAAmBsF,EAAQ,EAAC,CACjE,GAAM,CAACxB,CAAK,EACVrD,EAAE,OAASC,EAAE,OAASxB,IAAqBoG,EAAQhG,GAC/CwD,GAAUsB,GAAgB3D,EAAGC,CAAC,EAAG,IAAUtB,EAAM2C,GAAc,CAAC,EAChE,CAAA,EACN,GAAI,CAAC+B,EAAO,CACVsB,GAAW3E,EAAGC,EAAGV,CAAK,EACtB,MACF,CACA,IAAMuF,EAAS,CAACC,EAAYC,EAAYC,IAAoB,CAC1DL,GAAQG,EAAIC,EAAIC,EAAMJ,EAAQ,CAAC,CACjC,EACMtB,EAAQF,EAAM,CAAC,EAAG,IAClB3D,EAAO2D,EAAM,GAAG,EAAE,EAAG,IAC3ByB,EAAO9E,EAAE,MAAM,EAAGuD,EAAM,EAAE,EAAGtD,EAAE,MAAM,EAAGsD,EAAM,EAAE,EAAGhE,CAAK,EACxD8E,GAAWhB,EAAOrD,EAAGC,EAAGV,EAAOuF,CAAM,EACrCA,EAAO9E,EAAE,MAAMN,EAAK,EAAE,EAAGO,EAAE,MAAMP,EAAK,EAAE,EAAGH,CAAK,CAClD,CAEA,SAAS2F,GAAKlF,EAAWC,EAAWV,EAAiB,CACnDqF,GAAQ5E,EAAGC,EAAGV,CAAK,CACrB,CAGA,SAAS4F,GAAS9B,EAAerD,EAAWC,EAAS,CACnD,IAAMV,EAAoB,CAAA,EAC1B8E,GAAWhB,EAAOrD,EAAGC,EAAGV,EAAO2F,EAAI,EACnC,IAAM3B,EAAQF,EAAM,CAAC,EACf3D,EAAO2D,EAAM,GAAG,EAAE,EAClB,CAAE,QAAAG,CAAO,EAAKD,EAAM,IAC1B,MAAO,CACL,WAAYA,EAAM,IAAI,GAAKA,EAAM,KACjC,SAAU7D,EAAK,IAAI,GACnB,YAAa8D,EAAU9D,EAAK,IAAI,GAAK6D,EAAM,IAAI,GAAKA,EAAM,KAC1D,UAAWC,EAAUD,EAAM,IAAI,GAAKA,EAAM,KAAO7D,EAAK,IAAI,GAC1D,OAAQ8D,EAAU,IAAM,IACxB,MAAOA,EAAUjE,EAAM,QAAO,EAAKA,EACnC,YAAa,EAEjB,CASA,SAAS6F,GACPpF,EACAC,EACAV,EACAiD,EAAgB,CAEhB,IAAI6C,EAA0B,CAAA,EAC9B,GAAIrF,EAAE,OAASC,EAAE,QAAUxB,GACzBsB,GAAgBC,EAAGC,EAAGV,CAAK,MACtB,CACL,IAAMoD,EAASN,GACb8B,GAASnE,EAAGC,CAAC,EACb,IACA,KAAK,IAAIuC,EAAU7D,CAAI,EACvB2C,EAAY,EAERgE,EAAU3C,EAAO,KAAKU,GAAS,CAACA,EAAM,CAAC,EAAG,IAAI,OAAO,EAI3D,GAHAgC,EAAa1C,EACV,OAAOU,GAASA,EAAM,CAAC,EAAG,IAAI,OAAO,EACrC,IAAIA,GAAS8B,GAAS9B,EAAOrD,EAAGC,CAAC,CAAC,EACjCqF,EAAS,CAKX,IAAMC,EAAc,CAClBR,EACAC,EACAC,EACAO,EACAf,IACE,CACqBY,EAAW,KAChCI,GACGD,EAAYC,EAAU,UACrBA,EAAU,WAAaD,EAAYT,EAAG,QACvCN,EAAagB,EAAU,WACtBA,EAAU,YAAchB,EAAaO,EAAG,MAAO,EAGnDL,GAAWI,EAAIC,EAAIC,CAAI,EAEvBL,GAAQG,EAAIC,EAAIC,CAAI,CAExB,EACM1B,EAAQ+B,EAAQ,CAAC,EAAG,IACpB5F,EAAO4F,EAAQ,GAAG,EAAE,EAAG,IAC7BC,EAAYvF,EAAE,MAAM,EAAGuD,EAAM,EAAE,EAAGtD,EAAE,MAAM,EAAGsD,EAAM,EAAE,EAAGhE,EAAO,EAAG,CAAC,EACnE8E,GAAWiB,EAAStF,EAAGC,EAAGV,EAAOgG,CAAW,EAC5CA,EAAYvF,EAAE,MAAMN,EAAK,EAAE,EAAGO,EAAE,MAAMP,EAAK,EAAE,EAAGH,EAAOG,EAAK,GAAIA,EAAK,EAAE,CACzE,MACEJ,GAAWC,EAAO,IAAKS,EAAE,MAAM,EAC/BV,GAAWC,EAAO,IAAKU,EAAE,MAAM,CAEnC,CACA,OAAOoF,CACT,CAWA,SAASK,GACP,EACAC,EAAuE,CAEvE,IAAMnC,EAAU,EAAE,SAAW,IACzBoC,EAAK,EACLC,EAAK,EACT,OAAW,CAACrG,EAAIC,CAAG,IAAK,EAAE,MACxBkG,EACEnG,EACAC,EACA+D,EAAU,EAAE,SAAW,EAAIoC,EAAK,EAAE,WAAaA,EAC/C,EAAE,YAAcC,CAAE,EAEhBrG,IAAO,MACToG,GAAMnG,GAEJD,IAAO,MACTqG,GAAMpG,EAGZ,CAIA,SAASqG,GAAU,EAAcC,EAAY/D,EAAYC,EAAU,CACjE,IAAM+D,EAAOD,IAAS,SAAW,EAAE,SAAW,IAAM,GAAK,EACrDhD,EAAQ,EACZ,OAAA2C,GAAY,EAAG,CAAClG,EAAIC,EAAKkC,EAAOC,IAAU,CACxC,IAAMX,EAAO8E,IAAS,QAAUpE,EAAQC,EAClCqE,EAAUC,GAAa,CAC3B,IAAMC,EAAKlF,EAAO+E,EAAOE,EACzB,OAAOC,GAAMnE,GAAMmE,EAAKlE,CAC1B,EACA,GAAIzC,IAAO,KAAOA,IAAO,IACvB,QAAS0G,EAAI,EAAGA,EAAIzG,EAAKyG,IACnBD,EAAOC,CAAC,IACVnD,GAASvD,IAAO,IAAMV,GAAQC,YAGxBS,IAAO,MAAUuG,IAAS,SACpC,QAASG,EAAI,EAAGA,EAAIzG,EAAKyG,IACnBD,EAAOC,CAAC,IACVnD,GAASmD,IAAM,EAAIlH,EAAWC,SAGzBgH,EAAO,CAAC,IACjBlD,GAAS/D,GAAYS,EAAM,GAAKR,GAEpC,CAAC,EACM8D,CACT,CAEA,SAASqD,GAAO,EAAcL,EAAU,CACtC,OAAOA,IAAS,QACZ,CAAC,EAAE,WAAY,EAAE,QAAQ,EACzB,CAAC,EAAE,YAAa,EAAE,SAAS,CACjC,CAIA,SAASM,GAAe,EAAYC,EAAgB,CAClD,IAAM9C,EAAU,EAAE,SAAW,IACvBjE,EAAoB,CAAA,EACtBgH,EAAe,EACfC,EAAgB,EAChBC,EAAS,EACTC,EAAa,EACXC,EAAa,IAAI,WAAW,EAAE,SAAW,EAAE,UAAU,EAC3D,OAAW,CAAC7E,EAAGC,CAAC,IAAK,EAAE,OACrB4E,EAAW,KAAK,EAAG7E,EAAI,EAAE,WAAYC,EAAI,EAAE,UAAU,EAEvD,IAAM6E,EAAYT,GAAeQ,EAAWR,EAAK,EAAE,UAAU,IAAM,EAC7DU,EAAQ,IAAK,CACjBvH,GAAWC,EAAO,IAAKgH,CAAY,EACnCjH,GAAWC,EAAO,IAAKiH,CAAa,EACpCD,EAAe,EACfC,EAAgB,CAClB,EACAd,GAAY,EAAG,CAAClG,EAAIC,EAAKkC,IAAS,CAChC,GAAInC,IAAO,IACT+G,GAAgB9G,UACPD,IAAO,IAChBgH,GAAiB/G,MACZ,CACL,QAASyG,EAAI,EAAGA,EAAIzG,EAAKyG,IACnBI,EAAKG,EAASP,CAAC,GACjBK,GAAgB,EAChBC,GAAiB,EACbI,EAASpD,EAAU7B,EAAQuE,EAAIvE,EAAQuE,CAAC,IAC1CQ,GAAc,MAGZH,EAAe,GAAKC,EAAgB,IACtCK,EAAK,EAEPvH,GAAWC,EAAOC,EAAI,CAAC,GAG3BiH,GAAUhH,CACZ,CACF,CAAC,EACDoH,EAAK,EACL,IAAMC,EAAO,CAAE,EAAG,EAAG,EAAG,CAAC,EACzB,KAAOvH,EAAM,CAAC,IAAI,CAAC,IAAM,KAAOA,EAAM,CAAC,IAAI,CAAC,IAAM,KAAK,CACrD,GAAM,CAACC,EAAIC,CAAG,EAAIF,EAAM,MAAK,EAC7BuH,EAAKtH,CAAe,GAAKC,CAC3B,CACA,IAAMsH,EAAO,CAAE,EAAG,EAAG,EAAG,CAAC,EACzB,KAAOxH,EAAM,GAAG,EAAE,IAAI,CAAC,IAAM,KAAOA,EAAM,GAAG,EAAE,IAAI,CAAC,IAAM,KAAK,CAC7D,GAAM,CAACC,EAAIC,CAAG,EAAIF,EAAM,IAAG,EAC3BwH,EAAKvH,CAAe,GAAKC,CAC3B,CACA,OAAOF,EAAM,SAAW,EACpB,OACA,CACE,GAAG,EACH,WAAY,EAAE,YAAciE,EAAUuD,EAAK,EAAID,EAAK,GACpD,SAAU,EAAE,UAAYtD,EAAUsD,EAAK,EAAIC,EAAK,GAChD,YAAa,EAAE,YAAcD,EAAK,EAClC,UAAW,EAAE,UAAYC,EAAK,EAC9B,MAAAxH,EACA,YAAa,EAAE,YAAcmH,EAErC,CAQA,SAASM,GACPC,EACAC,EACAC,EACA3E,EAAgB,CAEhB,IAAM4E,EAAS,CACb,MAAO,IAAI,WAAWF,CAAW,EACjC,OAAQ,IAAI,WAAWC,CAAY,GAE/BE,EAAYJ,EAAQ,IAAIK,GAAI,CAChC,IAAMC,EAA8B,CAAA,EACpC7B,GAAY4B,EAAG,CAAC9H,EAAIC,EAAKkC,EAAOC,IAAU,CACxC,GAAIpC,IAAO,KAAOA,IAAO,IACvB,QAAS0G,EAAI,EAAGA,EAAIzG,EAAKyG,IACvBqB,EAAQ,KAAK,CAACD,EAAE,SAAW,IAAM3F,EAAQuE,EAAIvE,EAAQuE,EAAGtE,EAASsE,CAAC,CAAC,CAGzE,CAAC,EACD,OAAW,CAACvE,EAAOC,CAAM,IAAK2F,EAC5BH,EAAO,MAAMzF,CAAK,EAAI,KAAK,IAAI,IAAKyF,EAAO,MAAMzF,CAAK,EAAK,CAAC,EAC5DyF,EAAO,OAAOxF,CAAM,EAAI,KAAK,IAAI,IAAKwF,EAAO,OAAOxF,CAAM,EAAK,CAAC,EAElE,OAAO2F,CACT,CAAC,EACKC,EAAU,CACd,MAAO,IAAI,IACX,OAAQ,IAAI,KAEdH,EAAU,QAAQ,CAACE,EAAShH,IAAK,CAC/B,OAAW,CAACoB,EAAOC,CAAM,IAAK2F,EAC5B,OAAW,CAACxB,EAAMI,CAAE,GAAK,CACvB,CAAC,QAASxE,CAAK,EACf,CAAC,SAAUC,CAAM,GAEjB,GAAIwF,EAAOrB,CAAI,EAAEI,CAAE,EAAK,EAAG,CACzB,IAAMsB,EAAOD,EAAQzB,CAAI,EAAE,IAAII,CAAE,EAC5BsB,EAEMA,EAAK,GAAG,EAAE,IAAMlH,GACzBkH,EAAK,KAAKlH,CAAC,EAFXiH,EAAQzB,CAAI,EAAE,IAAII,EAAI,CAAC5F,CAAC,CAAC,CAI7B,CAGN,CAAC,EACD,IAAMmH,EAAS,IAAI,IACbC,EAAU,CAACpH,EAAWD,EAAWyF,IAAc,CACnD,IAAM6B,EAAM,GAAG7B,CAAI,IAAIxF,CAAC,IAAID,CAAC,GACzBuH,EAAQH,EAAO,IAAIE,CAAG,EAC1B,GAAIC,IAAU,OAAW,CACvB,GAAM,CAACC,EAAIC,CAAE,EAAI3B,GAAOa,EAAQ1G,CAAC,EAAIwF,CAAI,EACnC,CAACiC,EAAIC,CAAE,EAAI7B,GAAOa,EAAQ3G,CAAC,EAAIyF,CAAI,EACnC/D,EAAK,KAAK,IAAI8F,EAAIE,CAAE,EACpB/F,EAAK,KAAK,IAAI8F,EAAIE,CAAE,EAC1BJ,EACE/B,GAAUmB,EAAQ1G,CAAC,EAAIwF,EAAM/D,EAAIC,CAAE,EACnC6D,GAAUmB,EAAQ3G,CAAC,EAAIyF,EAAM/D,EAAIC,CAAE,EACrCyF,EAAO,IAAIE,EAAKC,CAAK,CACvB,CACA,OAAOA,CACT,EACA,OAAOZ,EAAQ,QAAQ,CAACK,EAAG/G,IAAK,CAC9B,IAAMgH,EAAUF,EAAU9G,CAAC,EACrB+F,EAAO,IAAI,WAAWiB,EAAQ,MAAM,EAc1C,GAbAA,EAAQ,QAAQ,CAAC,CAAC5F,EAAOC,CAAM,EAAGsG,IAAK,CACrC,OAAW,CAACnC,EAAMI,CAAE,GAAK,CACvB,CAAC,QAASxE,CAAK,EACf,CAAC,SAAUC,CAAM,GAGf,CAAC0E,EAAK4B,CAAC,GACPV,EAAQzB,CAAI,EAAE,IAAII,CAAE,GAAG,KAAK7F,GAAKA,IAAMC,GAAKoH,EAAQpH,EAAGD,EAAGyF,CAAI,CAAC,IAE/DO,EAAK4B,CAAC,EAAI,EAGhB,CAAC,EACG,CAAC5B,EAAK,SAAS,CAAC,EAClB,MAAO,CAACgB,CAAC,EAEX,IAAMa,EAAO9B,GAAeiB,EAAGhB,CAAI,EAC7B8B,EACJD,GAAM,MAAM,OAAO,CAAC7E,EAAK,CAAC9D,EAAIC,CAAG,IAAM6D,GAAO9D,IAAO,IAAMC,EAAM,GAAI,CAAC,GACtE,EACF,OAAO0I,GAAQC,GAAW5F,EAAW,CAAC2F,CAAI,EAAI,CAAA,CAChD,CAAC,CACH,CAEA,SAASE,GAAaC,EAAgBC,EAAkC,CACtE,OAAOD,EACJ,IAAIE,GAAS,CACZ,IAAMC,EAAWF,EAAWG,EAAOF,CAAM,CAAC,EAC1C,OAAOG,EAAUH,CAAM,EAAIpE,GAAkBqE,CAAQ,EAAIA,CAC3D,CAAC,EACA,KAAK,EAAE,CACZ,CAEA,SAASG,GAAYN,EAAgBC,EAAkC,CACrE,IAAMM,EAAU,CAAC,CAAC,EAClB,QAAWL,KAAUF,EACnBO,EAAQ,KAAKA,EAAQ,GAAG,EAAE,EAAKN,EAAWG,EAAOF,CAAM,CAAC,EAAE,MAAM,EAElE,OAAOK,CACT,CAMA,SAASC,GAAYR,EAAc,CACjC,IAAM/E,EAAQ,IAAI,IACZ7D,EAAO,IAAI,IACjB4I,EAAK,QAAQ,CAACE,EAAQjI,IAAK,CACzB,IAAMwI,EAAKL,EAAOF,CAAM,EACpBjF,EAAM,IAAIwF,CAAE,EACdrJ,EAAK,IAAIqJ,EAAIxI,CAAC,EAEdgD,EAAM,IAAIwF,EAAIxI,CAAC,CAEnB,CAAC,EACD,IAAMyI,EAAS,IAAI,WAAWV,EAAK,OAAS,CAAC,EAC7C,OAAW,CAACS,EAAI3F,CAAG,IAAK1D,EACtBsJ,EAAOzF,EAAM,IAAIwF,CAAE,CAAE,GAAM,EAC3BC,EAAO5F,EAAM,CAAC,GAAM,EAEtB,IAAM6C,EAAS,IAAI,WAAWqC,EAAK,MAAM,EACrCzD,EAAQ,EACZ,QAAS,EAAI,EAAG,EAAIyD,EAAK,OAAQ,IAC/BzD,GAASmE,EAAO,CAAC,EACjB/C,EAAO,CAAC,EAAIpB,EAAQ,EAAI,EAAI,EAE9B,OAAOoB,CACT,CAIA,SAASgD,GACPtH,EACAC,EACAsH,EACAC,EAAuB,CAEvB,IAAMC,EAAcN,GAAYnH,CAAK,EAC/B0H,EAAeP,GAAYlH,CAAM,EACjC0H,EAAS,IAAI,IACnB1H,EAAO,QAAQ,CAAC4G,EAAQe,IAAQ,CACzBF,EAAaE,CAAI,GACpBD,EAAO,IAAIZ,EAAOF,CAAM,EAAG,CAACe,CAAI,CAAC,CAErC,CAAC,EACD,IAAMnJ,EAAQ,EAAIwB,EAAO,OACnBgG,EAAM,CAACrH,EAAWgJ,EAAc/F,IACpCjD,EAAIH,EAAQ,EAAImJ,GAAQ/F,EAAU,EAAI,GAClCgG,EAAQ,IAAI,IAClB7H,EAAM,QAAQ,CAAC6G,EAAQjI,IAAK,CAC1B,QAAWgJ,KAAQH,EAAY7I,CAAC,EAC5B,CAAA,EACC+I,EAAO,IAAIZ,EAAOF,CAAM,CAAC,GAAK,CAAA,EACjCgB,EAAM,IAAI5B,EAAIrH,EAAGgJ,EAAMZ,EAAUH,CAAM,IAAMG,EAAU/G,EAAO2H,CAAI,CAAE,CAAC,CAAC,CAE1E,CAAC,EACD,IAAMjH,EAAc,CAAA,EACpB,OAAAX,EAAM,QAAQ,CAAC6G,EAAQjI,IAAK,CAC1B,QAAWgJ,KAAQH,EAAY7I,CAAC,EAC5B,CAAA,EACC+I,EAAO,IAAIZ,EAAOF,CAAM,CAAC,GAAK,CAAA,EAAK,CACtC,IAAMhF,EAAUmF,EAAUH,CAAM,IAAMG,EAAU/G,EAAO2H,CAAI,CAAE,EACvDvD,EAAOxC,EAAU,GAAK,EAC5B,GAAI,CAACgG,EAAM,IAAI5B,EAAIrH,EAAI,EAAGgJ,EAAOvD,EAAMxC,CAAO,CAAC,EAAG,CAChD,IAAIlD,EAAIC,EACJ+G,EAAIiC,EACR,KACEjJ,EAAIqB,EAAM,QACV2F,GAAK,GACLA,EAAI1F,EAAO,QACX4H,EAAM,IAAI5B,EAAItH,EAAGgH,EAAG9D,CAAO,CAAC,GAE5BlD,GAAK,EACLgH,GAAKtB,EAEP,IAAMyD,EAAWnC,EAAItB,EACrB1D,EAAK,KAAK,CACR,GAAI4G,EAAa3I,CAAC,EAClB,GAAI2I,EAAa5I,CAAC,EAClB,GAAI6I,EAAc,KAAK,IAAII,EAAME,CAAQ,CAAC,EAC1C,GAAIN,EAAc,KAAK,IAAII,EAAME,CAAQ,EAAI,CAAC,EAC9C,QAAAjG,EACD,CACH,CACF,CACF,CAAC,EACMlB,CACT,CAWM,SAAUoH,GACd/H,EACAC,EACA2G,EACAoB,EAAoB,CAAA,EAAE,CAEtB,IAAM3J,EAAIqI,GAAa1G,EAAO4G,CAAU,EAClCtI,EAAIoI,GAAazG,EAAQ2G,CAAU,EACnCjG,EAAO2G,GACXtH,EACAC,EACAgH,GAAYjH,EAAO4G,CAAU,EAC7BK,GAAYhH,EAAQ2G,CAAU,CAAC,EAE3B/F,EAAWmH,EAAK,UAAYnL,GAC5ByI,EAAqB,CAAA,EAC3B,QAAW5D,KAAShB,GAClBC,EACAqH,EAAK,QAAU,IACfnH,EACAtB,EAAY,EACX,CACD,IAAM3B,EAAoB,CAAA,EACpBgE,EAAQF,EAAM,CAAC,EACf3D,EAAO2D,EAAM,GAAG,EAAE,EAClB,CAAE,QAAAG,CAAO,EAAKD,EAAM,IAC1Bc,GAAWhB,EAAOrD,EAAGC,EAAGV,EAAO,CAACwF,EAAIC,EAAIC,EAAMO,EAAWf,IAAc,CACrE,QAAWgB,KAAaL,GAAaL,EAAIC,EAAIC,EAAMzC,CAAQ,EAAG,CAC5D,IAAMkC,EAAWD,EAAaO,EAAG,OACjCiC,EAAQ,KAAK,CACX,GAAGxB,EACH,WAAYD,EAAYC,EAAU,WAClC,SAAUD,EAAYC,EAAU,SAChC,YAAajC,EACTkB,EAAWe,EAAU,UACrBhB,EAAagB,EAAU,YAC3B,UAAWjC,EACPkB,EAAWe,EAAU,YACrBhB,EAAagB,EAAU,UAC3B,OAAQjC,EAAU,IAAM,IACxB,MAAOA,EAAUiC,EAAU,MAAM,QAAO,EAAKA,EAAU,MACvD,OAAQ,CAAA,EACT,CACH,CACF,CAAC,EACDwB,EAAQ,KAAK,CACX,WAAY1D,EAAM,IAAI,GAAKA,EAAM,KACjC,SAAU7D,EAAK,IAAI,GACnB,YAAa8D,EAAU9D,EAAK,IAAI,GAAK6D,EAAM,IAAI,GAAKA,EAAM,KAC1D,UAAWC,EAAUD,EAAM,IAAI,GAAKA,EAAM,KAAO7D,EAAK,IAAI,GAC1D,OAAQ8D,EAAU,IAAM,IACxB,MAAOA,EAAUjE,EAAM,QAAO,EAAKA,EACnC,YAAa8D,EAAM,OACjB,CAACC,EAAK,CAAE,IAAA9B,EAAK,KAAA0B,CAAI,IAAOI,EAAM9B,EAAI,GAAKA,EAAI,GAAK0B,EAChD,CAAC,EAEH,OAAQG,EAAM,IAAI,CAAC,CAAE,IAAA7B,EAAK,KAAA0B,CAAI,IAAO,CAAC1B,EAAI,GAAK0B,EAAM1B,EAAI,EAAE,CAAC,EAC7D,CACH,CACA,OAAOwF,GAAUC,EAASjH,EAAE,OAAQC,EAAE,OAAQuC,CAAQ,EACnD,IAAI,CAAC,CAAE,OAAQoH,EAAG,GAAGC,CAAM,IAAOA,CAAM,EACxC,KAAK,CAAC3H,EAAGC,IAAMD,EAAE,WAAaC,EAAE,UAAU,CAC/C,CAEM,SAAU2H,GAAUvK,EAAiB,CACzC,OAAOA,EAAM,IAAI,CAAC,CAACC,EAAIC,CAAG,IAAM,GAAGA,CAAG,GAAGD,CAAE,EAAE,EAAE,KAAK,EAAE,CACxD,CC/xBM,IAAOuK,EAAP,cAAkC,KAAK,CAClC,KAAO,qBACP,MACA,SACA,SAET,YAAYC,EAAeC,EAA6C,CACtE,MACEA,IAAS,OACL,0BAA0BD,CAAK,kBAC/B,0BAA0BA,CAAK,mBAAmBC,EAAK,QAAQ,cAAcA,EAAK,QAAQ,YAAY,EAE5G,KAAK,MAAQD,EACb,KAAK,SAAWC,GAAM,SACtB,KAAK,SAAWA,GAAM,QACxB,GAGF,SAASC,GACPC,EACAC,EAA6B,CAE7B,OACED,EAAE,CAAC,EAAIC,EAAE,CAAC,GACTD,EAAE,CAAC,IAAMC,EAAE,CAAC,IAAMD,EAAE,CAAC,EAAIC,EAAE,CAAC,GAAMD,EAAE,CAAC,IAAMC,EAAE,CAAC,GAAKD,EAAE,CAAC,EAAIC,EAAE,CAAC,EAElE,CAEA,IAAMC,GAAN,KAAe,CACL,KAAqC,CAAA,EAE7C,KAAKC,EAAkBC,EAAcC,EAAc,CACjD,IAAMC,EAAO,KAAK,KAClBA,EAAK,KAAK,CAACH,EAAUC,EAAMC,CAAI,CAAC,EAChC,IAAIE,EAAID,EAAK,OAAS,EACtB,KAAOC,EAAI,GAAG,CACZ,IAAMC,EAAUD,EAAI,GAAM,EAC1B,GAAIR,GAAWO,EAAKC,CAAC,EAAID,EAAKE,CAAM,CAAE,EACnC,CAACF,EAAKC,CAAC,EAAGD,EAAKE,CAAM,CAAC,EAAI,CAACF,EAAKE,CAAM,EAAIF,EAAKC,CAAC,CAAE,EACnDA,EAAIC,MAEJ,MAEJ,CACF,CAEA,KAAG,CACD,IAAMF,EAAO,KAAK,KACZG,EAAMH,EAAK,CAAC,EACZI,EAAOJ,EAAK,IAAG,EACrB,GAAIA,EAAK,OAAS,GAAKI,IAAS,OAAW,CACzCJ,EAAK,CAAC,EAAII,EACV,IAAIH,EAAI,EACR,OAAS,CACP,IAAMI,EAAO,EAAIJ,EAAI,EACfK,EAAQD,EAAO,EACjBE,EAAWN,EAOf,GANII,EAAOL,EAAK,QAAUP,GAAWO,EAAKK,CAAI,EAAIL,EAAKO,CAAQ,CAAE,IAC/DA,EAAWF,GAETC,EAAQN,EAAK,QAAUP,GAAWO,EAAKM,CAAK,EAAIN,EAAKO,CAAQ,CAAE,IACjEA,EAAWD,GAETC,IAAaN,EACf,MAED,CAACD,EAAKC,CAAC,EAAGD,EAAKO,CAAQ,CAAC,EAAI,CAACP,EAAKO,CAAQ,EAAIP,EAAKC,CAAC,CAAE,EACvDA,EAAIM,CACN,CACF,CACA,OAAOJ,CACT,CAEA,IAAI,MAAI,CACN,OAAO,KAAK,KAAK,MACnB,GAYF,SAASK,GAAUC,EAAyB,CAC1C,IAAMC,EAAS,IAAI,WAAWD,EAAM,MAAM,EACpCE,EAAQ,IAAI,WAAWF,EAAM,MAAM,EACzC,OAAAA,EAAM,QAAQ,CAAC,CAACf,EAAGC,CAAC,EAAGM,IAAK,CAC1BS,EAAOT,CAAC,EAAIP,EACZiB,EAAMV,CAAC,EAAIN,CACb,CAAC,EACM,CAAE,OAAAe,EAAQ,MAAAC,EAAO,MAAOF,EAAM,MAAM,CAC7C,CAMA,SAASG,GAAWC,EAAqBC,EAAa,CACpD,IAAIC,EAAK,EACLC,EAAKH,EAAU,OACnB,KAAOE,EAAKC,GAAI,CACd,IAAMC,EAAOF,EAAKC,GAAO,EACrBH,EAAUI,CAAG,EAAKH,EACpBE,EAAKC,EAELF,EAAKE,EAAM,CAEf,CACA,OAAOJ,EAAUE,CAAE,CACrB,CAEA,SAASG,GAAOC,EAAQ,CACtB,MAAO,GAAGA,EAAI,IAAI,IAAIA,EAAI,MAAM,EAClC,CAqBA,SAASC,GAAS1B,EAAsBC,EAAoB,CAC1D,IAAM0B,EAAY1B,EAAE,SAAU,SAAWD,EAAE,SAAU,OAC/C4B,EACJ5B,EAAE,SAAW,IAAMC,EAAE,SAAWD,EAAE,OAASA,EAAE,SAAWC,EAAE,OAC5D,OAAOD,EAAE,SAAWC,EAAE,QAAU0B,GAAa,GAAKC,GAAY,EAC1D,CAAE,UAAAD,EAAW,SAAAC,CAAQ,EACrB,MACN,CAEA,SAASC,GACP7B,EACAC,EACA6B,EAA4C,CAE5C,GAAM,CAACnB,EAAMC,CAAK,EAAIZ,EAAE,SAAW,IAAM,CAACA,EAAGC,CAAC,EAAI,CAACA,EAAGD,CAAC,EACjD+B,EAAQpB,EAAK,MAAM,IAAI,CAAC,CAACqB,EAAIC,CAAG,IAAY,CAACD,EAAIC,CAAG,CAAC,EAC3DC,GAAUH,EAAOD,EAAI,UAAWA,EAAI,QAAQ,EAC5C,OAAW,CAACE,EAAIC,CAAG,IAAKrB,EAAM,MAC5BuB,EAAWJ,EAAOC,EAAIC,CAAG,EAE3B,IAAMG,EAAcpC,EAAE,SAAU,YAC1B,CAACqC,EAAOC,CAAM,EAAIF,EAAc,CAACpC,EAAGC,CAAC,EAAI,CAACA,EAAGD,CAAC,EACpD,MAAO,CACL,OAAQA,EAAE,OACV,SAAUW,EAAK,SACf,OAAQC,EAAM,OACd,MAAAmB,EACA,OAAQ,OACR,KAAM,CAAC,GAAGM,EAAM,KAAM,GAAGC,EAAO,IAAI,EACpC,MAAOD,EAAM,MACb,SAAU,CACR,WAAYrC,EAAE,SAAU,WACxB,KAAMA,EAAE,SAAU,KAClB,SAAUA,EAAE,SAAU,SACtB,OAAQC,EAAE,SAAU,OACpB,YAAAmC,GAGN,CAEA,SAASG,GAAaC,EAA8B,CAClD,GAAIA,EAAU,KAAKC,GAAKA,EAAE,SAAW,MAAS,EAC5C,OAAOD,EAET,IAAME,EAAS,IAAI,IACnBF,EAAU,QAAQ,CAACG,EAAUC,IAAS,CACpC,GAAID,EAAS,SAAU,CACrB,IAAME,EAAWH,EAAO,IAAIC,EAAS,SAAS,UAAU,EACpDE,EACFA,EAAS,KAAKD,CAAK,EAEnBF,EAAO,IAAIC,EAAS,SAAS,WAAY,CAACC,CAAK,CAAC,CAEpD,CACF,CAAC,EACD,IAAME,EAAS,IAAI,IACbC,EAAW,IAAI,IACrB,QAAWF,KAAYH,EAAO,OAAM,EAAI,CACtCG,EAAS,KACP,CAACG,EAAGC,IACFT,EAAUQ,CAAC,EAAG,SAAU,SAAWR,EAAUS,CAAC,EAAG,SAAU,QAAQ,EAEvE,IAAIC,EAAOL,EAAS,CAAC,EACjBM,EAAUX,EAAUU,CAAI,EAC5B,QAAWN,KAASC,EAAS,MAAM,CAAC,EAAG,CACrC,IAAMO,EAAOZ,EAAUI,CAAK,EACtBd,EAAMJ,GAASyB,EAASC,CAAI,EAC9BtB,GACFqB,EAAUtB,GAASsB,EAASC,EAAMtB,CAAG,EACrCiB,EAAS,IAAIH,CAAK,IAElBE,EAAO,IAAII,EAAMC,CAAO,EACxBD,EAAON,EACPO,EAAUC,EAEd,CACAN,EAAO,IAAII,EAAMC,CAAO,CAC1B,CACA,OAAOX,EAAU,QAAQ,CAACG,EAAUC,IAClCG,EAAS,IAAIH,CAAK,EAAI,CAAA,EAAK,CAACE,EAAO,IAAIF,CAAK,GAAKD,CAAQ,CAAC,CAE9D,CAEA,SAASU,GAAaC,EAAgBC,EAAS,CAC7C,MAAO,CAAE,KAAMD,EAAK,KAAKC,CAAC,EAAI,OAAQD,EAAK,QAAQC,CAAC,CAAE,CACxD,CAEA,IAAMC,GAAW,KAEjB,SAASC,GAAWC,EAAuB,CACzC,IAAMC,EAA2B,CAAA,EACjC,QAAWC,KAAUF,EAAe,CAClC,IAAMhD,EAAOiD,EAAKA,EAAK,OAAS,CAAC,EAC7BjD,GAAQkD,EAASlD,EAAK,CAAC,GAAK8C,GAC9B9C,EAAK,CAAC,EAAIkD,EAEVD,EAAK,KAAK,CAACC,EAAQA,CAAM,CAAC,CAE9B,CACA,OAAOD,CACT,CAmFA,IAAME,GAAmB,MAQnBC,GAAqB,MAE3B,SAASC,GAAUC,EAAiB,CAClC,IAAMC,EAAS,CAAC,GAAGD,CAAO,EAAE,KAAK,CAAChE,EAAGC,IAAMD,EAAIC,CAAC,EAC1C0D,EAA2B,CAAA,EACjC,QAAWC,KAAUK,EAAQ,CAC3B,IAAMvD,EAAOiD,EAAKA,EAAK,OAAS,CAAC,EAC7BjD,GAAQkD,EAASlD,EAAK,CAAC,GAAKmD,GAC9BnD,EAAK,CAAC,EAAIkD,EAEVD,EAAK,KAAK,CAACC,EAAQA,CAAM,CAAC,CAE9B,CACA,OAAOD,CACT,CAEM,IAAOO,GAAP,KAAe,CACX,QAAU,IAAI,IACd,MAAoB,CAAA,EACpB,WAAa,IAAI,IACjB,MACA,QACA,UACA,YACA,cACA,eACA,SACC,MAAuB,CAC9B,kBAAmB,EACnB,cAAe,EACf,oBAAqB,EACrB,sBAAuB,EACvB,eAAgB,CACd,SAAU,EACV,MAAO,CAAA,EACP,cAAe,EACf,gBAAiB,CAAA,EACjB,eAAgB,EAChB,gBAAiB,EACjB,aAAc,EACd,aAAc,EACd,OAAQ,CAAA,GAEV,WAAY,QAGN,GACS,MACA,OAEjB,YAAYC,EAAaC,EAAwB,CAAA,EAAE,CACjD,KAAK,GAAKD,EACV,KAAK,MAAQC,EAAK,MAClB,KAAK,OAASA,EAAK,MACrB,CAEA,IAAI,WAAS,CACX,OAAO,KAAK,QAAQ,KAAO,CAC7B,CAEA,IAAI,WAAS,CACX,OAAO,KAAK,MAAM,MACpB,CAEA,IAAI,mBAAiB,CACnB,OAAO,KAAK,aAAe,KAAK,QAC5B,CACE,KAAM,KAAK,QACX,MAAO,KAAK,QAAQ,SAAW,KAAK,YAAY,CAAC,EACjD,IAAK,KAAK,QAAQ,SAAW,KAAK,YAAY,CAAC,GAEjD,MACN,CAEA,QAAQC,EAAU,CAChB,OAAO,KAAK,QAAQ,IAAIC,EAAWD,EAAI,SAAS,CAAC,CACnD,CAEA,UAAUT,EAAc,CACtB,OAAO,KAAK,QAAQ,IAAIA,CAAM,CAChC,CAEQ,OAAOA,EAAc,CAC3B,IAAMW,EAAS,KAAK,QAAQ,IAAIX,CAAM,EACtC,GAAI,CAACW,EACH,MAAM,IAAI,MAAM,qCAAqCX,CAAM,EAAE,EAE/D,OAAOW,CACT,CAEQ,eAAa,CACnB,MAAO,CAAC,GAAG,KAAK,QAAQ,KAAI,CAAE,EAAE,KAAK,CAACvE,EAAGC,IAAMD,EAAIC,CAAC,CACtD,CAEQ,MAAM,QAAQoE,EAAU,CAE9B,GADA,KAAK,QAAQ,eAAc,EACvB,KAAK,QAAU,QAAa,KAAK,WAAa,KAAK,MACrD,MAAM,IAAIzE,EAAmB,KAAK,KAAK,EAEzC,IAAM4E,EAAU,MAAM,KAAK,GAAG,UAAUF,EAAWD,EAAI,SAAS,CAAC,EAC3DI,EAAU,MAAM,KAAK,GAAG,UAAUH,EAAWD,EAAI,SAAS,CAAC,EACjE,GAAI,CAACG,GAAW,CAACC,EACf,MAAM,IAAI,MAAM,QAAQJ,CAAE,8BAA8B,EAE1D,KAAK,QAAQ,IAAIG,EAAQ,OAAQA,CAAO,EACxC,KAAK,QAAQ,IAAIC,EAAQ,OAAQA,CAAO,CAC1C,CAEQ,MAAM,WAAWJ,EAAU,CAC5B,KAAK,QAAQA,CAAE,GAClB,MAAM,KAAK,QAAQA,CAAE,CAEzB,CAEQ,YAAU,CAChB,KAAK,MAAQ,CAAA,EACb,KAAK,WAAW,MAAK,EACrB,KAAK,MAAQ,OACb,KAAK,QAAU,OACf,KAAK,UAAY,OACjB,KAAK,YAAc,OACnB,KAAK,cAAgB,OACrB,KAAK,eAAiB,MACxB,CAEA,MAAM,aAAaK,EAAe,CAChC,IAAMC,EAAO,MAAM,KAAK,GAAG,SAASD,CAAK,EACzC,GAAI,CAACC,EACH,MAAM,IAAI,MACR,+BAA+BC,EAAeF,EAAOA,EAAM,QAAQ,CAAC,EAAE,EAG1E,GAAI,CAACC,EAAK,UACR,MAAM,IAAI,MACR,QAAQC,EAAeD,EAAK,KAAMA,EAAK,KAAK,QAAQ,CAAC,yCAAyC,EAGlG,IAAME,EAAcH,EAAM,SAAWC,EAAK,KAAK,SACzCG,EAAU,MAAM,KAAK,GAAG,gBAAgBH,EAAK,OAAQE,CAAW,EACtE,GAAI,CAACC,EACH,MAAM,IAAI,MACR,QAAQF,EAAeD,EAAK,KAAMA,EAAK,KAAK,QAAQ,CAAC,yCAAyC,EAGlG,OAAO,KAAK,iBACVA,EACAE,EACAC,EAAQ,WACRA,EAAQ,GAAG,CAEf,CAEQ,MAAM,iBACZH,EACAE,EACAE,EACAC,EAAU,CAEV,IAAIC,EAAaF,EACbtD,EAAMuD,EACV,OAAS,CACP,MAAM,KAAK,WAAWE,EAAOzD,EAAI,IAAI,CAAC,EACtC,IAAM8C,EAAS,KAAK,OAAO9C,EAAI,IAAI,EACnC,GAAIwD,EAAaV,EAAO,YAAcM,EACpC,MAAO,CACL,SAAU,CACR,UAAWA,EACX,OAAQpD,EAAI,KACZ,WAAYoD,EAAcI,EAC1B,WAAYxD,EAAI,QAElB,KAAMkD,EAAK,KACX,OAAQA,EAAK,QAGjBM,GAAcV,EAAO,YACrB,IAAMnB,EAAOmB,EAAO,KAAI,EAAG,GAAG9C,EAAI,MAAM,EACxC,GAAI,CAAC2B,EACH,MAAM,IAAI,MACR,QAAQwB,EAAeD,EAAK,KAAMA,EAAK,KAAK,QAAQ,CAAC,4BAA4BE,CAAW,EAAE,EAGlGpD,EAAM2B,CACR,CACF,CAEA,MAAM,eAAeQ,EAAgBuB,EAAoBC,EAAe,CACtE,IAAMf,EAAKa,EAAOtB,CAAM,EACxB,MAAM,KAAK,WAAWS,CAAE,EACxB,IAAME,EAAS,KAAK,OAAOX,CAAM,EAC3ByB,EAAcC,GAAgB1B,CAAM,EACpC2B,EAAS,IAAIrF,GACnB,OAAAqF,EAAO,KAAKJ,EAAYd,EAAImB,GAAUH,CAAW,CAAC,EAClDE,EAAO,KAAKhB,EAAO,YAAcY,EAAa,EAAGd,EAAIoB,GAASJ,CAAW,CAAC,EACnE,KAAK,cAAcE,EAAQH,CAAO,CAC3C,CAEA,sBAAsBM,EAA0BzD,EAAW,CACzD,OAAO,KAAK,uBACVyD,EAAU,OACVA,EAAU,SAAS,UACnBA,EAAU,SAAS,UAAYzD,CAAG,CAEtC,CAMQ,MAAM,uBACZ0D,EACAC,EACAC,EAAgB,CAEhB,GAAM,CAACxD,EAAO3B,CAAI,EAAI,MAAM,QAAQ,IAAI,CACtC,KAAK,GAAG,gBAAgBiF,EAAYC,CAAU,EAC9C,KAAK,GAAG,gBAAgBD,EAAYE,CAAQ,EAC7C,EACD,GAAIxD,GAAS3B,EAAM,CACjB,IAAMV,EAAIqC,EAAM,IAAI,KACdpC,EAAIS,EAAK,IAAI,KAKnB,GAAI,CAJU,MAAM,KAAK,GAAG,gBAC1B,KAAK,IAAIV,EAAGC,CAAC,EACb,KAAK,IAAID,EAAGC,CAAC,EAAI,CAAC,EAER,CACV,IAAM6F,EAAY,MAAM,KAAK,GAAG,wBAC9BH,EACAC,EACAC,CAAQ,EAEJlC,EAAOI,GAAU+B,EAAU,IAAI,GAAK,EAAE,IAAI,IAAI,CAAC,EACrD,MAAM,QAAQ,IACZnC,EAAK,IAAI,CAAC,CAACtC,EAAIC,CAAE,IAAM,KAAK,GAAG,gBAAgBD,EAAIC,EAAK,CAAC,CAAC,CAAC,CAE/D,CACF,CACA,OAAOe,CACT,CAEA,MAAM,eAAe2C,EAAqB/C,EAAamD,EAAe,CACpE,GAAInD,IAAQ,EACV,MAAM,IAAI,MAAM,wCAAwC,EAE1D,KAAK,SAAW,EAChB,GAAI,CACF,OAAO,MAAM,KAAK,aAAa+C,EAAO/C,EAAKmD,CAAO,CACpD,OAASW,EAAO,CACd,MAAMA,aAAiBnG,GAAsBmG,EAAM,WAAa,OAC5D,IAAInG,EAAmBmG,EAAM,MAAO,CAClC,SAAU9D,EACV,SAAU,KAAK,SAChB,EACD8D,CACN,CACF,CAEA,IAAI,mBAAiB,CACnB,OAAO,KAAK,QACd,CAEQ,MAAM,aACZf,EACA/C,EACAmD,EAAe,CAEf,IAAI3D,EAAW,CAAE,KAAMuD,EAAM,OAAQ,OAAQA,EAAM,UAAU,EACzDgB,EAAShB,EAAM,WACfiB,EAAYhE,EACVsD,EAAS,IAAIrF,GACnB,OAAS,CACP,IAAMmE,EAAKa,EAAOzD,EAAI,IAAI,EACpB4D,EAAcC,GAAgB7D,EAAI,IAAI,EAC5C,KAAK,SAAWQ,EAAMgE,EACtB,MAAM,KAAK,WAAW5B,CAAE,EACxB,IAAME,EAAS,KAAK,OAAO9C,EAAI,IAAI,EACnC,GAAIuE,GAAUzB,EAAO,YACnB,MAAM,IAAI,MACR,UAAUyB,CAAM,YAAY3B,CAAE,cAAcE,EAAO,WAAW,EAAE,EAGpEgB,EAAO,KAAKS,EAAQ3B,EAAImB,GAAUH,CAAW,CAAC,EAC9C,IAAMa,EAAiB3B,EAAO,YAAcyB,EAC5C,GAAIC,GAAaC,EAAgB,CAC/BX,EAAO,KACLU,IAAcC,EAAiB,EAAIA,EAAiBD,EAAY,EAChE5B,EACAoB,GAASJ,CAAW,CAAC,EAEvB,KACF,CACAE,EAAO,KAAK,EAAGlB,EAAIoB,GAASJ,CAAW,CAAC,EACxC,IAAMjC,EAAOmB,EAAO,KAAI,EAAG,GAAG9C,EAAI,MAAM,EACxC,GAAI,CAAC2B,EACH,MAAM,IAAI,MACR,mCAAmC3B,EAAI,IAAI,KAAKA,EAAI,MAAM,GAAG,EAGjEA,EAAM2B,EACN4C,EAAS,EACTC,GAAaC,CACf,CACA,YAAK,SAAWjE,EACT,KAAK,cAAcsD,EAAQH,CAAO,CAC3C,CAEA,MAAM,YAAYe,EAAyBf,EAAe,CACxD,IAAMG,EAAS,IAAIrF,GACnB,QAAWmE,KAAM8B,EACf,MAAM,KAAK,WAAW9B,CAAE,EACxBkB,EAAO,KAAK,EAAGlB,EAAI,MAAM,EACzBkB,EAAO,KAAK,EAAGlB,EAAI,OAAO,EAE5B,OAAO,KAAK,cAAckB,EAAQH,CAAO,CAC3C,CAEQ,MAAM,cAAcG,EAAmBH,EAAe,CAC5D,KAAK,WAAU,EACf,IAAMgB,EAAU,IAAI,IACdC,EAAW,IAAI,IACrB,QAAWzC,KAAU,KAAK,QAAQ,KAAI,EACpCyC,EAAS,IAAInB,EAAOtB,CAAM,CAAC,EAE7B,IAAI0C,EAAW,EACf,KAAOf,EAAO,KAAO,GAAG,CACtB,GAAM,CAACpF,EAAUkE,EAAIhE,CAAI,EAAIkF,EAAO,IAAG,EACjCgB,EAAM,GAAGlC,CAAE,IAAIhE,CAAI,GACzB,GAAI+F,EAAQ,IAAIG,CAAG,EACjB,SAEFH,EAAQ,IAAIG,CAAG,EACfF,EAAS,OAAOhC,CAAE,EACb,KAAK,QAAQA,CAAE,IAClB,MAAM,KAAK,QAAQA,CAAE,EACrBiC,GAAY,GAEd,IAAME,EAAYC,GAASpG,CAAI,EAC/B,GAAI,CAAC+F,EAAQ,IAAI,GAAG/B,CAAE,IAAImC,CAAS,EAAE,EAAG,CACtC,IAAMjC,EAAS,KAAK,OAAOD,EAAWD,EAAIqC,GAAiBrG,CAAI,CAAC,CAAC,EAC3DsG,EAAexG,EAAWoE,EAAO,YAAc,EACjDoC,GAAgBvB,GAClBG,EAAO,KAAKoB,EAActC,EAAImC,CAAS,CAE3C,CACA,IAAMjC,EAAS,KAAK,OAAOD,EAAWD,EAAIuC,GAAgBvG,CAAI,CAAC,CAAC,EAC1DsG,EAAexG,EAAW,EAChC,GAAIwG,GAAgBvB,EAClB,QAAWyB,KAAatC,EAAO,WAAU,EAAI,CAC3C,IAAMuC,EAAc5B,EAAO2B,CAAS,EAC9BE,EAAgBvB,GAAUF,GAAgBuB,CAAS,CAAC,EACrDT,EAAQ,IAAI,GAAGU,CAAW,IAAIC,CAAa,EAAE,GAChDxB,EAAO,KAAKoB,EAAcG,EAAaC,CAAa,CAExD,CAEJ,CACA,QAAW1C,KAAMgC,EACf,KAAK,QAAQ,OAAO/B,EAAWD,EAAI,SAAS,CAAC,EAC7C,KAAK,QAAQ,OAAOC,EAAWD,EAAI,SAAS,CAAC,EAE/C,MAAO,CAAE,SAAAiC,EAAU,QAASD,EAAS,IAAI,CAC3C,CAEA,MAAM,aAAarB,EAAegC,EAAW,CAC3C,KAAK,WAAU,EACf,IAAMzB,EAAS,CAACP,EAAOiC,EAASD,CAAG,CAAC,EAC9BZ,EAAU,IAAI,IAAI,CAAClB,EAAOF,CAAK,EAAGE,EAAO8B,CAAG,CAAC,CAAC,EAChDV,EAAW,EACf,KAAOf,EAAO,OAAS,GAAG,CACxB,IAAM2B,EAAO3B,EAAO,IAAG,EACjBlB,EAAKa,EAAOgC,CAAI,EACjB,KAAK,QAAQ7C,CAAE,IAClB,MAAM,KAAK,QAAQA,CAAE,EACrBiC,GAAY,GAEd,QAAWO,KAAa,KAAK,OAAOK,CAAI,EAAE,WAAU,EAAI,CACtD,IAAMJ,EAAc5B,EAAO2B,CAAS,EAC/BT,EAAQ,IAAIU,CAAW,IAC1BvB,EAAO,KAAKsB,EAAWI,EAASJ,CAAS,CAAC,EAC1CT,EAAQ,IAAIU,CAAW,EAE3B,CACF,CACA,OAAOR,CACT,CAEA,MAAM,cAAca,EAAmB,CACrC,IAAIb,EAAW,EACf,OAAW,CAACtB,EAAOgC,CAAG,IAAK,MAAM,KAAK,kBAAkBG,CAAM,EAC5Db,GAAY,MAAM,KAAK,aAAatB,EAAOgC,CAAG,EAEhD,OAAOV,CACT,CAEQ,MAAM,kBAAkBa,EAAmB,CACjD,IAAMC,EAA6B,CAAA,EACnC,GAAID,IAAW,OAAQ,CACrB,IAAIE,EAAY,GAChB,QAAWzD,KAAU,KAAK,cAAa,EAAI,CACzC,IAAMW,EAAS,KAAK,OAAOX,CAAM,EAC3BR,EAAOmB,EAAO,KAChBnB,IAAS,SACXiE,EAAY,GACR,KAAK,UAAUjE,CAAI,EACjBkE,GAAgB1D,EAAQR,CAAI,GAC9BgE,EAAO,KAAK,CAACxD,EAAQR,CAAI,CAAC,EAG5B+D,IAAW,eACX,KAAK,uBAAuB5C,CAAM,GAElC6C,EAAO,KAAK,CAACxD,EAAQR,CAAI,CAAC,EAGhC,CACA,GACE,CAACiE,GACDF,IAAW,eACV,MAAM,KAAK,GAAG,cAAa,EAC5B,CACA,IAAMI,EAAW,MAAM,KAAK,kBAAiB,EACzCA,GACFH,EAAO,KAAKG,CAAQ,CAExB,CACF,CACA,OAAOH,CACT,CAEQ,uBAAuB7C,EAAiB,CAC9C,IAAMiD,EAAajD,EAAO,WAAU,EAC9BlC,EAAQmF,EAAW,KAAK5D,GAAU,KAAK,UAAUA,CAAM,CAAC,EAC9D,OAAOvB,IAAU,OACb,GACAmF,EAAW,OAAS,GAClB,KAAK,OAAOP,EAAS5E,CAAK,CAAC,EAAE,WAAU,EAAG,OAAS,CAC3D,CAEQ,aAAaoF,EAAoB,CACvC,IAAMC,EAAU,IAAI,IACpB,MAAO,OAAO9D,GAAkB,CAC9B,IAAM+D,EAAS,KAAK,QAAQ,IAAI/D,CAAM,EACtC,GAAI+D,EACF,OAAOA,EAET,IAAIpD,EAASmD,EAAQ,IAAI9D,CAAM,EAC/B,GAAI,CAACW,EAAQ,CAGX,GAFAA,EAAS,MAAM,KAAK,GAAG,UAAUX,CAAM,EACvC6D,IAAS,EACL,CAAClD,EACH,MAAM,IAAI,MAAM,eAAeX,CAAM,+BAA+B,EAEtE8D,EAAQ,IAAI9D,EAAQW,CAAM,CAC5B,CACA,OAAOA,CACT,CACF,CAEQ,MAAM,mBAAiB,CAC7B,IAAMqD,EAAO,KAAK,aAAY,EACxBC,EAAe,MAAOtD,GAAqB,CAC/C,IAAMiD,EAAajD,EAAO,WAAU,EAC9BlC,EAAQmF,EAAW,CAAC,EAC1B,OAAOnF,IAAU,OACb,GACAmF,EAAW,OAAS,IACjB,MAAMI,EAAKX,EAAS5E,CAAK,CAAC,GAAG,WAAU,EAAG,OAAS,CAC5D,EACMyF,EAAW,MAAOlE,GAAuC,CAC7D,IAAMa,EAAU,MAAMmD,EAAKX,EAASrD,CAAM,CAAC,EAC3C,OAAOa,EAAQ,OAAS,OACnB,MAAMoD,EAAapD,CAAO,EACzB,CAAE,KAAM,aAAc,MAAO,CAACwC,EAASrD,CAAM,EAAGa,EAAQ,IAAI,CAAC,EAC7D,CAAE,KAAM,OAAO,GAChB,MAAMmD,EAAKhE,CAAM,GAAG,OAAS,OAC5B,CAAE,KAAM,OAAO,EACf,CAAE,KAAM,SAAS,CACzB,EACMwC,EAAU,IAAI,IACd2B,EAAQ,KAAK,cAAa,EAAG,QAAQnE,GACzC,KAAK,OAAOA,CAAM,EAAE,WAAU,CAAE,EAE9BwD,EACAY,EAAO,GACX,KAAO,CAACA,GAAQD,EAAM,OAAS,GAAG,CAChC,IAAMnE,EAASmE,EAAM,MAAK,EACpB1D,EAAKa,EAAOtB,CAAM,EACxB,GAAI,CAAC,KAAK,UAAUA,CAAM,GAAK,CAACwC,EAAQ,IAAI/B,CAAE,EAAG,CAC/C+B,EAAQ,IAAI/B,CAAE,EACd,IAAM4D,EAAO,MAAMH,EAASlE,CAAM,EAClC,GAAIqE,EAAK,OAAS,aAChBb,EAASa,EAAK,MACdD,EAAO,WACEC,EAAK,OAAS,QACvBD,EAAO,OAEP,SAAW3C,IAAe,CAAC,UAAW,SAAS,EAC7C0C,EAAM,KACJ,IAAI,MAAMH,EAAKtD,EAAWD,EAAIgB,CAAW,CAAC,GAAG,WAAU,CAAE,CAIjE,CACF,CACA,OAAO+B,CACT,CAEA,aAAa1B,EAAsCwC,EAAuB,CAExE,GADA,KAAK,WAAU,EACXA,IAAW,OACb,OAEF,IAAMC,EAASzC,GAAW,SAC1B,KAAK,QAAUA,GAAW,KAC1B,KAAK,UAAYA,GAAW,OAC5B,IAAM1B,EAAU,KAAK,cAAa,EAC5BoE,EAAQpE,EAAQ,OAChBqE,EAAU,IAAI,IACpBrE,EAAQ,QAAQ,CAACJ,EAAQrD,IAAM8H,EAAQ,IAAIzE,EAAQrD,CAAC,CAAC,EAMrD,IAAM+H,EAAW,IAAI,WAAWF,EAAQ,CAAC,EACnCG,EAAS,IAAI,WAAWH,CAAK,EAC7BI,EAAqD,CAAA,EAC3D,QAASjI,EAAI,EAAGA,EAAI6H,EAAO7H,IAAK,CAC9B,IAAMgE,EAAS,KAAK,OAAOP,EAAQzD,CAAC,CAAE,EAChCkI,EAAMlE,EAAO,KAAI,EAAG,iBAAgB,EAC1CgE,EAAOhI,CAAC,EAAIgE,EAAO,YACnBiE,EAAK,KAAKC,CAAG,EACbH,EAAS/H,EAAI,CAAC,EAAI+H,EAAS/H,CAAC,EAAKkI,EAAI,MAAM,MAC7C,CACA,IAAM3C,EAAYwC,EAASF,CAAK,EAC1BM,EAAY,IAAI,WAAW5C,CAAS,EACpC6C,EAAa,IAAI,WAAW7C,CAAS,EACrC8C,EAAiB,IAAI,WAAW9C,CAAS,EAC/C,QAASvF,EAAI,EAAGA,EAAI6H,EAAO7H,IAAK,CAC9B,IAAMkI,EAAMD,EAAKjI,CAAC,EAClBmI,EAAU,IAAID,EAAI,MAAOH,EAAS/H,CAAC,CAAC,EACpCoI,EAAW,IAAIF,EAAI,QAASH,EAAS/H,CAAC,CAAC,CACzC,CACAiI,EAAK,OAAS,EACd,QAASjF,EAAI,EAAGA,EAAIuC,EAAWvC,IAAK,CAClC,IAAMsF,EAAIR,EAAQ,IAAIK,EAAUnF,CAAC,CAAE,EAC/BsF,IAAM,OACRH,EAAUnF,CAAC,EAAI,IAEfmF,EAAUnF,CAAC,EAAIsF,EACfD,EAAeN,EAASO,CAAC,EAAKF,EAAWpF,CAAC,CAAE,EAAI,EAEpD,CACA,IAAMuF,EACJX,IAAW,OAAY,OAAYE,EAAQ,IAAIF,EAAO,MAAM,EACxDY,EAAgBZ,GAAQ,WAC1Ba,EACElJ,EAAO,CAACS,EAAWyF,EAAgBrB,IAA8B,CACrE,IAAMsE,EAAoB,CAAA,EACtBC,EAAQ,EACRjH,EAAM,EACNhB,EAAQ,GACRkI,EAAM5I,EACN6I,EAAMpD,EACV,OAAS,CACHmD,IAAQL,GAAYM,IAAQL,IAC9B9H,EAAQiI,GAENvE,IACFA,EAAK,KAAKX,EAAQmF,CAAG,CAAE,EACvBF,EAAQ,KAAKG,CAAG,GAElBF,GAAS,EACTjH,GAAOsG,EAAOY,CAAG,EACjB,IAAME,EAAKf,EAASa,CAAG,EAAKC,EACtBhG,EAAOsF,EAAUW,CAAE,EACzB,GAAIjG,EAAO,EACT,MAEFgG,EAAMT,EAAWU,CAAE,EACnBF,EAAM/F,CACR,CACA,MAAO,CAAE,QAAA6F,EAAS,IAAAhH,EAAK,MAAAhB,EAAO,KAAMkI,CAAG,CACzC,EACMG,EAAO,CACX3E,EACAsE,EACAhH,EACAhB,IACE,CACEA,GAAS,IACX,KAAK,MAAQ,KAAK,MAAM,OACxB+H,EAAY/H,GAEd,KAAK,MAAM,KAAK,CACd,KAAA0D,EACA,QAAAsE,EACA,IAAAhH,EACA,OAAQ,OACR,SAAU,OACX,CACH,EACMsH,EAAgB,IAAI,WAAWnB,CAAK,EACpCoB,EACJV,IAAa,QAAaW,EAAUzF,EAAQ8E,CAAQ,CAAE,EACxD,QAASvI,EAAI,EAAGA,EAAI6H,EAAO7H,IAAK,CAC9B,IAAM8B,EAAQ2B,EAAQzD,CAAC,EACvB,GAAI,CAACkJ,EAAUpH,CAAK,EAAG,CACrB,IAAMqH,EAAOpB,EAAS/H,CAAC,EACjBoJ,EAASrB,EAAS/H,EAAI,CAAC,EAAKmJ,EAClC,QAAS1D,EAAS,EAAGA,EAAS2D,EAAQ3D,IACpC,GAAI4C,EAAec,EAAO1D,CAAM,IAAM,EAAG,CACvC,IAAMrB,EAAiB,CAAA,EACjB,CAAE,QAAAsE,EAAS,IAAAhH,EAAK,MAAAhB,EAAO,KAAAP,CAAI,EAAKZ,EAAKS,EAAGyF,EAAQrB,CAAI,EACpDiF,EAAa5F,EAAQtD,CAAI,EAC/B,GAAIO,GAAS,GAAK4I,GAAqBxH,EAAOuH,CAAU,GAEtD,GADAN,EAAK3E,EAAMsE,EAAShH,EAAKhB,CAAK,EAC1B,CAACwI,EAAUG,CAAU,EAAG,CAC1B,IAAME,EAAazB,EAAQ,IAAIpB,EAAS2C,CAAU,CAAC,EACnDL,EAAcO,CAAU,EAAIP,EAAcO,CAAU,EAAK,CAC3D,OAEA,KAAK,WAAW,IAAItI,GAAO,CAAE,KAAMa,EAAO,OAAA2D,CAAM,CAAE,CAAC,CAEvD,CAEJ,CACF,CACA,QAASzF,EAAI,EAAGA,EAAI6H,EAAO7H,IAAK,CAC9B,IAAM8B,EAAQ2B,EAAQzD,CAAC,EACvB,GAAIkJ,EAAUpH,CAAK,EAAG,CACpB,IAAMqH,EAAOpB,EAAS/H,CAAC,EACjBoJ,EAASrB,EAAS/H,EAAI,CAAC,EAAKmJ,EAC9BK,EAAa,EACjB,QAAS/D,EAAS,EAAGA,EAAS2D,EAAQ3D,IAChC4C,EAAec,EAAO1D,CAAM,IAAM,IACpC+D,GAAc,GAGlB,IAAMC,EAAW,CAACR,GAAuBO,IAAeR,EAAchJ,CAAC,EACvE,QAASyF,EAAS,EAAGA,EAAS2D,EAAQ3D,IACpC,GAAI4C,EAAec,EAAO1D,CAAM,IAAM,EAAG,CACvC,IAAMiE,EAAOD,EAAW,OAAYlK,EAAKS,EAAGyF,EAAQ,MAAS,EAC7D,GACEiE,IACCA,EAAK,OAAS,GACbJ,GAAqBxH,EAAO2B,EAAQiG,EAAK,IAAI,CAAC,GAChD,CACA,IAAMtF,EAAiB,CAAA,EACjB,CAAE,QAAAsE,EAAS,IAAAhH,EAAK,MAAAhB,CAAK,EAAKnB,EAAKS,EAAGyF,EAAQrB,CAAI,EACpD2E,EAAK3E,EAAMsE,EAAShH,EAAKhB,CAAK,CAChC,MACE,KAAK,WAAW,IAAIO,GAAO,CAAE,KAAMa,EAAO,OAAA2D,CAAM,CAAE,CAAC,CAEvD,CAEJ,CACF,CACA,GAAImC,EAAQ,CACV,GAAIa,IAAc,QAAa,KAAK,QAAU,OAC5C,WAAK,WAAU,EACT,IAAI,MAAM,mCAAmC,EAErD,IAAM1F,EAAO,KAAK,MAAM,KAAK,KAAK,EAC9B4G,EAAS/B,EAAO,WACpB,QAAWvE,KAAUN,EAAK,KAAK,MAAM,EAAG0F,CAAS,EAC/CkB,GAAU,KAAK,OAAOtG,CAAM,EAAE,YAEhC,IAAMoB,EAAQmD,EAAO,UAAY+B,EACjC,KAAK,YAAc,CAAClF,EAAOA,EAAQ1B,EAAK,GAAG,EAC3CA,EAAK,SAAW,CACd,WAAYoC,EAAU,OACtB,KAAMA,EAAU,KAChB,YAAa,UACb,SAAUV,EACV,OAAQA,EAAQ1B,EAAK,IAEzB,CACA,GAAI4E,IAAW,WACb,KAAK,cAAa,UACTA,IAAW,iBAAkB,CACtC,GAAI,KAAK,QAAU,OACjB,MAAM,IAAI,MAAM,sDAAsD,EAExE,KAAK,MAAQ,CAAC,KAAK,MAAM,KAAK,KAAK,CAAE,EACrC,KAAK,MAAQ,CACf,CACF,CAEQ,eAAa,CACnB,IAAMiC,EACJ,KAAK,QAAU,OAAY,OAAY,KAAK,MAAM,KAAK,KAAK,EAAG,KACjE,KAAK,MAAM,KAAK,CAACnH,EAAGC,IAAMmH,GAAapH,EAAE,KAAMC,EAAE,IAAI,GAAKD,EAAE,IAAMC,EAAE,GAAG,EACvE,IAAMoH,EAAqB,CAAA,EACvBC,EACJ,QAAWhH,KAAQ,KAAK,MAAO,CAC7B,IAAM5C,EAAO2J,EAAOA,EAAO,OAAS,CAAC,EACjC3J,GAAQ0J,GAAa1J,EAAK,KAAM4C,EAAK,IAAI,IAAM,EACjD5C,EAAK,QAAUA,EAAK,QAAU,GAAK,GAE/ByJ,GAAWC,GAAa9G,EAAK,KAAM6G,CAAO,IAAM,IAClDG,EAAQD,EAAO,QAEjBA,EAAO,KAAK,CAAE,GAAG/G,EAAM,OAAQ,CAAC,CAAE,EAEtC,CACA,KAAK,MAAQ+G,EACb,KAAK,MAAQC,CACf,CAMA,eAAeC,EAAmC,CAChD,IAAMC,EACJ,KAAK,QAAU,OAAY,OAAY,KAAK,MAAM,KAAK,KAAK,EACxDC,EAAO,KAAK,MAAM,OACtB,CAACnH,EAAMV,IACLA,IAAU,KAAK,OACdU,EAAK,WAAa,QAAaiH,EAAOjH,EAAK,SAAS,IAAI,CAAE,EAEzD8C,EAAU,IAAI,IACpB,QAAW9C,KAAQmH,EACjB,QAAW7G,KAAUN,EAAK,KACxB8C,EAAQ,IAAIlB,EAAOtB,CAAM,CAAC,EAG9B,QAAWA,IAAU,CAAC,GAAG,KAAK,QAAQ,KAAI,CAAE,EACrCwC,EAAQ,IAAIlB,EAAOtB,CAAM,CAAC,GAC7B,KAAK,QAAQ,OAAOA,CAAM,EAG9B,KAAK,MAAQ6G,EACb,KAAK,MAAQD,IAAY,OAAY,OAAYC,EAAK,QAAQD,CAAO,CACvE,CASA,MAAM,yBACJ9E,EACAzD,EACAyI,EACAH,EACAnF,EAAe,CAEf,IAAMuF,EAAcjF,EAAU,SAAS,UACjCkF,EAAYD,EAAc1I,EAC1B4I,EAAe,KAAK,MAAMF,EAAcD,CAAO,EAAIA,EACnDI,EAAS,KAAK,IAAIJ,EAAS5G,EAAkB,EAC7C1C,EAAQ,GAAKsJ,EAAUzI,GAAO6I,EAC9BC,EAAyB,CAC7B,QAAAL,EACA,aAAAG,EACA,iBAAkB,GAClB,aAAc,GACd,eAAgB,EAChB,KAAM,EACN,MAAO,CAAA,EACP,aAAc,EACd,MAAO,CAAA,EACP,SAAU,EACV,SAAU,OACV,GAAI,CAAE,UAAW,EAAG,KAAM,EAAG,MAAO,EAAG,KAAM,EAAG,QAAS,CAAC,GAE5D,KAAK,MAAM,WAAaE,EACxB,IAAIC,EAAQ,YAAY,IAAG,EACrBC,EAAM,IAAK,CACf,IAAMC,EAAM,YAAY,IAAG,EACrBC,EAAUD,EAAMF,EACtB,OAAAA,EAAQE,EACDC,CACT,EACA,KAAK,WAAU,EACf,KAAK,QAAQ,MAAK,EAClB,IAAMvD,EAAO,KAAK,aAAa,IAAK,CAClCmD,EAAM,cAAgB,CACxB,CAAC,EACKK,EAAQ,MAAM,KAAK,GAAG,gBAAgB1F,EAAU,OAAQmF,CAAY,EAC1E,GAAIO,IAAU,OACZ,MAAM,IAAI,MACR,2CAA2CxG,EAAec,EAAU,KAAMA,EAAU,KAAK,QAAQ,CAAC,cAAcmF,CAAY,sCAAsCH,CAAO,oBAAoB,EAGjMK,EAAM,iBAAmBK,EAAM,WAC/B,IAAMtG,EAAU,MAAM,KAAK,uBACzBY,EAAU,OACV0F,EAAM,WACNR,EAAYE,CAAM,EAEpB,GAAI,CAAChG,EACH,MAAM,IAAI,MACR,QAAQF,EAAec,EAAU,KAAMA,EAAU,KAAK,QAAQ,CAAC,yCAAyC,EAG5G,IAAM2F,EAAQ,MAAM,KAAK,cACvBzD,EACA9C,EACAsG,EACAT,EACAC,EACAA,EAAYE,CAAM,EAEd,CAAE,OAAAQ,EAAQ,YAAAC,EAAa,WAAAC,EAAY,YAAAC,CAAW,EAAKJ,EACzDN,EAAM,aAAeO,EAAO,IAAI,KAChCP,EAAM,eAAiBM,EAAM,MAC7B,KAAK,SAAWpJ,EAChB,IAAMkI,EAAoB,CAAA,EACpBuB,EAAuB,CAAA,EACzBC,EAAS,EACb,QAAWC,KAAQH,EACjB,MAAM,KAAK,WAAWvG,EAAO0G,EAAK,IAAI,IAAI,CAAC,EAC3CzB,EAAQ,KAAKyB,EAAK,IAAI,IAAI,EAC1BF,EAAW,KAAKE,EAAK,IAAI,MAAM,EAC/BD,GAAU,KAAK,OAAOC,EAAK,IAAI,IAAI,EAAE,YAEvC,IAAMC,EAAYJ,EAAY,CAAC,EAC/B,GAAII,IAAc,OAChB,MAAM,IAAI,MAAM,8CAA8C,EAEhE,KAAK,QAAUnG,EAAU,KACzB,KAAK,UAAYA,EAAU,OAC3B,KAAK,YAAc,CAACmG,EAAU,UAAWA,EAAU,UAAYF,CAAM,EACrE,KAAK,MAAQ,EACb,KAAK,MAAM,KAAK,CACd,KAAMxB,EACN,QAASuB,EACT,IAAKC,EACL,OAAQ,OACR,SAAU,CACR,WAAYjG,EAAU,OACtB,KAAMA,EAAU,KAChB,YAAa,UACb,SAAUmG,EAAU,UACpB,OAAQA,EAAU,UAAYF,GAEjC,EACDZ,EAAM,GAAG,UAAYE,EAAG,EACxB,IAAMzC,EAAO,MAAM,KAAK,GAAG,uBAAuB8C,EAAO,IAAI,IAAI,EACjEP,EAAM,KAAOvC,EAAK,OAClBuC,EAAM,GAAG,KAAOE,EAAG,EACnB,IAAMa,EAAStD,EAAK,KAClBC,GACEA,EAAI,SAAW6C,EAAO,IAAI,QAC1B7C,EAAI,aAAe/C,EAAU,QAC7B+C,EAAI,aAAe6C,EAAO,MAAM,EAEpC,GAAIQ,IAAW,OACb,MAAM,IAAI,MACR,6CAA6ClH,EAAec,EAAU,KAAMA,EAAU,KAAK,QAAQ,CAAC,cAAc4F,EAAO,MAAM,UAAUpG,EAAOoG,EAAO,IAAI,IAAI,CAAC,uCAAuCZ,CAAO,oBAAoB,EAGtO,IAAMqB,EAAgB,MAAM,KAAK,GAAG,cAAa,EAC3CC,EAAUrG,GAAsB,CACpC,IAAMhB,EAAOoH,EAAc,IAAIpG,CAAU,EACzC,GAAI,CAAChB,EACH,MAAM,IAAI,MAAM,QAAQgB,CAAU,+BAA+B,EAEnE,OAAOhB,EAAK,IACd,EACMsH,EAAU,IAAI,IAAY,CAACvG,EAAU,MAAM,CAAC,EAC5CwG,EAAe,IAAI,IACzB,QAAWzD,KAAOD,EAChB,GAAIC,IAAQqD,GAAUvB,EAAOyB,EAAOvD,EAAI,UAAU,CAAC,EAAG,CACpD,IAAM0D,EAASD,EAAa,IAAIzD,EAAI,UAAU,EAC1C0D,EACFA,EAAO,KAAK1D,CAAG,EAEfyD,EAAa,IAAIzD,EAAI,WAAY,CAACA,CAAG,CAAC,CAE1C,CAOF,IAAI2D,EACJ,OAAW,CAACzG,EAAYwG,CAAM,IAAKD,EACjC,GAAIE,IAAa,OAAW,CAC1B,IAAMC,GAAW5D,IACf,KAAK,IAAIA,GAAI,OAASqD,EAAO,MAAM,EACrCK,EAAO,KAAK,CAACnJ,GAAGC,KAAMoJ,GAAQrJ,EAAC,EAAIqJ,GAAQpJ,EAAC,CAAC,EAC7C,IAAIqJ,GACJ,QAAWC,MAASJ,EACbF,EAAQ,IAAItG,CAAU,IACzB2G,GAAS,MAAM,KAAK,YAClB1E,EACA2E,GACA,SACAP,EAAOrG,CAAU,EACjB4F,EACAX,EACAxJ,EACAgE,EACA6G,EACAlB,CAAK,GAINkB,EAAQ,IAAItG,CAAU,IACzByG,EAAWE,GAEf,CAEFvB,EAAM,GAAG,MAAQE,EAAG,EACpB,IAAMuB,GACJJ,IAAa,OACT,MAAM,KAAK,yBACTjC,EACAoB,EACAC,EACAjB,EACA0B,EACAD,EACAjB,CAAK,EAEP,IAAI,IAEV,GADAA,EAAM,GAAG,KAAOE,EAAG,EACfuB,GAAS,KAAO,EAAG,CACrB,MAAM,KAAK,mBACT5E,EACAlC,EAAU,OACV,KAAK,IAAI,EAAG0F,EAAM,WAAa,EAAIV,CAAO,EAC1CU,EAAM,WACNG,EACAC,CAAU,EAEZ,OAAW,CAAC7F,EAAY8G,CAAO,IAAKD,GAClC,GAAIJ,IAAa,OAAW,CAC1B,IAAMM,GAAOV,EAAOrG,CAAU,EAC1BgH,GACJ,QAAWC,MAAUH,EACnBE,KAAU,MAAM,KAAK,YACnB/E,EACAgF,GACArB,EACAC,EACA,KAAK,YAAY,CAAC,EAClBpK,CAAK,EAGTgL,EACEO,KAAU,OACN,gBAAgB/H,EAAe8H,GAAMA,GAAK,QAAQ,CAAC,iDACnD,MAAM,KAAK,YACT9E,EACA+E,GACA,SACAD,GACAnB,EACAX,EACAxJ,EACAgE,EACA6G,EACAlB,CAAK,CAEf,CAEFA,EAAM,GAAG,QAAUE,EAAG,CACxB,CACA,OAAAF,EAAM,SAAWqB,EACVA,CACT,CAEQ,MAAM,YACZxE,EACAa,EACAiB,EACAgD,EACAnB,EACAX,EACAxJ,EACAgE,EACA6G,EACAlB,EAAsB,CAEtB,IAAM8B,EAAS,MAAM,KAAK,YACxBjF,EACAa,EACAiE,EACAnB,EACA,KAAK,YAAa,CAAC,EACnBX,EACAxJ,EACAgE,CAAO,EAET2F,EAAM,MAAM,KAAK,CACf,WAAYtC,EAAI,WAChB,KAAAiB,EACA,MAAOmD,EAAO,MACd,OAAQA,EAAO,MAAM,OACrB,IAAKA,EAAO,IACb,EACD,IAAIP,EAMJ,OAAIO,EAAO,MAAQ,SAAWA,EAAO,MAAM,SAAW,EACpDP,EAAS,GAAG1H,EAAe8H,EAAMjE,EAAI,UAAU,CAAC,WAAWoE,EAAO,KAAK,mBAAmBnD,CAAI,+CAA+CmD,EAAO,GAAG,KAEvJZ,EAAQ,IAAIxD,EAAI,UAAU,EAC1B,KAAK,MAAM,KAAK,GAAGoE,EAAO,KAAK,GAE1BP,CACT,CAKQ,MAAM,mBACZ1E,EACAjC,EACAC,EACAC,EACA0F,EACAC,EAAuB,CAEvB,IAAM1G,EAAU,MAAM,KAAK,uBACzBa,EACAC,EACAC,CAAQ,EAENpE,EAAuBqD,GAAS,IAChCkB,EAASlB,GAAS,YAAce,EACpC,KAAOpE,IAAQ,QAAaA,EAAI,OAAS,GAAauE,EAASH,GAAU,CACvE,KAAK,QAAQ,eAAc,EAC3B,IAAMtB,EAAS,MAAMqD,EAAKnG,EAAI,IAAI,EAC5B4C,EAAKa,EAAOzD,EAAI,IAAI,EACrB8J,EAAY,IAAIlH,CAAE,IACrBkH,EAAY,IAAIlH,EAAI2B,CAAM,EAC1BwF,EAAW,IAAI/J,EAAI,IAAI,GAEzBuE,GAAUzB,EAAO,YACjB9C,EAAM8C,EAAO,KAAI,EAAG,GAAG9C,EAAI,MAAM,CACnC,CACF,CAOQ,MAAM,kBACZmG,EACAgF,EACArB,EACAC,EACApK,EAAa,CAEb,IAAIK,EAAuB,CAAE,KAAMmL,EAAO,KAAM,OAAQA,EAAO,MAAM,EACjEC,EAAS,EACTC,EACJ,KAAOA,IAAY,QAEjB,GADA,KAAK,QAAQ,eAAc,EACvBrL,IAAQ,QAAaA,EAAI,OAAS,GAAaoL,EAASzL,EAC1D0L,EAAU,WACDvB,EAAY,IAAIrG,EAAOzD,EAAI,IAAI,CAAC,EACzCqL,EAAUtB,EAAW,IAAI/J,EAAI,IAAI,MAC5B,CACL,IAAM8C,EAAS,MAAMqD,EAAKnG,EAAI,IAAI,EAClCoL,GAAUtI,EAAO,YACjB9C,EAAM8C,EAAO,KAAI,EAAG,GAAG9C,EAAI,MAAM,CACnC,CAEF,OAAOqL,CACT,CAUQ,MAAM,YACZlF,EACAgF,EACArB,EACAC,EACAb,EACAvJ,EAAa,CAEb,IAAM2L,GAAa,MAAMnF,EAAKgF,EAAO,IAAI,GAAG,YACtCI,EAAQ,MACZvL,EACAwL,IAC4B,CAC5B,IAAMhL,GAAO,MAAM2F,EAAKnG,EAAI,IAAI,GAAG,YACnC,MAAO,CACL,KAAMA,EAAI,KACV,OAAQA,EAAI,OACZ,WAAYmL,EAAO,WACnB,YAAaA,EAAO,YACpB,WACEA,EAAO,cAAgB,UACnBA,EAAO,WAAaK,EACpBL,EAAO,WAAaG,EAAYE,EAAShL,EAEnD,EACIR,EAAW,CAAE,KAAMmL,EAAO,KAAM,OAAQA,EAAO,MAAM,EACrDK,EAAS,EACTN,EACA3E,EAAO,CAAE,MAAM,KAAK,kBACtBJ,EACAgF,EACArB,EACAC,EACApK,CAAK,EAEP,KAAO,CAAC4G,GAAM,CACZ,KAAK,QAAQ,eAAc,EAC3B,IAAMgB,EAAYuC,EAAY,IAAIrG,EAAOzD,EAAI,IAAI,CAAC,EAClD,GAAIuH,IAAc,QAAaA,EAAY2B,EACzCgC,EAAQ,MAAMK,EAAMvL,EAAKwL,CAAM,EAC/BjF,EAAO,WACEiF,EAAS7L,EAClBuL,EAAQ,CAAE,GAAGC,CAAM,EACnB5E,EAAO,OACF,CAEL,IAAMkF,GADU,MAAMtF,EAAKX,EAASxF,EAAI,IAAI,CAAC,GACjB,KAAI,EAAG,cAAcA,EAAI,MAAM,EAC3D,GAAIyL,IAAgB,OAClBP,EAAQ,MAAMK,EAAMvL,EAAKwL,CAAM,EAC/BjF,EAAO,OACF,CACL,IAAMzD,EAAS,MAAMqD,EAAKsF,CAAW,EAC/BlH,EAASzB,EAAO,KAAI,EAAG,SAAS9C,CAAG,EACzC,GAAIuE,IAAW,OACb,MAAM,IAAI,MACR,gBAAgBkH,CAAW,aAAazL,EAAI,IAAI,IAAIA,EAAI,MAAM,EAAE,EAGpEA,EAAM,CAAE,KAAMyL,EAAa,OAAAlH,CAAM,EACjCiH,GAAU1I,EAAO,WACnB,CACF,CACF,CACA,OAAOoI,CACT,CAOQ,MAAM,cACZ/E,EACA9C,EACAsG,EACAT,EACAC,EACAuC,EAAiB,CAEjB,IAAM5B,EAAc,IAAI,IAClBC,EAAa,IAAI,IACjBC,EAAiD,CAAA,EACnDH,EACA7J,EAAuBqD,EAAQ,IAC/BkB,EAASlB,EAAQ,WACjBoE,EAAQ,EACZ,KAAOzH,IAAQ,QAAaA,EAAI,OAAS,GAAauE,EAASmH,GAAW,CACxE,KAAK,QAAQ,eAAc,EAC3B,IAAM5I,EAAS,MAAMqD,EAAKnG,EAAI,IAAI,EAC5BuF,EAAMhB,EAASzB,EAAO,YAC5B,GAAI+G,IAAW,QAAatF,IAAWoF,EAAM,WAAY,CACvD,GAAI3J,EAAI,OAAS2J,EAAM,KACrB,MAAM,IAAI,MACR,mCAAmClG,EAAOzD,EAAI,IAAI,CAAC,cAAcuE,CAAM,yCAAyCd,EAAOkG,EAAM,IAAI,CAAC,gBAAgB,EAGtJE,EAAS,CAAE,IAAA7J,EAAK,OAAAuE,CAAM,CACxB,CACA,GAAIsF,IAAW,OAAW,CACxBpC,GAAS,EACT,IAAM7E,EAAKa,EAAOzD,EAAI,IAAI,EACrB8J,EAAY,IAAIlH,CAAE,IACrBkH,EAAY,IAAIlH,EAAI2B,CAAM,EAC1BwF,EAAW,IAAI/J,EAAI,IAAI,GAErBuE,EAAS4E,GAAa5D,EAAM2D,GAC9Bc,EAAY,KAAK,CAAE,IAAAhK,EAAK,UAAWuE,CAAM,CAAE,CAE/C,CACAA,EAASgB,EACTvF,EAAM8C,EAAO,KAAI,EAAG,GAAG9C,EAAI,MAAM,CACnC,CACA,GAAI6J,IAAW,OACb,MAAM,IAAI,MACR,kCAAkCxG,EAAQ,UAAU,6CAA6CsG,EAAM,UAAU,EAAE,EAGvH,MAAO,CAAE,OAAAE,EAAQ,YAAAC,EAAa,WAAAC,EAAY,YAAAC,EAAa,MAAAvC,CAAK,CAC9D,CASQ,MAAM,YACZtB,EACAa,EACAiE,EACAnB,EACAZ,EACAC,EACAxJ,EACAgE,EAAe,CAMf,IAAMgI,GAAY,MAAMxF,EAAKa,EAAI,IAAI,GAAG,YAClC4E,EACJ5E,EAAI,cAAgB,UAAYA,EAAI,WAAaA,EAAI,WAAa2E,EAC9DE,EAAuB,CAAA,EACzBC,EAAoB,CAAA,EACpBC,EAAsB,CAAA,EACtBC,EAAY,EACZC,EAAU,EACVxE,EAAQ,EACRyE,EACA3G,EACAvF,EAAuB,CAAE,KAAMgH,EAAI,KAAM,OAAQA,EAAI,MAAM,EAC/D,KAAOzB,IAAQ,QAEb,GADA,KAAK,QAAQ,eAAc,EACvBvF,IAAQ,QAAaA,EAAI,OAAS,EACpCuF,EACE2G,IAAY,OAAY,oBAAsB,8BACvCD,EAAUtM,EACnB4F,EAAM,YACD,CACL,IAAMgC,EAAYuC,EAAY,IAAIrG,EAAOzD,EAAI,IAAI,CAAC,EAC5CmM,EAAWD,IAAY,OAC7B,GAAI3E,IAAc,QAAaA,GAAa4B,EAC1C5D,EAAM4G,EAAW,qBAAuB,sBACnC,CAEH,CAACA,GACD5E,IAAc,QACdA,GAAa2B,IAEbgD,EAAUD,GAEZ,IAAMnJ,EAAS,MAAMqD,EAAKnG,EAAI,IAAI,EAClC,GAAIkM,IAAY,OAAW,CACzB,IAAM/B,EAAO,CAAE,IAAAnK,EAAK,GAAIiM,EAAS,IAAKnJ,EAAO,WAAW,EACpDyE,IAAc,QAChBwE,EAAQ,KAAK5B,CAAI,EACjB6B,GAAa7B,EAAK,MAQd6B,EAAYrI,GAAW4D,EAAY2B,GACrC2C,EAAO,KAAKC,CAAK,EACjBA,EAAQ,CAAA,GAERA,EAAM,KAAK,GAAGC,CAAO,EAEvBA,EAAU,CAAA,EACVC,EAAY,EACZF,EAAM,KAAK3B,CAAI,EAEnB,CACA1C,GAAS,EACTwE,GAAWnJ,EAAO,YAClB9C,EAAM8C,EAAO,KAAI,EAAG,GAAG9C,EAAI,MAAM,CACnC,CACF,CAEF6L,EAAO,KAAKC,CAAK,EACjB,IAAMM,EAAoB,CAAA,EAC1B,QAAW3E,KAASoE,EAAQ,CAC1B,IAAMjL,EAAQ6G,EAAM,CAAC,EACfxI,EAAOwI,EAAMA,EAAM,OAAS,CAAC,EACnC,GAAI7G,IAAU,QAAa3B,IAAS,OAAW,CAC7C,IAAMiE,EAAiB,CAAA,EACjBsE,EAAoB,CAAA,EACtBhH,EAAM,EACV,QAAW2J,KAAQ1C,EACjB,MAAM,KAAK,WAAWhE,EAAO0G,EAAK,IAAI,IAAI,CAAC,EAC3CjH,EAAK,KAAKiH,EAAK,IAAI,IAAI,EACvB3C,EAAQ,KAAK2C,EAAK,IAAI,MAAM,EAC5B3J,GAAO2J,EAAK,IAEd,IAAMlC,EAAOrH,EAAM,GACbyL,EAAKpN,EAAK,GAAKA,EAAK,IAC1BmN,EAAM,KAAK,CACT,KAAAlJ,EACA,QAAAsE,EACA,IAAAhH,EACA,OAAQ,OACR,SACEwG,EAAI,cAAgB,UAChB,CACE,WAAYA,EAAI,WAChB,KAAAiE,EACA,YAAa,UACb,SAAUW,EAAO3D,EACjB,OAAQ2D,EAAOS,GAEjB,CACE,WAAYrF,EAAI,WAChB,KAAAiE,EACA,YAAa,UACb,SAAUW,EAAOS,EACjB,OAAQT,EAAO3D,GAExB,CACH,CACF,CACA,MAAO,CAAE,MAAAR,EAAO,IAAAlC,EAAK,MAAA6G,CAAK,CAC5B,CASQ,MAAM,yBACZ1D,EACAoB,EACAC,EACAjB,EACA0B,EACAD,EACAjB,EAAsB,CAEtB,IAAMpH,EAAOF,GAAW,CAAC,GAAG0G,CAAO,EAAE,KAAK,CAACnK,EAAGC,IAAMD,EAAIC,CAAC,CAAC,EAC1D8K,EAAM,MAAQpH,EACd,IAAM6I,EAAW,IAAI,IACrB,OAAW,CAACnK,EAAO3B,CAAI,IAAKiD,EAAM,CAChC,IAAM8I,EAAU,MAAM,KAAK,GAAG,wBAAwBpK,EAAO3B,CAAI,EACjEqK,EAAM,UAAY0B,EAAQ,OAC1B,QAAWG,KAAUH,EAAS,CAC5B,IAAMsB,EAAcxC,EAAY,IAAIrG,EAAO0H,EAAO,IAAI,CAAC,EACvD,GACE,CAACX,EAAQ,IAAIW,EAAO,UAAU,IAC7B,CAACmB,GAAevC,EAAW,IAAIoB,EAAO,IAAI,IAC3CrC,EAAOyB,EAAOY,EAAO,UAAU,CAAC,EAChC,CACA,IAAMoB,EAAaxB,EAAS,IAAII,EAAO,UAAU,GAAK,CAAA,EAClDmB,EACFC,EAAW,QAAQpB,CAAM,EAEzBoB,EAAW,KAAKpB,CAAM,EAExBJ,EAAS,IAAII,EAAO,WAAYoB,CAAU,CAC5C,CACF,CACF,CACA,OAAOxB,CACT,CAEA,MAAM,eAAa,CACjB,GAAI,CAAC,KAAK,GAAG,kBACX,MAAM,IAAI,MACR,2EAA2E,EAG/E,IAAMyB,EAAY,MAAM,KAAK,GAAG,wBAAuB,GAAO,KACxDtK,EAAOF,GAAW,KAAK,cAAa,CAAE,EAC5C,GAAIE,EAAK,SAAW,EAClB,OAEF,IAAM8I,EAAU,IAAI,IACpB,OAAW,CAACpK,EAAO3B,CAAI,IAAKiD,EAC1B,QAAWiJ,KAAU,MAAM,KAAK,GAAG,wBAAwBvK,EAAO3B,CAAI,EACpE+L,EAAQ,IAAIjL,GAAOoL,CAAM,EAAGA,CAAM,EAGtC,IAAMsB,EAAWtK,GAAkB,CACjC,IAAIvC,EAAK,EACLC,EAAKqC,EAAK,OAAS,EACvB,KAAOtC,EAAKC,GAAI,CACd,IAAMC,EAAOF,EAAKC,EAAK,GAAM,EACzBqC,EAAKpC,CAAG,EAAG,CAAC,GAAKqC,EACnBvC,EAAKE,EAELD,EAAKC,EAAM,CAEf,CACA,IAAM4M,EAAMxK,EAAKtC,CAAE,EACnB,OAAO8M,EAAI,CAAC,GAAKvK,GAAUA,GAAUuK,EAAI,CAAC,CAC5C,EACMC,EAAS,IAAI,IACnB,KAAK,MAAM,QAAQ,CAAC9K,EAAMV,IAAS,CAC7BU,EAAK,KAAK,OAAS,GAAKV,IAAU,KAAK,OACzCwL,EAAO,IAAI5M,GAAO6B,GAAaC,EAAM,CAAC,CAAC,EAAGV,CAAK,CAEnD,CAAC,EACD,IAAMyL,EAAiB,KAAK,MAAM,eAClCA,EAAe,SAAWJ,EAC1BI,EAAe,MAAQ1K,EACvB0K,EAAe,cAAgB5B,EAAQ,KACvC,KAAK,MAAM,QAAQ,CAACnJ,EAAMV,IAAS,CAC7BA,IAAU,KAAK,OACjByL,EAAe,gBAAgB,KAAK/K,EAAK,GAAG,CAEhD,CAAC,EACD,IAAMgL,EAAa,KAAK,aAAa,IAAK,CACxC,KAAK,MAAM,uBAAyB,EACpCD,EAAe,cAAgB,CACjC,CAAC,EACKE,EAAY3K,IAChByK,EAAe,cAAgB,EACxBC,EAAW1K,CAAM,GAEpB4K,EAAW,MAAO/M,EAAUgN,IAAsB,CACtD,GAAIP,EAAQzM,EAAI,IAAI,EAClB,OAAOgL,EAAQ,IAAIjL,GAAOC,CAAG,CAAC,EAEhC,KAAK,MAAM,uBAAyB,EACpC4M,EAAe,gBAAkB,EACjCI,EAAM,OAAS,EACf,IAAM7B,EAAS,MAAM,KAAK,GAAG,kBAAkBnL,EAAI,KAAMA,EAAI,MAAM,EACnE,OAAKmL,IACHyB,EAAe,iBAAmB,GAE7BzB,CACT,EACM8B,EAAQ,IAAI,IACZ1C,EAAS,MAAOrG,GAAsB,CAC1C,IAAI+G,EAAOgC,EAAM,IAAI/I,CAAU,EAC/B,GAAI,CAAC+G,EAAM,CACT,IAAM/H,EAAO,MAAM,KAAK,GAAG,QAAQgB,CAAU,EAC7C,GAAI,CAAChB,EACH,MAAM,IAAI,MAAM,QAAQgB,CAAU,+BAA+B,EAEnE+G,EAAO/H,EAAK,KACZ+J,EAAM,IAAI/I,EAAY+G,CAAI,CAC5B,CACA,OAAOA,CACT,EACMiC,EAAmB,CACvB/B,EACAc,EACAkB,IAEAhC,EAAO,cAAgB,UACnB,CACE,WAAYA,EAAO,WACnB,YAAa,UACb,KAAMA,EAAO,WAAac,GAE5B,CACE,WAAYd,EAAO,WACnB,YAAa,UACb,KAAMA,EAAO,WAAac,EAAUkB,GAEtCC,EAAqB,CACzBC,EACApB,IAEAoB,EAAS,cAAgB,UACrB,CACE,WAAYA,EAAS,WACrB,YAAa,UACb,KAAMA,EAAS,SAAWpB,GAE5B,CACE,WAAYoB,EAAS,WACrB,YAAa,UACb,KAAMA,EAAS,OAASpB,GAGhC,QAAS1I,EAAQ,EAAGA,EAAQ,KAAK,MAAM,OAAQA,IAAS,CACtD,IAAM+J,EAAY,KAAK,MAAM/J,CAAK,EAClC,GAAIA,IAAU,KAAK,OAAS+J,EAAU,SACpC,SAEF,IAAMN,EAA8C,CAAA,EAC9CrI,EAAU,IAAI,IACd7B,EAAsB,CAC1B,UAAW,EACX,MAAO,EACP,MAAO,EACP,UAAW,EACX,aAAc,EACd,IAAK,YACL,WAAY,QAEd8J,EAAe,OAAO,KAAK9J,CAAM,EACjC,IAAI+G,EACAoC,EAAU,EACVvK,EAA8B6B,EAC9BvD,EACJ,KAAO6J,IAAW,QAAW,CAE3B,GADA,KAAK,QAAQ,eAAc,EACvBnI,IAAY,OAAW,CACzB,GAAIiD,EAAQ,IAAIjD,CAAO,EAAG,CACxBoB,EAAO,IAAM,QACb,KACF,CACA6B,EAAQ,IAAIjD,CAAO,EACnB,IAAMG,EAAO,KAAK,MAAMH,CAAO,EAC/BsL,EAAM,KAAK,CAAE,MAAOtL,EAAS,QAASuK,CAAO,CAAE,EAC/CnJ,EAAO,WAAa,EACpB,IAAIyK,EAAKtB,EACT,QAASnK,EAAI,EAAGA,EAAID,EAAK,KAAK,OAAQC,IAAK,CACzC,IAAM0L,EAAW5L,GAAaC,EAAMC,CAAC,EAC/BqJ,EAASH,EAAQ,IAAIjL,GAAOyN,CAAQ,CAAC,EACrCL,GAAU,KAAK,OAAOK,EAAS,IAAI,EAAE,YAC3C,GAAIrC,EAAQ,CACVtB,EAASqD,EAAiB/B,EAAQoC,EAAIJ,EAAO,EAC7C,KACF,CACAI,GAAMJ,EACR,CAEA,GADAlB,GAAWpK,EAAK,IACZgI,EAAQ,CACV/G,EAAO,IAAM,qBACb,KACF,CACA,IAAM7D,EAAO2C,GAAaC,EAAMA,EAAK,KAAK,OAAS,CAAC,EACpD7B,EAAM,KAAK,OAAOf,EAAK,IAAI,EAAE,KAAI,EAAG,GAAGA,EAAK,MAAM,EAClDyC,EAAU,MACZ,CACA,GAAI1B,IAAQ,QAAaA,EAAI,OAAS,EAAW,CAC/C8C,EAAO,IAAM,YACb,KACF,CACA,IAAMgC,EAAM/E,GAAOC,CAAG,EAChByN,EAAQd,EAAO,IAAI7H,CAAG,EAC5B,GAAI2I,IAAU,OAAW,CACvB,IAAMJ,EAAW,KAAK,MAAMI,CAAK,EAAG,SACpC,GAAIJ,EAAU,CACZxD,EAASuD,EAAmBC,EAAUpB,CAAO,EAC7CnJ,EAAO,IAAM,qBACb,KACF,CACApB,EAAU+L,EACV,QACF,CACI,KAAK,QAAQ,IAAIzN,EAAI,IAAI,IAC3B8C,EAAO,WAAa,GAElB,KAAK,WAAW,IAAIgC,CAAG,IACzBhC,EAAO,cAAgB,GAEzB,IAAMqI,EAAS,MAAM4B,EAAS/M,EAAK8C,CAAM,EACnCnE,EAAO,MAAMmO,EAAS9M,EAAI,IAAI,EACpC,GAAImL,EAAQ,CACVtB,EAASqD,EAAiB/B,EAAQc,EAAStN,EAAK,WAAW,EAC3DmE,EAAO,IAAM,uBACb,KACF,CAGA,GAFA,KAAK,MAAM,qBAAuB,EAClCA,EAAO,OAAS,EAEdmJ,EAAWe,EAAMA,EAAM,OAAS,CAAC,EAA0B,QAC3D,EAAIR,EAAW,EAAI7N,EAAK,YACxB,CACAmE,EAAO,IAAM,QACb,KACF,CACAmJ,GAAWtN,EAAK,YAChBqB,EAAMrB,EAAK,KAAI,EAAG,GAAGqB,EAAI,MAAM,CACjC,CACA,GAAI6J,EAAQ,CACV/G,EAAO,WAAa+G,EAAO,WAC3B,IAAMoB,EAAO,MAAMV,EAAOV,EAAO,UAAU,EAC3C,OAAW,CAAE,MAAA1I,EAAO,QAAA+K,CAAO,IAAMc,EAAO,CACtC,IAAMnL,EAAO,KAAK,MAAMV,CAAK,EAC7BU,EAAK,SACHgI,EAAO,cAAgB,UACnB,CACE,WAAYA,EAAO,WACnB,KAAAoB,EACA,YAAa,UACb,SAAUpB,EAAO,KAAOqC,EACxB,OAAQrC,EAAO,KAAOqC,EAAUrK,EAAK,KAEvC,CACE,WAAYgI,EAAO,WACnB,KAAAoB,EACA,YAAa,UACb,SAAUpB,EAAO,KAAOqC,EAAUrK,EAAK,IACvC,OAAQgI,EAAO,KAAOqC,EAEhC,CACF,CACF,CACF,CAEQ,SAASwB,EAAa,CAC5B,GAAI,KAAK,gBAAkB,OAAW,CACpC,IAAMvM,EAAQ,IAAI,IAClBuM,EAAI,QAAQ,CAACvL,EAAQrD,IAAK,CACxB,IAAM6O,EAAcxM,EAAM,IAAIgB,CAAM,EAChCwL,EACFA,EAAY,KAAK7O,CAAC,EAElBqC,EAAM,IAAIgB,EAAQ,CAACrD,CAAC,CAAC,CAEzB,CAAC,EACD,KAAK,cAAgBqC,CACvB,CACA,OAAO,KAAK,aACd,CAEQ,UAAUuM,EAAa,CAC7B,GAAI,KAAK,iBAAmB,OAAW,CACrC,IAAME,EAAS,CAAC,CAAC,EACjBF,EAAI,QAAQ,CAACvL,EAAQrD,IAAK,CACxB8O,EAAO,KAAKA,EAAO9O,CAAC,EAAK,KAAK,OAAOqD,CAAM,EAAE,WAAW,CAC1D,CAAC,EACD,KAAK,eAAiByL,CACxB,CACA,OAAO,KAAK,cACd,CAEQ,eAAe1K,EAAgBwK,EAAa,CAClD,IAAMvM,EAAQ,KAAK,SAASuM,CAAG,EACzBnO,EAAS,IAAI,WAAW2D,EAAK,MAAM,EACnC1D,EAAQ,IAAI,WAAW0D,EAAK,MAAM,EACpCyD,EAAQ,EACR1H,EAAO,GACX,QAASH,EAAI,EAAGA,EAAIoE,EAAK,OAAQpE,IAAK,CACpC,IAAM6O,EAAcxM,EAAM,IAAI+B,EAAKpE,CAAC,CAAE,EACtC,GAAI6O,EAAa,CACf,IAAMvG,EAAI3H,GAAWkO,EAAa1O,CAAI,EACtC,GAAImI,IAAM,OACR,OAEF7H,EAAOoH,CAAK,EAAI7H,EAChBU,EAAMmH,CAAK,EAAIS,EACfT,GAAS,EACT1H,EAAOmI,CACT,CACF,CACA,MAAO,CAAE,OAAA7H,EAAQ,MAAAC,EAAO,MAAAmH,CAAK,CAC/B,CAEQ,QAAQzD,EAAc,CAC5B,IAAI2K,EAAQ,EACZ,QAAW1L,KAAUe,EACnB2K,GAAS,KAAK,OAAO1L,CAAM,EAAE,YAE/B,OAAO0L,CACT,CAEQ,cAAc3K,EAAgBwK,EAAa,CACjD,IAAI/H,EAAS,EACTmI,EAAK,EACLC,EAAK,EACLC,EAAK,EACLC,EAAK,EACT,KAAOH,EAAK5K,EAAK,QAAU6K,EAAKL,EAAI,QAAQ,CAC1C,IAAMnP,EAAI,KAAK,OAAO2E,EAAK4K,CAAE,CAAE,EAAE,SAC3BtP,EAAI,KAAK,OAAOkP,EAAIK,CAAE,CAAE,EAAE,SAChC,KAAOC,EAAKzP,EAAE,QAAU0P,EAAKzP,EAAE,QAAQ,CACrC,GAAID,EAAEyP,CAAE,IAAMxP,EAAEyP,CAAE,EAChB,OAAOtI,EAETqI,GAAM,EACNC,GAAM,EACNtI,GAAU,CACZ,CACIqI,IAAOzP,EAAE,SACXuP,GAAM,EACNE,EAAK,GAEHC,IAAOzP,EAAE,SACXuP,GAAM,EACNE,EAAK,EAET,CACA,OAAOtI,CACT,CAEQ,cAAczC,EAAgBwK,EAAa,CACjD,IAAI/H,EAAS,EACTmI,EAAK,EACLC,EAAK,EACLC,EAAK,EACLC,EAAK,EACT,KAAOH,EAAK5K,EAAK,QAAU6K,EAAKL,EAAI,QAAQ,CAC1C,IAAMnP,EAAI,KAAK,OAAO2E,EAAKA,EAAK,OAAS4K,EAAK,CAAC,CAAE,EAAE,SAC7CtP,EAAI,KAAK,OAAOkP,EAAIA,EAAI,OAASK,EAAK,CAAC,CAAE,EAAE,SACjD,KAAOC,EAAKzP,EAAE,QAAU0P,EAAKzP,EAAE,QAAQ,CACrC,GAAID,EAAEA,EAAE,OAASyP,EAAK,CAAC,IAAMxP,EAAEA,EAAE,OAASyP,EAAK,CAAC,EAC9C,OAAOtI,EAETqI,GAAM,EACNC,GAAM,EACNtI,GAAU,CACZ,CACIqI,IAAOzP,EAAE,SACXuP,GAAM,EACNE,EAAK,GAEHC,IAAOzP,EAAE,SACXuP,GAAM,EACNE,EAAK,EAET,CACA,OAAOtI,CACT,CAEQ,MAAMzC,EAAgBwK,EAAepN,EAAa,CACxD,IAAM4N,EAAU,KAAK,QAAQhL,CAAI,EAC3BgH,EAAS,KAAK,QAAQwD,CAAG,EACzBE,EAAS,KAAK,cAAc1K,EAAMwK,CAAG,EACvCS,EAAS,KAAK,cAAcjL,EAAMwK,CAAG,EACrCE,EAASO,EAASD,IACpBC,EAASD,EAAUN,GAEjBA,EAASO,EAASjE,IACpBiE,EAASjE,EAAS0D,GAEpBlN,EAAWJ,EAAO,IAAKsN,CAAM,EAC7BnN,GAAUH,EAAO4N,EAAUN,EAASO,EAAQjE,EAAS0D,EAASO,CAAM,EACpEzN,EAAWJ,EAAO,IAAK6N,CAAM,CAC/B,CAEQ,aAAajL,EAAgBwK,EAAa,CAChD,IAAMvM,EAAQ,KAAK,SAASuM,CAAG,EAC3BU,EAAS,EACb,QAAWjM,KAAUe,EACf/B,EAAM,IAAIgB,CAAM,IAClBiM,GAAU,KAAK,OAAOjM,CAAM,EAAE,aAGlC,OAAOiM,CACT,CAEQ,aAAalL,EAAgBwK,EAAa,CAChD,IAAMW,EAAU,KAAK,eAAenL,EAAMwK,CAAG,EACzCW,EACF,KAAK,MAAM,mBAAqB,EAEhC,KAAK,MAAM,eAAiB,EAE9B,IAAMC,EACJD,GACAhP,GACEkP,GAAYrL,EAAMwK,EAAKvL,GAAU,KAAK,OAAOA,CAAM,EAAE,WAAW,EAAE,CAAC,CAAC,EAElE7B,EAAgB,CAAA,EAChBkO,EAAY,KAAK,UAAUd,CAAG,EAC9Be,EAAW,CACfC,EACAC,EACAC,EACAC,IACE,CACEH,IAAaC,EACfjO,EAAWJ,EAAO,IAAKkO,EAAUK,CAAK,EAAKL,EAAUI,CAAO,CAAE,EACrDA,IAAYC,EACrBnO,EAAWJ,EAAO,IAAK,KAAK,QAAQ4C,EAAK,MAAMwL,EAAUC,CAAM,CAAC,CAAC,EAEjE,KAAK,MACHzL,EAAK,MAAMwL,EAAUC,CAAM,EAC3BjB,EAAI,MAAMkB,EAASC,CAAK,EACxBvO,CAAK,CAGX,EACIwO,EAAU,EACVtL,EAAa,EACb+D,EAAY,EAChB,QAASwH,EAAI,EAAGA,EAAIT,EAAI,MAAOS,IAAK,CAClC,IAAMC,EAAWV,EAAI,OAAOS,CAAC,EACvBE,EAAUX,EAAI,MAAMS,CAAC,GAIvBvL,IAAewL,GAAYzH,IAAc0H,IAC3CR,EAASjL,EAAYwL,EAAUzH,EAAW0H,CAAO,EAEnD,IAAM9B,EAAU,KAAK,OAAOjK,EAAK8L,CAAQ,CAAE,EAAE,YAC7CtO,EAAWJ,EAAO,IAAK6M,CAAO,EAC9B2B,GAAW3B,EACX3J,EAAawL,EAAW,EACxBzH,EAAY0H,EAAU,CACxB,CACA,OAAAR,EAASjL,EAAYN,EAAK,OAAQqE,EAAWmG,EAAI,MAAM,EAChD,CAAE,MAAApN,EAAO,QAAAwO,CAAO,CACzB,CAEQ,UAAUI,EAAiB,CACjC,IAAMrN,EAAO,KAAK,MAAMqN,CAAS,EACjC,GAAI,KAAK,QAAU,QAAaA,IAAc,KAAK,OAAS,CAACrN,EAC3D,OAEF,IAAM6L,EAAM,KAAK,MAAM,KAAK,KAAK,EAAG,KAChC/H,EACJ,GAAIwJ,GAAgBzB,CAAG,EAIrB/H,EAAS,CACP,MAAO,KAAK,aAAa9D,EAAK,KAAM6L,CAAG,EAAE,MACzC,QAAS,QAEN,CACL,IAAM0B,EAAcvN,EAAK,KAAK,IAAIM,GAAUqD,EAASrD,CAAM,CAAC,EAAE,QAAO,EAC/DkN,EAAe,KAAK,aAAaxN,EAAK,KAAM6L,CAAG,EAErD,GADqB,KAAK,aAAa0B,EAAa1B,CAAG,IAClC,EACnB/H,EAAS,CACP,MAAO,KAAK,aAAa9D,EAAK,KAAM6L,CAAG,EAAE,MACzC,QAAS,YAEF2B,IAAiB,EAC1B1J,EAAS,CACP,MAAO,KAAK,aAAayJ,EAAa1B,CAAG,EAAE,MAC3C,QAAS,QAEN,CACL,IAAM3K,EAAU,KAAK,aAAalB,EAAK,KAAM6L,CAAG,EAC1C4B,EAAU,KAAK,aAAaF,EAAa1B,CAAG,EAClD/H,EACE2J,EAAQ,QAAUvM,EAAQ,QACtB,CAAE,MAAOuM,EAAQ,MAAO,QAAS,EAAI,EACrC,CAAE,MAAOvM,EAAQ,MAAO,QAAS,EAAK,CAC9C,CACF,CACA,OAAO4C,CACT,CAEA,WAAWuJ,EAAiB,CAC1B,OAAO,KAAK,UAAUA,CAAS,GAC3B,MAAM,IAAI,CAAC,CAAC3O,EAAIC,CAAG,IAAM,GAAGA,CAAG,GAAGD,CAAE,EAAE,EACvC,KAAK,EAAE,CACZ,CAEA,YAAU,CACR,IAAM0D,EAAY,KAAK,kBACvB,GAAI,KAAK,QAAU,QAAa,CAACA,EAC/B,MAAM,IAAI,MAAM,kCAAkC,EAEpD,IAAMyJ,EAAM,KAAK,MAAM,KAAK,KAAK,EAAG,KAC9B6B,EAAW,KAAK,UAAU7B,CAAG,EAAEA,EAAI,MAAM,EACzC3M,EAAiC,CAAA,EACvC,YAAK,MAAM,QAAQ,CAACc,EAAMV,IAAS,CACjC,GAAIA,IAAU,KAAK,MACjB,OAEF,GAAM,CAAE,MAAAb,EAAO,QAAAgP,CAAO,EAAK,KAAK,UAAUnO,CAAK,EAC3CP,EAAQ,EACR4O,EAAU,EACd,KAAO5O,EAAQN,EAAM,QAAUA,EAAMM,CAAK,EAAG,CAAC,IAAM,KAClD4O,GAAWlP,EAAMM,CAAK,EAAG,CAAC,EAC1BA,GAAS,EAEX,IAAI3B,EAAOqB,EAAM,OACbmP,EAAW,EACf,KAAOxQ,EAAO2B,GAASN,EAAMrB,EAAO,CAAC,EAAG,CAAC,IAAM,KAC7CwQ,GAAYnP,EAAMrB,EAAO,CAAC,EAAG,CAAC,EAC9BA,GAAQ,EAEV,IAAMoO,EAAWxL,EAAK,SAChB6N,EAAiBrC,EAClBA,EAAS,cAAgB,YAAeiC,EACzC,CAACA,EACLvO,EAAU,KAAK,CACb,OAAQ2O,EAAiB,IAAM,IAC/B,SAAUzL,EAAU,MAAQuL,EAC5B,OAAQvL,EAAU,MAAQsL,EAAWE,EACrC,MAAOnP,EAAM,MAAMM,EAAO3B,CAAI,EAC9B,OAAQ4C,EAAK,OACb,KAAMA,EAAK,KACX,MAAOD,GAAaC,EAAM,CAAC,EAC3B,SACEwL,IAAa,OACT,OACA,CACE,WAAYA,EAAS,WACrB,KAAMA,EAAS,KACf,SAAUA,EAAS,KAAK,SAAWA,EAAS,SAC5C,OAAQA,EAAS,KAAK,SAAWA,EAAS,OAC1C,YAAaA,EAAS,cAAgB,WAE/C,CACH,CAAC,EACMvM,GAAaC,CAAS,EAAE,IAAIG,GAAW,CAC5C,GAAM,CAAE,MAAAZ,EAAO,SAAA+M,EAAU,GAAGsC,CAAI,EAAKzO,EAC/B0O,EAAsB,CAAE,GAAGD,EAAM,MAAOE,GAAQvP,CAAK,CAAC,EAC5D,OAAO+M,EACH,CACE,GAAGuC,EACH,SAAU,GACV,KAAMvC,EAAS,KACf,MAAOlK,EACL,CAAE,GAAGkK,EAAS,KAAM,SAAUA,EAAS,QAAQ,EAC/CA,EAAS,MAAM,EAEjB,WAAYA,EAAS,WACrB,SAAUA,EAAS,SACnB,OAAQA,EAAS,QAEnB,CAAE,GAAGuC,EAAM,SAAU,EAAK,CAChC,CAAC,CACH,CAMA,eAAejN,EAA0B,CACvC,GAAM,CAAE,OAAAmN,EAAQ,MAAA7M,EAAO,OAAA8M,CAAM,EAAKpN,EAC5BqN,EAAQ,KAAK,MAAM,QAAQnO,GAAO,CACtC,GAAM,CAAE,SAAAwL,CAAQ,EAAKxL,EACrB,OAAOwL,EACH,CACE,CACE,KAAMA,EAAS,KACf,MAAOA,EAAS,KAAK,SAAWA,EAAS,SACzC,MAAO4C,GAAqBpO,EAAMwL,CAAQ,IAG9C,CAAA,CACN,CAAC,EACKJ,EAASiD,GAA6BjF,GAC1CA,EAAK,SAAWiF,EAAU,QAAUjF,EAAK,YAAciF,EAAU,UAC7DC,EAAWlD,EAAM6C,CAAM,EACvBM,EAAUnN,EAAQgK,EAAMhK,CAAK,EAAKgI,GAAmB,CAACkF,EAASlF,CAAI,EACnEoF,EAAczN,GAClB,KAAK,OAAOC,EAAWD,EAAI,SAAS,CAAC,EAAE,SACzC,OAAOoN,EACJ,OAAO3R,GAAQ8R,EAAS9R,EAAK,IAAI,CAAC,EAClC,QAAQiS,GACPN,EACG,OAAO3R,GAAQ+R,EAAQ/R,EAAK,IAAI,CAAC,EACjC,QAAQkS,GACPC,GACED,EAAU,MACVD,EAAW,MACXD,EACAN,IAAW,OAAY,CAAA,EAAK,CAAE,OAAAA,CAAM,CAAE,EACtC,IAAI/C,IAAU,CACd,MAAOuD,EAAU,KACjB,WAAYA,EAAU,MAAQvD,EAAM,WACpC,SAAUuD,EAAU,MAAQvD,EAAM,SAClC,OAAQA,EAAM,OACd,OAAQsD,EAAW,KACnB,YAAaA,EAAW,MAAQtD,EAAM,YACtC,UAAWsD,EAAW,MAAQtD,EAAM,UACpC,MAAOyD,GAAUzD,EAAM,KAAK,EAC5B,QAASA,EAAM,MAAM,OACnB,CAAC0D,EAAK,CAACnQ,EAAIC,CAAG,IAAMkQ,GAAOnQ,IAAO,IAAMC,EAAM,GAC9C,CAAC,EAEH,QAASwM,EAAM,MAAM,OAAO,CAAC0D,EAAK,CAAC,CAAElQ,CAAG,IAAMkQ,EAAMlQ,EAAK,CAAC,EAC1D,YAAawM,EAAM,aACnB,CAAC,CACJ,CAET,CAEQ,eAAepK,EAAU,CAC/B,IAAM+N,EAAoC,CAAA,EAC1C,QAAW/M,IAAe,CAAC,UAAW,SAAS,EAAY,CACzD,IAAMzB,EAASU,EAAWD,EAAIgB,CAAW,EACzC,QAAWwB,KAAa,KAAK,OAAOjD,CAAM,EAAE,WAAU,EAChD,KAAK,UAAUiD,CAAS,GAAKS,GAAgB1D,EAAQiD,CAAS,GAChEuL,EAAM,KAAK,CACT/M,IAAgB,UAAY,EAAI,EAChCH,EAAO2B,CAAS,EAChB4C,EAAU5C,CAAS,EAAI,EAAI,EAC5B,CAGP,CACA,OAAAuL,EAAM,KAAK,CAACpS,EAAGC,IAAMD,EAAE,CAAC,EAAIC,EAAE,CAAC,GAAKD,EAAE,CAAC,EAAIC,EAAE,CAAC,GAAKD,EAAE,CAAC,EAAIC,EAAE,CAAC,CAAC,EACvDmS,EAAM,OACX,CAACC,EAAM9R,IACLA,IAAM,GACN8R,EAAK,CAAC,IAAMD,EAAM7R,EAAI,CAAC,EAAG,CAAC,GAC3B8R,EAAK,CAAC,IAAMD,EAAM7R,EAAI,CAAC,EAAG,CAAC,GAC3B8R,EAAK,CAAC,IAAMD,EAAM7R,EAAI,CAAC,EAAG,CAAC,CAAC,CAElC,CAEA,MAAM,YAAU,CACd,IAAM+R,EAAU,IAAI,YACdC,EAAuB,CAAA,EAC7B,QAAW3O,KAAU,KAAK,cAAa,EACrC,GAAI,CAAC6F,EAAU7F,CAAM,EAAG,CACtB,IAAMS,EAAKa,EAAOtB,CAAM,EACpB4O,EAAO,KAAMnO,CAAE,IAAK,KAAK,OAAOT,CAAM,EAAE,QAAQ;EACpD,OAAW,CAAC6O,EAAaC,EAAMC,CAAS,IAAK,KAAK,eAAetO,CAAE,EACjEmO,GAAQ,KAAMnO,CAAE,IAAKoO,EAAc,IAAM,GAAG,IAAKC,CAAI,IAAKC,EAAY,IAAM,GAAG;EAEjFJ,EAAO,KAAKD,EAAQ,OAAOE,CAAI,CAAC,CAClC,CAEF,OAAOI,GAAUL,CAAM,CACzB,CAEA,MAAM,MAAMnO,EAA8B,CAAA,EAAE,CAC1C,IAAMyO,EAAQzO,EAAK,OAAS,GACtB0O,EAAQ,CACZ,KAAK,QAAU,mBAAqB,KAAK,QAAQ,MAAM,GAAK,aAC5D,GAAGC,GACDC,GAAa,MAAM,KAAK,WAAU,EAAI,MAAM,KAAK,GAAG,UAAS,CAAE,CAAC,GAG9DhP,EAAU,KAAK,cAAa,EAClC,QAAWJ,KAAUI,EACdyF,EAAU7F,CAAM,GACnBkP,EAAM,KAAK,KAAM5N,EAAOtB,CAAM,CAAC,IAAK,KAAK,OAAOA,CAAM,EAAE,QAAQ,EAAE,EAGtE,IAAMqP,EAAQrP,GAAoB6F,EAAU7F,CAAM,EAAI,IAAM,IAC5D,QAAWA,KAAUI,EACnB,QAAW6C,KAAa,KAAK,OAAOjD,CAAM,EAAE,WAAU,EAChD,KAAK,UAAUiD,CAAS,GAAKS,GAAgB1D,EAAQiD,CAAS,GAChEiM,EAAM,KACJ,KAAM5N,EAAOtB,CAAM,CAAC,IAAKqP,EAAKrP,CAAM,CAAC,IAAKsB,EAAO2B,CAAS,CAAC,IAAKoM,EAAKpM,CAAS,CAAC,KAAM,EAK7F,IAAM/G,EAAO,CACXwD,EACAwL,EACApC,EACA1F,EACAkM,IACE,CACF,IAAMhK,EAAQwI,GAAqBpO,EAAMwL,CAAQ,EAC9C,IAAIlL,GAAU,GAAG6F,EAAU7F,CAAM,EAAI,IAAM,GAAG,GAAGsB,EAAOtB,CAAM,CAAC,EAAE,EACjE,KAAK,EAAE,EACJiM,EAASvM,EAAK,SAAW,OAAY,GAAK,SAAUA,EAAK,MAAM,GAC/D6P,EAAKD,IAAgB,OAAY,GAAK,SAAUA,CAAW,GACjE,MAAO,KAAMxG,EAAK,MAAM,IAAKA,EAAK,SAAS,IAAKA,EAAK,MAAM,IAAKA,EAAK,QAAQ,IAAK1F,CAAG,IAAKkC,CAAK,GAAG2G,CAAM,GAAGsD,CAAE,EAC/G,EACMC,EAAS,KAAK,SAAS,QAAU,UACnC,KAAK,QAAU,QAAa,KAAK,SAAW,KAAK,aACnDN,EAAM,KACJhT,EACE,KAAK,MAAM,KAAK,KAAK,EACrB,OACA,CACE,GAAG,KAAK,QACR,SAAU,KAAK,QAAQ,SAAW,KAAK,YAAY,CAAC,GAEtD,KAAK,QAAQ,SAAW,KAAK,YAAY,CAAC,EAC1C,MAAS,CACV,EAGL,IAAI6R,EAAY,EAChB,YAAK,MAAM,QAAQ,CAACrO,EAAMV,IAAS,CACjC,GAAIA,IAAU,KAAK,MAAO,CACxB,IAAMyQ,EAAWjP,EAAK,QAAU,WAAad,EAAK,SAAW,OACvD4P,EAAcL,EAAQ,KAAK,WAAWjQ,CAAK,EAAI,OACrDkQ,EAAM,KACJO,EACIvT,EACEwD,EACA+P,EACA,CACE,GAAGA,EAAS,KACZ,SAAUA,EAAS,KAAK,SAAWA,EAAS,UAE9CA,EAAS,KAAK,SAAWA,EAAS,OAClCH,CAAW,EAEbpT,EACEwD,EACA,OACA,CAAE,OAAQ,UAAW,OAAA8P,EAAQ,UAAAzB,EAAW,SAAU,CAAC,EACnDrO,EAAK,IACL4P,CAAW,CACZ,EAEPvB,GAAa,CACf,CACF,CAAC,EACM,GAAGmB,EAAM,KAAK;CAAI,CAAC;CAC5B,CAMQ,YAAY1O,EAA2B,CAC7C,IAAMyO,EAAQzO,EAAK,OAAS,GACtBkP,EAKA,CAAA,EACAF,EAAS,KAAK,SAAS,QAAU,UACvC,GAAI,KAAK,QAAU,QAAa,KAAK,SAAW,KAAK,YAAa,CAChE,IAAMpO,EAAQ,CACZ,GAAG,KAAK,QACR,SAAU,KAAK,QAAQ,SAAW,KAAK,YAAY,CAAC,GAEtDsO,EAAQ,KAAK,CACX,KAAM,KAAK,MAAM,KAAK,KAAK,EAC3B,SAAU,OACV,KAAM1O,EACJI,EACA,KAAK,QAAQ,SAAW,KAAK,YAAY,CAAC,CAAC,EAE7C,MAAO,OACR,CACH,CACA,IAAI2M,EAAY,EAChB,YAAK,MAAM,QAAQ,CAACrO,EAAMV,IAAS,CACjC,GAAIA,IAAU,KAAK,MACjB,OAEF,IAAMkM,EAAW1K,EAAK,QAAU,WAAad,EAAK,SAAW,OAC7DgQ,EAAQ,KAAK,CACX,KAAAhQ,EACA,SAAAwL,EACA,KAAMA,EACFlK,EACE,CACE,GAAGkK,EAAS,KACZ,SAAUA,EAAS,KAAK,SAAWA,EAAS,UAE9CA,EAAS,KAAK,SAAWA,EAAS,MAAM,EAE1ClK,EACE,CAAE,OAAQ,UAAW,OAAAwO,EAAQ,UAAAzB,EAAW,SAAU,CAAC,EACnDrO,EAAK,GAAG,EAEd,MAAOuP,EAAQ,KAAK,WAAWjQ,CAAK,EAAI,OACzC,EACD+O,GAAa,CACf,CAAC,EACM2B,CACT,CAEQ,CAAC,aAAW,CAClB,QAAW1P,KAAU,KAAK,cAAa,EACrC,QAAWiD,KAAa,KAAK,OAAOjD,CAAM,EAAE,WAAU,EAChD,KAAK,UAAUiD,CAAS,GAAKS,GAAgB1D,EAAQiD,CAAS,IAChE,KAAM,CAACjD,EAAQiD,CAAS,EAIhC,CAEA,eAAezC,EAA8B,CAAA,EAAE,CAC7C,IAAM+B,EAAQ,KAAK,cAAa,EAC7B,OAAOvC,GAAU,CAAC6F,EAAU7F,CAAM,CAAC,EACnC,IAAIA,IAAW,CACd,GAAI,OAAOsB,EAAOtB,CAAM,CAAC,EACzB,SAAU,KAAK,OAAOA,CAAM,EAAE,UAC9B,EACEwO,EAA+B,CAAA,EACrC,OAAW,CAAC1I,EAAMoE,CAAE,IAAK,KAAK,YAAW,EACvCsE,EAAM,KAAK,CACT,KAAM,OAAOlN,EAAOwE,CAAI,CAAC,EACzB,gBAAiBD,EAAUC,CAAI,EAC/B,GAAI,OAAOxE,EAAO4I,CAAE,CAAC,EACrB,cAAerE,EAAUqE,CAAE,EAC5B,EAEH,IAAMyF,EAAQ,KAAK,YAAYnP,CAAI,EAAE,IAAIuI,GACvC6G,GAAS7G,EAAM,KAAMA,EAAM,SAAUA,EAAM,KAAMA,EAAM,KAAK,CAAC,EAE/D,MAAO,CAAE,MAAAxG,EAAO,MAAAiM,EAAO,MAAAmB,CAAK,CAC9B,CAsBA,kBAAkBnP,EAA8B,CAAA,EAAE,CAChD,IAAMI,EAAU,KAAK,cAAa,EAAG,OAAOZ,GAAU,CAAC6F,EAAU7F,CAAM,CAAC,EAClE6P,EAAU,IAAI,WAAWjP,EAAQ,MAAM,EACvCkP,EAA0B,CAAA,EAChClP,EAAQ,QAAQ,CAACZ,EAAQrD,IAAK,CAC5BkT,EAAQlT,CAAC,EAAI2E,EAAOtB,CAAM,EAC1B8P,EAAc,KAAK,KAAK,OAAO9P,CAAM,EAAE,QAAQ,CACjD,CAAC,EACD,IAAM+P,EAAwB,CAAA,EAC9B,OAAW,CAACjK,EAAMoE,CAAE,IAAK,KAAK,YAAW,EACvC6F,EAAY,KAAKjK,EAAMoE,CAAE,EAE3B,MAAO,CACL,QAAA2F,EACA,cAAAC,EACA,MAAO,WAAW,KAAKC,CAAW,EAClC,MAAO,KAAK,YAAYvP,CAAI,EAAE,IAAIuI,IAAU,CAC1C,KAAMA,EAAM,KACZ,OAAQA,EAAM,KAAK,OACnB,MAAOA,EAAM,MACb,MAAO,WAAW,KAChB+E,GAAqB/E,EAAM,KAAMA,EAAM,QAAQ,CAAC,GAElD,EAEN,GAmBF,SAASiH,GACPC,EACAC,EAAkC,CAElC,OAAOA,GAAU,cAAgB,UAC7BD,EAAK,KAAK,IAAIE,GAAUC,EAASD,CAAM,CAAC,EAAE,QAAO,EACjDF,EAAK,IACX,CAEA,SAASI,GACPJ,EACAC,EACAI,EACAC,EAAyB,CAEzB,MAAO,CACL,KAAAD,EACA,GAAIL,EAAK,SAAW,OAAY,CAAA,EAAK,CAAE,OAAQA,EAAK,MAAM,EAC1D,GAAIM,IAAU,OAAY,CAAA,EAAK,CAAE,MAAAA,CAAK,EACtC,KAAMP,GAAqBC,EAAMC,CAAQ,EAAE,IAAIC,IAAW,CACxD,GAAI,OAAOK,EAAOL,CAAM,CAAC,EACzB,WAAYM,EAAUN,CAAM,GAC5B,EAEN,CAEA,SAASO,GAAaC,EAAaC,EAAW,CAC5C,IAAMC,EAAI,KAAK,IAAIF,EAAE,OAAQC,EAAE,MAAM,EACrC,QAASE,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,IAAMC,EAAIJ,EAAEG,CAAC,EACPE,EAAIJ,EAAEE,CAAC,EACb,GAAIC,IAAMC,EACR,OAAOD,EAAIC,EAAI,GAAK,CAExB,CACA,OAAOL,EAAE,OAASC,EAAE,MACtB,CAEA,SAASK,EAAWC,EAAeC,EAAYC,EAAW,CACxD,GAAIA,IAAQ,EACV,OAEF,IAAMC,EAAOH,EAAMA,EAAM,OAAS,CAAC,EAC/BG,IAAO,CAAC,IAAMF,EAChBE,EAAK,CAAC,GAAKD,EAEXF,EAAM,KAAK,CAACC,EAAIC,CAAG,CAAC,CAExB,CAEA,SAASE,GAAWF,EAAW,CAC7B,OAAOA,IAAQ,EAAI,EAAI,GAAKA,EAAM,EACpC,CAEA,SAASG,GAAUL,EAAeM,EAAoBC,EAAiB,CACrE,GAAID,IAAe,EACjBP,EAAWC,EAAO,IAAKO,CAAS,UACvBA,IAAc,EACvBR,EAAWC,EAAO,IAAKM,CAAU,MAC5B,CACL,IAAME,EAAW,KAAK,IAAIF,EAAYC,CAAS,EACzCE,EACJ,EAAID,EACJJ,GAAWE,EAAaE,CAAQ,EAChCJ,GAAWG,EAAYC,CAAQ,EAC3BE,EAAoBN,GAAWE,CAAU,EAAIF,GAAWG,CAAS,EACnEE,GAAiBC,GACnBX,EAAWC,EAAO,IAAKQ,CAAQ,EAC/BT,EAAWC,EAAO,IAAKM,EAAaE,CAAQ,EAC5CT,EAAWC,EAAO,IAAKO,EAAYC,CAAQ,IAE3CT,EAAWC,EAAO,IAAKM,CAAU,EACjCP,EAAWC,EAAO,IAAKO,CAAS,EAEpC,CACF,CAEA,SAASI,GAAQX,EAAa,CAC5B,OAAOA,EAAM,IAAI,CAAC,CAACC,EAAIC,CAAG,IAAM,GAAGA,CAAG,GAAGD,CAAE,EAAE,EAAE,KAAK,EAAE,CACxD,CCpuFA,eAAsBW,GACpBC,EACAC,EACAC,EACAC,EACAC,EAAqB,CAAA,EAAE,CAEvB,IAAMC,EAAW,IAAIC,GAASN,EAAII,CAAI,EACtC,GAAI,CACF,IAAMG,EAAY,MAAMF,EAAS,aAAaG,GAAYP,EAAOC,CAAK,CAAC,EACvE,MAAMG,EAAS,sBAAsBE,EAAWJ,EAAMD,CAAK,EAC3D,MAAMG,EAAS,eACbE,EAAU,SACVJ,EAAMD,EACNE,EAAK,SAAW,GAAG,EAErB,MAAMC,EAAS,cAAcD,EAAK,QAAU,MAAM,EAClDC,EAAS,aAAaE,EAAWH,EAAK,YAAc,KAAK,CAC3D,OAASK,EAAO,CACd,MAAMA,aAAiBC,GAAsBD,EAAM,WAAa,OAC5D,IAAIC,EAAmBD,EAAM,MAAO,CAClC,SAAUN,EAAMD,EAChB,SAAUG,EAAS,mBAAqB,EACzC,EACDI,CACN,CACA,OAAOJ,CACT,CAWA,eAAsBM,GACpBX,EACAC,EACAC,EACAC,EACAC,EAA2B,CAE3B,GAAI,CAACJ,EAAG,kBACN,MAAM,IAAI,MACR,qEAAqE,EAGzE,IAAMY,EAAU,MAAMZ,EAAG,uBAAsB,EAC3Ca,EACAC,EACJ,GAAIF,IAAY,SAAcR,EAAK,YAAc,SAAW,MAAO,CACjE,IAAMC,EAAW,IAAIC,GAASN,EAAII,CAAI,EACtC,GAAI,CACF,IAAMG,EAAY,MAAMF,EAAS,aAAaG,GAAYP,EAAOC,CAAK,CAAC,EACvEY,EAAW,MAAMT,EAAS,yBACxBE,EACAJ,EAAMD,EACNU,EACAR,EAAK,KACLA,EAAK,SAAW,GAAG,CAEvB,OAASK,EAAO,CACd,MAAMA,aAAiBC,GAAsBD,EAAM,WAAa,OAC5D,IAAIC,EAAmBD,EAAM,MAAO,CAClC,SAAUN,EAAMD,EAChB,SAAUG,EAAS,mBAAqB,EACzC,EACDI,CACN,CACA,GAAIK,IAAa,OACfD,EAAWR,MACN,CACLS,EAAW,GAAGA,CAAQ,iDACtB,IAAMC,EAAU,MAAMhB,GAAmBC,EAAIC,EAAOC,EAAOC,EAAKC,CAAI,EACpE,MAAMW,EAAQ,cAAa,EAC3BA,EAAQ,eAAeX,EAAK,IAAI,EAChCW,EAAQ,MAAM,WAAaV,EAAS,MAAM,WACtCU,EAAQ,MAAM,aAChBA,EAAQ,MAAM,WAAW,SAAWD,GAEtCD,EAAWE,CACb,CACF,MACEF,EAAW,MAAMd,GAAmBC,EAAIC,EAAOC,EAAOC,EAAKC,CAAI,EAC/D,MAAMS,EAAS,cAAa,EAC5BA,EAAS,eAAeT,EAAK,IAAI,EAEnC,OAAOS,CACT,CC5HM,SAAUG,EACdC,EACAC,EAAc,CAEd,IAAIC,EAAQ,EACZ,QAASC,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,IAAMC,EAAOJ,EAAMC,EAASE,CAAC,EAC7B,GAAIC,IAAS,OACX,MAAM,IAAI,MAAM,+CAA+C,EAGjE,GADAF,EAAQA,EAAQ,KAAOE,EAAO,MACzBA,EAAO,OAAU,EACpB,MAAO,CAACF,EAAOD,EAASE,EAAI,CAAC,CAEjC,CACA,IAAME,EAAOL,EAAMC,EAAS,CAAC,EAC7B,GAAII,IAAS,OACX,MAAM,IAAI,MAAM,+CAA+C,EAGjE,GADAH,EAAQA,EAAQ,IAAMG,EAClB,CAAC,OAAO,cAAcH,CAAK,EAC7B,MAAM,IAAI,MAAM,8CAA8C,EAEhE,MAAO,CAACA,EAAOD,EAAS,CAAC,CAC3B,CAEA,SAASK,GAAcC,EAAgBN,EAAgBO,EAAa,CAClE,OAAQA,EAAO,CACb,IAAK,GACH,OAAOD,EAAK,QAAQN,CAAM,EAC5B,IAAK,GACH,OAAOM,EAAK,SAASN,CAAM,EAC7B,IAAK,GACH,OAAQM,EAAK,QAAQN,CAAM,GAAK,GAAMM,EAAK,UAAUN,EAAS,CAAC,EACjE,IAAK,GACH,OAAOM,EAAK,SAASN,CAAM,EAC7B,IAAK,GACH,OAAOM,EAAK,SAASN,CAAM,EAAI,WAAaM,EAAK,UAAUN,EAAS,CAAC,EACvE,QAAS,CACP,IAAMQ,EAAMF,EAAK,YAAYN,CAAM,EACnC,GACEQ,EAAM,OAAO,OAAO,gBAAgB,GACpCA,EAAM,OAAO,OAAO,gBAAgB,EAEpC,MAAM,IAAI,MAAM,kBAAkBA,CAAG,iCAAiC,EAExE,OAAO,OAAOA,CAAG,CACnB,CACF,CACF,CAEA,IAAMC,GAAU,IAAI,YAEd,SAAUC,GAAaC,EAAmB,CAC9C,GAAM,CAACC,EAAYC,CAAS,EAAIf,EAAWa,EAAS,CAAC,EAC/CG,EAAkB,CAAA,EACpBd,EAASa,EACb,KAAOb,EAASY,GAAY,CAC1B,GAAM,CAACG,EAAMC,CAAI,EAAIlB,EAAWa,EAASX,CAAM,EAC/Cc,EAAM,KAAKC,CAAI,EACff,EAASgB,CACX,CACA,IAAMV,EAAO,IAAI,SACfK,EAAQ,OACRA,EAAQ,WACRA,EAAQ,UAAU,EAEhBM,EAAOL,EACX,OAAOE,EAAM,IAAIC,GAAO,CACtB,GAAIA,IAAS,EACX,OAAO,KAET,GAAIA,GAAQ,GAAKA,GAAQ,EAAG,CAC1B,IAAMR,EAAQQ,GAAQ,EAAIA,EAAOA,IAAS,EAAI,EAAI,EAC5Cd,EAAQI,GAAcC,EAAMW,EAAMV,CAAK,EAC7C,OAAAU,GAAQV,EACDN,CACT,CACA,GAAIc,IAAS,EAAG,CACd,IAAMd,EAAQK,EAAK,WAAWW,CAAI,EAClC,OAAAA,GAAQ,EACDhB,CACT,CACA,GAAIc,IAAS,EACX,MAAO,GAET,GAAIA,IAAS,EACX,MAAO,GAET,GAAIA,GAAQ,GAAI,CACd,IAAMG,EAAUH,EAAO,IAAO,EACxBI,EAAQR,EAAQ,SAASM,EAAMA,EAAOC,CAAM,EAClD,OAAAD,GAAQC,EACDH,EAAO,IAAM,EAAII,EAAQV,GAAQ,OAAOU,CAAK,CACtD,CACA,MAAM,IAAI,MAAM,sBAAsBJ,CAAI,cAAc,CAC1D,CAAC,CACH,CC9FA,IAAMK,GAAiB,EACjBC,GAAiB,EACjBC,GAAa,GACbC,GAAa,GASnB,SAASC,GAAWC,EAAkBC,EAAc,CAClD,OAAOD,EAAKC,CAAM,EAAK,IAAMD,EAAKC,EAAS,CAAC,CAC9C,CAEA,SAASC,GAAWF,EAAkBC,EAAc,CAClD,OACED,EAAKC,CAAM,EAAK,SAChBD,EAAKC,EAAS,CAAC,EAAK,MACpBD,EAAKC,EAAS,CAAC,EAAK,IACpBD,EAAKC,EAAS,CAAC,CAEnB,CAEA,SAASE,GAAWH,EAAkBI,EAAa,CACjD,IAAMC,EAAOL,EAAKI,CAAK,EACvB,GACEC,IAASV,IACTU,IAAST,IACTS,IAASR,IACTQ,IAASP,GAET,MAAM,IAAI,MAAM,uCAAuCO,CAAI,EAAE,EAE/D,IAAMC,EAAWD,IAASV,IAAkBU,IAAST,GACrD,MAAO,CACL,KAAAS,EACA,UAAWN,GAAWC,EAAMI,EAAQ,CAAC,EACrC,WAAYE,EAAWJ,GAAWF,EAAMI,EAAQ,CAAC,EAAI,EACrD,aAAcA,GAASE,EAAW,GAAK,GAE3C,CAEA,SAASC,GAAWP,EAAkBQ,EAAoBC,EAAa,CACrE,OAAOV,GAAWC,EAAMQ,EAAO,aAAe,EAAIC,CAAK,CACzD,CAOA,IAAMC,GAA0B,KAE1BC,GAAsB,KAEfC,GAAP,KAAY,CACC,OACT,MACA,kBAAoB,IAAI,IACxB,YAAc,IAAI,IAE1B,YAAYC,EAAcC,EAAqB,CAC7C,KAAK,MAAQD,EACb,KAAK,OAASA,EAAM,SAAWC,CACjC,CAEQ,iBAAiBC,EAAeC,EAAgB,CACtD,IAAMC,EAAS,KAAK,OACdC,EAAWF,EACb,KAAK,OAAQC,EAAS,IAAM,GAAM,GAAG,EAAI,GACzCA,EAAS,GACb,GAAIF,GAASG,EACX,OAAOH,EAET,IAAMI,EAAW,KAAK,OAAQF,EAAS,IAAM,GAAM,GAAG,EAAI,GACpDG,EAAQD,GAAaJ,EAAQI,IAAaF,EAAS,GACzD,OAAOG,GAASF,EAAWE,EAAQD,CACrC,CAEQ,MAAM,QACZnB,EACAC,EACAc,EACAC,EAAgB,CAEhB,IAAMK,EAAQ,KAAK,iBAAiBN,EAAOC,CAAO,EAClD,GAAIK,IAAUN,EACZ,OAAOf,EAAK,SAASC,EAAQA,EAASc,CAAK,EAE7C,IAAMO,EAAS,IAAI,WAAWP,CAAK,EACnCO,EAAO,IAAItB,EAAK,SAASC,EAAQA,EAASoB,CAAK,EAAG,CAAC,EACnD,IAAIE,EAASF,EACTG,EAAOtB,GAAWF,EAAMC,EAASoB,CAAK,EAC1C,KAAOG,IAAS,GAAKD,EAASR,GAAO,CACnC,IAAMU,EAAW,MAAM,KAAK,MAAM,KAAKD,CAAI,EACrCE,EAAQD,EAAS,SACrB,EACA,EAAI,KAAK,IAAI,KAAK,OAAS,EAAGV,EAAQQ,CAAM,CAAC,EAE/CD,EAAO,IAAII,EAAOH,CAAM,EACxBA,GAAUG,EAAM,OAChBF,EAAOtB,GAAWuB,EAAU,CAAC,CAC/B,CACA,GAAIF,IAAWR,EACb,MAAM,IAAI,MACR,6DAA6D,EAGjE,OAAOO,CACT,CAEQ,MAAM,OAAOK,EAAkB,CACrC,IAAM3B,EAAO,MAAM,KAAK,MAAM,KAAK2B,CAAU,EAC7C,MAAO,CAAE,KAAA3B,EAAM,OAAQG,GAAWH,EAAM2B,IAAe,EAAI,IAAM,CAAC,CAAC,CACrE,CAEQ,WAAWC,EAAcC,EAAe,CAC9C,IAAIC,EAAQ,KAAK,YAAY,IAAIF,CAAI,EACrC,OAAKE,IACHA,GAAS,SAAW,CAClB,IAAIH,EAAaC,EACjB,QAASG,EAAQ,GAAKA,IAAS,CAC7B,GAAM,CAAE,KAAA/B,EAAM,OAAAQ,CAAM,EAAK,MAAM,KAAK,OAAOmB,CAAU,EACrD,GAAInB,EAAO,OAASV,GAClB,OAAOiC,EAET,GAAIvB,EAAO,OAASZ,GAClB,MAAM,IAAI,MAAM,4CAA4C,EAE9D,IAAMoC,EAAQ,KAAK,cAAchC,EAAMQ,EAAQqB,CAAO,EACtDF,EACEK,IAAUxB,EAAO,UACbA,EAAO,WACPN,GAAWF,EAAMO,GAAWP,EAAMQ,EAAQwB,CAAK,CAAC,CACxD,CACF,GAAE,EACF,KAAK,YAAY,IAAIJ,EAAME,CAAK,EAChCA,EAAM,MAAM,IAAM,KAAK,YAAY,OAAOF,CAAI,CAAC,GAE1CE,CACT,CAEQ,cAAc9B,EAAkBQ,EAAoByB,EAAa,CACvE,IAAIC,EAAM,EACNC,EAAO3B,EAAO,UAClB,KAAO0B,EAAMC,GAAM,CACjB,IAAMC,EAAOF,EAAMC,GAAS,EACtB,CAACE,CAAG,EAAIC,EAAWtC,EAAMO,GAAWP,EAAMQ,EAAQ4B,CAAG,EAAI,CAAC,EAC5DC,EAAMJ,EACRC,EAAME,EAAM,EAEZD,EAAOC,CAEX,CACA,OAAOF,CACT,CAEA,MAAM,mBAAmBN,EAAcW,EAAYC,EAAU,CAC3D,IAAMC,EAAY,MAAM,KAAK,WAAWb,EAAMW,CAAE,EAC5CG,EAAQ,CAACd,CAAI,EACjB,QAASG,EAAQ,EAAGA,EAAQU,EAAWV,IAAS,CAC9C,IAAMY,EAAU,MAAM,QAAQ,IAAID,EAAM,IAAIE,GAAK,KAAK,OAAOA,CAAC,CAAC,CAAC,EAC1DC,EAAqB,CAAA,EAe3B,GAdAF,EAAQ,QAAQ,CAAC,CAAE,KAAA3C,EAAM,OAAAQ,CAAM,EAAIsC,IAAK,CACtC,IAAMC,EAAOD,IAAM,EAAI,KAAK,cAAc9C,EAAMQ,EAAQ+B,CAAE,EAAI,EACxDS,EACJF,IAAMH,EAAQ,OAAS,EACnB,KAAK,cAAc3C,EAAMQ,EAAQgC,CAAE,EACnChC,EAAO,UACb,QAASyC,EAAIF,EAAME,GAAKD,EAAIC,IAC1BJ,EAAS,KACPI,IAAMzC,EAAO,UACTA,EAAO,WACPN,GAAWF,EAAMO,GAAWP,EAAMQ,EAAQyC,CAAC,CAAC,CAAC,CAGvD,CAAC,EACGJ,EAAS,OAASlC,GACpB,MAAO,GAET,KAAK,MAAM,SAASkC,CAAQ,EAC5BH,EAAQG,CACV,CACA,MAAO,EACT,CAEA,MAAM,WACJjB,EACAK,EAAa,CAEb,IAAIN,EAAaC,EACjB,OAAS,CACP,GAAM,CAAE,KAAA5B,EAAM,OAAAQ,CAAM,EAAK,MAAM,KAAK,OAAOmB,CAAU,EACrD,GAAInB,EAAO,OAASV,GAAY,CAC9B,IAAIoC,EAAM,EACNC,EAAO3B,EAAO,UAClB,KAAO0B,EAAMC,GAAM,CACjB,IAAMC,EAAOF,EAAMC,GAAS,EACtBlC,EAASM,GAAWP,EAAMQ,EAAQ4B,CAAG,EACrC,CAACc,EAAMC,CAAS,EAAIb,EAAWtC,EAAMC,CAAM,EAC3C,CAACoC,EAAKe,CAAQ,EAAId,EAAWtC,EAAMmD,CAAS,EAClD,GAAId,IAAQJ,EACV,OAAOoB,GAAa,MAAM,KAAK,QAAQrD,EAAMoD,EAAUF,EAAM,EAAK,CAAC,EAEjEb,EAAMJ,EACRC,EAAME,EAAM,EAEZD,EAAOC,CAEX,CACA,MACF,CACA,GAAI5B,EAAO,OAASZ,GAClB,MAAM,IAAI,MAAM,4CAA4C,EAE9D,IAAIsC,EAAM,EACNC,EAAO3B,EAAO,UAClB,KAAO0B,EAAMC,GAAM,CACjB,IAAMC,EAAOF,EAAMC,GAAS,EACtBlC,EAASM,GAAWP,EAAMQ,EAAQ4B,CAAG,EACrC,CAACC,CAAG,EAAIC,EAAWtC,EAAMC,EAAS,CAAC,EACrCoC,EAAMJ,EACRC,EAAME,EAAM,EAEZD,EAAOC,CAEX,CACAT,EACEO,IAAQ1B,EAAO,UACXA,EAAO,WACPN,GAAWF,EAAMO,GAAWP,EAAMQ,EAAQ0B,CAAG,CAAC,CACtD,CACF,CAEA,MAAO,UACLN,EAAY,CAEZ,GAAM,CAAE,KAAA5B,EAAM,OAAAQ,CAAM,EAAK,MAAM,KAAK,OAAOoB,CAAI,EAC/C,GAAIpB,EAAO,OAASV,GAClB,QAASgD,EAAI,EAAGA,EAAItC,EAAO,UAAWsC,IAAK,CACzC,IAAM7C,EAASM,GAAWP,EAAMQ,EAAQsC,CAAC,EACnC,CAACI,EAAMC,CAAS,EAAIb,EAAWtC,EAAMC,CAAM,EAC3C,CAACgC,EAAOmB,CAAQ,EAAId,EAAWtC,EAAMmD,CAAS,EACpD,KAAM,CACJ,MAAAlB,EACA,OAAQoB,GAAa,MAAM,KAAK,QAAQrD,EAAMoD,EAAUF,EAAM,EAAK,CAAC,EAExE,KACK,CACL,IAAML,EAAqB,CAAA,EAC3B,QAASC,EAAI,EAAGA,EAAItC,EAAO,UAAWsC,IACpCD,EAAS,KAAK3C,GAAWF,EAAMO,GAAWP,EAAMQ,EAAQsC,CAAC,CAAC,CAAC,EAE7DD,EAAS,KAAKrC,EAAO,UAAU,EAC/B,KAAK,MAAM,SAASqC,CAAQ,EAC5B,QAAWb,KAASa,EAClB,MAAO,KAAK,UAAUb,CAAK,CAE/B,CACF,CAEQ,aAAaL,EAAoBnB,EAAkB,CACzD,IAAI8C,EAAQ,KAAK,kBAAkB,IAAI3B,CAAU,EACjD,GAAI2B,EACF,KAAK,kBAAkB,OAAO3B,CAAU,UAExC2B,EAAQ,IAAI,MAA6B9C,EAAO,SAAS,EACrD,KAAK,kBAAkB,MAAQE,GAAyB,CAC1D,IAAM6C,EAAS,KAAK,kBAAkB,KAAI,EAAG,KAAI,EAAG,MAChDA,IAAW,QACb,KAAK,kBAAkB,OAAOA,CAAM,CAExC,CAEF,YAAK,kBAAkB,IAAI5B,EAAY2B,CAAK,EACrCA,CACT,CAEQ,MAAM,UACZ3B,EACA3B,EACAQ,EACAC,EAAa,CAEb,IAAM6C,EAAQ,KAAK,aAAa3B,EAAYnB,CAAM,EAC9CgD,EAAOF,EAAM7C,CAAK,EACtB,GAAI,CAAC+C,EAAM,CACT,IAAMvD,EAASM,GAAWP,EAAMQ,EAAQC,CAAK,EACvCH,EAAWE,EAAO,OAASb,GAC3B,CAACuD,EAAMC,CAAS,EAAIb,EAAWtC,EAAMM,EAAWL,EAAS,EAAIA,CAAM,EACzEuD,EAAO,CACL,OAAQH,GAAa,MAAM,KAAK,QAAQrD,EAAMmD,EAAWD,EAAM,EAAI,CAAC,EACpE,UAAW5C,EAAWJ,GAAWF,EAAMC,CAAM,EAAI,GAEnDqD,EAAM7C,CAAK,EAAI+C,CACjB,CACA,OAAOA,CACT,CAEA,MAAO,cACL5B,EACAM,EAAa,CAEb,GAAM,CAAE,KAAAlC,EAAM,OAAAQ,CAAM,EAAK,MAAM,KAAK,OAAOoB,CAAI,EAC3C6B,EAAQ,EACRtB,EAAO3B,EAAO,UAClB,KAAOiD,EAAQtB,GAAM,CACnB,IAAMC,EAAOqB,EAAQtB,GAAS,EACxBqB,EAAO,MAAM,KAAK,UAAU5B,EAAM5B,EAAMQ,EAAQ4B,CAAG,EACrDsB,GAAWF,EAAK,OAAQtB,CAAG,EAAI,EACjCuB,EAAQrB,EAAM,EAEdD,EAAOC,CAEX,CACA,QAASU,EAAIW,EAAOX,EAAItC,EAAO,UAAWsC,IAAK,CAC7C,IAAMU,EAAO,MAAM,KAAK,UAAU5B,EAAM5B,EAAMQ,EAAQsC,CAAC,EACnDtC,EAAO,OAASb,KAClB,MAAO,KAAK,cAAc6D,EAAK,UAAWtB,CAAG,GAE/C,MAAMsB,EAAK,MACb,CACIhD,EAAO,OAASb,KAClB,MAAO,KAAK,cAAca,EAAO,WAAY0B,CAAG,EAEpD,CAEA,MAAM,YACJN,EACAS,EAAa,CAEb,IAAIsB,EACAhC,EAAaC,EACjB,OAAS,CACP,GAAM,CAAE,KAAA5B,EAAM,OAAAQ,CAAM,EAAK,MAAM,KAAK,OAAOmB,CAAU,EACjDO,EAAM,EACNC,EAAO3B,EAAO,UACdwB,EAAQ,EACZ,KAAOE,EAAMC,GAAM,CACjB,IAAMC,EAAOF,EAAMC,GAAS,EACtBqB,EAAO,MAAM,KAAK,UAAU7B,EAAY3B,EAAMQ,EAAQ4B,CAAG,EAC3DsB,GAAWF,EAAK,OAAQnB,CAAG,GAAK,GAClCsB,EAAOH,EAAK,OACZtB,EAAME,EAAM,IAEZJ,EAAQwB,EAAK,UACbrB,EAAOC,EAEX,CACA,GAAI5B,EAAO,OAASX,GAClB,OAAO8D,EAEThC,EAAaO,IAAQ1B,EAAO,UAAYA,EAAO,WAAawB,CAC9D,CACF,GAGF,SAAS0B,GAAWE,EAAoBvB,EAAa,CACnD,QAASS,EAAI,EAAGA,EAAIT,EAAI,OAAQS,IAAK,CACnC,IAAMe,EAAID,EAAOd,CAAC,EACZgB,EAAIzB,EAAIS,CAAC,EACf,GAAI,OAAOe,GAAM,UAAYC,IAAM,OACjC,MAAM,IAAI,MAAM,iCAAiC,EAEnD,GAAID,IAAMC,EACR,OAAOD,EAAIC,EAAI,GAAK,CAExB,CACA,MAAO,EACT,CCjXM,IAAOC,GAAP,KAAY,CACR,OAAS,IAAI,IACJ,UACA,UACjB,aAAe,EACf,QAAU,EAEF,OACC,SACD,SAER,YACEC,EACAC,EACAC,EACAC,EAAqB,CAAA,EAAE,CAEvB,KAAK,OAASH,EACd,KAAK,SAAWC,EAChB,KAAK,SAAWC,EAChB,IAAME,EAAYD,EAAK,WAAa,MACpC,KAAK,UAAY,KAAK,IACpBF,EACA,KAAK,KAAKG,EAAYH,CAAQ,EAAIA,CAAQ,EAE5C,KAAK,UAAYE,EAAK,WAAa,GACrC,CAEQ,MAAM,KAAKE,EAAgBC,EAAa,CAC9C,IAAIC,EAAU,EACd,OACE,GAAI,CACF,IAAMC,EAAQ,MAAM,KAAK,OAAO,KAAKH,EAAQC,CAAK,EAClD,YAAK,cAAgBE,EAAM,OACpBA,CACT,OAASC,EAAO,CAEd,GADAF,GAAW,EACPA,GAAW,EACb,MAAME,EAER,MAAM,IAAI,QAAQC,GAAW,WAAWA,EAAS,IAAMH,CAAO,CAAC,CACjE,CAEJ,CAEA,KAAKI,EAAeH,EAAiB,CAEjCA,EAAM,SACN,KAAK,IAAI,KAAK,UAAW,KAAK,SAAWG,EAAQ,KAAK,SAAS,GAE/D,KAAK,OAAO,IAAIA,EAAO,QAAQ,QAAQH,CAAK,CAAC,CAEjD,CAEQ,MAAMG,EAAa,CACzB,IAAMC,EAAS,KAAK,OAAO,IAAID,CAAK,EACpC,GAAIC,EACF,YAAK,OAAO,OAAOD,CAAK,EACxB,KAAK,OAAO,IAAIA,EAAOC,CAAM,EACtBA,EAET,IAAMN,EAAQK,EAAQ,KAAK,UACrBN,EAAS,KAAK,IAAI,KAAK,UAAW,KAAK,SAAWC,CAAK,EACvDO,EAAU,KAAK,KAAKR,EAAQC,CAAK,EACvC,YAAK,SAAW,EAChB,KAAK,OAAO,IAAIK,EAAOE,CAAO,EAC9B,KAAK,gBAAgBA,EAAS,CAACF,CAAK,CAAC,EACrC,KAAK,MAAK,EACHE,CACT,CAEA,SAASC,EAAqB,CAC5B,IAAMC,EAAS,CACb,GAAG,IAAI,IACLD,EAAY,IAAIE,GACd,KAAK,OAAQA,EAAa,GAAK,KAAK,SAAY,KAAK,SAAS,CAAC,CAChE,GAGF,OAAOL,GAAS,CAAC,KAAK,OAAO,IAAIA,CAAK,CAAC,EACvC,KAAK,CAACM,EAAGC,IAAMD,EAAIC,CAAC,EACnBC,EAAW,EACf,KAAOA,EAAWJ,EAAO,QAAQ,CAC/B,IAAIK,EAASD,EAAW,EACxB,KACEC,EAASL,EAAO,QAChBA,EAAOK,CAAM,IAAML,EAAOK,EAAS,CAAC,EAAK,GAEzCA,GAAU,EAEZ,KAAK,SAASL,EAAOI,CAAQ,EAAIC,EAASD,CAAQ,EAClDA,EAAWC,CACb,CACF,CAEQ,SAASC,EAAoBC,EAAa,CAChD,IAAMhB,EAAQe,EAAa,KAAK,UAC1BhB,EAAS,KAAK,IAAIiB,EAAQ,KAAK,UAAW,KAAK,SAAWhB,CAAK,EAC/DO,EAAU,KAAK,KAAKR,EAAQC,CAAK,EACvC,KAAK,SAAW,EAChB,IAAMiB,EAAoB,CAAA,EAC1B,QAASC,EAAI,EAAGA,EAAIF,EAAOE,IAAK,CAC9B,IAAMC,EAASD,EAAI,KAAK,UACxBD,EAAQ,KAAKF,EAAaG,CAAC,EAC3B,KAAK,OAAO,IACVH,EAAaG,EACbX,EAAQ,KAAKL,GAASA,EAAM,SAASiB,EAAQA,EAAS,KAAK,SAAS,CAAC,CAAC,CAE1E,CACA,KAAK,gBAAgBZ,EAASU,CAAO,EACrC,KAAK,MAAK,CACZ,CAEQ,gBAAgBV,EAA8BU,EAAiB,CACrEV,EAAQ,MAAM,IAAK,CACjB,QAAWF,KAASY,EAClB,KAAK,OAAO,OAAOZ,CAAK,CAE5B,CAAC,CACH,CAEQ,OAAK,CACX,KAAO,KAAK,OAAO,KAAO,KAAK,WAAW,CACxC,IAAMe,EAAS,KAAK,OAAO,KAAI,EAAG,KAAI,EAAG,MACzC,GAAIA,IAAW,OACb,MAEF,KAAK,OAAO,OAAOA,CAAM,CAC3B,CACF,CAEA,MAAM,KAAKV,EAAkB,CAC3B,IAAMW,GAAUX,EAAa,GAAK,KAAK,SACvC,GAAIA,EAAa,GAAKW,EAAS,KAAK,SAAW,KAAK,SAClD,MAAM,IAAI,MAAM,eAAeX,CAAU,sBAAsB,EAEjE,IAAMR,EAAQ,MAAM,KAAK,MAAM,KAAK,MAAMmB,EAAS,KAAK,SAAS,CAAC,EAC5DF,EAASE,EAAS,KAAK,UAC7B,OAAOnB,EAAM,SAASiB,EAAQA,EAAS,KAAK,QAAQ,CACtD,GCnII,IAAOG,GAAP,MAAOC,CAAc,CAChB,MACA,MACA,QAET,YACEC,EACAC,EACAC,EAAkC,CAElC,KAAK,MAAQF,EACb,KAAK,MAAQC,EACb,KAAK,QAAUC,CACjB,CAEA,aAAa,KAAKC,EAAoBC,EAAqB,CAAA,EAAE,CAC3D,GAAM,CAAE,KAAAC,CAAI,EAAK,MAAMF,EAAO,KAAI,EAC5BG,EAAa,MAAMH,EAAO,KAC9B,KAAK,IAAIC,EAAK,WAAa,MAAOC,CAAI,EACtC,CAAC,EAEGE,EAASD,EAAW,SAAS,EAAG,GAAG,EAEzC,GADc,IAAI,YAAW,EAAG,OAAOC,EAAO,SAAS,EAAG,EAAE,CAAC,IAC/C,kBACZ,MAAM,IAAI,MAAM,uBAAuB,EAEzC,IAAMC,EAAO,IAAI,SACfD,EAAO,OACPA,EAAO,WACPA,EAAO,UAAU,EAEbE,EAAcD,EAAK,UAAU,EAAE,EAC/BE,EAAWD,IAAgB,EAAI,MAAQA,EACvCE,EAAWJ,EAAO,EAAE,GAAK,EACzBK,EAAWJ,EAAK,UAAU,EAAE,EAClC,GAAII,IAAa,EACf,MAAM,IAAI,MAAM,wBAAwBA,CAAQ,eAAe,EAEjE,IAAMZ,EAAQ,IAAIa,GAAMV,EAAQO,EAAUL,EAAMD,CAAI,EACpDJ,EAAM,KAAK,EAAGM,CAAU,EACxBN,EAAM,SAAW,EACjBA,EAAM,cAAgBM,EAAW,OACjC,IAAML,EAAQ,IAAIa,GAAMd,EAAOW,CAAQ,EACjCT,EAAU,IAAI,IACpB,aAAiB,CAAE,OAAAa,CAAM,IAAMd,EAAM,UAAU,CAAC,EAAG,CACjD,GAAM,CAACe,EAAMC,EAAMC,EAAWC,EAAUC,CAAG,EAAIL,EAE7C,OAAOC,GAAS,UAChB,OAAOC,GAAS,UAChB,OAAOC,GAAc,UACrB,OAAOC,GAAa,UAEpBjB,EAAQ,IAAIe,EAAM,CAChB,KAAAD,EACA,KAAAC,EACA,UAAAC,EACA,SAAAC,EACA,IAAK,OAAOC,GAAQ,SAAWA,EAAM,GACtC,CAEL,CACA,OAAO,IAAIrB,EAAeC,EAAOC,EAAOC,CAAO,CACjD,CAEA,SAASe,EAAY,CACnB,IAAMI,EAAS,KAAK,QAAQ,IAAIJ,CAAI,EACpC,GAAI,CAACI,EACH,MAAM,IAAI,MAAM,uCAAuCJ,CAAI,EAAE,EAE/D,OAAOI,EAAO,QAChB,CAEA,QAAQH,EAAiB,CACvB,IAAMI,EAAQ,CAAC,GAAG,KAAK,QAAQ,OAAM,CAAE,EAAE,KACvCC,GAAKA,EAAE,OAAS,SAAWA,EAAE,YAAcL,CAAS,EAEtD,GAAI,CAACI,EACH,MAAM,IAAI,MAAM,gBAAgBJ,CAAS,eAAe,EAE1D,OAAOI,EAAM,QACf,CAEA,QAAQE,EAAeC,EAAa,CAClC,OAAO,KAAK,MAAM,WAAW,KAAK,SAASD,CAAK,EAAGC,CAAK,CAC1D,CAEA,aAAaD,EAAeE,EAAYC,EAAU,CAChD,OAAO,KAAK,MAAM,mBAAmB,KAAK,SAASH,CAAK,EAAGE,EAAIC,CAAE,CACnE,CAEA,KAAKH,EAAa,CAChB,OAAO,KAAK,MAAM,UAAU,KAAK,SAASA,CAAK,CAAC,CAClD,CAEA,YAAYA,EAAeI,EAAa,CACtC,OAAO,KAAK,MAAM,YAAY,KAAK,QAAQJ,CAAK,EAAGI,CAAG,CACxD,CAEA,cAAcJ,EAAeK,EAAa,CACxC,OAAO,KAAK,MAAM,cAAc,KAAK,QAAQL,CAAK,EAAGK,CAAG,CAC1D,CAEA,IAAIZ,EAAY,CACd,OAAO,KAAK,QAAQ,IAAIA,CAAI,CAC9B,GCtGK,IAAMa,GAAiB,qBAmBjBC,GAAP,cAAqC,KAAK,CACrC,KAAO,wBAEhB,aAAA,CACE,MACE,kMAAkM,CAEtM,GAGWC,GAAP,cAAkC,KAAK,CAClC,KAAO,qBAEP,MAET,YAAYC,EAAyB,CACnC,MACEA,IAAU,OACN,yDACA,gCAAgCA,CAAK,+BAA+BH,EAAc,GAAG,EAE3F,KAAK,MAAQG,CACf,GA6BWC,GAAP,KAAgB,CACX,YACA,OACA,MACA,IACA,gBACA,KACD,QAER,YACEC,EACAC,EACAC,EACAC,EACAC,EAAwB,CAExB,KAAK,OAASJ,EACd,KAAK,MAAQC,EACb,KAAK,IAAMC,EACX,KAAK,gBAAkBC,EACvB,KAAK,KAAOC,EACZ,KAAK,YAAcC,GAAsBF,CAAe,CAC1D,CAEA,IAAI,IAAE,CACJ,OAAOG,EAAO,KAAK,MAAM,CAC3B,CAEA,IAAI,aAAW,CACb,OAAOC,GAAgB,KAAK,MAAM,CACpC,CAEA,IAAI,UAAQ,CACV,YAAK,UAAYC,GAAe,KAAK,eAAe,EAC7C,KAAK,OACd,CAEA,YAAU,CACR,OAAO,KAAK,MAAM,OAAO,GAAK,EAAE,OAAS,CAAS,EAAE,IAAI,GAAK,EAAE,IAAI,CACrE,CAEA,MAAI,CACF,GAAI,KAAK,MAAM,SAAW,EACxB,MAAM,IAAI,MAAM,0BAA0B,KAAK,MAAM,WAAW,EAElE,OAAO,IAAIC,GAAW,KAAK,MAAO,KAAK,GAAG,CAC5C,GAGF,SAASC,EAAIC,EAA6BC,EAAY,CACpD,GAAI,OAAOD,GAAU,SACnB,MAAM,IAAI,MAAM,GAAGC,CAAI,kCAAkC,EAE3D,OAAOD,CACT,CAEA,SAASE,GAAIF,EAA6BC,EAAY,CACpD,GAAI,OAAOD,GAAU,SACnB,MAAM,IAAI,MAAM,GAAGC,CAAI,8BAA8B,EAEvD,OAAOD,CACT,CAEA,SAASG,GAAKH,EAA6BC,EAAY,CACrD,GAAI,EAAED,aAAiB,YACrB,MAAM,IAAI,MAAM,GAAGC,CAAI,gCAAgC,EAEzD,OAAOD,CACT,CAEA,SAASI,GAAUC,EAAeC,EAAkB,CAClD,MAAO,CACL,OAAQD,EACR,QAAS,CACP,KAAMN,EAAIO,EAAO,CAAC,EAAG,eAAe,EACpC,OAAQP,EAAIO,EAAO,CAAC,EAAG,iBAAiB,GAE1C,SAAU,CACR,KAAMP,EAAIO,EAAO,CAAC,EAAG,gBAAgB,EACrC,OAAQP,EAAIO,EAAO,CAAC,EAAG,kBAAkB,GAE3C,KAAM,CACJ,OAAQJ,GAAII,EAAO,CAAC,EAAG,cAAc,EACrC,OAAQJ,GAAII,EAAO,CAAC,EAAG,cAAc,EACrC,UAAWP,EAAIO,EAAO,CAAC,EAAG,iBAAiB,EAC3C,SAAUP,EAAIO,EAAO,CAAC,EAAG,gBAAgB,GAE3C,UAAWP,EAAIO,EAAO,CAAC,EAAG,kBAAkB,IAAM,EAEtD,CAMA,eAAeC,GAASC,EAAsB,CAC5C,IAAMC,EAAO,IAAI,IACjB,aAAiB,CAAE,OAAAH,CAAM,IAAME,EAAO,KAAK,MAAM,EAC/CC,EAAK,IAAIP,GAAII,EAAO,CAAC,EAAG,UAAU,EAAGJ,GAAII,EAAO,CAAC,EAAG,YAAY,CAAC,EAEnE,OAAOG,CACT,CAEM,IAAOC,GAAP,MAAOC,CAAO,CACV,SACA,UACA,aACA,UAEC,OACA,MAET,YAAoBH,EAAwBI,EAAqB,CAC/D,KAAK,OAASJ,EACd,KAAK,MAAQI,CACf,CAEA,aAAa,KAAKC,EAAoBC,EAAoB,CAAA,EAAE,CAC1D,GAAM,CAAE,eAAAC,EAAgB,GAAGC,CAAY,EAAKF,EACtCN,EAAS,MAAMS,GAAe,KAAKJ,EAAQG,CAAY,EAC7D,QAAWE,IAAS,CAAC,OAAQ,QAAS,QAAS,gBAAgB,EAC7DV,EAAO,SAASU,CAAK,EAEvB,IAAMN,EAAQG,EACV,MAAME,GAAe,KAAKF,EAAgBC,CAAY,EACtDR,EACEW,EAAK,IAAIR,EAAQH,EAAQI,CAAK,EAC9BQ,EAAU,MAAMD,EAAG,IAAI,SAAS,EACtC,GAAIC,IAAYpC,GACd,MAAM,IAAIE,GAAmBkC,CAAO,EAEtC,GAAIL,EAAgB,CAClB,QAAWG,IAAS,CAAC,OAAQ,mBAAoB,kBAAkB,EACjEN,EAAM,SAASM,CAAK,EAEtBC,EAAG,UAAY,MAAMZ,GAASK,CAAK,EACnC,IAAMS,EAAUF,EAAG,UAAU,IAAI,uBAAuB,EAClDG,EAAQ,MAAMH,EAAG,IAAI,OAAO,EAClC,GAAIE,IAAYC,EACd,MAAM,IAAI,MACR,iCAAiCD,GAAW,sBAAsB,4BAA4BC,CAAK,EAAE,EAGzG,IAAMC,EAAeJ,EAAG,UAAU,IAAI,uBAAuB,EACvDK,EAAQ,MAAML,EAAG,IAAI,OAAO,EAClC,GAAII,IAAiB,QAAaA,IAAiBC,EACjD,MAAM,IAAI,MACR,8CAA8CD,CAAY,2BAA2BC,CAAK,EAAE,CAGlG,CACA,GAAIL,EAAG,mBACgB,MAAMA,EAAG,kBAC5B,8BAA8B,IAEX,UACnB,MAAM,IAAIlC,GAGd,OAAOkC,CACT,CAEA,MAAI,CACF,YAAK,WAAaZ,GAAS,KAAK,MAAM,EAC/B,KAAK,QACd,CAEA,MAAM,IAAIkB,EAAW,CACnB,OAAQ,MAAM,KAAK,KAAI,GAAI,IAAIA,CAAG,CACpC,CAEA,gBAAgBC,EAAYC,EAAU,CACpC,OAAO,KAAK,OAAO,aAAa,QAASD,EAAIC,CAAE,CACjD,CAEA,MAAM,UAAUtC,EAAc,CAC5B,IAAMuC,EAAM,MAAM,KAAK,OAAO,QAAQ,QAASvC,CAAM,EACrD,GAAI,CAACuC,EACH,OAEF,IAAMnC,EAAOmC,EAAI,CAAC,EAClB,OAAO,IAAIxC,GACTC,EACAwC,GAAgB1B,GAAKyB,EAAI,CAAC,EAAG,aAAa,CAAC,EAC3CzB,GAAKyB,EAAI,CAAC,EAAG,WAAW,EACxBzB,GAAKyB,EAAI,CAAC,EAAG,gBAAgB,EAC7B,OAAOnC,GAAS,SAAWA,EAAO,MAAS,CAE/C,CAEA,OAAK,CACH,YAAK,aAAe,SAAW,CAC7B,IAAM6B,EAAmB,CAAA,EACzB,aAAiB,CAAE,MAAAjB,EAAO,OAAAC,CAAM,IAAM,KAAK,OAAO,KAAK,OAAO,EAC5DgB,EAAM,KAAKlB,GAAUC,EAAOC,CAAM,CAAC,EAErC,OAAOgB,CACT,GAAE,EACK,KAAK,SACd,CAEA,MAAM,QAAQjC,EAAc,CAC1B,IAAMuC,EAAM,MAAM,KAAK,OAAO,QAAQ,QAASvC,CAAM,EACrD,OAAOuC,EAAMxB,GAAUf,EAAQuC,CAAG,EAAI,MACxC,CAEA,eAAa,CACX,YAAK,eAAiB,KAAK,MAAK,EAAG,KACjCN,GAAS,IAAI,IAAIA,EAAM,IAAIQ,GAAQ,CAACA,EAAK,OAAQA,CAAI,CAAC,CAAC,CAAC,EAEnD,KAAK,YACd,CAEA,MAAM,SAASC,EAAc,CAQ3B,OAPoB,MAAM,KAAK,MAAK,GAAI,OACtCC,GACEA,EAAE,KAAK,SAAWD,EAAK,QACvBC,EAAE,KAAK,SAAWD,EAAK,QACvBC,EAAE,KAAK,YAAcD,EAAK,WAC1BC,EAAE,KAAK,UAAYD,EAAK,QAAQ,EAElB,KAAK,CAACE,EAAGC,IAAMA,EAAE,KAAK,SAAWD,EAAE,KAAK,QAAQ,EAAE,CAAC,CACvE,CAEA,MAAM,eAAeE,EAAc,CACjC,OAAQ,MAAM,KAAK,MAAK,GAAI,OAAOH,GAAKA,EAAE,KAAK,SAAWG,CAAM,CAClE,CAEQ,MAAM,WAAWC,EAAY,CACnC,IAAML,EAAOM,GAAYC,GAAYF,CAAG,EAAG,CAAC,EAC5C,OAAQ,MAAM,KAAK,MAAK,GACrB,OACCJ,GACEA,EAAE,KAAK,SAAWD,EAAK,QACvBC,EAAE,KAAK,SAAWD,EAAK,QACvBC,EAAE,KAAK,YAAcD,EAAK,SAAS,EAEtC,KAAK,CAACE,EAAGC,IAAMD,EAAE,KAAK,SAAWC,EAAE,KAAK,QAAQ,CACrD,CAEA,MAAM,QAAQE,EAAY,CACxB,OAAQ,MAAM,KAAK,WAAWA,CAAG,GAAG,OAAS,CAC/C,CAEQ,YAAc,IAAI,IAE1B,WAAW/C,EAAc,CACvB,IAAIkD,EAAS,KAAK,YAAY,IAAIlD,CAAM,EACxC,OAAKkD,IACHA,EAAS,KAAK,eAAelD,CAAM,EACnC,KAAK,YAAY,IAAIA,EAAQkD,CAAM,EACnCA,EAAO,MAAM,IAAM,KAAK,YAAY,OAAOlD,CAAM,CAAC,GAE7CkD,CACT,CAEQ,MAAM,eAAelD,EAAc,CACzC,IAAMgC,EAAU,KAAK,kBACjB,MAAM,KAAK,gBAAgBhC,CAAM,EACjC,OACJ,GAAIgC,IAAY,OAAW,CACzB,IAAMmB,EAAO,MAAM,KAAK,gBAAgBnD,EAAQ,OAAO,gBAAgB,EACvE,GAAI,CAACmD,EAAM,CACT,IAAMV,EAAO,MAAM,KAAK,QAAQzC,CAAM,EACtC,MAAM,IAAI,MACR,QAAQyC,EAAOW,EAAeX,EAAK,KAAMA,EAAK,KAAK,QAAQ,EAAIzC,CAAM,yCAAyC,CAElH,CACA,IAAIkD,EAASC,EAAK,WACdE,EAAMF,EAAK,IACf,OAAS,CACP,IAAMG,EAAS,MAAM,KAAK,UAAUD,EAAI,IAAI,EAC5C,GAAI,CAACC,EACH,MAAM,IAAI,MAAM,QAAQD,EAAI,IAAI,8BAA8B,EAEhEH,GAAUI,EAAO,YACjB,IAAMlD,EAAOkD,EAAO,KAAI,EAAG,GAAGD,EAAI,MAAM,EACxC,GAAI,CAACjD,GAAQA,EAAK,OAAS,EACzB,OAAO8C,EAETG,EAAMjD,CACR,CACF,CACA,OAAO4B,CACT,CAEA,MAAM,sBACJe,EACAQ,EACAC,EAAW,CAEX,GAAIA,GAAOD,EACT,MAAO,CAAA,EAET,IAAME,EAAU,MAAM,KAAK,WAAWV,CAAG,EACnCW,EAAWD,EAAQ,OAAOd,GAAKA,EAAE,KAAK,UAAYY,CAAK,EAAE,MAAM,EAAE,EACjEI,EAASF,EAAQ,OACrBd,GAAKA,EAAE,KAAK,SAAWY,GAASZ,EAAE,KAAK,SAAWa,CAAG,EASvD,OAPkB,MAAM,QAAQ,IAC9B,CAAC,GAAGE,EAAU,GAAGC,CAAM,EAAE,IAAI,MAAMlB,IAAS,CAC1C,KAAAA,EACA,MAAOA,EAAK,KAAK,SACjB,IAAKA,EAAK,KAAK,SAAY,MAAM,KAAK,WAAWA,EAAK,MAAM,GAC5D,CAAC,GAEY,OAAOmB,GAAKL,EAAQK,EAAE,GAAG,CAC5C,CAEQ,MAAM,oBACZC,EACAN,EACAC,EACA/B,EAAkB,CAElB,GAAM,CAAE,KAAAqC,EAAM,GAAGC,CAAY,EAAKtC,EAClC,GAAIqC,IAAS,QAAa,CAAC,KAAK,kBAC9B,MAAM,IAAI,MACR,qEAAqE,EAGzE,GAAM,CAAE,OAAAhB,EAAQ,OAAAkB,EAAQ,UAAAC,CAAS,EAAKJ,EAAS,KAAK,KAC9CK,EAAQ,CAAE,OAAApB,EAAQ,OAAAkB,EAAQ,UAAAC,CAAS,EACnCE,EAAO,KAAK,IAAIZ,EAAOM,EAAS,KAAK,EACrCO,EAAK,KAAK,IAAIZ,EAAKK,EAAS,GAAG,EAC/BQ,EAAa5C,EAAK,YAAc,MAChC6C,EAAQD,IAAe,OAASA,IAAe,WACjDE,EACJ,OAAIT,IAAS,QAAaO,IAAe,MACvCE,EAAW,MAAMC,GAAsB,KAAMN,EAAOC,EAAMC,EAAI,CAC5D,GAAGL,EACH,KAAAD,EACD,GAEDS,EAAW,MAAME,GAAmB,KAAMP,EAAOC,EAAMC,EAAIL,CAAY,EACnE,KAAK,mBAAqBO,IAC5B,MAAMC,EAAS,cAAa,EACxBT,IAAS,QACXS,EAAS,eAAeT,CAAI,IAI3BS,CACT,CAEA,MAAM,oBACJxB,EACAQ,EACAC,EACA/B,EAAqB,CAAA,EAAE,CAEvB,GAAM,CAACoC,CAAQ,EAAI,MAAM,KAAK,sBAAsBd,EAAKQ,EAAOC,CAAG,EACnE,OAAOK,EACH,KAAK,oBAAoBA,EAAUN,EAAOC,EAAK/B,CAAI,EACnD,MACN,CAEA,MAAM,sBACJsB,EACAQ,EACAC,EACA/B,EAAyB,CAAA,EAAE,CAE3B,IAAMiD,EAA+B,CAAA,EACrC,QAAWb,KAAY,MAAM,KAAK,sBAAsBd,EAAKQ,EAAOC,CAAG,EAAG,CACxE,IAAMe,EAAW,MAAM,KAAK,oBAC1BV,EACAN,EACAC,EACA/B,CAAI,EAENiD,EAAO,KAAK,GAAGH,EAAS,WAAU,CAAE,CACtC,CACA,OAAOG,CACT,CAEA,MAAM,WAAS,CACb,IAAMC,EAAU,IAAI,IACpB,OAAW,CAACvC,EAAKzB,CAAK,IAAK,MAAM,KAAK,KAAI,EACpCyB,EAAI,WAAW,MAAM,GACvBuC,EAAQ,IAAIvC,EAAI,MAAM,CAAa,EAAGzB,CAAK,EAG/C,IAAI+B,EAAkB,CACpB,KAAM,OACN,SAAU,IAAI,IACd,YAAa,IAAI,KAEnB,GAAI,CACFA,EAAOkC,GAAkBD,CAAO,CAClC,MAAQ,CAER,CACA,OAAOjC,CACT,CAEA,MAAM,eAAa,CACjB,IAAMmC,EAAQ,MAAM,KAAK,IAAI,aAAa,EAC1C,OAAOA,IAAU,QAAa,OAAOA,CAAK,EAAI,CAChD,CAEA,IAAI,mBAAiB,CACnB,OACE,KAAK,MAAM,IAAI,kBAAkB,GAAK,KAAK,MAAM,IAAI,kBAAkB,CAE3E,CAEQ,MAAM,kBAAkBzC,EAAW,CACzC,OAAO,KAAK,UAAY,KAAK,UAAU,IAAIA,CAAG,EAAI,MAAM,KAAK,IAAIA,CAAG,CACtE,CAEA,MAAM,yBAAuB,CAC3B,IAAMzB,EAAQ,MAAM,KAAK,kBAAkB,0BAA0B,EACrE,OAAOA,IAAU,OAAY,OAAY,OAAOA,CAAK,CACvD,CAEA,MAAM,wBAAsB,CAC1B,IAAMA,EACJ,KAAK,mBAAqB,KAAK,MAAM,IAAI,kBAAkB,EACvD,MAAM,KAAK,kBAAkB,gCAAgC,EAC7D,OACN,OAAOA,IAAU,OAAY,OAAY,OAAOA,CAAK,CACvD,CAEA,MAAM,gBACJmE,EACAC,EAAoB,CAEpB,IAAM3C,EAAM,MAAM,KAAK,MAAM,YAAY,mBAAoB,CAC3D0C,EACAC,EACD,EACKxC,EACJH,IAAM,CAAC,IAAM0C,GAAc1C,EAAI,CAAC,IAAM2C,EAClC,MAAM,KAAK,MAAM,QACf,mBACArE,EAAI0B,EAAI,CAAC,EAAG,wBAAwB,CAAC,EAEvC,OACN,OAAOG,EACH,CACE,KAAM7B,EAAI6B,EAAI,CAAC,EAAG,8BAA8B,EAChD,WAAY7B,EAAI6B,EAAI,CAAC,EAAG,8BAA8B,GAExD,MACN,CAEA,uBAAuBvC,EAAc,CACnC,OAAO,KAAK,wBAAwBA,EAAQA,CAAM,CACpD,CAEQ,cAAciB,EAAkB,CACtC,MAAO,CACL,KAAMP,EAAIO,EAAO,CAAC,EAAG,8BAA8B,EACnD,OAAQP,EAAIO,EAAO,CAAC,EAAG,8BAA8B,EACrD,WAAYP,EAAIO,EAAO,CAAC,EAAG,8BAA8B,EACzD,YACEP,EAAIO,EAAO,CAAC,EAAG,8BAA8B,IAAM,EAC/C,UACA,UACN,WAAYP,EAAIO,EAAO,CAAC,EAAG,8BAA8B,EAE7D,CAEA,MAAM,wBAAwB+D,EAAmBC,EAAiB,CAChE,IAAMC,EAA6B,CAAA,EACnC,cAAiB9C,KAAO,KAAK,MAAM,cAAc,mBAAoB,CACnE4C,EACA,EACD,EAAG,CAEF,GADatE,EAAI0B,EAAI,CAAC,EAAG,8BAA8B,EAC5C6C,EACT,MAEF,IAAM1C,EAAM,MAAM,KAAK,MAAM,QAC3B,mBACA7B,EAAI0B,EAAI,CAAC,EAAG,wBAAwB,CAAC,EAEnCG,GACF2C,EAAQ,KAAK,KAAK,cAAc3C,CAAG,CAAC,CAExC,CACA,OAAO2C,CACT,CAEA,MAAM,kBAAkBC,EAAcC,EAAc,CAClD,IAAMhD,EAAM,MAAM,KAAK,MAAM,YAAY,mBAAoB,CAAC+C,EAAMC,CAAM,CAAC,EAC3E,GAAIhD,IAAM,CAAC,IAAM+C,GAAQ/C,EAAI,CAAC,IAAMgD,EAClC,OAEF,IAAM7C,EAAM,MAAM,KAAK,MAAM,QAC3B,mBACA7B,EAAI0B,EAAI,CAAC,EAAG,wBAAwB,CAAC,EAEvC,OAAOG,EAAM,KAAK,cAAcA,CAAG,EAAI,MACzC,CAEA,MAAM,gBAAgBuC,EAAkB,CACtC,IAAMvC,EAAM,MAAM,KAAK,MAAM,QAAQ,mBAAoBuC,CAAU,EACnE,OAAOvC,EAAM7B,EAAI6B,EAAI,CAAC,EAAG,yBAAyB,EAAI,MACxD,CAEQ,MAAM,WAAWvB,EAAa,CACpC,IAAMuB,EAAM,MAAM,KAAK,OAAO,QAAQ,iBAAkBvB,CAAK,EAC7D,GAAI,CAACuB,EACH,MAAM,IAAI,MAAM,uDAAuD,EAEzE,MAAO,CACL,WAAY7B,EAAI6B,EAAI,CAAC,EAAG,4BAA4B,EACpD,IAAK,CACH,KAAM7B,EAAI6B,EAAI,CAAC,EAAG,4BAA4B,EAC9C,OAAQ7B,EAAI6B,EAAI,CAAC,EAAG,4BAA4B,GAGtD,CAEQ,MAAM,aAAauC,EAAoBO,EAAkB,CAC/D,IAAMjD,EAAM,MAAM,KAAK,OAAO,YAAY,iBAAkB,CAC1D0C,EACAO,EACD,EACD,OAAOjD,IAAM,CAAC,IAAM0C,EAChBpE,EAAI0B,EAAI,CAAC,EAAG,sBAAsB,EAClC,MACN,CAEA,MAAM,gBACJ0C,EACAO,EAAkB,CAElB,IAAMrE,EAAQ,MAAM,KAAK,aAAa8D,EAAYO,CAAU,EAC5D,OAAOrE,IAAU,OAAY,OAAY,KAAK,WAAWA,CAAK,CAChE,CAEA,MAAM,wBACJ8D,EACAQ,EACAC,EAAgB,CAEhB,GAAM,CAACC,EAAOrC,CAAI,EAAI,MAAM,QAAQ,IAAI,CACtC,KAAK,aAAa2B,EAAYQ,CAAU,EACxC,KAAK,aAAaR,EAAYS,CAAQ,EACvC,EACKE,EAA+B,CAAA,EACrC,GAAID,IAAU,QAAarC,IAAS,OAAW,CAC7C,MAAM,KAAK,OAAO,aAAa,iBAAkBqC,EAAOrC,EAAO,CAAC,EAChE,QAASnC,EAAQwE,EAAOxE,GAASmC,EAAMnC,IACrCyE,EAAU,KAAK,MAAM,KAAK,WAAWzE,CAAK,CAAC,CAE/C,CACA,OAAOyE,CACT,GC7nBF,IAAAC,GAA4B,UAC5BC,GAA6B,UAC7BC,GAA6B,UAC7BC,GAAiC,UCJjC,IAAAC,GAAuC,UACvCC,GAAmC,UCenC,IAAIC,GAAgB,SAASC,EAAGC,EAAG,CACjC,OAAAF,GAAgB,OAAO,gBAClB,CAAE,UAAW,CAAC,CAAE,YAAa,OAAS,SAAUC,EAAGC,EAAG,CAAED,EAAE,UAAYC,CAAG,GAC1E,SAAUD,EAAGC,EAAG,CAAE,QAASC,KAAKD,EAAO,OAAO,UAAU,eAAe,KAAKA,EAAGC,CAAC,IAAGF,EAAEE,CAAC,EAAID,EAAEC,CAAC,EAAG,EAC7FH,GAAcC,EAAGC,CAAC,CAC3B,EAEO,SAASE,GAAUH,EAAGC,EAAG,CAC9B,GAAI,OAAOA,GAAM,YAAcA,IAAM,KACjC,MAAM,IAAI,UAAU,uBAAyB,OAAOA,CAAC,EAAI,+BAA+B,EAC5FF,GAAcC,EAAGC,CAAC,EAClB,SAASG,GAAK,CAAE,KAAK,YAAcJ,CAAG,CACtCA,EAAE,UAAYC,IAAM,KAAO,OAAO,OAAOA,CAAC,GAAKG,EAAG,UAAYH,EAAE,UAAW,IAAIG,EACjF,CAqFO,SAASC,GAAUC,EAASC,EAAYC,EAAGC,EAAW,CAC3D,SAASC,EAAMC,EAAO,CAAE,OAAOA,aAAiBH,EAAIG,EAAQ,IAAIH,EAAE,SAAUI,EAAS,CAAEA,EAAQD,CAAK,CAAG,CAAC,CAAG,CAC3G,OAAO,IAAKH,IAAMA,EAAI,UAAU,SAAUI,EAASC,EAAQ,CACvD,SAASC,EAAUH,EAAO,CAAE,GAAI,CAAEI,EAAKN,EAAU,KAAKE,CAAK,CAAC,CAAG,OAASK,EAAG,CAAEH,EAAOG,CAAC,CAAG,CAAE,CAC1F,SAASC,EAASN,EAAO,CAAE,GAAI,CAAEI,EAAKN,EAAU,MAASE,CAAK,CAAC,CAAG,OAASK,EAAG,CAAEH,EAAOG,CAAC,CAAG,CAAE,CAC7F,SAASD,EAAKG,EAAQ,CAAEA,EAAO,KAAON,EAAQM,EAAO,KAAK,EAAIR,EAAMQ,EAAO,KAAK,EAAE,KAAKJ,EAAWG,CAAQ,CAAG,CAC7GF,GAAMN,EAAYA,EAAU,MAAMH,EAASC,GAAc,CAAC,CAAC,GAAG,KAAK,CAAC,CACxE,CAAC,CACH,CAEO,SAASY,GAAYb,EAASc,EAAM,CACzC,IAAIC,EAAI,CAAE,MAAO,EAAG,KAAM,UAAW,CAAE,GAAIC,EAAE,CAAC,EAAI,EAAG,MAAMA,EAAE,CAAC,EAAG,OAAOA,EAAE,CAAC,CAAG,EAAG,KAAM,CAAC,EAAG,IAAK,CAAC,CAAE,EAAGC,EAAGC,EAAGF,EAAGG,EAAI,OAAO,QAAQ,OAAO,UAAa,WAAa,SAAW,QAAQ,SAAS,EAC/L,OAAOA,EAAE,KAAOC,EAAK,CAAC,EAAGD,EAAE,MAAWC,EAAK,CAAC,EAAGD,EAAE,OAAYC,EAAK,CAAC,EAAG,OAAO,QAAW,aAAeD,EAAE,OAAO,QAAQ,EAAI,UAAW,CAAE,OAAO,IAAM,GAAIA,EAC1J,SAASC,EAAKC,EAAG,CAAE,OAAO,SAAUC,EAAG,CAAE,OAAOb,EAAK,CAACY,EAAGC,CAAC,CAAC,CAAG,CAAG,CACjE,SAASb,EAAKc,EAAI,CACd,GAAIN,EAAG,MAAM,IAAI,UAAU,iCAAiC,EAC5D,KAAOE,IAAMA,EAAI,EAAGI,EAAG,CAAC,IAAMR,EAAI,IAAKA,GAAG,GAAI,CAC1C,GAAIE,EAAI,EAAGC,IAAMF,EAAIO,EAAG,CAAC,EAAI,EAAIL,EAAE,OAAYK,EAAG,CAAC,EAAIL,EAAE,SAAcF,EAAIE,EAAE,SAAcF,EAAE,KAAKE,CAAC,EAAG,GAAKA,EAAE,OAAS,EAAEF,EAAIA,EAAE,KAAKE,EAAGK,EAAG,CAAC,CAAC,GAAG,KAAM,OAAOP,EAE3J,OADIE,EAAI,EAAGF,IAAGO,EAAK,CAACA,EAAG,CAAC,EAAI,EAAGP,EAAE,KAAK,GAC9BO,EAAG,CAAC,EAAG,CACX,IAAK,GAAG,IAAK,GAAGP,EAAIO,EAAI,MACxB,IAAK,GAAG,OAAAR,EAAE,QAAgB,CAAE,MAAOQ,EAAG,CAAC,EAAG,KAAM,EAAM,EACtD,IAAK,GAAGR,EAAE,QAASG,EAAIK,EAAG,CAAC,EAAGA,EAAK,CAAC,CAAC,EAAG,SACxC,IAAK,GAAGA,EAAKR,EAAE,IAAI,IAAI,EAAGA,EAAE,KAAK,IAAI,EAAG,SACxC,QACI,GAAMC,EAAID,EAAE,KAAM,EAAAC,EAAIA,EAAE,OAAS,GAAKA,EAAEA,EAAE,OAAS,CAAC,KAAOO,EAAG,CAAC,IAAM,GAAKA,EAAG,CAAC,IAAM,GAAI,CAAER,EAAI,EAAG,QAAU,CAC3G,GAAIQ,EAAG,CAAC,IAAM,IAAM,CAACP,GAAMO,EAAG,CAAC,EAAIP,EAAE,CAAC,GAAKO,EAAG,CAAC,EAAIP,EAAE,CAAC,GAAK,CAAED,EAAE,MAAQQ,EAAG,CAAC,EAAG,KAAO,CACrF,GAAIA,EAAG,CAAC,IAAM,GAAKR,EAAE,MAAQC,EAAE,CAAC,EAAG,CAAED,EAAE,MAAQC,EAAE,CAAC,EAAGA,EAAIO,EAAI,KAAO,CACpE,GAAIP,GAAKD,EAAE,MAAQC,EAAE,CAAC,EAAG,CAAED,EAAE,MAAQC,EAAE,CAAC,EAAGD,EAAE,IAAI,KAAKQ,CAAE,EAAG,KAAO,CAC9DP,EAAE,CAAC,GAAGD,EAAE,IAAI,IAAI,EACpBA,EAAE,KAAK,IAAI,EAAG,QACtB,CACAQ,EAAKT,EAAK,KAAKd,EAASe,CAAC,CAC7B,OAASL,EAAG,CAAEa,EAAK,CAAC,EAAGb,CAAC,EAAGQ,EAAI,CAAG,QAAE,CAAUD,EAAID,EAAI,CAAG,CACzD,GAAIO,EAAG,CAAC,EAAI,EAAG,MAAMA,EAAG,CAAC,EAAG,MAAO,CAAE,MAAOA,EAAG,CAAC,EAAIA,EAAG,CAAC,EAAI,OAAQ,KAAM,EAAK,CACnF,CACF,CAkBO,SAASC,GAASC,EAAG,CAC1B,IAAIC,EAAI,OAAO,QAAW,YAAc,OAAO,SAAUC,EAAID,GAAKD,EAAEC,CAAC,EAAGE,EAAI,EAC5E,GAAID,EAAG,OAAOA,EAAE,KAAKF,CAAC,EACtB,GAAIA,GAAK,OAAOA,EAAE,QAAW,SAAU,MAAO,CAC1C,KAAM,UAAY,CACd,OAAIA,GAAKG,GAAKH,EAAE,SAAQA,EAAI,QACrB,CAAE,MAAOA,GAAKA,EAAEG,GAAG,EAAG,KAAM,CAACH,CAAE,CAC1C,CACJ,EACA,MAAM,IAAI,UAAUC,EAAI,0BAA4B,iCAAiC,CACvF,CAEO,SAASG,GAAOJ,EAAGK,EAAG,CAC3B,IAAIH,EAAI,OAAO,QAAW,YAAcF,EAAE,OAAO,QAAQ,EACzD,GAAI,CAACE,EAAG,OAAOF,EACf,IAAIG,EAAID,EAAE,KAAKF,CAAC,EAAGM,EAAGC,EAAK,CAAC,EAAGC,EAC/B,GAAI,CACA,MAAQH,IAAM,QAAUA,KAAM,IAAM,EAAEC,EAAIH,EAAE,KAAK,GAAG,MAAMI,EAAG,KAAKD,EAAE,KAAK,CAC7E,OACOG,EAAO,CAAED,EAAI,CAAE,MAAOC,CAAM,CAAG,QACtC,CACI,GAAI,CACIH,GAAK,CAACA,EAAE,OAASJ,EAAIC,EAAE,SAAYD,EAAE,KAAKC,CAAC,CACnD,QACA,CAAU,GAAIK,EAAG,MAAMA,EAAE,KAAO,CACpC,CACA,OAAOD,CACT,CAkBO,SAASG,GAAcC,EAAIC,EAAMC,EAAM,CAC5C,GAAIA,GAAQ,UAAU,SAAW,EAAG,QAASC,EAAI,EAAGC,EAAIH,EAAK,OAAQI,EAAIF,EAAIC,EAAGD,KACxEE,GAAM,EAAEF,KAAKF,MACRI,IAAIA,EAAK,MAAM,UAAU,MAAM,KAAKJ,EAAM,EAAGE,CAAC,GACnDE,EAAGF,CAAC,EAAIF,EAAKE,CAAC,GAGtB,OAAOH,EAAG,OAAOK,GAAM,MAAM,UAAU,MAAM,KAAKJ,CAAI,CAAC,CACzD,CAEO,SAASK,GAAQC,EAAG,CACzB,OAAO,gBAAgBD,IAAW,KAAK,EAAIC,EAAG,MAAQ,IAAID,GAAQC,CAAC,CACrE,CAEO,SAASC,GAAiBC,EAASC,EAAYC,EAAW,CAC/D,GAAI,CAAC,OAAO,cAAe,MAAM,IAAI,UAAU,sCAAsC,EACrF,IAAIC,EAAID,EAAU,MAAMF,EAASC,GAAc,CAAC,CAAC,EAAGP,EAAGU,EAAI,CAAC,EAC5D,OAAOV,EAAI,OAAO,QAAQ,OAAO,eAAkB,WAAa,cAAgB,QAAQ,SAAS,EAAGW,EAAK,MAAM,EAAGA,EAAK,OAAO,EAAGA,EAAK,SAAUC,CAAW,EAAGZ,EAAE,OAAO,aAAa,EAAI,UAAY,CAAE,OAAO,IAAM,EAAGA,EACtN,SAASY,EAAYC,EAAG,CAAE,OAAO,SAAUT,EAAG,CAAE,OAAO,QAAQ,QAAQA,CAAC,EAAE,KAAKS,EAAGC,CAAM,CAAG,CAAG,CAC9F,SAASH,EAAKI,EAAGF,EAAG,CAAMJ,EAAEM,CAAC,IAAKf,EAAEe,CAAC,EAAI,SAAUX,EAAG,CAAE,OAAO,IAAI,QAAQ,SAAUY,EAAGC,EAAG,CAAEP,EAAE,KAAK,CAACK,EAAGX,EAAGY,EAAGC,CAAC,CAAC,EAAI,GAAKC,EAAOH,EAAGX,CAAC,CAAG,CAAC,CAAG,EAAOS,IAAGb,EAAEe,CAAC,EAAIF,EAAEb,EAAEe,CAAC,CAAC,GAAK,CACvK,SAASG,EAAOH,EAAGX,EAAG,CAAE,GAAI,CAAEe,EAAKV,EAAEM,CAAC,EAAEX,CAAC,CAAC,CAAG,OAASgB,EAAG,CAAEC,EAAOX,EAAE,CAAC,EAAE,CAAC,EAAGU,CAAC,CAAG,CAAE,CACjF,SAASD,EAAKG,EAAG,CAAEA,EAAE,iBAAiBnB,GAAU,QAAQ,QAAQmB,EAAE,MAAM,CAAC,EAAE,KAAKC,EAAST,CAAM,EAAIO,EAAOX,EAAE,CAAC,EAAE,CAAC,EAAGY,CAAC,CAAG,CACvH,SAASC,EAAQC,EAAO,CAAEN,EAAO,OAAQM,CAAK,CAAG,CACjD,SAASV,EAAOU,EAAO,CAAEN,EAAO,QAASM,CAAK,CAAG,CACjD,SAASH,EAAOR,EAAGT,EAAG,CAAMS,EAAET,CAAC,EAAGM,EAAE,MAAM,EAAGA,EAAE,QAAQQ,EAAOR,EAAE,CAAC,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAE,CAAC,CAAC,CAAG,CACnF,CAQO,SAASe,GAAcC,EAAG,CAC/B,GAAI,CAAC,OAAO,cAAe,MAAM,IAAI,UAAU,sCAAsC,EACrF,IAAIC,EAAID,EAAE,OAAO,aAAa,EAAGE,EACjC,OAAOD,EAAIA,EAAE,KAAKD,CAAC,GAAKA,EAAI,OAAOG,IAAa,WAAaA,GAASH,CAAC,EAAIA,EAAE,OAAO,QAAQ,EAAE,EAAGE,EAAI,CAAC,EAAGE,EAAK,MAAM,EAAGA,EAAK,OAAO,EAAGA,EAAK,QAAQ,EAAGF,EAAE,OAAO,aAAa,EAAI,UAAY,CAAE,OAAO,IAAM,EAAGA,GAC9M,SAASE,EAAKC,EAAG,CAAEH,EAAEG,CAAC,EAAIL,EAAEK,CAAC,GAAK,SAAUC,EAAG,CAAE,OAAO,IAAI,QAAQ,SAAUC,EAASC,EAAQ,CAAEF,EAAIN,EAAEK,CAAC,EAAEC,CAAC,EAAGG,EAAOF,EAASC,EAAQF,EAAE,KAAMA,EAAE,KAAK,CAAG,CAAC,CAAG,CAAG,CAC/J,SAASG,EAAOF,EAASC,EAAQE,EAAGJ,EAAG,CAAE,QAAQ,QAAQA,CAAC,EAAE,KAAK,SAASA,EAAG,CAAEC,EAAQ,CAAE,MAAOD,EAAG,KAAMI,CAAE,CAAC,CAAG,EAAGF,CAAM,CAAG,CAC7H,CCxPM,SAAUG,EAAWC,EAAU,CACnC,OAAO,OAAOA,GAAU,UAC1B,CCGM,SAAUC,GAAoBC,EAAgC,CAClE,IAAMC,EAAS,SAACC,EAAa,CAC3B,MAAM,KAAKA,CAAQ,EACnBA,EAAS,MAAQ,IAAI,MAAK,EAAG,KAC/B,EAEMC,EAAWH,EAAWC,CAAM,EAClC,OAAAE,EAAS,UAAY,OAAO,OAAO,MAAM,SAAS,EAClDA,EAAS,UAAU,YAAcA,EAC1BA,CACT,CCDO,IAAMC,GAA+CC,GAC1D,SAACC,EAAM,CACL,OAAA,SAA4CC,EAA0B,CACpED,EAAO,IAAI,EACX,KAAK,QAAUC,EACRA,EAAO,OAAM;EACxBA,EAAO,IAAI,SAACC,EAAKC,EAAC,CAAK,OAAGA,EAAI,EAAC,KAAKD,EAAI,SAAQ,CAAzB,CAA6B,EAAE,KAAK;GAAM,EACzD,GACJ,KAAK,KAAO,sBACZ,KAAK,OAASD,CAChB,CARA,CAQC,ECvBC,SAAUG,GAAaC,EAA6BC,EAAO,CAC/D,GAAID,EAAK,CACP,IAAME,EAAQF,EAAI,QAAQC,CAAI,EAC9B,GAAKC,GAASF,EAAI,OAAOE,EAAO,CAAC,EAErC,CCKA,IAAAC,IAAA,UAAA,CAwBE,SAAAA,EAAoBC,EAA4B,CAA5B,KAAA,gBAAAA,EAdb,KAAA,OAAS,GAER,KAAA,WAAmD,KAMnD,KAAA,YAAqD,IAMV,CAOnD,OAAAD,EAAA,UAAA,YAAA,UAAA,aACME,EAEJ,GAAI,CAAC,KAAK,OAAQ,CAChB,KAAK,OAAS,GAGN,IAAAC,EAAe,KAAI,WAC3B,GAAIA,EAEF,GADA,KAAK,WAAa,KACd,MAAM,QAAQA,CAAU,MAC1B,QAAqBC,EAAAC,GAAAF,CAAU,EAAAG,EAAAF,EAAA,KAAA,EAAA,CAAAE,EAAA,KAAAA,EAAAF,EAAA,KAAA,EAAE,CAA5B,IAAMG,EAAMD,EAAA,MACfC,EAAO,OAAO,IAAI,yGAGpBJ,EAAW,OAAO,IAAI,EAIlB,IAAiBK,EAAqB,KAAI,gBAClD,GAAIC,EAAWD,CAAgB,EAC7B,GAAI,CACFA,EAAgB,QACTE,EAAG,CACVR,EAASQ,aAAaC,GAAsBD,EAAE,OAAS,CAACA,CAAC,EAIrD,IAAAE,EAAgB,KAAI,YAC5B,GAAIA,EAAa,CACf,KAAK,YAAc,SACnB,QAAwBC,EAAAR,GAAAO,CAAW,EAAAE,EAAAD,EAAA,KAAA,EAAA,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAE,CAAhC,IAAME,EAASD,EAAA,MAClB,GAAI,CACFE,GAAcD,CAAS,QAChBE,EAAK,CACZf,EAASA,GAAU,CAAA,EACfe,aAAeN,GACjBT,EAAMgB,GAAAA,GAAA,CAAA,EAAAC,GAAOjB,CAAM,CAAA,EAAAiB,GAAKF,EAAI,MAAM,CAAA,EAElCf,EAAO,KAAKe,CAAG,sGAMvB,GAAIf,EACF,MAAM,IAAIS,GAAoBT,CAAM,EAG1C,EAoBAF,EAAA,UAAA,IAAA,SAAIoB,EAAuB,OAGzB,GAAIA,GAAYA,IAAa,KAC3B,GAAI,KAAK,OAGPJ,GAAcI,CAAQ,MACjB,CACL,GAAIA,aAAoBpB,EAAc,CAGpC,GAAIoB,EAAS,QAAUA,EAAS,WAAW,IAAI,EAC7C,OAEFA,EAAS,WAAW,IAAI,GAEzB,KAAK,aAAcC,EAAA,KAAK,eAAW,MAAAA,IAAA,OAAAA,EAAI,CAAA,GAAI,KAAKD,CAAQ,EAG/D,EAOQpB,EAAA,UAAA,WAAR,SAAmBsB,EAAoB,CAC7B,IAAAnB,EAAe,KAAI,WAC3B,OAAOA,IAAemB,GAAW,MAAM,QAAQnB,CAAU,GAAKA,EAAW,SAASmB,CAAM,CAC1F,EASQtB,EAAA,UAAA,WAAR,SAAmBsB,EAAoB,CAC7B,IAAAnB,EAAe,KAAI,WAC3B,KAAK,WAAa,MAAM,QAAQA,CAAU,GAAKA,EAAW,KAAKmB,CAAM,EAAGnB,GAAcA,EAAa,CAACA,EAAYmB,CAAM,EAAIA,CAC5H,EAMQtB,EAAA,UAAA,cAAR,SAAsBsB,EAAoB,CAChC,IAAAnB,EAAe,KAAI,WACvBA,IAAemB,EACjB,KAAK,WAAa,KACT,MAAM,QAAQnB,CAAU,GACjCoB,GAAUpB,EAAYmB,CAAM,CAEhC,EAgBAtB,EAAA,UAAA,OAAA,SAAOoB,EAAsC,CACnC,IAAAR,EAAgB,KAAI,YAC5BA,GAAeW,GAAUX,EAAaQ,CAAQ,EAE1CA,aAAoBpB,GACtBoB,EAAS,cAAc,IAAI,CAE/B,EAjLcpB,EAAA,OAAS,UAAA,CACrB,IAAMwB,EAAQ,IAAIxB,EAClB,OAAAwB,EAAM,OAAS,GACRA,CACT,GAAE,EA8KJxB,IAnLA,EAqLO,IAAMyB,GAAqBC,GAAa,MAEzC,SAAUC,GAAeC,EAAU,CACvC,OACEA,aAAiBF,IAChBE,GAAS,WAAYA,GAASC,EAAWD,EAAM,MAAM,GAAKC,EAAWD,EAAM,GAAG,GAAKC,EAAWD,EAAM,WAAW,CAEpH,CAEA,SAASE,GAAcC,EAAwC,CACzDF,EAAWE,CAAS,EACtBA,EAAS,EAETA,EAAU,YAAW,CAEzB,CC5MO,IAAMC,EAAuB,CAClC,iBAAkB,KAClB,sBAAuB,KACvB,QAAS,OACT,sCAAuC,GACvC,yBAA0B,ICGrB,IAAMC,GAAmC,CAG9C,WAAA,SAAWC,EAAqBC,EAAgB,SAAEC,EAAA,CAAA,EAAAC,EAAA,EAAAA,EAAA,UAAA,OAAAA,IAAAD,EAAAC,EAAA,CAAA,EAAA,UAAAA,CAAA,EACxC,IAAAC,EAAaL,GAAe,SACpC,OAAIK,GAAU,WACLA,EAAS,WAAU,MAAnBA,EAAQC,GAAA,CAAYL,EAASC,CAAO,EAAAK,GAAKJ,CAAI,CAAA,CAAA,EAE/C,WAAU,MAAA,OAAAG,GAAA,CAACL,EAASC,CAAO,EAAAK,GAAKJ,CAAI,CAAA,CAAA,CAC7C,EACA,aAAA,SAAaK,EAAM,CACT,IAAAH,EAAaL,GAAe,SACpC,OAAQK,GAAU,cAAgB,cAAcG,CAAa,CAC/D,EACA,SAAU,QCjBN,SAAUC,GAAqBC,EAAQ,CAC3CC,GAAgB,WAAW,UAAA,CACjB,IAAAC,EAAqBC,EAAM,iBACnC,GAAID,EAEFA,EAAiBF,CAAG,MAGpB,OAAMA,CAEV,CAAC,CACH,CCtBM,SAAUI,IAAI,CAAK,CCMlB,IAAMC,IAAyB,UAAA,CAAM,OAAAC,GAAmB,IAAK,OAAW,MAAS,CAA5C,GAAsE,EAO5G,SAAUC,GAAkBC,EAAU,CAC1C,OAAOF,GAAmB,IAAK,OAAWE,CAAK,CACjD,CAOM,SAAUC,GAAoBC,EAAQ,CAC1C,OAAOJ,GAAmB,IAAKI,EAAO,MAAS,CACjD,CAQM,SAAUJ,GAAmBK,EAAuBD,EAAYF,EAAU,CAC9E,MAAO,CACL,KAAIG,EACJ,MAAKD,EACL,MAAKF,EAET,CCrCA,IAAII,GAAuD,KASrD,SAAUC,GAAaC,EAAc,CACzC,GAAIC,EAAO,sCAAuC,CAChD,IAAMC,EAAS,CAACJ,GAKhB,GAJII,IACFJ,GAAU,CAAE,YAAa,GAAO,MAAO,IAAI,GAE7CE,EAAE,EACEE,EAAQ,CACJ,IAAAC,EAAyBL,GAAvBM,EAAWD,EAAA,YAAEE,EAAKF,EAAA,MAE1B,GADAL,GAAU,KACNM,EACF,MAAMC,QAMVL,EAAE,CAEN,CAMM,SAAUM,GAAaC,EAAQ,CAC/BN,EAAO,uCAAyCH,KAClDA,GAAQ,YAAc,GACtBA,GAAQ,MAAQS,EAEpB,CCvBA,IAAAC,IAAA,SAAAC,EAAA,CAAmCC,GAAAF,EAAAC,CAAA,EA4BjC,SAAAD,EAAYG,EAA6C,CAAzD,IAAAC,EACEH,EAAA,KAAA,IAAA,GAAO,KATC,OAAAG,EAAA,UAAqB,GAUzBD,GACFC,EAAK,YAAcD,EAGfE,GAAeF,CAAW,GAC5BA,EAAY,IAAIC,CAAI,GAGtBA,EAAK,YAAcE,IAEvB,CAzBO,OAAAN,EAAA,OAAP,SAAiBO,EAAwBC,EAA2BC,EAAqB,CACvF,OAAO,IAAIC,GAAeH,EAAMC,EAAOC,CAAQ,CACjD,EA+BAT,EAAA,UAAA,KAAA,SAAKW,EAAQ,CACP,KAAK,UACPC,GAA0BC,GAAiBF,CAAK,EAAG,IAAI,EAEvD,KAAK,MAAMA,CAAM,CAErB,EAQAX,EAAA,UAAA,MAAA,SAAMc,EAAS,CACT,KAAK,UACPF,GAA0BG,GAAkBD,CAAG,EAAG,IAAI,GAEtD,KAAK,UAAY,GACjB,KAAK,OAAOA,CAAG,EAEnB,EAOAd,EAAA,UAAA,SAAA,UAAA,CACM,KAAK,UACPY,GAA0BI,GAAuB,IAAI,GAErD,KAAK,UAAY,GACjB,KAAK,UAAS,EAElB,EAEAhB,EAAA,UAAA,YAAA,UAAA,CACO,KAAK,SACR,KAAK,UAAY,GACjBC,EAAA,UAAM,YAAW,KAAA,IAAA,EACjB,KAAK,YAAc,KAEvB,EAEUD,EAAA,UAAA,MAAV,SAAgBW,EAAQ,CACtB,KAAK,YAAY,KAAKA,CAAK,CAC7B,EAEUX,EAAA,UAAA,OAAV,SAAiBc,EAAQ,CACvB,GAAI,CACF,KAAK,YAAY,MAAMA,CAAG,UAE1B,KAAK,YAAW,EAEpB,EAEUd,EAAA,UAAA,UAAV,UAAA,CACE,GAAI,CACF,KAAK,YAAY,SAAQ,UAEzB,KAAK,YAAW,EAEpB,EACFA,CAAA,GAhHmCiB,EAAY,EAuH/C,IAAMC,GAAQ,SAAS,UAAU,KAEjC,SAASC,GAAyCC,EAAQC,EAAY,CACpE,OAAOH,GAAM,KAAKE,EAAIC,CAAO,CAC/B,CAMA,IAAAC,IAAA,UAAA,CACE,SAAAA,EAAoBC,EAAqC,CAArC,KAAA,gBAAAA,CAAwC,CAE5D,OAAAD,EAAA,UAAA,KAAA,SAAKE,EAAQ,CACH,IAAAD,EAAoB,KAAI,gBAChC,GAAIA,EAAgB,KAClB,GAAI,CACFA,EAAgB,KAAKC,CAAK,QACnBC,EAAO,CACdC,GAAqBD,CAAK,EAGhC,EAEAH,EAAA,UAAA,MAAA,SAAMK,EAAQ,CACJ,IAAAJ,EAAoB,KAAI,gBAChC,GAAIA,EAAgB,MAClB,GAAI,CACFA,EAAgB,MAAMI,CAAG,QAClBF,EAAO,CACdC,GAAqBD,CAAK,OAG5BC,GAAqBC,CAAG,CAE5B,EAEAL,EAAA,UAAA,SAAA,UAAA,CACU,IAAAC,EAAoB,KAAI,gBAChC,GAAIA,EAAgB,SAClB,GAAI,CACFA,EAAgB,SAAQ,QACjBE,EAAO,CACdC,GAAqBD,CAAK,EAGhC,EACFH,CAAA,GArCA,EAuCAM,IAAA,SAAAC,EAAA,CAAuCC,GAAAF,EAAAC,CAAA,EACrC,SAAAD,EACEG,EACAN,EACAO,EAA8B,CAHhC,IAAAC,EAKEJ,EAAA,KAAA,IAAA,GAAO,KAEHN,EACJ,GAAIW,EAAWH,CAAc,GAAK,CAACA,EAGjCR,EAAkB,CAChB,KAAOQ,GAAkB,OACzB,MAAON,GAAS,OAChB,SAAUO,GAAY,YAEnB,CAEL,IAAIG,EACAF,GAAQG,EAAO,0BAIjBD,EAAU,OAAO,OAAOJ,CAAc,EACtCI,EAAQ,YAAc,UAAA,CAAM,OAAAF,EAAK,YAAW,CAAhB,EAC5BV,EAAkB,CAChB,KAAMQ,EAAe,MAAQZ,GAAKY,EAAe,KAAMI,CAAO,EAC9D,MAAOJ,EAAe,OAASZ,GAAKY,EAAe,MAAOI,CAAO,EACjE,SAAUJ,EAAe,UAAYZ,GAAKY,EAAe,SAAUI,CAAO,IAI5EZ,EAAkBQ,EAMtB,OAAAE,EAAK,YAAc,IAAIX,GAAiBC,CAAe,GACzD,CACF,OAAAK,CAAA,GAzCuCS,EAAU,EA2CjD,SAASC,GAAqBC,EAAU,CAClCC,EAAO,sCACTC,GAAaF,CAAK,EAIlBG,GAAqBH,CAAK,CAE9B,CAQA,SAASI,GAAoBC,EAAQ,CACnC,MAAMA,CACR,CAOA,SAASC,GAA0BC,EAA2CC,EAA2B,CAC/F,IAAAC,EAA0BR,EAAM,sBACxCQ,GAAyBC,GAAgB,WAAW,UAAA,CAAM,OAAAD,EAAsBF,EAAcC,CAAU,CAA9C,CAA+C,CAC3G,CAOO,IAAMG,GAA6D,CACxE,OAAQ,GACR,KAAMC,GACN,MAAOR,GACP,SAAUQ,ICtQL,IAAMC,IAA+B,UAAA,CAAM,OAAC,OAAO,QAAW,YAAc,OAAO,YAAe,cAAvD,GAAsE,ECoClH,SAAUC,GAAYC,EAAI,CAC9B,OAAOA,CACT,CCsCM,SAAUC,GAAoBC,EAA+B,CACjE,OAAIA,EAAI,SAAW,EACVC,GAGLD,EAAI,SAAW,EACVA,EAAI,CAAC,EAGP,SAAeE,EAAQ,CAC5B,OAAOF,EAAI,OAAO,SAACG,EAAWC,EAAuB,CAAK,OAAAA,EAAGD,CAAI,CAAP,EAAUD,CAAY,CAClF,CACF,CChFA,IAAAG,GAAA,UAAA,CAiBE,SAAAA,EAAYC,EAA6E,CACnFA,IACF,KAAK,WAAaA,EAEtB,CAwBA,OAAAD,EAAA,UAAA,KAAA,SAAQE,EAAyB,CAC/B,IAAMC,EAAa,IAAIH,EACvB,OAAAG,EAAW,OAAS,KACpBA,EAAW,SAAWD,EACfC,CACT,EA2IAH,EAAA,UAAA,UAAA,SACEI,EACAC,EACAC,EAA8B,CAHhC,IAAAC,EAAA,KAKQC,EAAaC,GAAaL,CAAc,EAAIA,EAAiB,IAAIM,GAAeN,EAAgBC,EAAOC,CAAQ,EAErH,OAAAK,GAAa,UAAA,CACL,IAAAC,EAAuBL,EAArBL,EAAQU,EAAA,SAAEC,EAAMD,EAAA,OACxBJ,EAAW,IACTN,EAGIA,EAAS,KAAKM,EAAYK,CAAM,EAChCA,EAIAN,EAAK,WAAWC,CAAU,EAG1BD,EAAK,cAAcC,CAAU,CAAC,CAEtC,CAAC,EAEMA,CACT,EAGUR,EAAA,UAAA,cAAV,SAAwBc,EAAmB,CACzC,GAAI,CACF,OAAO,KAAK,WAAWA,CAAI,QACpBC,EAAK,CAIZD,EAAK,MAAMC,CAAG,EAElB,EA6DAf,EAAA,UAAA,QAAA,SAAQgB,EAA0BC,EAAoC,CAAtE,IAAAV,EAAA,KACE,OAAAU,EAAcC,GAAeD,CAAW,EAEjC,IAAIA,EAAkB,SAACE,EAASC,EAAM,CAC3C,IAAMZ,EAAa,IAAIE,GAAkB,CACvC,KAAM,SAACW,EAAK,CACV,GAAI,CACFL,EAAKK,CAAK,QACHN,EAAK,CACZK,EAAOL,CAAG,EACVP,EAAW,YAAW,EAE1B,EACA,MAAOY,EACP,SAAUD,EACX,EACDZ,EAAK,UAAUC,CAAU,CAC3B,CAAC,CACH,EAGUR,EAAA,UAAA,WAAV,SAAqBQ,EAA2B,OAC9C,OAAOI,EAAA,KAAK,UAAM,MAAAA,IAAA,OAAA,OAAAA,EAAE,UAAUJ,CAAU,CAC1C,EAMAR,EAAA,UAACG,EAAiB,EAAlB,UAAA,CACE,OAAO,IACT,EA4FAH,EAAA,UAAA,KAAA,UAAA,SAAKsB,EAAA,CAAA,EAAAC,EAAA,EAAAA,EAAA,UAAA,OAAAA,IAAAD,EAAAC,CAAA,EAAA,UAAAA,CAAA,EACH,OAAOC,GAAcF,CAAU,EAAE,IAAI,CACvC,EA4BAtB,EAAA,UAAA,UAAA,SAAUiB,EAAoC,CAA9C,IAAAV,EAAA,KACE,OAAAU,EAAcC,GAAeD,CAAW,EAEjC,IAAIA,EAAY,SAACE,EAASC,EAAM,CACrC,IAAIC,EACJd,EAAK,UACH,SAACkB,EAAI,CAAK,OAACJ,EAAQI,CAAT,EACV,SAACV,EAAQ,CAAK,OAAAK,EAAOL,CAAG,CAAV,EACd,UAAA,CAAM,OAAAI,EAAQE,CAAK,CAAb,CAAc,CAExB,CAAC,CACH,EAraOrB,EAAA,OAAkC,SAAIC,EAAwD,CACnG,OAAO,IAAID,EAAcC,CAAS,CACpC,EAoaFD,IArcA,EA8cA,SAAS0B,GAAeC,EAA+C,OACrE,OAAOC,EAAAD,GAAeE,EAAO,WAAO,MAAAD,IAAA,OAAAA,EAAI,OAC1C,CAEA,SAASE,GAAcC,EAAU,CAC/B,OAAOA,GAASC,EAAWD,EAAM,IAAI,GAAKC,EAAWD,EAAM,KAAK,GAAKC,EAAWD,EAAM,QAAQ,CAChG,CAEA,SAASE,GAAgBF,EAAU,CACjC,OAAQA,GAASA,aAAiBG,IAAgBJ,GAAWC,CAAK,GAAKI,GAAeJ,CAAK,CAC7F,CC9dM,SAAUK,GAAQC,EAAW,CACjC,OAAOC,EAAWD,GAAQ,IAAI,CAChC,CAMM,SAAUE,EACdC,EAAqF,CAErF,OAAO,SAACH,EAAqB,CAC3B,GAAID,GAAQC,CAAM,EAChB,OAAOA,EAAO,KAAK,SAA+BI,EAA2B,CAC3E,GAAI,CACF,OAAOD,EAAKC,EAAc,IAAI,QACvBC,EAAK,CACZ,KAAK,MAAMA,CAAG,EAElB,CAAC,EAEH,MAAM,IAAI,UAAU,wCAAwC,CAC9D,CACF,CCjBM,SAAUC,GACdC,EACAC,EACAC,EACAC,EACAC,EAAuB,CAEvB,OAAO,IAAIC,GAAmBL,EAAaC,EAAQC,EAAYC,EAASC,CAAU,CACpF,CAMA,IAAAC,IAAA,SAAAC,EAAA,CAA2CC,GAAAF,EAAAC,CAAA,EAiBzC,SAAAD,EACEL,EACAC,EACAC,EACAC,EACQC,EACAI,EAAiC,CAN3C,IAAAC,EAoBEH,EAAA,KAAA,KAAMN,CAAW,GAAC,KAfV,OAAAS,EAAA,WAAAL,EACAK,EAAA,kBAAAD,EAeRC,EAAK,MAAQR,EACT,SAAuCS,EAAQ,CAC7C,GAAI,CACFT,EAAOS,CAAK,QACLC,EAAK,CACZX,EAAY,MAAMW,CAAG,EAEzB,EACAL,EAAA,UAAM,MACVG,EAAK,OAASN,EACV,SAAuCQ,EAAQ,CAC7C,GAAI,CACFR,EAAQQ,CAAG,QACJA,EAAK,CAEZX,EAAY,MAAMW,CAAG,UAGrB,KAAK,YAAW,EAEpB,EACAL,EAAA,UAAM,OACVG,EAAK,UAAYP,EACb,UAAA,CACE,GAAI,CACFA,EAAU,QACHS,EAAK,CAEZX,EAAY,MAAMW,CAAG,UAGrB,KAAK,YAAW,EAEpB,EACAL,EAAA,UAAM,WACZ,CAEA,OAAAD,EAAA,UAAA,YAAA,UAAA,OACE,GAAI,CAAC,KAAK,mBAAqB,KAAK,kBAAiB,EAAI,CAC/C,IAAAO,EAAW,KAAI,OACvBN,EAAA,UAAM,YAAW,KAAA,IAAA,EAEjB,CAACM,KAAUC,EAAA,KAAK,cAAU,MAAAA,IAAA,QAAAA,EAAA,KAAf,IAAI,GAEnB,EACFR,CAAA,GAnF2CS,EAAU,EC5B9C,IAAMC,IAAe,SAAIC,EAAM,CAAwB,OAAAA,GAAK,OAAOA,EAAE,QAAW,UAAY,OAAOA,GAAM,UAAlD,GCMxD,SAAUC,GAAUC,EAAU,CAClC,OAAOC,EAAWD,GAAO,IAAI,CAC/B,CCHM,SAAUE,GAAoBC,EAAU,CAC5C,OAAOC,EAAWD,EAAME,EAAiB,CAAC,CAC5C,CCLM,SAAUC,GAAmBC,EAAQ,CACzC,OAAO,OAAO,eAAiBC,EAAWD,IAAM,OAAO,aAAa,CAAC,CACvE,CCAM,SAAUE,GAAiCC,EAAU,CAEzD,OAAO,IAAI,UACT,iBACEA,IAAU,MAAQ,OAAOA,GAAU,SAAW,oBAAsB,IAAIA,EAAK,KAAG,0HACwC,CAE9H,CCXM,SAAUC,IAAiB,CAC/B,OAAI,OAAO,QAAW,YAAc,CAAC,OAAO,SACnC,aAGF,OAAO,QAChB,CAEO,IAAMC,GAAWD,GAAiB,ECJnC,SAAUE,GAAWC,EAAU,CACnC,OAAOC,EAAWD,IAAQE,EAAe,CAAC,CAC5C,CCHM,SAAiBC,GAAsCC,EAAqC,mGAC1FC,EAASD,EAAe,UAAS,2DAGX,MAAA,CAAA,EAAAE,GAAMD,EAAO,KAAI,CAAE,CAAA,gBAArCE,EAAkBC,EAAA,KAAA,EAAhBC,EAAKF,EAAA,MAAEG,EAAIH,EAAA,KACfG,iBAAA,CAAA,EAAA,CAAA,SACF,MAAA,CAAA,EAAAF,EAAA,KAAA,CAAA,qBAEIC,CAAM,CAAA,SAAZ,MAAA,CAAA,EAAAD,EAAA,KAAA,CAAA,SAAA,OAAAA,EAAA,KAAA,mCAGF,OAAAH,EAAO,YAAW,6BAIhB,SAAUM,GAAwBC,EAAQ,CAG9C,OAAOC,EAAWD,GAAK,SAAS,CAClC,CCPM,SAAUE,EAAaC,EAAyB,CACpD,GAAIA,aAAiBC,EACnB,OAAOD,EAET,GAAIA,GAAS,KAAM,CACjB,GAAIE,GAAoBF,CAAK,EAC3B,OAAOG,GAAsBH,CAAK,EAEpC,GAAII,GAAYJ,CAAK,EACnB,OAAOK,GAAcL,CAAK,EAE5B,GAAIM,GAAUN,CAAK,EACjB,OAAOO,GAAYP,CAAK,EAE1B,GAAIQ,GAAgBR,CAAK,EACvB,OAAOS,GAAkBT,CAAK,EAEhC,GAAIU,GAAWV,CAAK,EAClB,OAAOW,GAAaX,CAAK,EAE3B,GAAIY,GAAqBZ,CAAK,EAC5B,OAAOa,GAAuBb,CAAK,EAIvC,MAAMc,GAAiCd,CAAK,CAC9C,CAMM,SAAUG,GAAyBY,EAAQ,CAC/C,OAAO,IAAId,EAAW,SAACe,EAAyB,CAC9C,IAAMC,EAAMF,EAAIG,EAAiB,EAAC,EAClC,GAAIC,EAAWF,EAAI,SAAS,EAC1B,OAAOA,EAAI,UAAUD,CAAU,EAGjC,MAAM,IAAI,UAAU,gEAAgE,CACtF,CAAC,CACH,CASM,SAAUX,GAAiBe,EAAmB,CAClD,OAAO,IAAInB,EAAW,SAACe,EAAyB,CAU9C,QAASK,EAAI,EAAGA,EAAID,EAAM,QAAU,CAACJ,EAAW,OAAQK,IACtDL,EAAW,KAAKI,EAAMC,CAAC,CAAC,EAE1BL,EAAW,SAAQ,CACrB,CAAC,CACH,CAEM,SAAUT,GAAee,EAAuB,CACpD,OAAO,IAAIrB,EAAW,SAACe,EAAyB,CAC9CM,EACG,KACC,SAACC,EAAK,CACCP,EAAW,SACdA,EAAW,KAAKO,CAAK,EACrBP,EAAW,SAAQ,EAEvB,EACA,SAACQ,EAAQ,CAAK,OAAAR,EAAW,MAAMQ,CAAG,CAApB,CAAqB,EAEpC,KAAK,KAAMC,EAAoB,CACpC,CAAC,CACH,CAEM,SAAUd,GAAgBe,EAAqB,CACnD,OAAO,IAAIzB,EAAW,SAACe,EAAyB,aAC9C,QAAoBW,EAAAC,GAAAF,CAAQ,EAAAG,EAAAF,EAAA,KAAA,EAAA,CAAAE,EAAA,KAAAA,EAAAF,EAAA,KAAA,EAAE,CAAzB,IAAMJ,EAAKM,EAAA,MAEd,GADAb,EAAW,KAAKO,CAAK,EACjBP,EAAW,OACb,yGAGJA,EAAW,SAAQ,CACrB,CAAC,CACH,CAEM,SAAUP,GAAqBqB,EAA+B,CAClE,OAAO,IAAI7B,EAAW,SAACe,EAAyB,CAC9Ce,GAAQD,EAAed,CAAU,EAAE,MAAM,SAACQ,EAAG,CAAK,OAAAR,EAAW,MAAMQ,CAAG,CAApB,CAAqB,CACzE,CAAC,CACH,CAEM,SAAUX,GAA0BmB,EAAqC,CAC7E,OAAOvB,GAAkBwB,GAAmCD,CAAc,CAAC,CAC7E,CAEA,SAAeD,GAAWD,EAAiCd,EAAyB,uIACxDkB,EAAAC,GAAAL,CAAa,gFAIrC,GAJeP,EAAKa,EAAA,MACpBpB,EAAW,KAAKO,CAAK,EAGjBP,EAAW,OACb,MAAA,CAAA,CAAA,6RAGJ,OAAAA,EAAW,SAAQ,WChHf,SAAUqB,EACdC,EACAC,EACAC,EACAC,EACAC,EAAc,CADdD,IAAA,SAAAA,EAAA,GACAC,IAAA,SAAAA,EAAA,IAEA,IAAMC,EAAuBJ,EAAU,SAAS,UAAA,CAC9CC,EAAI,EACAE,EACFJ,EAAmB,IAAI,KAAK,SAAS,KAAMG,CAAK,CAAC,EAEjD,KAAK,YAAW,CAEpB,EAAGA,CAAK,EAIR,GAFAH,EAAmB,IAAIK,CAAoB,EAEvC,CAACD,EAKH,OAAOC,CAEX,CCeM,SAAUC,GAAaC,EAA0BC,EAAS,CAAT,OAAAA,IAAA,SAAAA,EAAA,GAC9CC,EAAQ,SAACC,EAAQC,EAAU,CAChCD,EAAO,UACLE,GACED,EACA,SAACE,EAAK,CAAK,OAAAC,EAAgBH,EAAYJ,EAAW,UAAA,CAAM,OAAAI,EAAW,KAAKE,CAAK,CAArB,EAAwBL,CAAK,CAA1E,EACX,UAAA,CAAM,OAAAM,EAAgBH,EAAYJ,EAAW,UAAA,CAAM,OAAAI,EAAW,SAAQ,CAAnB,EAAuBH,CAAK,CAAzE,EACN,SAACO,EAAG,CAAK,OAAAD,EAAgBH,EAAYJ,EAAW,UAAA,CAAM,OAAAI,EAAW,MAAMI,CAAG,CAApB,EAAuBP,CAAK,CAAzE,CAA0E,CACpF,CAEL,CAAC,CACH,CCPM,SAAUQ,GAAeC,EAA0BC,EAAiB,CAAjB,OAAAA,IAAA,SAAAA,EAAA,GAChDC,EAAQ,SAACC,EAAQC,EAAU,CAChCA,EAAW,IAAIJ,EAAU,SAAS,UAAA,CAAM,OAAAG,EAAO,UAAUC,CAAU,CAA3B,EAA8BH,CAAK,CAAC,CAC9E,CAAC,CACH,CC7DM,SAAUI,GAAsBC,EAA6BC,EAAwB,CACzF,OAAOC,EAAUF,CAAK,EAAE,KAAKG,GAAYF,CAAS,EAAGG,GAAUH,CAAS,CAAC,CAC3E,CCFM,SAAUI,GAAmBC,EAAuBC,EAAwB,CAChF,OAAOC,EAAUF,CAAK,EAAE,KAAKG,GAAYF,CAAS,EAAGG,GAAUH,CAAS,CAAC,CAC3E,CCJM,SAAUI,GAAiBC,EAAqBC,EAAwB,CAC5E,OAAO,IAAIC,EAAc,SAACC,EAAU,CAElC,IAAIC,EAAI,EAER,OAAOH,EAAU,SAAS,UAAA,CACpBG,IAAMJ,EAAM,OAGdG,EAAW,SAAQ,GAInBA,EAAW,KAAKH,EAAMI,GAAG,CAAC,EAIrBD,EAAW,QACd,KAAK,SAAQ,EAGnB,CAAC,CACH,CAAC,CACH,CCfM,SAAUE,GAAoBC,EAAoBC,EAAwB,CAC9E,OAAO,IAAIC,EAAc,SAACC,EAAU,CAClC,IAAIC,EAKJ,OAAAC,EAAgBF,EAAYF,EAAW,UAAA,CAErCG,EAAYJ,EAAcI,EAAe,EAAC,EAE1CC,EACEF,EACAF,EACA,UAAA,OACMK,EACAC,EACJ,GAAI,CAEDC,EAAkBJ,EAAS,KAAI,EAA7BE,EAAKE,EAAA,MAAED,EAAIC,EAAA,WACPC,EAAK,CAEZN,EAAW,MAAMM,CAAG,EACpB,OAGEF,EAKFJ,EAAW,SAAQ,EAGnBA,EAAW,KAAKG,CAAK,CAEzB,EACA,EACA,EAAI,CAER,CAAC,EAMM,UAAA,CAAM,OAAAI,EAAWN,GAAU,MAAM,GAAKA,EAAS,OAAM,CAA/C,CACf,CAAC,CACH,CCvDM,SAAUO,GAAyBC,EAAyBC,EAAwB,CACxF,GAAI,CAACD,EACH,MAAM,IAAI,MAAM,yBAAyB,EAE3C,OAAO,IAAIE,EAAc,SAACC,EAAU,CAClCC,EAAgBD,EAAYF,EAAW,UAAA,CACrC,IAAMI,EAAWL,EAAM,OAAO,aAAa,EAAC,EAC5CI,EACED,EACAF,EACA,UAAA,CACEI,EAAS,KAAI,EAAG,KAAK,SAACC,EAAM,CACtBA,EAAO,KAGTH,EAAW,SAAQ,EAEnBA,EAAW,KAAKG,EAAO,KAAK,CAEhC,CAAC,CACH,EACA,EACA,EAAI,CAER,CAAC,CACH,CAAC,CACH,CCzBM,SAAUC,GAA8BC,EAA8BC,EAAwB,CAClG,OAAOC,GAAsBC,GAAmCH,CAAK,EAAGC,CAAS,CACnF,CCoBM,SAAUG,GAAaC,EAA2BC,EAAwB,CAC9E,GAAID,GAAS,KAAM,CACjB,GAAIE,GAAoBF,CAAK,EAC3B,OAAOG,GAAmBH,EAAOC,CAAS,EAE5C,GAAIG,GAAYJ,CAAK,EACnB,OAAOK,GAAcL,EAAOC,CAAS,EAEvC,GAAIK,GAAUN,CAAK,EACjB,OAAOO,GAAgBP,EAAOC,CAAS,EAEzC,GAAIO,GAAgBR,CAAK,EACvB,OAAOS,GAAsBT,EAAOC,CAAS,EAE/C,GAAIS,GAAWV,CAAK,EAClB,OAAOW,GAAiBX,EAAOC,CAAS,EAE1C,GAAIW,GAAqBZ,CAAK,EAC5B,OAAOa,GAA2Bb,EAAOC,CAAS,EAGtD,MAAMa,GAAiCd,CAAK,CAC9C,CCoDM,SAAUe,GAAQC,EAA2BC,EAAyB,CAC1E,OAAOA,EAAYC,GAAUF,EAAOC,CAAS,EAAIE,EAAUH,CAAK,CAClE,CCzDM,SAAUI,GAAUC,EAAyCC,EAAa,CAC9E,OAAOC,EAAQ,SAACC,EAAQC,EAAU,CAEhC,IAAIC,EAAQ,EAGZF,EAAO,UACLG,GAAyBF,EAAY,SAACG,EAAQ,CAG5CH,EAAW,KAAKJ,EAAQ,KAAKC,EAASM,EAAOF,GAAO,CAAC,CACvD,CAAC,CAAC,CAEN,CAAC,CACH,CCxCM,SAAUG,GACdC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAAgC,CAGhC,IAAMC,EAAc,CAAA,EAEhBC,EAAS,EAETC,EAAQ,EAERC,EAAa,GAKXC,EAAgB,UAAA,CAIhBD,GAAc,CAACH,EAAO,QAAU,CAACC,GACnCR,EAAW,SAAQ,CAEvB,EAGMY,EAAY,SAACC,EAAQ,CAAK,OAACL,EAASN,EAAaY,EAAWD,CAAK,EAAIN,EAAO,KAAKM,CAAK,CAA5D,EAE1BC,EAAa,SAACD,EAAQ,CAI1BT,GAAUJ,EAAW,KAAKa,CAAY,EAItCL,IAKA,IAAIO,EAAgB,GAGpBC,EAAUf,EAAQY,EAAOJ,GAAO,CAAC,EAAE,UACjCQ,GACEjB,EACA,SAACkB,EAAU,CAGTf,IAAee,CAAU,EAErBd,EAGFQ,EAAUM,CAAiB,EAG3BlB,EAAW,KAAKkB,CAAU,CAE9B,EACA,UAAA,CAGEH,EAAgB,EAClB,EAEA,OACA,UAAA,CAIE,GAAIA,EAKF,GAAI,CAIFP,IAKA,qBACE,IAAMW,EAAgBZ,EAAO,MAAK,EAI9BF,EACFe,EAAgBpB,EAAYK,EAAmB,UAAA,CAAM,OAAAS,EAAWK,CAAa,CAAxB,CAAyB,EAE9EL,EAAWK,CAAa,GARrBZ,EAAO,QAAUC,EAASN,OAYjCS,EAAa,QACNU,EAAK,CACZrB,EAAW,MAAMqB,CAAG,EAG1B,CAAC,CACF,CAEL,EAGA,OAAAtB,EAAO,UACLkB,GAAyBjB,EAAYY,EAAW,UAAA,CAE9CF,EAAa,GACbC,EAAa,CACf,CAAC,CAAC,EAKG,UAAA,CACLL,IAAmB,CACrB,CACF,CCpEM,SAAUgB,GACdC,EACAC,EACAC,EAA6B,CAE7B,OAFAA,IAAA,SAAAA,EAAA,KAEIC,EAAWF,CAAc,EAEpBF,GAAS,SAACK,EAAGC,EAAC,CAAK,OAAAC,GAAI,SAACC,EAAQC,EAAU,CAAK,OAAAP,EAAeG,EAAGG,EAAGF,EAAGG,CAAE,CAA1B,CAA2B,EAAEC,EAAUT,EAAQI,EAAGC,CAAC,CAAC,CAAC,CAAjF,EAAoFH,CAAU,GAC/G,OAAOD,GAAmB,WACnCC,EAAaD,GAGRS,EAAQ,SAACC,EAAQC,EAAU,CAAK,OAAAC,GAAeF,EAAQC,EAAYZ,EAASE,CAAU,CAAtD,CAAuD,EAChG,CChFM,SAAUY,GACdC,EACAC,EACAC,EACAC,EACAC,EAAqC,CAErC,OAAO,SAACC,EAAuBC,EAA2B,CAIxD,IAAIC,EAAWL,EAIXM,EAAaP,EAEbQ,EAAQ,EAGZJ,EAAO,UACLK,GACEJ,EACA,SAACK,EAAK,CAEJ,IAAMC,EAAIH,IAEVD,EAAQD,EAEJP,EAAYQ,EAAOG,EAAOC,CAAC,GAIzBL,EAAW,GAAOI,GAGxBR,GAAcG,EAAW,KAAKE,CAAK,CACrC,EAGAJ,IACG,UAAA,CACCG,GAAYD,EAAW,KAAKE,CAAK,EACjCF,EAAW,SAAQ,CACrB,EAAE,CACL,CAEL,CACF,CCHM,SAAUO,GAAaC,EAAyDC,EAAU,CAC9F,OAAOC,EAAQC,GAAcH,EAAaC,EAAM,UAAU,QAAU,EAAG,GAAO,EAAI,CAAC,CACrF,CCxDA,IAAMG,GAAa,SAACC,EAAYC,EAAU,CAAK,OAACD,EAAI,KAAKC,CAAK,EAAGD,CAAlB,EAgCzC,SAAUE,IAAO,CAIrB,OAAOC,EAAQ,SAACC,EAAQC,EAAU,CAChCC,GAAOP,GAAY,CAAA,CAAS,EAAEK,CAAM,EAAE,UAAUC,CAAU,CAC5D,CAAC,CACH,CCoDA,SAASE,GAAeC,EAAG,CACvB,IAAMC,EAAM,CAAC,EACTC,EAAM,EACNC,EACJ,QAASC,EAAI,EAAGC,EAAIL,EAAE,OAAQI,EAAIC,EAAGD,IAAK,CACtC,IAAME,EAAON,EAAE,WAAWI,CAAC,EAC3B,GAAIE,GAAQ,IAAMA,GAAQ,GACtBJ,EAAMA,EAAM,GAAKI,EAAO,WAEnBA,IAAS,GACdH,EAAiBD,EACjBA,EAAM,MAEL,CAGD,IAAMK,EAAKP,EAAEI,CAAC,EACVG,IAAO,KAAOA,IAAO,KAAOA,IAAO,IACnCN,EAAI,KAAK,CACL,IAAKE,IAAmB,OAAYD,EAAMC,EAC1C,KAAMD,EACN,GAAI,GACR,CAAC,EAEIK,IAAO,IACZN,EAAI,KAAK,CAAE,IAAK,EAAG,KAAMC,EAAK,GAAAK,CAAG,CAAC,GAE7BA,IAAO,KAAOA,IAAO,MAC1BN,EAAI,KAAK,CAAE,IAAKC,EAAK,KAAM,EAAG,GAAAK,CAAG,CAAC,EAEtCJ,EAAiB,OACjBD,EAAM,CACV,CACJ,CACA,OAAOD,CACX,CAiDO,SAASO,GAAmBC,EAAG,CAClC,IAAIC,EAAM,GACV,OAAW,CAAE,IAAAC,EAAK,KAAAC,EAAM,GAAAC,CAAG,IAAKC,GAAeL,CAAC,EAC5CC,GACIG,IAAO,IACDF,IAAQ,EACJ,GAAGC,CAAI,IACPA,IAAS,EACL,GAAGD,CAAG,IACN,GAAGA,CAAG,IACd,GAAGE,IAAO,IAAMD,EAAOD,CAAG,GAAGE,CAAE,GAE7C,OAAOH,CACX,CAGA,IAAMK,GAAiB,GAAK,GAAK,EACjC,SAASC,GAAWN,EAAKO,EAAKC,EAAM,CAChC,QAASC,EAAOF,EAAKE,EAAO,EAAGA,GAAQJ,GACnCL,EAAI,MAAO,KAAK,IAAIS,EAAMJ,EAAc,GAAK,EAAKG,KAAU,CAAC,CAErE,CACA,SAASE,GAAQV,EAAKC,EAAKC,EAAM,CAC7B,GAAID,IAAQC,EACRI,GAAWN,EAAKC,EAAK,CAAO,MAE3B,CACD,IAAMU,EAAS,KAAK,KAAK,KAAK,IAAIV,EAAKC,CAAI,EAAIG,EAAc,EAC7D,QAASO,EAAI,EAAGA,EAAID,EAAQC,IAAK,CAC7B,IAAMC,EAAI,KAAK,MAAOZ,GAAOW,EAAI,GAAMD,CAAM,EAAI,KAAK,MAAOV,EAAMW,EAAKD,CAAM,EACxEG,EAAI,KAAK,MAAOZ,GAAQU,EAAI,GAAMD,CAAM,EAAI,KAAK,MAAOT,EAAOU,EAAKD,CAAM,EAChFX,EAAI,MAAOa,GAAK,EAAK,KAAe,GAAKC,GAAK,EAAK,KAAe,CAAC,CACvE,CACJ,CACJ,CAOO,SAASC,GAAiBhB,EAAG,CAChC,IAAMC,EAAM,CAAC,EACb,OAAW,CAAE,IAAAC,EAAK,KAAAC,EAAM,GAAAC,CAAG,IAAKC,GAAeL,CAAC,EACxCI,IAAO,IACPO,GAAQV,EAAKC,EAAKC,CAAI,EAEjBC,IAAO,IACZG,GAAWN,EAAKE,EAAM,CAAO,EAG7BI,GAAWN,EAAKC,EAAKE,IAAO,IAAM,EAAU,CAAO,EAG3D,OAAO,YAAY,KAAKH,CAAG,CAC/B,CCzOA,SAASgB,GAAQC,EAAM,CACnB,OAAOA,GAAQ,IAAMA,GAAQ,EACjC,CACA,SAASC,GAAWC,EAAI,CACpB,OAAOA,IAAO,QAAa,WAAW,KAAKA,CAAE,CACjD,CACA,SAASC,GAAUC,EAAIC,EAAO,CAC1B,IAAIC,EAAID,EACR,KAAOC,EAAIF,EAAG,QAAUH,GAAWG,EAAGE,CAAC,CAAC,GACpCA,IAEJ,OAAOA,CACX,CACA,SAASC,GAAWH,EAAIC,EAAO,CAC3B,IAAIC,EAAID,EACJG,EAAQ,EACZ,KAAOF,EAAIF,EAAG,QAAUL,GAAQK,EAAG,WAAWE,CAAC,CAAC,GAC5CE,EAAQA,EAAQ,IAAMJ,EAAG,WAAWE,CAAC,EAAI,IACzCA,IAEJ,MAAO,CAAE,MAAAE,EAAO,KAAMF,CAAE,CAC5B,CAwBO,SAASG,GAAYL,EAAIM,EAAU,CACtC,IAAIJ,EAAI,EACR,KAAOA,EAAIF,EAAG,QAAQ,CAClB,IAAMO,EAAIP,EAAGE,CAAC,EACd,GAAIK,IAAM,IAAK,CACX,GAAM,CAAE,MAAAH,EAAO,KAAAI,CAAK,EAAIL,GAAWH,EAAIE,EAAI,CAAC,EAC5CI,EAAS,IAAKF,EAAOA,EAAOF,EAAI,EAAGM,CAAI,EACvCN,EAAIM,CACR,SACSD,IAAM,IAAK,CAChB,IAAMC,EAAOT,GAAUC,EAAIE,EAAI,CAAC,EAC1BO,EAAMD,EAAON,EAAI,EACvBI,EAAS,IAAKG,EAAKA,EAAKP,EAAI,EAAGM,CAAI,EACnCN,EAAIM,CACR,SACSD,IAAM,IACXD,EAAS,IAAK,EAAG,EAAGJ,EAAI,EAAG,KAAK,IAAIA,EAAI,EAAGF,EAAG,MAAM,CAAC,EACrDE,GAAK,UAEAK,IAAM,KAAOA,IAAM,IAAK,CAC7B,IAAMC,EAAOT,GAAUC,EAAIE,EAAI,CAAC,EAC1BO,EAAMD,EAAON,EAAI,EACvBI,EAASC,EAAGA,IAAM,IAAME,EAAM,EAAGF,IAAM,IAAME,EAAM,EAAGP,EAAI,EAAGM,CAAI,EACjEN,EAAIM,CACR,SACSD,IAAM,IAAK,CAEhB,GAAM,CAAE,MAAAH,EAAO,KAAAI,CAAK,EAAIL,GAAWH,EAAIE,EAAI,CAAC,EACtCQ,EAAM,KAAK,IAAIF,EAAO,EAAGR,EAAG,MAAM,EACxCM,EAAS,IAAKF,EAAO,EAAGF,EAAI,EAAGQ,CAAG,EAClCR,EAAIQ,CACR,MAEIR,GAER,CACJ,CA2CO,SAASS,GAAkBC,EAAIC,EAAUC,EAAaC,EAAW,CACpE,IAAMC,EAAKF,GAAe,OAAO,kBAC3BG,EAAKF,GAAa,OAAO,kBAC3BG,EAAM,EACVC,GAAYP,EAAI,CAACQ,EAAIC,EAAQC,EAAUC,EAAUC,IAAW,CACxD,GAAIJ,IAAO,IACHF,GAAOF,GAAME,EAAMD,GACnBJ,EAAS,GAAeK,EAAK,EAAGN,EAAGW,EAAW,CAAC,GAAK,GAAI,GAAI,EAAG,CAAC,UAG/DH,IAAO,KACZ,GAAIF,GAAOF,GAAME,GAAOD,EAAI,CACxB,IAAMQ,EAAMb,EAAG,MAAMW,EAAUC,CAAM,EACrCX,EAAS,GAAgBK,EAAKI,EAAUG,EAAK,GAAI,EAAGH,CAAQ,CAChE,OAEKF,IAAO,KAAOA,IAAO,MACtBF,EAAMD,GAAMC,EAAMG,EAASL,GAI3BH,EADaO,IAAO,IAAM,GAAgB,GAC3BF,EAAKG,EAAQ,GAAI,GAAI,EAAG,CAAC,EAGhDH,GAAOG,CACX,CAAC,CACL,CCnJO,SAASK,GAAmBC,EAAKC,EAAKC,EAAKC,EAAM,CACpD,IAAIC,EAAU,EACVC,EAAU,EACRC,EAAa,CAAC,EACdC,EAAeL,GAAOD,EAC5B,QAASO,EAAI,EAAGC,EAAIT,EAAI,OAAQQ,EAAIC,EAAGD,IAAK,CACxC,IAAME,EAASV,EAAIQ,CAAC,EACdG,EAAMD,IAAW,EACjBE,EAAKF,EAAS,GACpB,GAAIE,IAAO,GAAWA,IAAO,EAAU,CACnC,GAAIL,EACA,QAASM,EAAI,EAAGA,EAAIF,EAAKE,KAChBZ,EAAI,WAAWI,EAAUQ,CAAC,EAAI,OAC9BX,EAAI,WAAWE,EAAUS,CAAC,EAAI,KAC/BP,EAAW,KAAK,CACZ,MAAOF,EAAUS,EACjB,KAAM,WACN,KAAMZ,EAAII,EAAUQ,CAAC,EACrB,QAASX,EAAIE,EAAUS,CAAC,EACxB,OAAQ,CACZ,CAAC,EAIbR,GAAWM,EACXP,GAAWO,CACf,SACSC,IAAO,EACZN,EAAW,KAAK,CACZ,MAAOF,EACP,KAAM,YACN,UAAWO,EACX,cAAeV,GAAK,MAAMI,EAASA,EAAUM,CAAG,EAChD,OAAQ,CACZ,CAAC,EACDN,GAAWM,UAENC,IAAO,EACZN,EAAW,KAAK,CACZ,MAAOF,EACP,KAAM,WACN,OAAQO,CACZ,CAAC,EACDP,GAAWO,UAENC,IAAO,EACZN,EAAW,KAAK,CACZ,MAAOF,EACP,KAAM,OACN,OAAQO,CACZ,CAAC,EACDP,GAAWO,UAENC,IAAO,EAAS,CACrB,QAASC,EAAI,EAAGA,EAAIF,EAAKE,IACrBP,EAAW,KAAK,CACZ,MAAOF,EAAUS,EACjB,KAAM,WACN,KAAMZ,IAAMI,EAAUQ,CAAC,GAAK,IAC5B,KAAMV,IAAOE,EAAUQ,CAAC,EACxB,OAAQ,CACZ,CAAC,EAELR,GAAWM,EACXP,GAAWO,CACf,MACSC,IAAO,EACZN,EAAW,KAAK,CACZ,MAAOF,EACP,KAAM,WACN,QAASO,EACT,OAAQ,CACZ,CAAC,EAEIC,IAAO,IACZN,EAAW,KAAK,CACZ,MAAOF,EACP,KAAM,WACN,QAASO,EACT,OAAQ,CACZ,CAAC,EACDN,GAAWM,EAEnB,CACA,OAAOL,CACX,CCrFO,SAASQ,GAAgBC,EAAUC,EAAKC,EAAiBC,EAAKC,EAAM,CACvE,GAAI,CAACH,EACD,MAAO,CAAC,EAEZ,IAAMI,EAAkB,CAAC,EACnBC,EAAYL,EAAI,OAChBM,EAAYJ,EAAI,OAChBK,EAAUJ,IAAS,OAEnBK,EAAcP,EAAgB,OAChCQ,EAAW,GACf,QAASC,EAAI,EAAGA,EAAIF,EAAaE,IAC7B,GAAIT,EAAgBS,CAAC,EAAE,OAAS,OAAQ,CACpCD,EAAW,GACX,KACJ,CAEJ,IAAIE,EAAY,EACZC,EAAY,EACZC,EAAqB,EACrBC,EAAgB,EAChBC,EAAc,EAEdC,EAAI,EACFC,EAAMlB,EAAS,OACrB,KAAOiB,EAAIC,GAAK,CACZ,IAAMC,EAAOnB,EAAS,WAAWiB,CAAC,EAClC,GAAIE,GAAQ,IAAMA,GAAQ,GAAI,CAE1B,IAAIC,EAAM,EACV,KAAOH,EAAIC,GAAK,CACZ,IAAMG,EAAIrB,EAAS,WAAWiB,CAAC,EAC/B,GAAII,GAAK,IAAMA,GAAK,GAChBD,EAAMA,EAAM,IAAMC,EAAI,IACtBJ,QAGA,MAER,CACAL,GAAaQ,CACjB,SACSD,IAAS,GAGd,IADAF,IACOA,EAAIC,GAAOlB,EAAS,WAAWiB,CAAC,GAAK,IAExCA,IACAL,YAGCO,GAAQ,GAAI,CAEjB,IAAMG,EAAStB,EAASiB,CAAC,EAGzB,GAFAA,IAEIP,GAAYD,EAAc,EAC1B,QAASE,EAAIK,EAAaL,EAAIF,EAAaE,IAAK,CAC5C,IAAMY,EAAWrB,EAAgBS,CAAC,EAC9BY,EAAS,OAAS,QAAUX,GAAaW,EAAS,QAClDX,GAAaW,EAAS,OACtBP,EAAcL,EAAI,EAE1B,CAGJ,IAAIa,EAAiBV,EACjBW,EAAYV,EAEhB,QAASW,EAAIb,EAAWa,EAAIpB,GAAamB,GAAab,EAAWc,IAAKb,EAAYa,EAAG,CACjF,IAAMC,EAAS1B,EAAIyB,CAAC,EACdR,EAAMS,IAAW,EACjBC,EAAKD,EAAS,GAChBC,IAAO,GAAWA,IAAO,EACzBJ,GAAkBN,EAEbU,IAAO,GAAWA,IAAO,GAAWA,IAAO,EAChDH,GAAaP,EAERU,IAAO,IACZJ,GAAkBN,EAClBO,GAAaP,EAErB,CACAJ,EAAqBU,EACrBT,EAAgBU,EAChB,IAAMI,EAAIL,GAAkBC,EAAYb,GAClCkB,EAAOD,EAAItB,EAAYJ,EAAI0B,CAAC,EAAI,IACtCxB,EAAgB,KAAK,CACjB,MAAOO,EACP,KAAAkB,EACA,KAAMtB,EAAUJ,EAAKyB,CAAC,EAAI,OAC1B,QAASP,EACT,OAAQ,EACR,KAAM,UACV,CAAC,EACDV,GACJ,MAEIK,GAER,CACA,OAAOZ,CACX,CCvGA,IAAM0B,GAAsB,CACxB,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,CACR,EAyBO,SAASC,GAAYC,EAAI,GAAI,CAChC,IAAIC,EAAU,EACRC,EAAM,CAAC,EACb,QAASC,EAAI,EAAGC,EAAIJ,EAAE,OAAQG,EAAIC,EAAGD,IAAK,CACtC,IAAME,EAAOL,EAAE,WAAWG,CAAC,EAC3B,GAAIE,GAAQ,IAAMA,GAAQ,GACtBJ,EAAUA,EAAU,IAAMI,EAAO,QAEhC,CACD,IAAMC,EAAUC,GAAoBF,CAAI,EACxCH,EAAI,KAAMD,GAAW,EAAKK,CAAO,EACjCL,EAAU,CACd,CACJ,CACA,OAAOC,CACX,CAOO,SAASM,GAAiBR,EAAI,GAAI,CACrC,IAAIS,EAAU,EACd,QAASN,EAAI,EAAGC,EAAIJ,EAAE,OAAQG,EAAIC,EAAGD,IAAK,CACtC,IAAME,EAAOL,EAAE,WAAWG,CAAC,GACvBE,EAAO,IAAMA,EAAO,KACpBI,GAER,CACA,IAAMC,EAAM,IAAI,YAAYD,CAAO,EAC/BR,EAAU,EACVU,EAAI,EACR,QAASR,EAAI,EAAGC,EAAIJ,EAAE,OAAQG,EAAIC,EAAGD,IAAK,CACtC,IAAME,EAAOL,EAAE,WAAWG,CAAC,EACvBE,GAAQ,IAAMA,GAAQ,GACtBJ,EAAUA,EAAU,IAAMI,EAAO,KAGjCK,EAAIC,GAAG,EAAKV,GAAW,EAAKM,GAAoBF,CAAI,EACpDJ,EAAU,EAElB,CACA,OAAOS,CACX,CAMO,SAASE,GAAcC,EAAOC,EAAIC,EAAKC,EAAKC,EAAM,CACrD,IAAMC,EAAMnB,GAAYc,CAAK,EACvBM,EAAaN,EAAQO,GAAmBF,EAAKH,EAAKC,EAAKC,CAAI,EAAI,CAAC,EACtE,OAAIH,GAAMC,EACCI,EAAW,OAAOE,GAAgBP,EAAII,EAAKC,EAAYJ,EAAKE,CAAI,CAAC,EAErEE,CACX,CClEA,IAAMG,GAAU,IAKVC,GAAU,IACVC,GAAa,IACnB,SAASC,GAAcC,EAAI,CACvB,OAAS,GAAKA,EAAMJ,MAAY,CACpC,CACA,SAASK,GAAeD,EAAI,CACxB,OAAS,GAAKA,EAAMH,MAAY,CACpC,CACA,SAASK,GAAUF,EAAI,CACnB,OAAS,GAAKA,EAAMF,MAAe,CACvC,CAsCO,SAASK,GAAmBC,EAAOC,EAAOC,EAAWC,EAASC,EAAQC,EAAUC,EAAQ,CAC3F,IAAMC,EAAYH,IAAW,GAAK,GAAK,EACnCI,EAAMP,EACNQ,EAAML,IAAW,GAAKD,EAAUD,EAC9BQ,EAAM,CAAC,EACTC,EAAM,IACNC,EAAM,KACNC,EAAM,IACNC,EAAM,KACJC,EAAe,CAACC,EAAGC,IAAM,CAC3BJ,EAAM,KAAK,IAAIA,EAAKG,EAAGC,CAAC,EACxBH,EAAM,KAAK,IAAIA,EAAKE,EAAGC,CAAC,CAC5B,EACA,QAASC,EAAI,EAAGA,EAAIlB,EAAM,OAAQkB,IAAK,CACnC,IAAMC,EAASnB,EAAMkB,CAAC,EAChBE,EAAMD,IAAW,EACjBvB,EAAKuB,EAAS,GAGdE,EAAQzB,IAAO,EACf0B,EAAOD,GAAS1B,GAAcC,CAAE,EAAIwB,EAAM,EAC1CG,EAAOF,EAAQrB,EAAM,EAAEkB,CAAC,IAAM,EAAIrB,GAAeD,CAAE,EAAIwB,EAAM,EAC7DI,EAAUhB,EAAMc,EAChBG,EAAUhB,EAAMc,EAAOhB,EACvBmB,EAAQlB,EACRmB,EAAQH,EACd,GAAIG,GAAStB,GAAYqB,GAASpB,EAC9B,GAAIgB,EAAO,EAAG,CAGV,IAAMM,EAAM,KAAK,IAAIF,EAAOrB,CAAQ,EAC9BwB,EAAM,KAAK,IAAIF,EAAOrB,CAAM,EAClC,GAAIuB,EAAMD,EAGN,GAFAjB,EAAM,KAAK,IAAIA,EAAKiB,CAAG,EACvBhB,EAAM,KAAK,IAAIA,EAAKiB,CAAG,EACnBR,EAAO,CACP,IAAMS,EAAQP,EAAOH,EACfW,EAAUF,EAAMD,EAChBI,EAAW,KAAK,MAAMD,EAAUD,CAAK,EACrCG,EAAS,KAAK,MAAMxB,GAAOmB,EAAMpB,GAAOsB,EAAQvB,CAAS,EAC/DG,EAAI,KAAMqB,GAAW,EAAK,EAAYC,GAAY,EAAK,CAAS,EAChEjB,EAAakB,EAAQA,EAASD,EAAWzB,CAAS,CACtD,MAEIG,EAAI,KAAOmB,EAAMD,GAAQ,EAAKhC,CAAE,EAC5BE,GAAUF,CAAE,EAEZmB,EAAaN,GAAOmB,EAAMpB,GAAOD,EAAWE,GAAOoB,EAAMrB,GAAOD,CAAS,EAIzEQ,EAAaN,EAAKA,CAAG,CAIrC,MACSc,EAAO,IAGRF,EACAX,EAAI,KAAKS,EAAQnB,EAAMkB,CAAC,CAAC,EAGzBR,EAAI,KAAKS,CAAM,EAEnBR,EAAM,KAAK,IAAIA,EAAKH,CAAG,EACvBI,EAAM,KAAK,IAAIA,EAAKJ,CAAG,EACvBO,EAAaN,EAAKgB,CAAO,GAkBjC,GARAjB,EAAMgB,EACNf,EAAMgB,EAOFjB,EAAMF,EACN,KAER,CACA,GAAII,EAAI,SAAW,EAGnB,MAAO,CACH,MAAOC,EACP,IAAKC,EACL,UAAWC,EACX,QAASC,EACT,MAAO,YAAY,KAAKJ,CAAG,CAC/B,CACJ,CACA,SAASwB,GAAQtC,EAAI,CACjB,OAAOA,IAAO,GAAWA,IAAO,GAAWA,IAAO,CACtD,CAoBO,SAASuC,GAA0BnC,EAAOC,EAAOC,EAAWC,EAASC,EAAQgC,EAAO,CACvF,IAAM7B,EAAYH,IAAW,GAAK,GAAK,EACjCiC,EAAO,CAAC,EACV7B,EAAMP,EACNQ,EAAML,IAAW,GAAKD,EAAUD,EAChCoC,EACAC,EAAU,GACRC,EAAQ,IAAM,CACZF,IAAQ,QAAaC,GAAWD,EAAI,IAAMA,EAAI,KAC9CD,EAAK,KAAK,CACN,MAAOC,EAAI,IACX,IAAKA,EAAI,IACT,UAAWA,EAAI,IACf,QAASA,EAAI,IACb,MAAO,YAAY,KAAKA,EAAI,GAAG,CACnC,CAAC,EAELA,EAAM,OACNC,EAAU,EACd,EACA,QAASrB,EAAI,EAAGA,EAAIlB,EAAM,OAAQkB,IAAK,CACnC,IAAMC,EAASnB,EAAMkB,CAAC,EAChBE,EAAMD,IAAW,EACjBvB,EAAKuB,EAAS,GACdE,EAAQzB,IAAO,EACf6C,EAASpB,EAAQrB,EAAM,EAAEkB,CAAC,EAAI,OAC9BI,EAAOD,GAAS1B,GAAcC,CAAE,EAAIwB,EAAM,EAC1CG,EAAOkB,IAAW,OAAYA,IAAW,EAAI5C,GAAeD,CAAE,EAAIwB,EAAM,EACxEK,EAAUhB,EAAMc,EAAOhB,EACzB2B,GAAQtC,CAAE,GAAKwB,GAAOgB,EACtBI,EAAM,GAEDlB,EAAO,GAAKC,EAAO,KACpBe,IAAQ,SACRA,EAAM,CAAE,IAAK9B,EAAK,IAAKA,EAAK,IAAKC,EAAK,IAAKA,EAAK,IAAK,CAAC,CAAE,GAE5D6B,EAAI,IAAM9B,EAAMc,EAChBgB,EAAI,IAAM,KAAK,IAAIA,EAAI,IAAK7B,EAAKgB,CAAO,EACxCa,EAAI,IAAM,KAAK,IAAIA,EAAI,IAAK7B,EAAKgB,CAAO,EACxCa,EAAI,IAAI,KAAKnB,CAAM,EACfsB,IAAW,QACXH,EAAI,IAAI,KAAKG,CAAM,EAEvBF,EAAUA,GAAWlB,GAASvB,GAAUF,CAAE,GAE9CY,GAAOc,EACPb,EAAMgB,CACV,CACA,OAAAe,EAAM,EACCH,CACX,CC9PO,SAASK,GAASC,EAAS,CAC9B,IAAMC,EAAQD,EAAQ,IAAI,OAAO,EACjC,OAAO,OAAOC,GAAU,SAAWA,EAAQ,MAC/C,CACO,SAASC,GAAeF,EAAS,CACpC,IAAMG,EAASH,EAAQ,IAAI,aAAa,EACxC,OAAO,OAAOG,GAAW,SAAWA,EAAS,MACjD,CAKO,SAASC,GAAgBC,EAAS,CACrC,IAAMC,EAAQC,GAASF,CAAO,EACxBG,EAASF,IAAU,OAAYG,GAAeJ,CAAO,EAAI,OAC/D,OAAOC,IAAU,OACXI,GAAiBJ,CAAK,EACtBE,IAAW,OACPG,GAAiBH,CAAM,EACvB,MACd,CCPA,IAAAI,GAA8B,UAI9BC,GAA+C,UAI/C,IAAAC,GAAoC,UAgEpC,IAAAC,GAAiC,UC7EjC,IAAAC,GAA8B,UASTC,GAArB,cAA4C,gBAAc,CAUxD,IAAIC,EAAuB,CACzB,OAAIA,IAAS,aACJC,GAAc,KAAK,aAAa,EAC9BD,IAAS,0BACX,KAAK,wBACHA,IAAS,OACX,MAAM,IAAI,MAAM,GAAK,KAAK,MAAM,QAEhC,MAAM,IAAIA,CAAI,CAEzB,CAEA,IAAY,MAAO,CACjB,OAAO,MAAM,IAAI,MAAM,CACzB,CAKA,IAAY,eAAgB,CAC1B,IAAME,EAAQ,MAAM,IAAI,OAAO,EACzBC,EAAS,MAAM,IAAI,aAAa,EACtC,OAAO,OAAOD,GAAU,SACpBA,EACA,OAAOC,GAAW,SAChBC,GAAmBD,CAAM,EACzB,MACR,CAMA,IAAI,yBAA0B,CAC5B,OAAO,KAAK,MAAM,OAAS,CAC7B,CAEA,gBAAgBE,EAA4BC,EAAuB,CACjE,IAAMC,EAAQ,KAAK,IAAI,OAAO,EACxBC,EAAKF,GAAM,QAAU,OAAY,OAAYA,EAAK,MAAQC,EAC1DE,EAAKH,GAAM,MAAQ,OAAY,OAAYA,EAAK,IAAMC,EACtDG,EAAK,KAAK,IAAI,IAAI,EACxB,GAAIA,EACFC,GAAkBD,EAAIL,EAAUG,EAAIC,CAAE,MACjC,CACL,IAAMG,EAAKJ,GAAM,OAAO,kBAClBK,EAAKJ,GAAM,OAAO,kBACxB,QAAWK,KAAKb,GAAc,KAAK,aAAa,GAO5Ca,EAAE,OAAS,YAAcA,EAAE,OAAS,OAChCA,EAAE,MAAQD,GAAMC,EAAE,MAAQA,EAAE,OAASF,EACrCE,EAAE,OAASF,GAAME,EAAE,OAASD,KAE5BC,EAAE,OAAS,WACbT,EACE,GACAS,EAAE,MACFA,EAAE,OACFA,EAAE,KACFA,EAAE,MAAQ,GACV,EACA,CACF,EACSA,EAAE,OAAS,YACpBT,EACE,GACAS,EAAE,MACFA,EAAE,OACFA,EAAE,eAAiB,GACnB,GACA,EACAA,EAAE,SACJ,EACSA,EAAE,OAAS,WACpBT,EAAS,GAAeS,EAAE,MAAOA,EAAE,OAAQ,GAAI,GAAI,EAAG,CAAC,EAC9CA,EAAE,OAAS,QACpBT,EAAS,GAAWS,EAAE,MAAOA,EAAE,OAAQ,GAAI,GAAI,EAAG,CAAC,EAI3D,CACF,CACF,EC/FA,IAAMC,GAA0B,CAAC,QAAS,KAAM,cAAe,KAAM,IAAI,EAIzE,SAASC,GAAOC,EAAuC,CACrD,OACE,OAAOA,GAAS,UAChBA,IAAS,MACT,YAAaA,GACb,UAAWA,GACX,QAASA,GACT,OAAOA,EAAK,SAAY,UACxB,OAAOA,EAAK,OAAU,UACtB,OAAOA,EAAK,KAAQ,QAExB,CAEA,SAASC,GAAOC,EAAkB,CAChC,IAAMF,EAAgBE,EAAQ,IAAI,MAAM,EACxC,OAAOH,GAAOC,CAAI,EAAIA,EAAO,MAC/B,CAKA,SAASG,GACPC,EACAJ,EACAK,EACAC,EAC8B,CAC9B,IAAMC,EAAK,KAAK,IAAIH,EAAI,MAAOE,EAAO,KAAK,EACrCE,EAAK,KAAK,IAAIJ,EAAI,IAAKE,EAAO,GAAG,EACjCG,GAAST,EAAK,IAAMA,EAAK,OAAS,KAAK,IAAII,EAAI,IAAMA,EAAI,MAAO,CAAC,EACjEM,EAAUC,GACdN,IAAW,GACPL,EAAK,KAAOW,EAAIP,EAAI,OAASK,EAC7BT,EAAK,OAASW,EAAIP,EAAI,OAASK,EAC/BG,EAAI,KAAK,MAAMF,EAAOH,CAAE,CAAC,EACzBM,EAAI,KAAK,MAAMH,EAAOF,CAAE,CAAC,EAC/B,OAAOA,EAAKD,EACR,CAAE,MAAOA,EAAI,IAAKC,EAAI,UAAW,KAAK,IAAII,EAAGC,CAAC,EAAG,QAAS,KAAK,IAAID,EAAGC,CAAC,CAAE,EACzE,MACN,CAIA,SAASC,GACPZ,EACAF,EACAM,EACAS,EACoB,CACpB,IAAMX,EAAM,CAAE,MAAOF,EAAQ,IAAI,OAAO,EAAG,IAAKA,EAAQ,IAAI,KAAK,CAAE,EAC7DG,EAASH,EAAQ,IAAI,QAAQ,IAAM,GAAK,GAAK,EAC7Cc,EAASZ,EAAI,OAASE,EAAO,OAASF,EAAI,KAAOE,EAAO,IACxDW,EACJD,GAAUD,IAAiB,OAAY,OAAYG,GAAgBhB,CAAO,EAC5E,GAAIe,IAAQ,OAAW,CACrB,IAAME,EAAUH,EACZ,CAAE,GAAGZ,EAAK,UAAWJ,EAAK,MAAO,QAASA,EAAK,GAAI,EACnDG,GAAgBC,EAAKJ,EAAMK,EAAQC,CAAM,EAC7C,OAAOa,IAAY,OAAY,CAAC,EAAI,CAACA,CAAO,CAC9C,KAYE,QAVEJ,IAAiB,OACb,CAAC,CAAE,GAAGX,EAAK,UAAWJ,EAAK,MAAO,QAASA,EAAK,IAAK,MAAOiB,CAAI,CAAC,EACjEG,GACEH,EACAb,EAAI,MACJJ,EAAK,MACLA,EAAK,IACLK,EACAU,CACF,GACM,QAAQM,GAAO,CACzB,IAAMF,EAAUG,GACdD,EAAI,MACJA,EAAI,MACJA,EAAI,UACJA,EAAI,QACJhB,EACAC,EAAO,MACPA,EAAO,GACT,EACA,OAAOa,IAAY,OAAY,CAAC,EAAI,CAACA,CAAO,CAC9C,CAAC,CAEL,CAEA,SAASI,GACPrB,EACAF,EACAmB,EACAb,EACAe,EACA,CACA,IAAMG,EAAS,IAAIlB,EAAO,KAAK,IAAIA,EAAO,GAAG,GAAGe,CAAG,GAC7CI,EAASvB,EAAQ,OAAO,EACxBwB,EAAgC,CACpC,GAAGD,EACH,SAAU,GAAGvB,EAAQ,GAAG,CAAC,GAAGsB,CAAM,GAClC,MAAOL,EAAQ,MACf,IAAKA,EAAQ,IACb,KAAM,CAAE,GAAGnB,EAAM,MAAOmB,EAAQ,UAAW,IAAKA,EAAQ,OAAQ,CAClE,EACIM,EAAO,YAAc,SACvBC,EAAK,UAAY,GAAG,OAAOD,EAAO,SAAS,CAAC,GAAGD,CAAM,IAEvD,QAAWG,KAAS7B,GAClB,OAAO4B,EAAKC,CAAK,EAEnB,OAAO,IAAIC,GAAeF,CAAI,CAChC,CAaO,SAASG,GACd3B,EACAI,EACAS,EACW,CACX,IAAMf,EAAOC,GAAOC,CAAO,EAC3B,GAAIF,IAAS,OACX,MAAO,CAACE,CAAO,EACV,CACL,IAAM4B,EAAShB,GAAcZ,EAASF,EAAMM,EAAQS,CAAY,EAChE,OAAOe,EAAO,IAAI,CAACC,EAAO,IACxBR,GACErB,EACAF,EACA+B,EACAzB,EACAwB,EAAO,OAAS,EAAI,IAAI,CAAC,GAAK,EAChC,CACF,CACF,CACF,CvD7IO,IAAeE,GAAf,cAEG,yBAA6B,CAFhC,kCAUL,KAAmB,qBAAgC,GAPnD,YAAc,aAAe,CAAC,cAAe,aAAa,EAS1D,MAAM,mBAAoB,CACxB,MAAO,EACT,CAaA,6BACEC,EACAC,EAA2B,CAAC,EAC5B,CACA,GAAM,CAAE,aAAAC,EAAc,aAAAC,EAAc,GAAGC,CAAK,EAAIH,EAC1CI,EAAOH,GAAgB,KAAK,qBAC5BI,KAAO,uBAAmBF,EAAK,cAAc,EACnD,OAAOG,GAAKP,CAAO,EAAE,KACnBQ,GAAS,CAACC,EAAQC,IAChB,KAAK,YAAYD,EAAQ,CAAE,GAAGL,EAAM,eAAgBE,EAAK,CAAE,CAAC,EAAE,KAC5DE,GAAUG,GACRN,EACIO,GACED,EACAA,EAAQ,IAAI,cAAc,IAAMF,EAAO,aACnCA,EACA,CAAE,MAAOE,EAAQ,IAAI,OAAO,EAAG,IAAKA,EAAQ,IAAI,KAAK,CAAE,EAC3DR,CACF,EACA,CAACQ,CAAO,CACd,EACAE,GAAQ,EACRC,GAAIC,IAAa,CAAE,MAAAL,EAAO,SAAAK,CAAS,EAAE,CACvC,CACF,EACAF,GAAQ,EACRL,GAASQ,GACPA,EACG,KAAK,CAACC,EAAGC,IAAMD,EAAE,MAAQC,EAAE,KAAK,EAChC,QAAQC,GAASA,EAAM,QAAQ,CACpC,CACF,CACF,CACF,EDxDO,IAAMC,GAAN,cAAoC,KAAM,CAG/C,aAAc,CACZ,MACE,yJACF,EALF,KAAS,KAAO,uBAMhB,CACF,EAEaC,GAAN,cAAqC,KAAM,CAGhD,YAAYC,EAAgBC,EAA4B,CACtD,MACEA,EAAiB,SAAW,EACxB,gFAAgFD,CAAM,sCACtF,eAAeA,CAAM,+CAA+CC,EAAiB,KAAK,IAAI,CAAC,8DACrG,EAPF,KAAS,KAAO,wBAQhB,CACF,EAEO,SAASC,GAAgBC,EAA8C,CAC5E,MAAO,GAAGA,EAAK,MAAM,IAAIA,EAAK,SAAS,EACzC,CAmCO,IAAMC,GAAN,cAA8B,KAAM,CAGzC,YAAYC,EAA2B,CACrC,MACE,oDAAoDA,CAAiB,oCACvE,EALF,KAAS,KAAO,iBAMhB,CACF,EAEA,SAASC,GAAgBH,EAAgBI,EAA8B,CACrE,IAAMC,EAASN,GAAgBC,CAAI,EACnC,OACEI,IAAW,QACXA,EAAO,KAAKE,GAAaC,GAAmBF,EAAQC,CAAS,CAAC,CAElE,CAEO,IAAME,GAAN,cAAmC,KAAM,CAG9C,YAAYC,EAAsBZ,EAAgB,CAChD,MACE,sCAAsCA,CAAM,iBAAiBY,CAAY,kEAAkEZ,CAAM,6CACnJ,EALF,KAAS,KAAO,sBAMhB,CACF,EAEaa,GAAN,cAA6B,KAAM,CAGxC,YAAYC,EAAeC,EAAkBC,EAAgB,CAC3D,MACE,QAAQD,EAAS,eAAe,CAAC,yCAAyCD,EAAM,eAAe,CAAC,mCAAmCE,EAAO,eAAe,CAAC,wBAC5J,EALF,KAAS,KAAO,gBAMhB,CACF,EAOO,SAASC,GACdC,EACAJ,EACAC,EACA,CAKA,GAHEG,aAAiB,QAChBA,EAAM,OAAS,sBACd,6CAA6C,KAAKA,EAAM,OAAO,GAG5D,CACL,IAAMC,EAAUD,EAAiC,SAC3CE,EACJ,OAAOD,GAAW,UAAYA,EAAS,EACnC,KAAK,MAAMA,EAAS,EAAG,EACvB,KAAK,MAAMJ,EAAW,CAAC,EAC7B,OAAO,IAAIF,GAAeC,EAAOC,EAAU,KAAK,IAAIK,EAAM,CAAC,CAAC,CAC9D,KARE,OASJ,CAQO,SAASC,GACdC,EACAnB,EACA,CACA,IAAMK,EAASN,GAAgBC,CAAI,EACnC,OAAOmB,EAAYd,CAAM,GAAKc,EAAYnB,EAAK,MAAM,GAAKK,CAC5D,CAEO,SAASe,GAAuB,CACrC,WAAAC,EACA,aAAAC,EACA,iBAAAxB,CACF,EAIG,CACD,IAAMyB,EAAaC,GAAYF,CAAY,EAC3C,GAAID,IAAe,GACjB,OAAOA,EACF,GAAIvB,EAAiB,SAASyB,CAAU,EAC7C,OAAOA,EACF,GAAIzB,EAAiB,SAAW,EACrC,OAAOA,EAAiB,CAAC,EAEzB,MAAM,IAAIF,GAAuB0B,EAAcxB,CAAgB,CAEnE,CAQA,SAAS2B,GAAWzB,EAAgB0B,EAA+B,CACjE,MAAO,GAAG3B,GAAgBC,CAAI,CAAC,IAAIA,EAAK,MAAM,IAAI0B,EAAU,MAAM,IAAI,IAAIA,EAAU,MAAM,MAAM,EAClG,CAEO,SAASC,GAAgB,CAC9B,UAAAD,EACA,aAAAjB,EACA,QAAAmB,EACA,KAAAC,CACF,EAKG,CACD,GAAM,CAAE,SAAAC,EAAU,OAAAC,EAAQ,OAAAC,EAAQ,MAAAC,CAAM,EAAIP,EAC5C,GAAI,GAACA,EAAU,UAAYK,GAAUD,GAE9B,CACL,GAAM,CAAE,KAAA9B,EAAM,SAAAkC,EAAU,OAAAC,CAAO,EAAIT,EAC7BU,EAAKX,GAAWzB,EAAM0B,CAAS,EAC/BW,EAAgC,CACpC,SAAUD,EACV,aAAA3B,EACA,QAAAmB,EACA,MAAOE,EACP,IAAKC,EACL,KAAM,QACN,OAAQC,IAAW,IAAM,GAAK,EAC9B,MAAOC,EACP,UAAWG,EACX,KAAM,CACJ,QAASpC,EAAK,OACd,MAAOkC,EACP,IAAKC,EACL,aAAcN,CAChB,CACF,EACA,OAAO,IAAIS,GAAeD,CAAI,CAChC,CACF,CAQO,SAASE,GAAY,CAC1B,KAAAC,EACA,KAAAX,EACA,SAAAY,CACF,EAIG,CACD,IAAML,EAAK,GAAGrC,GAAgByC,EAAK,MAAM,CAAC,IAAIA,EAAK,OAAO,MAAM,IAAIA,EAAK,WAAW,IAAIA,EAAK,SAAS,IAAIzC,GAAgByC,EAAK,KAAK,CAAC,IAAIA,EAAK,MAAM,MAAM,IAAIA,EAAK,UAAU,IAAIA,EAAK,QAAQ,GAC9L,OAAO,IAAIF,GAAe,CACxB,SAAUF,EACV,aAAcP,EACd,QAASW,EAAK,OAAO,OACrB,MAAOA,EAAK,YACZ,IAAKA,EAAK,UACV,KAAM,QACN,OAAQA,EAAK,SAAW,IAAM,GAAK,EACnC,MAAOA,EAAK,MACZ,UAAWJ,EACX,SAAUI,EAAK,QAAU,KAAK,IAAIA,EAAK,QAAS,CAAC,EACjD,WAAYA,EAAK,QACjB,SAAUA,EAAK,QACf,KAAM,CACJ,QAASA,EAAK,MAAM,OACpB,MAAOA,EAAK,WACZ,IAAKA,EAAK,SACV,aAAcC,CAChB,CACF,CAAC,CACH,CAEA,IAAqBC,GAArB,cAAmDC,EAAoD,CAAvG,kCACE,KAAQ,SAAQ,gBAAY,CAC1B,MAAO,6BACP,MAAO,SAAY,CACjB,IAAMC,EAA8B,KAAK,QAAQ,wBAAwB,EACnEC,EAAe,EAAE,QAASD,IAAkBA,EAAc,MAAQ,GAClEE,EAAK,MAAMC,GAAQ,QACvB,iBAAa,KAAK,QAAQ,eAAe,EAAG,KAAK,aAAa,EAC9DF,EACI,CACE,kBAAgB,iBAAaD,EAAe,KAAK,aAAa,CAChE,EACA,CAAC,CACP,EACM/C,EAAS,KAAK,QAAQ,eAAe,EAAE,CAAC,EAC9C,GAAIA,IAAW,OACb,MAAM,IAAI,MACR,8GACF,EAEF,IAAMC,GAAqB,MAAMgD,EAAG,IAAI,wBAAwB,GAAM,IACnE,MAAM,KAAK,EACX,OAAOE,GAAUA,IAAW,EAAE,EAC3BC,EAAkB7B,GAAuB,CAC7C,WAAY,KAAK,QAAQ,iBAAiB,EAC1C,aAAc8B,GAAmB,KAAMrD,CAAM,EAC7C,iBAAAC,CACF,CAAC,EACD,MAAO,CAAE,GAAAgD,EAAI,OAAAjD,EAAQ,gBAAAoD,EAAiB,iBAAAnD,CAAiB,CACzD,CACF,CAAC,EAOD,MAAc,eACZ8B,EACAuB,EACgC,CAChC,GAAM,CAAE,GAAAL,EAAI,gBAAAG,CAAgB,EAAI,MAAM,KAAK,MAAME,CAAI,EAC/CC,GAAQ,MAAMN,EAAG,MAAM,GAAG,KAC9BO,GACEA,EAAE,WACFA,EAAE,KAAK,SAAWJ,GAClBI,EAAE,KAAK,SAAWzB,CACtB,EACA,OAAOwB,EACH,CACE,OAAQA,EAAK,KAAK,OAClB,OAAQxB,EACR,UAAWwB,EAAK,KAAK,SACvB,EACA,MACN,CAOA,MAAM,cAAcD,EAAoB,CAAC,EAA4B,CACnE,GAAM,CAAE,GAAAL,EAAI,iBAAAhD,CAAiB,EAAI,MAAM,KAAK,MAAMqD,CAAI,EAChDG,EAAW,IAAI,IACrB,QAAWF,KAAQ,MAAMN,EAAG,MAAM,EAAG,CACnC,IAAMzC,EAASN,GAAgBqD,EAAK,IAAI,EAClCG,EAAQD,EAAS,IAAIjD,CAAM,EAC7BkD,EACGA,EAAM,QAAQ,SAASH,EAAK,KAAK,MAAM,GAC1CG,EAAM,QAAQ,KAAKH,EAAK,KAAK,MAAM,EAGrCE,EAAS,IAAIjD,EAAQ,CACnB,OAAAA,EACA,OAAQ+C,EAAK,KAAK,OAClB,UAAWA,EAAK,KAAK,UACrB,QAAS,CAACA,EAAK,KAAK,MAAM,EAC1B,YAAatD,EAAiB,SAASsD,EAAK,KAAK,MAAM,CACzD,CAAC,CAEL,CACA,MAAO,CAAC,GAAGE,EAAS,OAAO,CAAC,CAC9B,CAOA,MAAM,UAAUH,EAAoB,CAAC,EAAG,CACtC,GAAM,CAAE,OAAAtD,EAAQ,gBAAAoD,EAAiB,iBAAAnD,CAAiB,EAAI,MAAM,KAAK,MAAMqD,CAAI,EACrEhC,EAAcqC,GAAsB,IAAI,EACxCC,EAAyB,CAAC,EAChC,QAAWC,KAAa,MAAM,KAAK,cAAcP,CAAI,EAC/CO,EAAU,SAAWT,GACvBQ,EAAM,KAAK,CACT,KAAMvC,GAAiBC,EAAauC,CAAS,EAC7C,MAAOA,EAAU,OACjB,MAAOA,EAAU,MACnB,CAAC,EAGL,MAAO,CACL,cAAe,GACf,mBAAoB7D,EACpB,gBAAAoD,EACA,iBAAAnD,EACA,MAAA2D,CACF,CACF,CAEA,MAAM,YAAYN,EAAoB,CAAC,EAAG,CACxC,GAAM,CAAE,GAAAL,EAAI,OAAAjD,EAAQ,gBAAAoD,CAAgB,EAAI,MAAM,KAAK,MAAME,CAAI,EACvD,CAAE,aAAA1C,CAAa,EAAI0C,EACnB9C,EACJI,IAAiBZ,EACb,OACAqD,GAAmB,KAAMzC,CAAY,EACrCkD,GAAW,MAAMb,EAAG,MAAM,GAC7B,OAAOM,GACN3C,IAAiBZ,EACbuD,EAAK,WAAaA,EAAK,KAAK,SAAWH,EACvC1C,GAAmBR,GAAgBqD,EAAK,IAAI,EAAG/C,CAAM,CAC3D,EACC,IAAI+C,GAAQA,EAAK,KAAK,MAAM,EAC/B,MAAO,CAAC,GAAG,IAAI,IAAIO,CAAO,CAAC,CAC7B,CAcQ,cACNC,EACAC,EACA,CACA,IAAMC,EACJF,IAAe,QAAaA,EAAW,SAAW,EAC9C,OACAA,EAAW,IAAI/B,GAAQqB,GAAmB,KAAMrB,CAAI,CAAC,EAC3D,OAAOiC,IAAmB,QAAaD,IAAiB,OACpD,OACC7D,GACCG,GAAgBH,EAAM8D,CAAc,IACnCD,IAAiB,QAChBtD,GAAmBR,GAAgBC,CAAI,EAAG6D,CAAY,EAChE,CAcA,MAAM,YAAYE,EAAgBZ,EAA+B,CAAC,EAAG,CACnE,GAAM,CAAE,GAAAL,EAAI,OAAAjD,CAAO,EAAI,MAAM,KAAK,MAAM,EAClC,CAAE,aAAAY,EAAc,QAAAmB,EAAS,MAAAoC,EAAO,IAAAC,CAAI,EAAIF,EAC9C,GAAItD,IAAiBZ,EACnB,MAAM,IAAIW,GAAqBC,EAAcZ,CAAM,EAErD,IAAMqE,EAAQ,MAAM,KAAK,eAAetC,EAAS,CAAC,CAAC,EAC7CuC,EAAoB,KAAK,QAAQ,WAAW,EAC5CC,EAAO,KAAK,cAAcjB,EAAK,UAAU,EACzCkB,EAAWH,EACb,MAAMpB,EACH,oBAAoBoB,EAAOF,EAAOC,EAAK,CACtC,QAAS,KAAK,QAAQ,SAAS,EAC/B,OAAQ,KAAK,QAAQ,gBAAgB,EACrC,WAAY,MACZ,MAAOE,EACP,OAAQhB,EAAK,OACb,GAAIiB,IAAS,OAAY,CAAC,EAAI,CAAE,KAAAA,CAAK,CACvC,CAAC,EACA,MAAOrD,GAAmB,CACzB,MAAMD,GAAeC,EAAOoD,EAAWF,EAAMD,CAAK,GAAKjD,CACzD,CAAC,EACH,OACJ,OAAOsD,EAAWA,EAAS,MAAM,CAAE,MAAO,UAAW,CAAC,EAAI,EAC5D,CAEA,MAAc,eACZ5D,EACA0C,EACyB,CACzB,IAAM9C,EAAS6C,GAAmB,KAAMzC,CAAY,EACpD,OAAQ,MAAM,KAAK,cAAc0C,CAAI,GAAG,OAAOO,GAC7CnD,GAAmBmD,EAAU,OAAQrD,CAAM,CAC7C,CACF,CAOA,MAAc,gBACZuB,EACAoC,EACAC,EACAd,EACA,CACA,GAAM,CAAE,GAAAL,EAAI,gBAAAG,CAAgB,EAAI,MAAM,KAAK,MAAME,CAAI,EAC/CmB,GAAU,MAAMxB,EAAG,MAAM,GAC5B,OACCM,GACEA,EAAK,WACLA,EAAK,KAAK,SAAWH,GACrBG,EAAK,KAAK,SAAWxB,GACrBwB,EAAK,KAAK,SAAWY,GACrBZ,EAAK,KAAK,SAAWa,CACzB,EACC,IAAIb,GAAQA,EAAK,KAAK,QAAQ,EAC3BmB,EAAS,CAACP,EAAO,GAAG,CAAC,GAAG,IAAI,IAAIM,CAAM,CAAC,EAAE,KAAK,CAACE,EAAGC,IAAMD,EAAIC,CAAC,EAAGR,CAAG,EACzE,OAAOM,EAAO,MAAM,CAAC,EAAE,IAAI,CAACG,EAAUC,KAAO,CAC3C,MAAOJ,EAAOI,CAAC,EACf,IAAKD,CACP,EAAE,CACJ,CAEA,MAAc,eAAeX,EAAgBZ,EAAyB,CACpE,GAAM,CAAE,GAAAL,CAAG,EAAI,MAAM,KAAK,MAAMK,CAAI,EAC9B,CAAE,aAAA1C,EAAc,QAAAmB,EAAS,MAAAoC,EAAO,IAAAC,CAAI,EAAIF,EACxCF,EAAeX,GAAmB,KAAMC,EAAK,kBAAkB,EAC/DhC,EAAcqC,GAAsB,IAAI,EACxCY,EAAO,KAAK,cAAcjB,EAAK,WAAYU,CAAY,EACvDK,EAAQ,MAAM,KAAK,eAAetC,EAASuB,CAAI,EAC/CgB,EAAoB,KAAK,QAAQ,WAAW,EAmBlD,OAlBmBD,EACf,QAAM,iBACJ,iBAAiBtC,CAAO,IAAIoC,EAAM,eAAe,CAAC,IAAIC,EAAI,eAAe,CAAC,GAC1Ed,EAAK,eACL,IACEL,EACG,sBAAsBoB,EAAOF,EAAOC,EAAK,CACxC,QAAS,KAAK,QAAQ,SAAS,EAC/B,WAAY,MACZ,MAAOE,EACP,OAAQhB,EAAK,OACb,GAAIiB,IAAS,OAAY,CAAC,EAAI,CAAE,KAAAA,CAAK,CACvC,CAAC,EACA,MAAOrD,GAAmB,CACzB,MAAMD,GAAeC,EAAOoD,EAAWF,EAAMD,CAAK,GAAKjD,CACzD,CAAC,CACP,EACA,CAAC,GACa,QAAQW,GAAa,CACrC,IAAMkD,EAAUlD,EAAU,SACtBC,GAAgB,CACd,UAAAD,EACA,aAAAjB,EACA,QAAAmB,EACA,KAAMV,GAAiBC,EAAaO,EAAU,IAAI,CACpD,CAAC,EACD,OACJ,OAAOkD,IAAY,OAAY,CAAC,EAAI,CAACA,CAAO,CAC9C,CAAC,CACH,CAaA,MAAc,aACZb,EACA7D,EACAiD,EACA,CACA,GAAM,CAAE,mBAAA0B,CAAmB,EAAI1B,EAC/B,GAAI0B,IAAuB,OACzB,MAAM,IAAI5E,GAAgBC,CAAiB,EAE7C,GAAM,CAAE,GAAA4C,CAAG,EAAI,MAAM,KAAK,MAAMK,CAAI,EAC9B,CAAE,QAAAvB,EAAS,MAAAoC,EAAO,IAAAC,CAAI,EAAIF,EAC1Be,EAAc,MAAM,KAAK,eAAe5E,EAAmBiD,CAAI,EAC/D4B,EAAW,MAAM,KAAK,eAAeF,EAAoB1B,CAAI,EAC7D6B,EAAO,CAAC,GAAGF,EAAa,GAAGC,CAAQ,EACnCb,EAAQ,MAAM,KAAK,eAAetC,EAASuB,CAAI,EAC/CgB,EAAoB,KAAK,QAAQ,WAAW,EAC5Cc,EAAY,MAAMnC,EAAG,uBAAuB,IAAO,OACnDoC,EAAM,CAACC,EAAsBC,IACjCtC,EACG,oBAAoBqC,EAAWC,EAAM,MAAOA,EAAM,IAAK,CACtD,QAAS,KAAK,QAAQ,SAAS,EAC/B,WAAY,MACZ,MAAOjB,EACP,OAAQhB,EAAK,OACb,KAAMnD,GACJgF,EAAK,KACHtB,GACEA,EAAU,SAAW1D,EAAK,QAC1B0D,EAAU,YAAc1D,EAAK,SACjC,CACJ,CAAC,EACA,MAAOe,GAAmB,CACzB,MAAMD,GAAeC,EAAOoD,EAAWF,EAAMD,CAAK,GAAKjD,CACzD,CAAC,EACCsE,EACJnB,GAASe,GAAYH,EAAY,OAAS,GAAKC,EAAS,OAAS,GAE3D,QAAM,iBACJ,YAAY7E,CAAiB,OAAO2E,CAAkB,GACtD1B,EAAK,eACL,SACE,QAAQ,KACL,MAAM,KAAK,gBAAgBvB,EAASoC,EAAOC,EAAKd,CAAI,GAAG,IACtDiC,GAASF,EAAIhB,EAAOkB,CAAK,CAC3B,CACF,CACJ,GACA,OAAOf,GAAYA,IAAa,MAAS,EAC3C,CAAC,EAKP,OAJcgB,EAAU,MAAMhB,GAAY,CACxC,IAAMiB,EAAOjB,EAAS,MAAM,WAC5B,OAAOiB,IAAS,QAAaA,EAAK,WAAa,MACjD,CAAC,EAEGD,EAAU,QAAQhB,GAChBS,EAAY,QAAQS,GAClBR,EAAS,QAAQS,GACfnB,EAAS,eAAe,CAAE,OAAAkB,EAAQ,MAAOC,CAAK,CAAC,EAAE,IAAIhD,GACnDD,GAAY,CACV,KAAAC,EACA,KAAMtC,EACN,SAAU2E,CACZ,CAAC,CACH,CACF,CACF,CACF,EACA,CAAC,CACP,CAEA,YAAYd,EAAgBZ,EAA0B,CAAC,EAAG,CACxD,SAAO,qBAA0B,MAAMsC,GAAY,CACjD,GAAM,CAAE,GAAA3C,EAAI,OAAAjD,CAAO,EAAI,MAAM,KAAK,MAAMsD,CAAI,EAC5C,GAAI,CAACL,EAAG,kBACN,MAAM,IAAInD,GAIZ,GAAIoE,EAAO,eAAiBlE,EAAQ,CAClC,IAAM6F,EACJvC,EAAK,oBAAsB,OACvB,MAAM,KAAK,eAAeY,EAAQZ,CAAI,EACtC,MAAM,KAAK,aAAaY,EAAQZ,EAAK,kBAAmBA,CAAI,EAClE,QAAWyB,KAAWc,EACpBD,EAAS,KAAKb,CAAO,CAEzB,CACAa,EAAS,SAAS,CACpB,EAAGtC,EAAK,MAAM,CAChB,CACF",
|
|
6
|
+
"names": ["require_installClearHoverOnSurfaceMove", "__commonJSMin", "exports", "module", "encodeNode", "id", "orientation", "nodeId", "handle", "nodeOrientation", "isReverse", "flipNode", "flipSide", "side", "entrySide", "exitSide", "entryOrientation", "exitOrientation", "edgeIsCanonical", "from", "to", "fromId", "toId", "pathIsCanonical", "path", "pathEndsAreCanonical", "first", "last", "ByteCodeReader", "bytes", "value", "shift", "result", "RLE_THRESHOLD", "RLE_UNIVERSE", "RunReader", "sigma", "len", "byte", "extra", "run", "decompressEdges", "bytes", "reader", "ByteCodeReader", "sigma", "edges", "prev", "i", "delta", "offset", "GbwtRecord", "bwt", "RunReader", "rank", "edge", "offsets", "e", "run", "soFar", "node", "low", "high", "mid", "pos", "succRank", "counts", "flipNode", "entry", "curr", "nodeId", "total", "nodes", "nextOffsets", "k", "result", "DECODE", "encodedSequenceLength", "encoded", "last", "value", "inLast", "i", "decodeSequence", "result", "byte", "base", "COMPLEMENT", "reverseComplement", "sequence", "parseRelationships", "field", "what", "relationships", "rel", "parts", "from", "to", "targets", "graphNameFromTags", "tags", "merge", "into", "key", "values", "value", "subgraphName", "name", "parent", "result", "sortedEntries", "a", "b", "tos", "gfaHeaderLines", "graphName", "lines", "subgraph", "supergraph", "sha256Hex", "chunks", "total", "sum", "chunk", "bytes", "offset", "digest", "byte", "GENERIC_SAMPLE", "formatPathName", "name", "end", "PAN_SN", "BARE_CONTIG", "parsePathName", "panSn", "bare", "toPathQuery", "ref", "pathNameFor", "query", "fragment", "lowerBound", "ascending", "value", "lo", "hi", "mid", "ColumnMax", "columns", "column", "best", "p", "candidate", "holder", "SparseLcs", "a", "b", "weight", "x", "j", "list", "a0", "a1", "b0", "b1", "prefix", "suffix", "k", "i", "matches", "split", "count", "from", "to", "step", "trace", "w", "before", "match", "last", "chained", "width", "after", "s", "combined", "weightedLcs", "lcs", "DEFAULT_MIN_MATCH", "MAX_ALIGNED_CELLS", "CHAIN_LOOKBACK", "KMER", "MAX_KMER_OCCURRENCES", "MAX_FILL_DEPTH", "MATCH", "MISMATCH", "GAP_OPEN", "GAP_EXTEND", "UNREACHABLE", "DIAGONAL", "INSERTION", "DELETION", "appendEdit", "edits", "op", "len", "last", "best", "diagonal", "insertion", "deletion", "affineAlignment", "a", "b", "la", "lb", "width", "trace", "j", "i", "nextDiagonal", "nextInsertion", "nextDeletion", "ai", "fromDiagonal", "fromInsertion", "fromDeletion", "ops", "state", "from", "stepJumpCost", "dq", "dt", "indel", "kmerJumpCost", "sliceRun", "run", "to", "untakenPieces", "query", "target", "blocked", "s", "e", "lo", "hi", "x", "y", "pieces", "chainRuns", "runs", "maxGap", "minMatch", "jumpCost", "maxChains", "chains", "basesTaken", "spanTaken", "pool", "score", "back", "trims", "trim", "candidate", "end", "chain", "sum", "first", "flipped", "spans", "same", "forwardKmerRuns", "index", "p", "kmer", "seen", "open", "hits", "started", "kmerRuns", "reverseComplement", "chainEdits", "between", "previous", "qs", "targetFrom", "targetTo", "alignExact", "fillGap", "depth", "deeper", "qa", "tb", "into", "fill", "recordOf", "alignPrivate", "inversions", "forward", "forwardFill", "queryFrom", "inversion", "forEachEdit", "visit", "qi", "ti", "scoreOver", "side", "step", "inside", "k", "at", "spanOf", "withoutColumns", "lost", "pendingQuery", "pendingTarget", "column", "sharedLost", "sharedMask", "inShared", "flush", "lead", "tail", "claimOnce", "records", "queryLength", "targetLength", "claims", "columnsOf", "r", "columns", "holders", "held", "beaten", "losesTo", "key", "loses", "si", "ei", "sj", "ej", "c", "kept", "matched", "walkSequence", "walk", "sequenceOf", "handle", "sequence", "nodeId", "isReverse", "walkOffsets", "offsets", "repeatSteps", "id", "change", "sharedRuns", "queryOffsets", "targetOffsets", "queryRepeat", "targetRepeat", "visits", "rank", "seeds", "lastRank", "pairAlignments", "opts", "_", "record", "pairCigar", "SubgraphLimitError", "limit", "walk", "sideBefore", "a", "b", "SideQueue", "distance", "node", "side", "heap", "i", "parent", "top", "last", "left", "right", "smallest", "asMatches", "pairs", "pathAt", "refAt", "firstAbove", "ascending", "bound", "lo", "hi", "mid", "posKey", "pos", "joinable", "insertion", "deletion", "joinPair", "gap", "edits", "op", "len", "appendGap", "appendEdit", "walkForward", "first", "second", "joinSiblings", "fragments", "f", "byPath", "fragment", "index", "siblings", "joined", "consumed", "x", "y", "head", "current", "next", "pathPosition", "info", "k", "SCAN_GAP", "handleRuns", "sortedHandles", "runs", "handle", "PREFETCH_RUN_GAP", "ANCHOR_WALK_MARGIN", "rowidRuns", "handles", "sorted", "Subgraph", "db", "opts", "id", "encodeNode", "record", "forward", "reverse", "query", "path", "formatPathName", "queryOffset", "indexed", "startOffset", "start", "pathOffset", "nodeId", "nodeOffset", "context", "orientation", "nodeOrientation", "active", "entrySide", "exitSide", "reference", "pathHandle", "fromOffset", "toOffset", "positions", "error", "offset", "remaining", "distanceToNext", "nodes", "visited", "toRemove", "inserted", "key", "otherSide", "flipSide", "entryOrientation", "nextDistance", "exitOrientation", "successor", "successorId", "successorSide", "end", "flipNode", "curr", "snarls", "result", "foundLink", "edgeIsCanonical", "covering", "successors", "onFetch", "outside", "inside", "read", "isSnarlEntry", "classify", "queue", "done", "type", "output", "refPos", "count", "indexOf", "rowStart", "seqLen", "rows", "row", "nextIndex", "nextOffset", "hasPredecessor", "j", "refIndex", "refGbwtOffset", "refOffset", "offsets", "steps", "cur", "off", "at", "keep", "twinsExpected", "refMayStartReversed", "isReverse", "from", "degree", "lastHandle", "pathEndsAreCanonical", "twinRecord", "startCount", "allTwins", "bare", "before", "refPath", "comparePaths", "merged", "refId", "wanted", "refInfo", "kept", "spacing", "windowStart", "windowEnd", "anchorOffset", "margin", "stats", "clock", "lap", "now", "elapsed", "named", "reach", "anchor", "refOffsetOf", "refHandles", "windowSteps", "refOffsets", "refLen", "step", "firstStep", "ownRow", "pathsByHandle", "nameOf", "handled", "visitsByPath", "visits", "fallback", "nearest", "reason", "visit", "unwalked", "samples", "name", "entry", "sample", "walked", "verdict", "sampleLen", "rowAt", "bpBack", "predecessor", "mappedEnd", "startLen", "base", "pieces", "piece", "pending", "pendingBp", "counter", "startBp", "inWindow", "infos", "to", "onReference", "candidates", "interval", "scanned", "run", "starts", "identification", "readRecord", "recordAt", "sampleAt", "chain", "names", "anchorFromSample", "nodeLen", "anchorFromIdentity", "identity", "startInfo", "bp", "position", "known", "ref", "occurrences", "prefix", "total", "pi", "ri", "pb", "rb", "pathLen", "suffix", "weight", "ordered", "lcs", "weightedLcs", "refPrefix", "alignGap", "pathFrom", "pathTo", "refFrom", "refTo", "matched", "m", "nextPath", "nextRef", "pathIndex", "pathIsCanonical", "flippedPath", "forwardBound", "flipped", "refTotal", "leading", "trailing", "alongReference", "rest", "span", "cigarOf", "target", "maxGap", "walks", "haplotypeOrderedPath", "haplotype", "isTarget", "isQuery", "sequenceOf", "targetWalk", "queryWalk", "pairAlignments", "pairCigar", "sum", "edges", "edge", "encoder", "chunks", "text", "fromReverse", "toId", "toReverse", "sha256Hex", "cigar", "lines", "gfaHeaderLines", "subgraphName", "sign", "cigarString", "cg", "contig", "resolved", "entries", "paths", "jsonPath", "nodeIds", "nodeSequences", "edgeHandles", "haplotypeOrderedPath", "info", "identity", "handle", "flipNode", "jsonPath", "name", "cigar", "nodeId", "isReverse", "comparePaths", "a", "b", "n", "i", "x", "y", "appendEdit", "edits", "op", "len", "last", "gapPenalty", "appendGap", "pathMiddle", "refMiddle", "mismatch", "mismatchIndel", "insertionDeletion", "cigarOf", "subgraphInInterval", "db", "query", "start", "end", "opts", "subgraph", "Subgraph", "reference", "pathNameFor", "error", "SubgraphLimitError", "subgraphForHaplotypes", "spacing", "anchored", "fallback", "sampled", "readVarint", "bytes", "offset", "value", "i", "byte", "last", "readSignedInt", "view", "width", "big", "decoder", "decodeRecord", "payload", "headerSize", "firstType", "types", "type", "next", "body", "length", "slice", "INTERIOR_INDEX", "INTERIOR_TABLE", "LEAF_INDEX", "LEAF_TABLE", "readUint16", "page", "offset", "readUint32", "readHeader", "start", "type", "interior", "cellOffset", "header", "index", "MAX_DECODED_INDEX_PAGES", "PREFETCH_PAGE_LIMIT", "BTree", "pager", "reservedBytes", "total", "isIndex", "usable", "maxLocal", "minLocal", "spill", "local", "result", "filled", "next", "overflow", "chunk", "pageNumber", "root", "towards", "depth", "level", "child", "rowid", "low", "high", "mid", "key", "readVarint", "lo", "hi", "leafLevel", "pages", "decoded", "n", "children", "i", "from", "to", "c", "size", "afterSize", "afterKey", "decodeRecord", "cells", "oldest", "cell", "first", "compareKey", "best", "values", "a", "b", "Pager", "source", "pageSize", "fileSize", "opts", "requested", "length", "start", "attempt", "bytes", "error", "resolve", "index", "cached", "pending", "pageNumbers", "wanted", "pageNumber", "a", "b", "runStart", "runEnd", "firstIndex", "count", "indexes", "i", "within", "oldest", "offset", "SqliteDatabase", "_SqliteDatabase", "pager", "btree", "objects", "source", "opts", "size", "firstBlock", "header", "view", "rawPageSize", "pageSize", "reserved", "encoding", "Pager", "BTree", "values", "type", "name", "tableName", "rootPage", "sql", "object", "index", "o", "table", "rowid", "lo", "hi", "key", "low", "SCHEMA_VERSION", "ForwardOnlyIndexError", "SchemaVersionError", "found", "GbzRecord", "handle", "edges", "bwt", "encodedSequence", "next", "encodedSequenceLength", "nodeId", "nodeOrientation", "decodeSequence", "GbwtRecord", "num", "value", "what", "str", "blob", "rowToPath", "rowid", "values", "readTags", "sqlite", "tags", "GBZBase", "_GBZBase", "index", "source", "opts", "haplotypeIndex", "pagerOptions", "SqliteDatabase", "table", "db", "version", "indexed", "paths", "indexedNodes", "nodes", "key", "lo", "hi", "row", "decompressEdges", "path", "name", "p", "a", "b", "sample", "ref", "pathNameFor", "toPathQuery", "length", "last", "formatPathName", "pos", "record", "start", "end", "ordered", "covering", "within", "f", "fragment", "keep", "queryOptions", "contig", "haplotype", "query", "from", "to", "haplotypes", "named", "subgraph", "subgraphForHaplotypes", "subgraphInInterval", "result", "gbzTags", "graphNameFromTags", "links", "pathHandle", "anchorOffset", "minHandle", "maxHandle", "samples", "node", "offset", "pathOffset", "fromOffset", "toOffset", "first", "positions", "import_BaseAdapter", "import_util", "import_io", "import_rxjs", "import_BaseAdapter", "import_util", "extendStatics", "d", "b", "p", "__extends", "__", "__awaiter", "thisArg", "_arguments", "P", "generator", "adopt", "value", "resolve", "reject", "fulfilled", "step", "e", "rejected", "result", "__generator", "body", "_", "t", "f", "y", "g", "verb", "n", "v", "op", "__values", "o", "s", "m", "i", "__read", "n", "r", "ar", "e", "error", "__spreadArray", "to", "from", "pack", "i", "l", "ar", "__await", "v", "__asyncGenerator", "thisArg", "_arguments", "generator", "g", "q", "verb", "awaitReturn", "f", "reject", "n", "a", "b", "resume", "step", "e", "settle", "r", "fulfill", "value", "__asyncValues", "o", "m", "i", "__values", "verb", "n", "v", "resolve", "reject", "settle", "d", "isFunction", "value", "createErrorClass", "createImpl", "_super", "instance", "ctorFunc", "UnsubscriptionError", "createErrorClass", "_super", "errors", "err", "i", "arrRemove", "arr", "item", "index", "Subscription", "initialTeardown", "errors", "_parentage", "_parentage_1", "__values", "_parentage_1_1", "parent_1", "initialFinalizer", "isFunction", "e", "UnsubscriptionError", "_finalizers", "_finalizers_1", "_finalizers_1_1", "finalizer", "execFinalizer", "err", "__spreadArray", "__read", "teardown", "_a", "parent", "arrRemove", "empty", "EMPTY_SUBSCRIPTION", "Subscription", "isSubscription", "value", "isFunction", "execFinalizer", "finalizer", "config", "timeoutProvider", "handler", "timeout", "args", "_i", "delegate", "__spreadArray", "__read", "handle", "reportUnhandledError", "err", "timeoutProvider", "onUnhandledError", "config", "noop", "COMPLETE_NOTIFICATION", "createNotification", "errorNotification", "error", "nextNotification", "value", "kind", "context", "errorContext", "cb", "config", "isRoot", "_a", "errorThrown", "error", "captureError", "err", "Subscriber", "_super", "__extends", "destination", "_this", "isSubscription", "EMPTY_OBSERVER", "next", "error", "complete", "SafeSubscriber", "value", "handleStoppedNotification", "nextNotification", "err", "errorNotification", "COMPLETE_NOTIFICATION", "Subscription", "_bind", "bind", "fn", "thisArg", "ConsumerObserver", "partialObserver", "value", "error", "handleUnhandledError", "err", "SafeSubscriber", "_super", "__extends", "observerOrNext", "complete", "_this", "isFunction", "context_1", "config", "Subscriber", "handleUnhandledError", "error", "config", "captureError", "reportUnhandledError", "defaultErrorHandler", "err", "handleStoppedNotification", "notification", "subscriber", "onStoppedNotification", "timeoutProvider", "EMPTY_OBSERVER", "noop", "observable", "identity", "x", "pipeFromArray", "fns", "identity", "input", "prev", "fn", "Observable", "subscribe", "operator", "observable", "observerOrNext", "error", "complete", "_this", "subscriber", "isSubscriber", "SafeSubscriber", "errorContext", "_a", "source", "sink", "err", "next", "promiseCtor", "getPromiseCtor", "resolve", "reject", "value", "operations", "_i", "pipeFromArray", "x", "getPromiseCtor", "promiseCtor", "_a", "config", "isObserver", "value", "isFunction", "isSubscriber", "Subscriber", "isSubscription", "hasLift", "source", "isFunction", "operate", "init", "liftedSource", "err", "createOperatorSubscriber", "destination", "onNext", "onComplete", "onError", "onFinalize", "OperatorSubscriber", "_super", "__extends", "shouldUnsubscribe", "_this", "value", "err", "closed_1", "_a", "Subscriber", "isArrayLike", "x", "isPromise", "value", "isFunction", "isInteropObservable", "input", "isFunction", "observable", "isAsyncIterable", "obj", "isFunction", "createInvalidObservableTypeError", "input", "getSymbolIterator", "iterator", "isIterable", "input", "isFunction", "iterator", "readableStreamLikeToAsyncGenerator", "readableStream", "reader", "__await", "_a", "_b", "value", "done", "isReadableStreamLike", "obj", "isFunction", "innerFrom", "input", "Observable", "isInteropObservable", "fromInteropObservable", "isArrayLike", "fromArrayLike", "isPromise", "fromPromise", "isAsyncIterable", "fromAsyncIterable", "isIterable", "fromIterable", "isReadableStreamLike", "fromReadableStreamLike", "createInvalidObservableTypeError", "obj", "subscriber", "obs", "observable", "isFunction", "array", "i", "promise", "value", "err", "reportUnhandledError", "iterable", "iterable_1", "__values", "iterable_1_1", "asyncIterable", "process", "readableStream", "readableStreamLikeToAsyncGenerator", "asyncIterable_1", "__asyncValues", "asyncIterable_1_1", "executeSchedule", "parentSubscription", "scheduler", "work", "delay", "repeat", "scheduleSubscription", "observeOn", "scheduler", "delay", "operate", "source", "subscriber", "createOperatorSubscriber", "value", "executeSchedule", "err", "subscribeOn", "scheduler", "delay", "operate", "source", "subscriber", "scheduleObservable", "input", "scheduler", "innerFrom", "subscribeOn", "observeOn", "schedulePromise", "input", "scheduler", "innerFrom", "subscribeOn", "observeOn", "scheduleArray", "input", "scheduler", "Observable", "subscriber", "i", "scheduleIterable", "input", "scheduler", "Observable", "subscriber", "iterator", "executeSchedule", "value", "done", "_a", "err", "isFunction", "scheduleAsyncIterable", "input", "scheduler", "Observable", "subscriber", "executeSchedule", "iterator", "result", "scheduleReadableStreamLike", "input", "scheduler", "scheduleAsyncIterable", "readableStreamLikeToAsyncGenerator", "scheduled", "input", "scheduler", "isInteropObservable", "scheduleObservable", "isArrayLike", "scheduleArray", "isPromise", "schedulePromise", "isAsyncIterable", "scheduleAsyncIterable", "isIterable", "scheduleIterable", "isReadableStreamLike", "scheduleReadableStreamLike", "createInvalidObservableTypeError", "from", "input", "scheduler", "scheduled", "innerFrom", "map", "project", "thisArg", "operate", "source", "subscriber", "index", "createOperatorSubscriber", "value", "mergeInternals", "source", "subscriber", "project", "concurrent", "onBeforeNext", "expand", "innerSubScheduler", "additionalFinalizer", "buffer", "active", "index", "isComplete", "checkComplete", "outerNext", "value", "doInnerSub", "innerComplete", "innerFrom", "createOperatorSubscriber", "innerValue", "bufferedValue", "executeSchedule", "err", "mergeMap", "project", "resultSelector", "concurrent", "isFunction", "a", "i", "map", "b", "ii", "innerFrom", "operate", "source", "subscriber", "mergeInternals", "scanInternals", "accumulator", "seed", "hasSeed", "emitOnNext", "emitBeforeComplete", "source", "subscriber", "hasState", "state", "index", "createOperatorSubscriber", "value", "i", "reduce", "accumulator", "seed", "operate", "scanInternals", "arrReducer", "arr", "value", "toArray", "operate", "source", "subscriber", "reduce", "parseCoarseOps", "s", "out", "len", "ownBeforeColon", "i", "l", "code", "op", "coarseCigarOwnAxis", "s", "out", "own", "mate", "op", "parseCoarseOps", "MAX_PACKED_LEN", "pushPacked", "len", "code", "rest", "pushRun", "chunks", "i", "o", "m", "parseCoarseCigar", "isDigit", "code", "isBaseChar", "ch", "scanBases", "cs", "start", "i", "scanDigits", "value", "forEachCsOp", "callback", "c", "next", "len", "end", "forEachCsMismatch", "cs", "callback", "windowStart", "windowEnd", "lo", "hi", "ref", "forEachCsOp", "op", "refLen", "queryLen", "seqStart", "seqEnd", "seq", "cigarToMismatches2", "ops", "seq", "ref", "qual", "roffset", "soffset", "mismatches", "hasRefAndSeq", "i", "l", "packed", "len", "op", "j", "mdToMismatches2", "mdstring", "ops", "cigarMismatches", "seq", "qual", "mismatchRecords", "opsLength", "seqLength", "hasQual", "cigarLength", "hasSkips", "k", "currStart", "lastCigar", "lastTemplateOffset", "lastRefOffset", "lastSkipPos", "i", "len", "char", "num", "c", "letter", "mismatch", "templateOffset", "refOffset", "j", "packed", "op", "s", "base", "CIGAR_CODE_TO_INDEX", "parseCigar2", "s", "currLen", "ret", "i", "l", "code", "opIndex", "CIGAR_CODE_TO_INDEX", "parseCigar2Typed", "opCount", "out", "j", "getMismatches", "cigar", "md", "seq", "ref", "qual", "ops", "mismatches", "cigarToMismatches2", "mdToMismatches2", "V1_OPS", "V2_OPS", "MATCH_OPS", "consumesQuery", "op", "consumesTarget", "isMatchOp", "clipSyntenyFeature", "cigar", "start", "mateStart", "mateEnd", "strand", "winStart", "winEnd", "revTarget", "bp1", "bp2", "out", "qLo", "qHi", "tLo", "tHi", "extendTarget", "a", "b", "k", "packed", "len", "isRun", "qAdv", "tAdv", "bp1Next", "bp2Next", "opQLo", "opQHi", "cLo", "cHi", "ratio", "keptOwn", "keptMate", "tEntry", "isGapOp", "splitSyntenyFeatureAtGaps", "gapBp", "runs", "run", "aligned", "close", "second", "getCigar", "feature", "cigar", "getCoarseCigar", "coarse", "getAlignmentOps", "feature", "cigar", "getCigar", "coarse", "getCoarseCigar", "parseCigar2Typed", "parseCoarseCigar", "import_util", "import_installClearHoverOnSurfaceMove", "import_util", "import_tracks", "import_util", "SyntenyFeature", "name", "getMismatches", "cigar", "coarse", "coarseCigarOwnAxis", "callback", "opts", "start", "ws", "we", "cs", "forEachCsMismatch", "lo", "hi", "m", "ALIGNMENT_STRING_FIELDS", "isMate", "mate", "mateOf", "feature", "interpolateClip", "own", "strand", "window", "lo", "hi", "ratio", "mateAt", "q", "a", "b", "clipIntervals", "splitAtGapBp", "inside", "ops", "getAlignmentOps", "clipped", "splitSyntenyFeatureAtGaps", "run", "clipSyntenyFeature", "clippedFeature", "suffix", "source", "data", "field", "SyntenyFeature", "clipFeatureToRegion", "pieces", "piece", "ComparativeAdapterBase", "regions", "opts", "clipToRegion", "splitAtGapBp", "rest", "clip", "slot", "from", "mergeMap", "region", "index", "feature", "clipFeatureToRegion", "toArray", "map", "features", "chunks", "a", "b", "chunk", "NoHaplotypeIndexError", "NoReferenceSampleError", "anchor", "referenceSamples", "haplotypePrefix", "name", "PairTargetError", "queryAssemblyName", "haplotypeWanted", "wanted", "prefix", "candidate", "panSNMatchesPrefix", "HaplotypeWindowError", "assemblyName", "NodeLimitError", "limit", "windowBp", "fitsBp", "nodeLimitError", "error", "walked", "fits", "laneAssemblyName", "asmByPrefix", "resolveReferenceSample", "configured", "anchorPrefix", "fromAnchor", "panSNSample", "fragmentId", "alignment", "fragmentFeature", "refName", "lane", "refStart", "refEnd", "strand", "cigar", "hapStart", "hapEnd", "id", "data", "SyntenyFeature", "pairFeature", "pair", "mateLane", "GbzBaseSyntenyAdapter", "ComparativeAdapterBase", "indexLocation", "hasCompanion", "db", "GBZBase", "sample", "referenceSample", "resolvePanSNPrefix", "opts", "path", "p", "byPrefix", "entry", "assemblyByPanSNPrefix", "lanes", "haplotype", "contigs", "haplotypes", "targetPrefix", "wantedPrefixes", "region", "start", "end", "query", "nodeLimit", "keep", "subgraph", "inside", "bounds", "a", "b", "pieceEnd", "i", "feature", "targetAssemblyName", "featureSide", "mateSide", "kept", "anchored", "cut", "reference", "piece", "subgraphs", "walk", "target", "mate", "observer", "features"]
|
|
7
|
+
}
|