jbrowse-plugin-graphgenomeviewer 7.1.12 → 7.2.0

package/dist/chunks/GbzBaseSyntenyAdapter-RYGR6L75.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../node_modules/.pnpm/@jbrowse+bandage-core@11.0.0/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-TUQKGAK3.js", "../../src/GbzBaseSyntenyAdapter/companion.ts", "../../src/gaf/gafFile.ts", "../../src/GbzBaseSyntenyAdapter/GbzBaseSyntenyAdapter.ts"],
-  "sourcesContent": ["import {\n  GBZ_CUT_DEFAULTS,\n  NoReferenceSampleError,\n  aliasedSample,\n  cutWindowGFA,\n  haplotypeWanted,\n  referencePathQuery,\n  referenceSamplesOf\n} from \"./chunk-NMWQUFPF.js\";\nimport {\n  panSNSample\n} from \"./chunk-4XWZNPQ2.js\";\n\n// src/gbzCut.ts\nimport { GBZBase } from \"@gmod/gbz-base\";\nvar HPRC_GBZ = {\n  db: \"https://s3-us-west-2.amazonaws.com/human-pangenomics/pangenomes/freeze/release2/minigraph-cactus/v2.1/hprc-v2.1-mc-grch38/hprc-v2.1-mc-grch38.gbz.db\",\n  index: \"https://jbrowse.org/demos/hprc/hprc-v2.1-mc-grch38.haplotype-index.f3.db\"\n};\nfunction gbzLocations({ db, index }) {\n  return db === \"hprc\" ? { db: HPRC_GBZ.db, index: index ?? HPRC_GBZ.index } : { db, index };\n}\nfunction haplotypeIndexBeside(db) {\n  const GBZ_DB = /\\.gbz\\.db$/i;\n  return GBZ_DB.test(db) ? db.replace(GBZ_DB, \".haplotype-index.db\") : void 0;\n}\nfunction parseRegion(text) {\n  const m = /^\\s*([^:\\s]+):([\\d,]+)-([\\d,]+)\\s*$/.exec(text);\n  if (!m) {\n    throw new Error(\n      `\"${text}\" is not a region like chr6:160,614,798-160,647,758`\n    );\n  }\n  const n = (s) => Number(s.replaceAll(\",\", \"\"));\n  const region = { refName: m[1], start: n(m[2]), end: n(m[3]) };\n  if (region.end <= region.start) {\n    throw new Error(`\"${text}\" ends at or before it starts`);\n  }\n  return region;\n}\nasync function openGbz(db, index) {\n  const base = await GBZBase.open({ source: db, haplotypeIndex: index });\n  return { base, referenceSamples: await referenceSamplesOf(base) };\n}\nfunction referenceSample(ref, samples) {\n  if (ref) {\n    return aliasedSample(panSNSample(ref), samples) ?? ref;\n  }\n  const first = samples[0];\n  if (first === void 0) {\n    throw new NoReferenceSampleError(\"\", samples);\n  }\n  return first;\n}\nasync function cutGbzRegion({ base, referenceSamples }, src, signal) {\n  const region = parseRegion(src.region);\n  const sample = referenceSample(src.referenceSample, referenceSamples);\n  const query = await referencePathQuery(base, sample, region.refName);\n  if (!query) {\n    throw new Error(`${sample} has no indexed path named ${region.refName}`);\n  }\n  signal?.throwIfAborted();\n  const wanted = src.haplotypes?.length ? src.haplotypes : void 0;\n  const text = await cutWindowGFA(base, query, region.start, region.end, {\n    context: src.context ?? GBZ_CUT_DEFAULTS.context,\n    snarls: src.snarls ?? GBZ_CUT_DEFAULTS.snarls,\n    limit: GBZ_CUT_DEFAULTS.limit,\n    signal,\n    keep: wanted ? (name) => haplotypeWanted(name, wanted) : void 0\n  });\n  return { text, region, sample };\n}\n\nexport {\n  HPRC_GBZ,\n  gbzLocations,\n  haplotypeIndexBeside,\n  parseRegion,\n  openGbz,\n  cutGbzRegion\n};\n", "import { haplotypeIndexBeside } from '@jbrowse/bandage-core/gbzCut'\nimport { openLocation } from '@jbrowse/core/util/io'\n\nimport { locationName, readsSiblings, renamed } from '../locationName'\n\nimport type PluginManager from '@jbrowse/core/PluginManager'\nimport type { FileLocation } from '@jbrowse/core/util/types'\n\nexport function siblingCompanion(gbzDb: FileLocation) {\n  return readsSiblings(gbzDb) && haplotypeIndexBeside(locationName(gbzDb))\n    ? renamed(gbzDb, name => haplotypeIndexBeside(name)!)\n    : undefined\n}\n\n// 404 is a missing file, and so is 403 from a bucket that does not let a\n// reader list it; anything else leaves the file's presence unknown\nfunction isMissing(error: unknown) {\n  return (\n    error instanceof Error &&\n    (/\\bHTTP 40[34]\\b/.test(error.message) ||\n      (error as { code?: unknown }).code === 'ENOENT')\n  )\n}\n\n// `unreadable` is why a companion that may be there could not be checked, such\n// as a network error, or a server that answers a missing file without CORS\nexport async function findCompanion(\n  gbzDb: FileLocation,\n  pluginManager?: PluginManager,\n): Promise<{ location?: FileLocation; unreadable?: string }> {\n  const candidate = siblingCompanion(gbzDb)\n  if (!candidate) {\n    return {}\n  }\n  try {\n    await openLocation(candidate, pluginManager).stat()\n    return { location: candidate }\n  } catch (error) {\n    return isMissing(error) ? {} : { unreadable: String(error) }\n  }\n}\n", "import { unzip } from '@gmod/bgzf-filehandle'\nimport { parseGaf, parseGafLine } from '@jbrowse/bandage-core/gaf/parseGaf'\nimport { cachedSetup } from '@jbrowse/core/data_adapters/BaseAdapter'\n\nimport type { TabixIndexedFile } from '@gmod/tabix'\nimport type { GafRecord } from '@jbrowse/bandage-core/gaf/parseGaf'\n\ninterface WholeFile {\n  stat(): Promise<{ size: number }>\n  readFile(opts?: { signal?: AbortSignal }): Promise<Uint8Array>\n}\n\nexport interface GafReads {\n  records: GafRecord[]\n  // reads over the nodes before sampling\n  total: number\n}\n\n// The tube map lays reads out on the main thread at about 40 ms per thousand\nexport const MAX_READS = 5000\n\n// An unindexed GAF is read whole, once, into the worker\nconst MAX_UNINDEXED_BYTES = 50 * 2 ** 20\n\nexport class UnindexedGafTooLargeError extends Error {\n  override name = 'UnindexedGafTooLargeError'\n\n  constructor(size: number) {\n    super(\n      `this GAF is ${(size / 2 ** 20).toFixed(0)} MB without an index; bgzip it and index it with tabix -p gaf`,\n    )\n  }\n}\n\n// Evenly spaced, so a pileup thins out rather than losing its right half\nfunction sample(records: GafRecord[], max: number) {\n  if (records.length <= max) {\n    return records\n  }\n  const stride = records.length / max\n  return Array.from({ length: max }, (_, k) => records[Math.floor(k * stride)]!)\n}\n\nconst touches = (record: GafRecord, names: ReadonlySet<string>) =>\n  record.path.some(step => names.has(step.name))\n\n// A GAF over a graph's segments: bgzipped and indexed with `tabix -p gaf`,\n// which keys each line by its lowest and highest node id and so needs numeric\n// segment names, or plain or gzipped and read whole.\nexport class GafFile {\n  // Shared by every window, so the signal is cachedSetup's own, which aborts\n  // once no caller is left waiting\n  private whole = cachedSetup({\n    setup: async ({ signal }) => {\n      const { size } = await this.file.stat()\n      if (size > MAX_UNINDEXED_BYTES) {\n        throw new UnindexedGafTooLargeError(size)\n      }\n      const bytes = await this.file.readFile({ signal })\n      const text = new TextDecoder().decode(\n        bytes[0] === 0x1f && bytes[1] === 0x8b ? await unzip(bytes) : bytes,\n      )\n      return parseGaf(text)\n    },\n  })\n\n  constructor(\n    private file: WholeFile,\n    private tabix?: TabixIndexedFile,\n  ) {}\n\n  private async readIndexed(\n    tabix: TabixIndexedFile,\n    names: ReadonlySet<string>,\n    signal?: AbortSignal,\n  ) {\n    let lo = Infinity\n    let hi = -Infinity\n    for (const name of names) {\n      const id = Number(name)\n      if (Number.isInteger(id)) {\n        lo = Math.min(lo, id)\n        hi = Math.max(hi, id)\n      }\n    }\n    const records: GafRecord[] = []\n    if (lo <= hi) {\n      // a GAF index ignores the refName, and getLines keeps a read whose node\n      // ids span min..max when min < end && max >= start, hence hi + 1\n      await tabix.getLines('{node}', lo, hi + 1, {\n        signal,\n        lineCallback: line => {\n          const record = parseGafLine(line)\n          if (record && touches(record, names)) {\n            records.push(record)\n          }\n        },\n      })\n    }\n    return records\n  }\n\n  async readsOver(\n    names: ReadonlySet<string>,\n    { signal }: { signal?: AbortSignal } = {},\n  ): Promise<GafReads> {\n    const records = this.tabix\n      ? await this.readIndexed(this.tabix, names, signal)\n      : (await this.whole({ signal })).filter(r => touches(r, names))\n    return { records: sample(records, MAX_READS), total: records.length }\n  }\n}\n", "import { GBZBase, SubgraphLimitError } from '@gmod/gbz-base'\nimport {\n  NodeLimitError,\n  cutWindowTables,\n  haplotypePrefix,\n  haplotypeWanted,\n  nodeLimitError,\n  referencePathQuery,\n  referenceSamplesOf,\n  resolveReferenceSample,\n} from '@jbrowse/bandage-core/gbzWindow'\nimport {\n  assemblyByPanSNPrefix,\n  panSNMatchesPrefix,\n  resolvePanSNPrefix,\n} from '@jbrowse/bandage-core/pansn'\nimport { cachedSetup } from '@jbrowse/core/data_adapters/BaseAdapter'\nimport { getBpDisplayStr, updateStatus } from '@jbrowse/core/util'\nimport { openLocation } from '@jbrowse/core/util/io'\nimport { ObservableCreate } from '@jbrowse/core/util/rxjs'\n\nimport { findCompanion } from './companion.ts'\nimport { walkCutFor } from '../RgfaTabixAdapter/walkRowRuns.ts'\nimport { GafFile } from '../gaf/gafFile.ts'\nimport { locationIsSet } from '../locationName.ts'\nimport { openTabixSlot } from '../panSNTabix.ts'\nimport { ComparativeAdapterBase } from '../synteny/ComparativeAdapterBase.ts'\nimport SyntenyFeature from '../synteny/SyntenyFeature.ts'\nimport {\n  laneAssemblyName,\n  lanePairsStatus,\n  requestedPairs,\n} from '../synteny/lanePairs.ts'\nimport { matchFeature } from '../synteny/matchFeature.ts'\n\nimport type { GbzBaseSyntenyAdapterConfig } from './configSchema.ts'\nimport type { SubgraphAdapterOptions } from '../GetSubgraph.ts'\nimport type { GafReads } from '../gaf/gafFile.ts'\nimport type { LaneFeatureOptions, LanePair } from '../synteny/lanePairs.ts'\nimport type {\n  HaplotypeAlignment,\n  HaplotypeRef,\n  PairAlignment,\n  PathName,\n  PathQuery,\n  Subgraph,\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'\n\nexport class NoHaplotypeIndexError extends Error {\n  override name = 'NoHaplotypeIndexError'\n\n  constructor(unreadable?: string) {\n    super(\n      unreadable === undefined\n        ? 'no haplotype index is set, so the walks cannot be named; build one with gbz-haplotype-index (cargo install gbz-haplotype-index) and set it as haplotypeIndexLocation'\n        : `the haplotype index beside the graph database could not be checked (${unreadable}), so the walks cannot be named; if it is there, reload to try again, or set haplotypeIndexLocation`,\n    )\n  }\n}\n\ninterface 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 */\ninterface GbzHeaderLane {\n  name: string\n  label: string\n  group: string\n}\n\nexport { PairTargetError } from '../synteny/lanePairs.ts'\n\nclass 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\ntype ResolvedAlignment = Extract<HaplotypeAlignment, { resolved: true }>\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: ResolvedAlignment) {\n  return `${haplotypePrefix(name)}#${name.contig}@${alignment.start.node}.${alignment.start.offset}`\n}\n\nfunction fragmentFeature({\n  alignment,\n  assemblyName,\n  refName,\n  lane,\n}: {\n  alignment: ResolvedAlignment\n  assemblyName: string\n  refName: string\n  lane: string\n}) {\n  const { refStart, refEnd, strand, cigar } = alignment\n  if (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// gbz-base writes the CIGAR along the target, which is the side a JBrowse\n// feature is, so it passes through unchanged\nfunction pairFeature({\n  pair,\n  lane,\n  mateLane,\n}: {\n  pair: PairAlignment\n  lane: string\n  mateLane: string\n}) {\n  return matchFeature({\n    target: {\n      name: `${haplotypePrefix(pair.target)}#${pair.target.contig}`,\n      assemblyName: lane,\n      refName: pair.target.contig,\n      start: pair.targetStart,\n      end: pair.targetEnd,\n    },\n    query: {\n      name: `${haplotypePrefix(pair.query)}#${pair.query.contig}`,\n      assemblyName: mateLane,\n      refName: pair.query.contig,\n      start: pair.queryStart,\n      end: pair.queryEnd,\n    },\n    strand: pair.strand,\n    cigar: pair.cigar,\n    matches: pair.matches,\n    columns: pair.columns,\n  })\n}\n\n// The longest detour a pair cut widens its context to take in\nconst BRIDGE_MAX_BP = 120_000\n\n/**\n * The widest gap, up to `BRIDGE_MAX_BP`, between two pieces of one kept walk:\n * a haplotype that left the cut's nodes for sequence the reference lacks and\n * came back. Two kept haplotypes that share that sequence only align across it\n * once its nodes are in the cut.\n */\nexport function widestWalkGap(subgraphs: Subgraph[], kept: Set<string>) {\n  const byPath = new Map<string, [number, number][]>()\n  for (const subgraph of subgraphs) {\n    for (const { name, start, end } of subgraph.walkSpans()) {\n      const prefix = haplotypePrefix(name)\n      if (kept.has(prefix)) {\n        const key = `${prefix}#${name.contig}`\n        const spans = byPath.get(key)\n        if (spans) {\n          spans.push([start, end])\n        } else {\n          byPath.set(key, [[start, end]])\n        }\n      }\n    }\n  }\n  let widest = 0\n  for (const spans of byPath.values()) {\n    spans.sort((a, b) => a[0] - b[0])\n    for (let i = 1; i < spans.length; i++) {\n      const gap = spans[i]![0] - spans[i - 1]![1]\n      if (gap > 0 && gap <= BRIDGE_MAX_BP) {\n        widest = Math.max(widest, gap)\n      }\n    }\n  }\n  return widest\n}\n\n// A window past the node limit fails as a zoom-in notice naming a span that\n// fits\nfunction zoomInNotice(error: unknown, what: string) {\n  if (error instanceof NodeLimitError) {\n    error.message = `Zoom in to about ${getBpDisplayStr(error.fitsBp)} to see ${what}`\n  }\n  return error\n}\n\n// gbz-base reads whole bp; a view asks at fractional ones\nconst wholeBp = (region: Region) => ({\n  ...region,\n  start: Math.floor(region.start),\n  end: Math.ceil(region.end),\n})\n\nexport default class GbzBaseSyntenyAdapter extends ComparativeAdapterBase<GbzBaseSyntenyAdapterConfig> {\n  private graph = cachedSetup({\n    label: 'Opening pangenome database',\n    setup: async () => {\n      const gbzDb: FileLocation = this.getConf('gbzDbLocation')\n      const configured: FileLocation = this.getConf('haplotypeIndexLocation')\n      const companion = locationIsSet(configured)\n        ? { location: configured }\n        : await findCompanion(gbzDb, this.pluginManager)\n      const indexLocation = companion.location\n      const db = await GBZBase.open({\n        source: openLocation(gbzDb, this.pluginManager),\n        haplotypeIndex: indexLocation\n          ? openLocation(indexLocation, this.pluginManager)\n          : undefined,\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 referenceSamplesOf(db)\n      const referenceSample = resolveReferenceSample({\n        configured: this.getConf('referenceSample'),\n        anchorPrefix: resolvePanSNPrefix(this, anchor),\n        referenceSamples,\n      })\n      return {\n        db,\n        anchor,\n        referenceSample,\n        referenceSamples,\n        unreadableIndex: companion.unreadable,\n      }\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   */\n  private async referenceQuery(\n    refName: string,\n    opts: BaseOptions,\n  ): Promise<PathQuery | undefined> {\n    const { db, referenceSample } = await this.graph(opts)\n    return referencePathQuery(db, referenceSample, refName)\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 } = 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.prefix),\n          label: haplotype.prefix,\n          group: haplotype.sample,\n        })\n      }\n    }\n    return {\n      hasCoarseTier: false,\n      anchorAssemblyName: anchor,\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 whose stray rows cover the window gbz-base walks\n   * only the wanted haplotypes; otherwise it names every walk and keeps the\n   * ones the predicate accepts, and throws rather than guess when a walk has\n   * no name. 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, as tables: the reference walk, every\n   * top-level snarl contained in it, and one walk per haplotype, PanSN-named\n   * when the database (or its companion) carries the haplotype index and\n   * `unknown#N` otherwise. The reference walk is the first, which is the one\n   * the view anchors on by default. With `haplotypes` the walks are that\n   * set's and the nodes those walks visit, the reference walk kept. With\n   * `walkRows` the rows' runs come along, as on a walk-file cut.\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 { signal } = opts\n    const { db, anchor, referenceSample, unreadableIndex } = await this.graph({\n      signal,\n    })\n    const { assemblyName, refName, start, end } = wholeBp(region)\n    if (assemblyName !== anchor) {\n      throw new HaplotypeWindowError(assemblyName, anchor)\n    }\n    const query = await this.referenceQuery(refName, { signal })\n    if (!query) {\n      throw new Error(\n        `${referenceSample} has no indexed path ${refName} in this graph`,\n      )\n    }\n    const keep = this.keepPredicate(opts.haplotypes)\n    if (keep !== undefined && !db.hasHaplotypeIndex) {\n      throw new NoHaplotypeIndexError(unreadableIndex)\n    }\n    const cut = await cutWindowTables(db, query, start, end, {\n      context: this.getConf('context'),\n      snarls: opts.snarls ?? this.getConf('subgraphSnarls'),\n      limit: this.getConf('nodeLimit'),\n      signal: opts.signal,\n      keep,\n    }).catch((error: unknown) => {\n      throw zoomInNotice(error, 'the graph')\n    })\n    return typeof cut === 'string'\n      ? cut\n      : walkCutFor(cut, { start, end }, opts.walkRows)\n  }\n\n  private gaf = cachedSetup({\n    label: 'Opening reads',\n    setup: async () => {\n      const location: FileLocation = this.getConf('readsLocation')\n      const index: FileLocation = this.getConf(['readsIndex', 'location'])\n      return locationIsSet(location)\n        ? new GafFile(\n            openLocation(location, this.pluginManager),\n            locationIsSet(index)\n              ? openTabixSlot(this, ['readsLocation'], ['readsIndex'])\n              : undefined,\n          )\n        : undefined\n    },\n  })\n\n  /**\n   * The reads over a cut's segments, from `readsLocation`, sampled down to\n   * what the tube map lays out at interactive speed\n   */\n  async getReads(\n    nodeNames: string[],\n    opts: BaseOptions = {},\n  ): Promise<GafReads> {\n    const gaf = await this.gaf(opts)\n    return gaf\n      ? gaf.readsOver(new Set(nodeNames), opts)\n      : { records: [], total: 0 }\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  private async anchorFeatures(region: Region, opts: LaneFeatureOptions) {\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              .getAlignments({\n                path: query,\n                start,\n                end,\n                context: this.getConf('context'),\n                haplotypes: 'all',\n                limit: nodeLimit,\n                signal: opts.signal,\n                keep,\n              })\n              .catch((error: unknown) => {\n                throw zoomInNotice(\n                  nodeLimitError(error, nodeLimit, end - start) ?? error,\n                  'lanes',\n                )\n              }),\n        )\n      : []\n    return alignments.flatMap(alignment => {\n      const feature = alignment.resolved\n        ? fragmentFeature({\n            alignment,\n            assemblyName,\n            refName,\n            lane: laneAssemblyName(\n              asmByPrefix,\n              haplotypePrefix(alignment.name),\n            ),\n          })\n        : undefined\n      return feature === undefined ? [] : [feature]\n    })\n  }\n\n  /**\n   * Each pair's two lanes cut out of the anchor window alone, all pairs in one\n   * cut, and each walk of a pair's query lane aligned to each walk of its\n   * target lane on the nodes both visit, with no base compared. A pair's\n   * records sit on its query lane's contigs, the lane the display draws on top.\n   *\n   * Whether the index has anchor rows changes only how fast gbz-base finds\n   * the walks: both routes cut the same pieces.\n   */\n  private async pairFeatures(\n    region: Region,\n    pairs: LanePair[],\n    opts: LaneFeatureOptions,\n  ) {\n    const { db } = await this.graph(opts)\n    const { refName, start, end } = region\n    const sides = await Promise.all(\n      pairs.map(async pair => ({\n        pair,\n        featureSide: await this.laneHaplotypes(pair.queryAssemblyName, opts),\n        mateSide: await this.laneHaplotypes(pair.targetAssemblyName, opts),\n      })),\n    )\n    const answerable = sides.filter(\n      ({ featureSide, mateSide }) =>\n        featureSide.length > 0 && mateSide.length > 0,\n    )\n    const kept = new Set(\n      answerable.flatMap(({ featureSide, mateSide }) =>\n        [...featureSide, ...mateSide].map(haplotypePrefix),\n      ),\n    )\n    const query = await this.referenceQuery(refName, opts)\n    const nodeLimit: number = this.getConf('nodeLimit')\n    const baseContext: number = this.getConf('context')\n    const cut = (path: PathQuery, context: number) =>\n      db.getSubgraphs({\n        path,\n        start,\n        end,\n        context,\n        snarls: this.getConf('subgraphSnarls'),\n        haplotypes: 'all',\n        limit: nodeLimit,\n        signal: opts.signal,\n        keep: name => kept.has(haplotypePrefix(name)),\n      })\n    // a cut past the node limit for the wider context keeps the first one\n    const bridged = async (path: PathQuery) => {\n      const subgraphs = await cut(path, baseContext).catch((error: unknown) => {\n        throw zoomInNotice(\n          nodeLimitError(error, nodeLimit, end - start) ?? error,\n          'lanes',\n        )\n      })\n      const gap = widestWalkGap(subgraphs, kept)\n      const context = Math.ceil(gap / 2) + 2000\n      return gap > 0 && context > baseContext\n        ? cut(path, context).catch((error: unknown) => {\n            if (error instanceof SubgraphLimitError) {\n              return subgraphs\n            }\n            throw error\n          })\n        : subgraphs\n    }\n    const subgraphs =\n      query && answerable.length > 0\n        ? await updateStatus(lanePairsStatus(pairs), opts.statusCallback, () =>\n            bridged(query),\n          )\n        : []\n    return subgraphs.flatMap(subgraph =>\n      answerable.flatMap(({ pair, featureSide, mateSide }) =>\n        featureSide.flatMap(target =>\n          mateSide.flatMap(mate =>\n            subgraph\n              .pairAlignments({ target, query: mate, bases: false })\n              .map(alignment =>\n                pairFeature({\n                  pair: alignment,\n                  lane: pair.queryAssemblyName,\n                  mateLane: pair.targetAssemblyName,\n                }),\n              ),\n          ),\n        ),\n      ),\n    )\n  }\n\n  getFeatures(asked: Region, opts: LaneFeatureOptions = {}) {\n    const region = wholeBp(asked)\n    return ObservableCreate<Feature>(async observer => {\n      const { db, anchor, unreadableIndex } = await this.graph(opts)\n      if (!db.hasHaplotypeIndex) {\n        throw new NoHaplotypeIndexError(unreadableIndex)\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 pairs = requestedPairs(opts)\n        const features =\n          pairs.length > 0\n            ? await this.pairFeatures(region, pairs, opts)\n            : await this.anchorFeatures(region, opts)\n        for (const feature of features) {\n          observer.next(feature)\n        }\n      }\n      observer.complete()\n    }, opts.signal)\n  }\n}\n"],
-  "mappings": "6zBAsBA,SAASA,EAAqBC,EAAI,CAChC,IAAMC,EAAS,cACf,OAAOA,EAAO,KAAKD,CAAE,EAAIA,EAAG,QAAQC,EAAQ,qBAAqB,EAAI,MACvE,CCjBO,SAASC,GAAiBC,EAAqB,CACpD,OAAOC,EAAcD,CAAK,GAAKE,EAAqBC,EAAaH,CAAK,CAAC,EACnEI,EAAQJ,EAAOK,GAAQH,EAAqBG,CAAI,CAAE,EAClD,MACN,CAIA,SAASC,GAAUC,EAAgB,CACjC,OACEA,aAAiB,QAChB,kBAAkB,KAAKA,EAAM,OAAO,GAClCA,EAA6B,OAAS,SAE7C,CAIA,eAAsBC,GACpBR,EACAS,EAC2D,CAC3D,IAAMC,EAAYX,GAAiBC,CAAK,EACxC,GAAI,CAACU,EACH,MAAO,CAAC,EAEV,GAAI,CACF,aAAMC,EAAaD,EAAWD,CAAa,EAAE,KAAK,EAC3C,CAAE,SAAUC,CAAU,CAC/B,OAASH,EAAO,CACd,OAAOD,GAAUC,CAAK,EAAI,CAAC,EAAI,CAAE,WAAY,OAAOA,CAAK,CAAE,CAC7D,CACF,CCrBO,IAAMK,GAAY,IAGnBC,GAAsB,GAAK,GAAK,GAEzBC,EAAN,cAAwC,KAAM,CAGnD,YAAYC,EAAc,CACxB,MACE,gBAAgBA,EAAO,GAAK,IAAI,QAAQ,CAAC,CAAC,+DAC5C,EALF,KAAS,KAAO,2BAMhB,CACF,EAGA,SAASC,GAAOC,EAAsBC,EAAa,CACjD,GAAID,EAAQ,QAAUC,EACpB,OAAOD,EAET,IAAME,EAASF,EAAQ,OAASC,EAChC,OAAO,MAAM,KAAK,CAAE,OAAQA,CAAI,EAAG,CAACE,EAAGC,IAAMJ,EAAQ,KAAK,MAAMI,EAAIF,CAAM,CAAC,CAAE,CAC/E,CAEA,IAAMG,GAAU,CAACC,EAAmBC,IAClCD,EAAO,KAAK,KAAKE,GAAQD,EAAM,IAAIC,EAAK,IAAI,CAAC,EAKlCC,EAAN,KAAc,CAiBnB,YACUC,EACAC,EACR,CAFQ,UAAAD,EACA,WAAAC,EAhBV,KAAQ,MAAQC,EAAY,CAC1B,MAAO,MAAO,CAAE,OAAAC,CAAO,IAAM,CAC3B,GAAM,CAAE,KAAAf,CAAK,EAAI,MAAM,KAAK,KAAK,KAAK,EACtC,GAAIA,EAAOF,GACT,MAAM,IAAIC,EAA0BC,CAAI,EAE1C,IAAMgB,EAAQ,MAAM,KAAK,KAAK,SAAS,CAAE,OAAAD,CAAO,CAAC,EAC3CE,EAAO,IAAI,YAAY,EAAE,OAC7BD,EAAM,CAAC,IAAM,IAAQA,EAAM,CAAC,IAAM,IAAO,MAAME,EAAMF,CAAK,EAAIA,CAChE,EACA,OAAOG,EAASF,CAAI,CACtB,CACF,CAAC,CAKE,CAEH,MAAc,YACZJ,EACAJ,EACAM,EACA,CACA,IAAIK,EAAK,IACLC,EAAK,KACT,QAAWC,KAAQb,EAAO,CACxB,IAAMc,EAAK,OAAOD,CAAI,EAClB,OAAO,UAAUC,CAAE,IACrBH,EAAK,KAAK,IAAIA,EAAIG,CAAE,EACpBF,EAAK,KAAK,IAAIA,EAAIE,CAAE,EAExB,CACA,IAAMrB,EAAuB,CAAC,EAC9B,OAAIkB,GAAMC,GAGR,MAAMR,EAAM,SAAS,SAAUO,EAAIC,EAAK,EAAG,CACzC,OAAAN,EACA,aAAcS,GAAQ,CACpB,IAAMhB,EAASiB,EAAaD,CAAI,EAC5BhB,GAAUD,GAAQC,EAAQC,CAAK,GACjCP,EAAQ,KAAKM,CAAM,CAEvB,CACF,CAAC,EAEIN,CACT,CAEA,MAAM,UACJO,EACA,CAAE,OAAAM,CAAO,EAA8B,CAAC,EACrB,CACnB,IAAMb,EAAU,KAAK,MACjB,MAAM,KAAK,YAAY,KAAK,MAAOO,EAAOM,CAAM,GAC/C,MAAM,KAAK,MAAM,CAAE,OAAAA,CAAO,CAAC,GAAG,OAAOW,GAAKnB,GAAQmB,EAAGjB,CAAK,CAAC,EAChE,MAAO,CAAE,QAASR,GAAOC,EAASL,EAAS,EAAG,MAAOK,EAAQ,MAAO,CACtE,CACF,EC5DO,IAAMyB,EAAN,cAAoC,KAAM,CAG/C,YAAYC,EAAqB,CAC/B,MACEA,IAAe,OACX,uKACA,uEAAuEA,CAAU,qGACvF,EAPF,KAAS,KAAO,uBAQhB,CACF,EAwBMC,EAAN,cAAmC,KAAM,CAGvC,YAAYC,EAAsBC,EAAgB,CAChD,MACE,sCAAsCA,CAAM,iBAAiBD,CAAY,kEAAkEC,CAAM,6CACnJ,EALF,KAAS,KAAO,sBAMhB,CACF,EAUA,SAASC,GAAWC,EAAgBC,EAA8B,CAChE,MAAO,GAAGC,EAAgBF,CAAI,CAAC,IAAIA,EAAK,MAAM,IAAIC,EAAU,MAAM,IAAI,IAAIA,EAAU,MAAM,MAAM,EAClG,CAEA,SAASE,GAAgB,CACvB,UAAAF,EACA,aAAAJ,EACA,QAAAO,EACA,KAAAC,CACF,EAKG,CACD,GAAM,CAAE,SAAAC,EAAU,OAAAC,EAAQ,OAAAC,EAAQ,MAAAC,CAAM,EAAIR,EAC5C,GAAI,EAAAM,GAAUD,GAEP,CACL,GAAM,CAAE,KAAAN,EAAM,SAAAU,EAAU,OAAAC,CAAO,EAAIV,EAC7BW,EAAKb,GAAWC,EAAMC,CAAS,EAC/BY,EAAgC,CACpC,SAAUD,EACV,aAAAf,EACA,QAAAO,EACA,MAAOE,EACP,IAAKC,EACL,KAAM,QACN,OAAQC,IAAW,IAAM,GAAK,EAC9B,MAAOC,EACP,UAAWG,EACX,KAAM,CACJ,QAASZ,EAAK,OACd,MAAOU,EACP,IAAKC,EACL,aAAcN,CAChB,CACF,EACA,OAAO,IAAIS,GAAeD,CAAI,CAChC,CACF,CAIA,SAASE,GAAY,CACnB,KAAAC,EACA,KAAAX,EACA,SAAAY,CACF,EAIG,CACD,OAAOC,GAAa,CAClB,OAAQ,CACN,KAAM,GAAGhB,EAAgBc,EAAK,MAAM,CAAC,IAAIA,EAAK,OAAO,MAAM,GAC3D,aAAcX,EACd,QAASW,EAAK,OAAO,OACrB,MAAOA,EAAK,YACZ,IAAKA,EAAK,SACZ,EACA,MAAO,CACL,KAAM,GAAGd,EAAgBc,EAAK,KAAK,CAAC,IAAIA,EAAK,MAAM,MAAM,GACzD,aAAcC,EACd,QAASD,EAAK,MAAM,OACpB,MAAOA,EAAK,WACZ,IAAKA,EAAK,QACZ,EACA,OAAQA,EAAK,OACb,MAAOA,EAAK,MACZ,QAASA,EAAK,QACd,QAASA,EAAK,OAChB,CAAC,CACH,CAGA,IAAMG,GAAgB,KAQf,SAASC,GAAcC,EAAuBC,EAAmB,CACtE,IAAMC,EAAS,IAAI,IACnB,QAAWC,KAAYH,EACrB,OAAW,CAAE,KAAArB,EAAM,MAAAyB,EAAO,IAAAC,CAAI,IAAKF,EAAS,UAAU,EAAG,CACvD,IAAMG,EAASzB,EAAgBF,CAAI,EACnC,GAAIsB,EAAK,IAAIK,CAAM,EAAG,CACpB,IAAMC,EAAM,GAAGD,CAAM,IAAI3B,EAAK,MAAM,GAC9B6B,EAAQN,EAAO,IAAIK,CAAG,EACxBC,EACFA,EAAM,KAAK,CAACJ,EAAOC,CAAG,CAAC,EAEvBH,EAAO,IAAIK,EAAK,CAAC,CAACH,EAAOC,CAAG,CAAC,CAAC,CAElC,CACF,CAEF,IAAII,EAAS,EACb,QAAWD,KAASN,EAAO,OAAO,EAAG,CACnCM,EAAM,KAAK,CAACE,EAAGC,IAAMD,EAAE,CAAC,EAAIC,EAAE,CAAC,CAAC,EAChC,QAASC,EAAI,EAAGA,EAAIJ,EAAM,OAAQI,IAAK,CACrC,IAAMC,EAAML,EAAMI,CAAC,EAAG,CAAC,EAAIJ,EAAMI,EAAI,CAAC,EAAG,CAAC,EACtCC,EAAM,GAAKA,GAAOf,KACpBW,EAAS,KAAK,IAAIA,EAAQI,CAAG,EAEjC,CACF,CACA,OAAOJ,CACT,CAIA,SAASK,EAAaC,EAAgBC,EAAc,CAClD,OAAID,aAAiBE,IACnBF,EAAM,QAAU,oBAAoBG,EAAgBH,EAAM,MAAM,CAAC,WAAWC,CAAI,IAE3ED,CACT,CAGA,IAAMI,GAAWC,IAAoB,CACnC,GAAGA,EACH,MAAO,KAAK,MAAMA,EAAO,KAAK,EAC9B,IAAK,KAAK,KAAKA,EAAO,GAAG,CAC3B,GAEqBC,EAArB,cAAmDC,EAAoD,CAAvG,kCACE,KAAQ,MAAQC,EAAY,CAC1B,MAAO,6BACP,MAAO,SAAY,CACjB,IAAMC,EAAsB,KAAK,QAAQ,eAAe,EAClDC,EAA2B,KAAK,QAAQ,wBAAwB,EAChEC,EAAYC,EAAcF,CAAU,EACtC,CAAE,SAAUA,CAAW,EACvB,MAAMG,GAAcJ,EAAO,KAAK,aAAa,EAC3CK,EAAgBH,EAAU,SAC1BI,EAAK,MAAMC,EAAQ,KAAK,CAC5B,OAAQC,EAAaR,EAAO,KAAK,aAAa,EAC9C,eAAgBK,EACZG,EAAaH,EAAe,KAAK,aAAa,EAC9C,MACN,CAAC,EACKpD,EAAS,KAAK,QAAQ,eAAe,EAAE,CAAC,EAC9C,GAAIA,IAAW,OACb,MAAM,IAAI,MACR,8GACF,EAEF,IAAMwD,EAAmB,MAAMC,EAAmBJ,CAAE,EAC9CK,EAAkBC,EAAuB,CAC7C,WAAY,KAAK,QAAQ,iBAAiB,EAC1C,aAAcC,EAAmB,KAAM5D,CAAM,EAC7C,iBAAAwD,CACF,CAAC,EACD,MAAO,CACL,GAAAH,EACA,OAAArD,EACA,gBAAA0D,EACA,iBAAAF,EACA,gBAAiBP,EAAU,UAC7B,CACF,CACF,CAAC,EA8JD,KAAQ,IAAMH,EAAY,CACxB,MAAO,gBACP,MAAO,SAAY,CACjB,IAAMe,EAAyB,KAAK,QAAQ,eAAe,EACrDC,EAAsB,KAAK,QAAQ,CAAC,aAAc,UAAU,CAAC,EACnE,OAAOZ,EAAcW,CAAQ,EACzB,IAAIE,EACFR,EAAaM,EAAU,KAAK,aAAa,EACzCX,EAAcY,CAAK,EACfE,GAAc,KAAM,CAAC,eAAe,EAAG,CAAC,YAAY,CAAC,EACrD,MACN,EACA,MACN,CACF,CAAC,EAtKD,MAAc,eACZ1D,EACA2D,EACgC,CAChC,GAAM,CAAE,GAAAZ,EAAI,gBAAAK,CAAgB,EAAI,MAAM,KAAK,MAAMO,CAAI,EACrD,OAAOC,EAAmBb,EAAIK,EAAiBpD,CAAO,CACxD,CAOA,MAAM,cAAc2D,EAAoB,CAAC,EAA4B,CACnE,GAAM,CAAE,GAAAZ,EAAI,iBAAAG,CAAiB,EAAI,MAAM,KAAK,MAAMS,CAAI,EAChDE,EAAW,IAAI,IACrB,QAAWC,KAAQ,MAAMf,EAAG,MAAM,EAAG,CACnC,IAAMxB,EAASzB,EAAgBgE,EAAK,IAAI,EAClCC,EAAQF,EAAS,IAAItC,CAAM,EAC7BwC,EACGA,EAAM,QAAQ,SAASD,EAAK,KAAK,MAAM,GAC1CC,EAAM,QAAQ,KAAKD,EAAK,KAAK,MAAM,EAGrCD,EAAS,IAAItC,EAAQ,CACnB,OAAAA,EACA,OAAQuC,EAAK,KAAK,OAClB,UAAWA,EAAK,KAAK,UACrB,QAAS,CAACA,EAAK,KAAK,MAAM,EAC1B,YAAaZ,EAAiB,SAASY,EAAK,KAAK,MAAM,CACzD,CAAC,CAEL,CACA,MAAO,CAAC,GAAGD,EAAS,OAAO,CAAC,CAC9B,CAOA,MAAM,UAAUF,EAAoB,CAAC,EAAG,CACtC,GAAM,CAAE,OAAAjE,EAAQ,gBAAA0D,CAAgB,EAAI,MAAM,KAAK,MAAMO,CAAI,EACnDK,EAAcC,EAAsB,IAAI,EACxCC,EAAyB,CAAC,EAChC,QAAWC,KAAa,MAAM,KAAK,cAAcR,CAAI,EAC/CQ,EAAU,SAAWf,GACvBc,EAAM,KAAK,CACT,KAAME,EAAiBJ,EAAaG,EAAU,MAAM,EACpD,MAAOA,EAAU,OACjB,MAAOA,EAAU,MACnB,CAAC,EAGL,MAAO,CACL,cAAe,GACf,mBAAoBzE,EACpB,MAAAwE,CACF,CACF,CAEA,MAAM,YAAYP,EAAoB,CAAC,EAAG,CACxC,GAAM,CAAE,GAAAZ,EAAI,OAAArD,EAAQ,gBAAA0D,CAAgB,EAAI,MAAM,KAAK,MAAMO,CAAI,EACvD,CAAE,aAAAlE,CAAa,EAAIkE,EACnBpC,EACJ9B,IAAiBC,EACb,OACA4D,EAAmB,KAAM7D,CAAY,EACrC4E,GAAW,MAAMtB,EAAG,MAAM,GAC7B,OAAOe,GACNrE,IAAiBC,EACboE,EAAK,WAAaA,EAAK,KAAK,SAAWV,EACvCkB,EAAmBxE,EAAgBgE,EAAK,IAAI,EAAGvC,CAAM,CAC3D,EACC,IAAIuC,GAAQA,EAAK,KAAK,MAAM,EAC/B,MAAO,CAAC,GAAG,IAAI,IAAIO,CAAO,CAAC,CAC7B,CAcQ,cACNE,EACAC,EACA,CACA,IAAMC,EACJF,IAAe,QAAaA,EAAW,SAAW,EAC9C,OACAA,EAAW,IAAItE,GAAQqD,EAAmB,KAAMrD,CAAI,CAAC,EAC3D,OAAOwE,IAAmB,QAAaD,IAAiB,OACpD,OACC5E,GACC8E,EAAgB9E,EAAM6E,CAAc,IACnCD,IAAiB,QAChBF,EAAmBxE,EAAgBF,CAAI,EAAG4E,CAAY,EAChE,CAeA,MAAM,YAAYnC,EAAgBsB,EAA+B,CAAC,EAAG,CACnE,GAAM,CAAE,OAAAgB,CAAO,EAAIhB,EACb,CAAE,GAAAZ,EAAI,OAAArD,EAAQ,gBAAA0D,EAAiB,gBAAAwB,CAAgB,EAAI,MAAM,KAAK,MAAM,CACxE,OAAAD,CACF,CAAC,EACK,CAAE,aAAAlF,EAAc,QAAAO,EAAS,MAAAqB,EAAO,IAAAC,CAAI,EAAIc,GAAQC,CAAM,EAC5D,GAAI5C,IAAiBC,EACnB,MAAM,IAAIF,EAAqBC,EAAcC,CAAM,EAErD,IAAMmF,EAAQ,MAAM,KAAK,eAAe7E,EAAS,CAAE,OAAA2E,CAAO,CAAC,EAC3D,GAAI,CAACE,EACH,MAAM,IAAI,MACR,GAAGzB,CAAe,wBAAwBpD,CAAO,gBACnD,EAEF,IAAM8E,EAAO,KAAK,cAAcnB,EAAK,UAAU,EAC/C,GAAImB,IAAS,QAAa,CAAC/B,EAAG,kBAC5B,MAAM,IAAIzD,EAAsBsF,CAAe,EAEjD,IAAMG,EAAM,MAAMC,EAAgBjC,EAAI8B,EAAOxD,EAAOC,EAAK,CACvD,QAAS,KAAK,QAAQ,SAAS,EAC/B,OAAQqC,EAAK,QAAU,KAAK,QAAQ,gBAAgB,EACpD,MAAO,KAAK,QAAQ,WAAW,EAC/B,OAAQA,EAAK,OACb,KAAAmB,CACF,CAAC,EAAE,MAAO9C,GAAmB,CAC3B,MAAMD,EAAaC,EAAO,WAAW,CACvC,CAAC,EACD,OAAO,OAAO+C,GAAQ,SAClBA,EACAE,GAAWF,EAAK,CAAE,MAAA1D,EAAO,IAAAC,CAAI,EAAGqC,EAAK,QAAQ,CACnD,CAsBA,MAAM,SACJuB,EACAvB,EAAoB,CAAC,EACF,CACnB,IAAMwB,EAAM,MAAM,KAAK,IAAIxB,CAAI,EAC/B,OAAOwB,EACHA,EAAI,UAAU,IAAI,IAAID,CAAS,EAAGvB,CAAI,EACtC,CAAE,QAAS,CAAC,EAAG,MAAO,CAAE,CAC9B,CAEA,MAAc,eACZlE,EACAkE,EACyB,CACzB,IAAMpC,EAAS+B,EAAmB,KAAM7D,CAAY,EACpD,OAAQ,MAAM,KAAK,cAAckE,CAAI,GAAG,OAAOQ,GAC7CG,EAAmBH,EAAU,OAAQ5C,CAAM,CAC7C,CACF,CAEA,MAAc,eAAec,EAAgBsB,EAA0B,CACrE,GAAM,CAAE,GAAAZ,CAAG,EAAI,MAAM,KAAK,MAAMY,CAAI,EAC9B,CAAE,aAAAlE,EAAc,QAAAO,EAAS,MAAAqB,EAAO,IAAAC,CAAI,EAAIe,EACxCmC,EAAelB,EAAmB,KAAMK,EAAK,kBAAkB,EAC/DK,EAAcC,EAAsB,IAAI,EACxCa,EAAO,KAAK,cAAcnB,EAAK,WAAYa,CAAY,EACvDK,EAAQ,MAAM,KAAK,eAAe7E,EAAS2D,CAAI,EAC/CyB,EAAoB,KAAK,QAAQ,WAAW,EAyBlD,OAxBmBP,EACf,MAAMQ,EACJ,iBAAiBrF,CAAO,IAAIqB,EAAM,eAAe,CAAC,IAAIC,EAAI,eAAe,CAAC,GAC1EqC,EAAK,eACL,IACEZ,EACG,cAAc,CACb,KAAM8B,EACN,MAAAxD,EACA,IAAAC,EACA,QAAS,KAAK,QAAQ,SAAS,EAC/B,WAAY,MACZ,MAAO8D,EACP,OAAQzB,EAAK,OACb,KAAAmB,CACF,CAAC,EACA,MAAO9C,GAAmB,CACzB,MAAMD,EACJuD,EAAetD,EAAOoD,EAAW9D,EAAMD,CAAK,GAAKW,EACjD,OACF,CACF,CAAC,CACP,EACA,CAAC,GACa,QAAQnC,GAAa,CACrC,IAAM0F,EAAU1F,EAAU,SACtBE,GAAgB,CACd,UAAAF,EACA,aAAAJ,EACA,QAAAO,EACA,KAAMoE,EACJJ,EACAlE,EAAgBD,EAAU,IAAI,CAChC,CACF,CAAC,EACD,OACJ,OAAO0F,IAAY,OAAY,CAAC,EAAI,CAACA,CAAO,CAC9C,CAAC,CACH,CAWA,MAAc,aACZlD,EACAmD,EACA7B,EACA,CACA,GAAM,CAAE,GAAAZ,CAAG,EAAI,MAAM,KAAK,MAAMY,CAAI,EAC9B,CAAE,QAAA3D,EAAS,MAAAqB,EAAO,IAAAC,CAAI,EAAIe,EAQ1BoD,GAPQ,MAAM,QAAQ,IAC1BD,EAAM,IAAI,MAAM5E,IAAS,CACvB,KAAAA,EACA,YAAa,MAAM,KAAK,eAAeA,EAAK,kBAAmB+C,CAAI,EACnE,SAAU,MAAM,KAAK,eAAe/C,EAAK,mBAAoB+C,CAAI,CACnE,EAAE,CACJ,GACyB,OACvB,CAAC,CAAE,YAAA+B,EAAa,SAAAC,CAAS,IACvBD,EAAY,OAAS,GAAKC,EAAS,OAAS,CAChD,EACMzE,EAAO,IAAI,IACfuE,EAAW,QAAQ,CAAC,CAAE,YAAAC,EAAa,SAAAC,CAAS,IAC1C,CAAC,GAAGD,EAAa,GAAGC,CAAQ,EAAE,IAAI7F,CAAe,CACnD,CACF,EACM+E,EAAQ,MAAM,KAAK,eAAe7E,EAAS2D,CAAI,EAC/CyB,EAAoB,KAAK,QAAQ,WAAW,EAC5CQ,EAAsB,KAAK,QAAQ,SAAS,EAC5Cb,EAAM,CAACjB,EAAiB+B,IAC5B9C,EAAG,aAAa,CACd,KAAAe,EACA,MAAAzC,EACA,IAAAC,EACA,QAAAuE,EACA,OAAQ,KAAK,QAAQ,gBAAgB,EACrC,WAAY,MACZ,MAAOT,EACP,OAAQzB,EAAK,OACb,KAAM/D,GAAQsB,EAAK,IAAIpB,EAAgBF,CAAI,CAAC,CAC9C,CAAC,EAEGkG,EAAU,MAAOhC,GAAoB,CACzC,IAAM7C,EAAY,MAAM8D,EAAIjB,EAAM8B,CAAW,EAAE,MAAO5D,GAAmB,CACvE,MAAMD,EACJuD,EAAetD,EAAOoD,EAAW9D,EAAMD,CAAK,GAAKW,EACjD,OACF,CACF,CAAC,EACKF,EAAMd,GAAcC,EAAWC,CAAI,EACnC2E,EAAU,KAAK,KAAK/D,EAAM,CAAC,EAAI,IACrC,OAAOA,EAAM,GAAK+D,EAAUD,EACxBb,EAAIjB,EAAM+B,CAAO,EAAE,MAAO7D,GAAmB,CAC3C,GAAIA,aAAiB+D,EACnB,OAAO9E,EAET,MAAMe,CACR,CAAC,EACDf,CACN,EAOA,OALE4D,GAASY,EAAW,OAAS,EACzB,MAAMJ,EAAaW,GAAgBR,CAAK,EAAG7B,EAAK,eAAgB,IAC9DmC,EAAQjB,CAAK,CACf,EACA,CAAC,GACU,QAAQzD,GACvBqE,EAAW,QAAQ,CAAC,CAAE,KAAA7E,EAAM,YAAA8E,EAAa,SAAAC,CAAS,IAChDD,EAAY,QAAQO,GAClBN,EAAS,QAAQO,IACf9E,EACG,eAAe,CAAE,OAAA6E,EAAQ,MAAOC,GAAM,MAAO,EAAM,CAAC,EACpD,IAAIrG,IACHc,GAAY,CACV,KAAMd,GACN,KAAMe,EAAK,kBACX,SAAUA,EAAK,kBACjB,CAAC,CACH,CACJ,CACF,CACF,CACF,CACF,CAEA,YAAYuF,EAAexC,EAA2B,CAAC,EAAG,CACxD,IAAMtB,EAASD,GAAQ+D,CAAK,EAC5B,OAAOC,GAA0B,MAAMC,GAAY,CACjD,GAAM,CAAE,GAAAtD,EAAI,OAAArD,EAAQ,gBAAAkF,CAAgB,EAAI,MAAM,KAAK,MAAMjB,CAAI,EAC7D,GAAI,CAACZ,EAAG,kBACN,MAAM,IAAIzD,EAAsBsF,CAAe,EAIjD,GAAIvC,EAAO,eAAiB3C,EAAQ,CAClC,IAAM8F,EAAQc,GAAe3C,CAAI,EAC3B4C,EACJf,EAAM,OAAS,EACX,MAAM,KAAK,aAAanD,EAAQmD,EAAO7B,CAAI,EAC3C,MAAM,KAAK,eAAetB,EAAQsB,CAAI,EAC5C,QAAW4B,KAAWgB,EACpBF,EAAS,KAAKd,CAAO,CAEzB,CACAc,EAAS,SAAS,CACpB,EAAG1C,EAAK,MAAM,CAChB,CACF",
-  "names": ["haplotypeIndexBeside", "db", "GBZ_DB", "siblingCompanion", "gbzDb", "readsSiblings", "haplotypeIndexBeside", "locationName", "renamed", "name", "isMissing", "error", "findCompanion", "pluginManager", "candidate", "openLocation", "MAX_READS", "MAX_UNINDEXED_BYTES", "UnindexedGafTooLargeError", "size", "sample", "records", "max", "stride", "_", "k", "touches", "record", "names", "step", "GafFile", "file", "tabix", "cachedSetup", "signal", "bytes", "text", "unzip", "parseGaf", "lo", "hi", "name", "id", "line", "parseGafLine", "r", "NoHaplotypeIndexError", "unreadable", "HaplotypeWindowError", "assemblyName", "anchor", "fragmentId", "name", "alignment", "haplotypePrefix", "fragmentFeature", "refName", "lane", "refStart", "refEnd", "strand", "cigar", "hapStart", "hapEnd", "id", "data", "SyntenyFeature", "pairFeature", "pair", "mateLane", "matchFeature", "BRIDGE_MAX_BP", "widestWalkGap", "subgraphs", "kept", "byPath", "subgraph", "start", "end", "prefix", "key", "spans", "widest", "a", "b", "i", "gap", "zoomInNotice", "error", "what", "NodeLimitError", "getBpDisplayStr", "wholeBp", "region", "GbzBaseSyntenyAdapter", "ComparativeAdapterBase", "cachedSetup", "gbzDb", "configured", "companion", "locationIsSet", "findCompanion", "indexLocation", "db", "GBZBase", "openLocation", "referenceSamples", "referenceSamplesOf", "referenceSample", "resolveReferenceSample", "resolvePanSNPrefix", "location", "index", "GafFile", "openTabixSlot", "opts", "referencePathQuery", "byPrefix", "path", "entry", "asmByPrefix", "assemblyByPanSNPrefix", "lanes", "haplotype", "laneAssemblyName", "contigs", "panSNMatchesPrefix", "haplotypes", "targetPrefix", "wantedPrefixes", "haplotypeWanted", "signal", "unreadableIndex", "query", "keep", "cut", "cutWindowTables", "walkCutFor", "nodeNames", "gaf", "nodeLimit", "updateStatus", "nodeLimitError", "feature", "pairs", "answerable", "featureSide", "mateSide", "baseContext", "context", "bridged", "SubgraphLimitError", "lanePairsStatus", "target", "mate", "asked", "ObservableCreate", "observer", "requestedPairs", "features"]
-}

package/dist/chunks/WalkTabixSyntenyAdapter-PQ4LGBPO.js

@@ -1,2 +0,0 @@
-import{a as G}from"./chunk-ZNT7TQLN.js";import{a as z}from"./chunk-PJ43KEV6.js";import{b as j,d as H,e as D,f as E,g as X}from"./chunk-IJJZC7A4.js";import{a as $}from"./chunk-KOB7YIMR.js";import{p as W,q as R,r as I}from"./chunk-T4HOC6O3.js";import"./chunk-PFAHNHMM.js";import"./chunk-VDHDEEMF.js";import{e as q,m as T,o as _}from"./chunk-EDSIYH4H.js";import"./chunk-YBLNN5FU.js";import"./chunk-MVVXRZXV.js";import{a as F,c as v,d as S,g as P,h as k,i as x}from"./chunk-GUXZESDR.js";import"./chunk-T4R3ZVEM.js";import"./chunk-7WIBGKBU.js";import"./chunk-OGQ6OQDN.js";import"./chunk-NDRLCGPC.js";import{o as C}from"./chunk-TENPGIPX.js";var ee=50;function te(i){let o=[];for(let e=0;e<i.length;e++){let[t,s]=i[e],[n,a]=i[e+1]??[];s===a&&s<=ee&&(t==="I"&&n==="D"||t==="D"&&n==="I")?(o.push(["X",s]),e++):o.push([t,s])}return o}function M(i){return Array.from(i.ids,(o,e)=>2*o+i.rev[e])}function K(i,o){let e=i.get(o);return e===void 0?0:e.end-e.start}function U(i){let o=new Map,e=n=>{let a=K(i,n),r=o.get(a);return r===void 0&&(r="N".repeat(a),o.set(a,r)),r},t=new Map,s=n=>{let a=t.get(n);return a===void 0&&(a=M(n),t.set(n,a)),a};return(n,a)=>R({query:s(n),target:s(a),sequenceOf:e,bases:!1})}var ae=100;function O(i,o,e){let t=i.at(-1);e>0&&(t?.[0]===o?t[1]+=e:i.push([o,e]))}function J(i){let o=t=>K(i,t>>1),e=t=>{let s=new Float64Array(t.length+1);return t.forEach((n,a)=>{s[a+1]=s[a]+o(n)}),s};return(t,s)=>{let n=M(s),a=M(t),[r,f]=W(a,n,o),[g,y]=W(a.map(u=>u^1).reverse(),n,o),l=y>f,p=l?g:r,N=Math.max(f,y);if(N<ae)return[];let h=e(n),c=e(a),b=u=>l?a.length-1-p[u][0]:p[u][0],m=[];p.forEach(([,u],w)=>{if(w>0){let[Q,V]=[b(w-1),b(w)].sort((Y,Z)=>Y-Z);O(m,"I",c[V]-c[Q+1]),O(m,"D",h[u]-h[p[w-1][1]+1])}O(m,"=",o(n[u]))});let[d,A]=[b(0),b(p.length-1)].sort((u,w)=>u-w);return[{queryStart:c[d],queryEnd:c[A+1],targetStart:h[p[0][1]],targetEnd:h[p.at(-1)[1]+1],strand:l?"-":"+",edits:m,sharedBases:N}]}}function B({chain:i,target:o,query:e,assemblyName:t,refName:s,mateAssemblyName:n}){let a=te(i.edits);return X({target:{name:o.name,assemblyName:t,refName:s,start:o.hapStart+i.targetStart,end:o.hapStart+i.targetEnd},query:{name:e.name,assemblyName:n,refName:S(e.name),start:e.hapStart+i.queryStart,end:e.hapStart+i.queryEnd},strand:i.strand,cigar:I(a),matches:a.reduce((r,[f,g])=>r+(f==="="?g:0),0),columns:a.reduce((r,[,f])=>r+f,0)})}var ne=i=>v(i.name)??i.name,L=class extends j{constructor(){super(...arguments);this.walks=new G(T(this,["walksLocation"],["walksIndex"]),this);this.refNames=new _(this.walks.file,this)}get anchor(){let e=this.getConf("assemblyNames")[0];if(e===void 0)throw new Error("WalkTabixSyntenyAdapter needs assemblyNames: its first entry is the assembly the reference sample is loaded as");return e}async getHaplotypeNames(e={}){return this.walks.haplotypeNames(e)}async getHeader(e={}){let{haplotypes:t}=await this.walks.reader.header(e),{anchor:s}=this,n=k(this,s),a=x(this);return{hasCoarseTier:!1,anchorAssemblyName:s,lanes:t.filter(r=>r!==n&&F(r)!==n).map(r=>({name:E(a,r),label:r,group:F(r)}))}}async getRefNames(e={}){let{assemblyName:t}=e;return t===void 0||t===this.anchor?this.refNames.assemblyRefNames({...e,assemblyName:this.anchor}):[]}async getSubgraph(e,t={}){let s=await this.refNames.resolve(e,{signal:t.signal});if(s===void 0)throw new Error(`${e.assemblyName} ${e.refName} is not in this graph's index; the graph is cut on ${this.anchor}, mapped to its PanSN prefix in assemblyNameToPanSN`);return this.walks.subgraph(s,e,t)}async laneWalks(e,t,s,n,a){return C(a,n.statusCallback,()=>this.walks.reader.cut(e,t,{...this.walks.budgets(),signal:n.signal,keep:q(s,e),links:!1}).catch(r=>{throw z(r)&&r instanceof Error&&(r.message=r.message.replace("to see the graph","to see lanes")),r}))}async anchorFeatures(e,t,s){let n=s.haplotypes?.length?s.haplotypes.map(m=>k(this,m)):void 0,a=k(this,s.targetAssemblyName),r=a===void 0?n:n===void 0||n.some(m=>P(a,m)||P(m,a))?[a]:[];if(r?.length===0)return[];let{start:f,end:g}=t,{graph:y,fragments:l}=await this.laneWalks(e,t,r,s,`Reading walks ${t.refName}:${f.toLocaleString()}-${g.toLocaleString()}`),p=J(y.nodes),N=x(this),h=l.filter(m=>m.name===e),c=m=>r===void 0?0:r.findIndex(d=>P(m.name,d));return l.filter(m=>m.name!==e&&c(m)>=0).sort((m,d)=>c(m)-c(d)).flatMap(m=>h.flatMap(d=>p(m,d).map(A=>B({chain:A,target:d,query:m,assemblyName:t.assemblyName,refName:t.refName,mateAssemblyName:E(N,ne(m))}))))}async pairFeatures(e,t,s,n){let a=s.map(l=>({pair:l,featurePrefix:k(this,l.queryAssemblyName),matePrefix:k(this,l.targetAssemblyName)})),{graph:r,fragments:f}=await this.laneWalks(e,t,a.flatMap(l=>[l.featurePrefix,l.matePrefix]),n,D(s)),g=U(r.nodes),y=l=>f.filter(p=>P(p.name,l));return a.flatMap(({pair:l,featurePrefix:p,matePrefix:N})=>y(p).flatMap(h=>y(N).flatMap(c=>g(c,h).map(b=>B({chain:b,target:h,query:c,assemblyName:l.queryAssemblyName,refName:S(h.name),mateAssemblyName:l.targetAssemblyName})))))}getFeatures(e,t={}){return $(async s=>{let n=e.assemblyName===this.anchor?await this.refNames.resolve(e,t):void 0;if(n!==void 0){let a=H(t),r=a.length>0?await this.pairFeatures(n,e,a,t):await this.anchorFeatures(n,e,t);for(let f of r)s.next(f)}s.complete()},t.signal)}};export{L as default};
-//# sourceMappingURL=WalkTabixSyntenyAdapter-PQ4LGBPO.js.map

package/dist/chunks/WalkTabixSyntenyAdapter-PQ4LGBPO.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../src/WalkTabixSyntenyAdapter/walkLanes.ts", "../../src/WalkTabixSyntenyAdapter/WalkTabixSyntenyAdapter.ts"],
-  "sourcesContent": ["import { weightedLcs } from '@gmod/gbz-base/lcs'\nimport { pairAlignments, pairCigar } from '@gmod/gbz-base/pairAlignment'\nimport { panSNContig } from '@jbrowse/bandage-core/pansn'\n\nimport { matchFeature } from '../synteny/matchFeature.ts'\n\nimport type { PairChain, PairEdit } from '@gmod/gbz-base/pairAlignment'\nimport type { WalkFragment, WalkNode } from '@jbrowse/graph-walks'\n\n// The longest bubble with equal bases on both sides that is written as\n// mismatches; a longer one stays an insertion and a deletion\nconst BALANCED_BUBBLE_MAX_BP = 50\n\n/**\n * A chain's edits with each short balanced bubble as `X`. The walks carry no\n * bases, so two walks differ wherever they leave a shared node, and a SNP is\n * one base inserted and one deleted until it is read as the mismatch it is.\n */\nexport function bubblesAsMismatches(edits: PairEdit[]) {\n  const out: PairEdit[] = []\n  for (let i = 0; i < edits.length; i++) {\n    const [op, len] = edits[i]!\n    const [nextOp, nextLen] = edits[i + 1] ?? []\n    if (\n      len === nextLen &&\n      len <= BALANCED_BUBBLE_MAX_BP &&\n      ((op === 'I' && nextOp === 'D') || (op === 'D' && nextOp === 'I'))\n    ) {\n      out.push(['X', len])\n      i++\n    } else {\n      out.push([op, len])\n    }\n  }\n  return out\n}\n\n// A walk's steps as the handles gbz-base reads, 2 * id + reversed\nfunction handlesOf(fragment: WalkFragment) {\n  return Array.from(fragment.ids, (id, i) => 2 * id + fragment.rev[i]!)\n}\n\nfunction nodeLength(nodes: Map<number, WalkNode>, id: number) {\n  const node = nodes.get(id)\n  return node === undefined ? 0 : node.end - node.start\n}\n\n/**\n * Aligns one walk fragment to another on the nodes both visit, from node\n * lengths alone: the fragments' steps as the handles gbz-base's chainer reads,\n * and a stand-in sequence of each node's length.\n */\nexport function walkAligner(nodes: Map<number, WalkNode>) {\n  const standIn = new Map<number, string>()\n  const sequenceOf = (id: number) => {\n    const length = nodeLength(nodes, id)\n    let sequence = standIn.get(length)\n    if (sequence === undefined) {\n      sequence = 'N'.repeat(length)\n      standIn.set(length, sequence)\n    }\n    return sequence\n  }\n  const handles = new Map<WalkFragment, number[]>()\n  const cachedHandles = (fragment: WalkFragment) => {\n    let steps = handles.get(fragment)\n    if (steps === undefined) {\n      steps = handlesOf(fragment)\n      handles.set(fragment, steps)\n    }\n    return steps\n  }\n  return (query: WalkFragment, target: WalkFragment) =>\n    pairAlignments({\n      query: cachedHandles(query),\n      target: cachedHandles(target),\n      sequenceOf,\n      bases: false,\n    })\n}\n\n// The fewest bases on shared nodes a record against the reference keeps,\n// gbz-base's floor for a pair record\nconst MIN_MATCH_BP = 100\n\nfunction appendEdit(edits: PairEdit[], op: PairEdit[0], len: number) {\n  const last = edits.at(-1)\n  if (len > 0) {\n    if (last?.[0] === op) {\n      last[1] += len\n    } else {\n      edits.push([op, len])\n    }\n  }\n}\n\n/**\n * Aligns a haplotype's walk fragment to the reference's as gbz-base aligns a\n * walk to its reference path: the heaviest common subsequence of their steps,\n * each node weighing its length, read in whichever direction shares more. A\n * pair chain leaves out every node either walk passes twice, which is the\n * whole of a collapsed copy-number array (amylase, KIV-2); the subsequence\n * matches one pass over it, and the other copies are insertions.\n */\nexport function referenceAligner(nodes: Map<number, WalkNode>) {\n  const lengthOf = (handle: number) => nodeLength(nodes, handle >> 1)\n  const offsets = (handles: number[]) => {\n    const out = new Float64Array(handles.length + 1)\n    handles.forEach((handle, i) => {\n      out[i + 1] = out[i]! + lengthOf(handle)\n    })\n    return out\n  }\n\n  return (query: WalkFragment, target: WalkFragment): PairChain[] => {\n    const ref = handlesOf(target)\n    const hap = handlesOf(query)\n    const [same, sameWeight] = weightedLcs(hap, ref, lengthOf)\n    const [turned, turnedWeight] = weightedLcs(\n      hap.map(handle => handle ^ 1).reverse(),\n      ref,\n      lengthOf,\n    )\n    const reverse = turnedWeight > sameWeight\n    const pairs = reverse ? turned : same\n    const sharedBases = Math.max(sameWeight, turnedWeight)\n    if (sharedBases < MIN_MATCH_BP) {\n      return []\n    }\n    const refAt = offsets(ref)\n    const hapAt = offsets(hap)\n    // a pair's haplotype step, counted along the haplotype\n    const stepOf = (k: number) =>\n      reverse ? hap.length - 1 - pairs[k]![0] : pairs[k]![0]\n    const edits: PairEdit[] = []\n    pairs.forEach(([, r], k) => {\n      if (k > 0) {\n        const [lo, hi] = [stepOf(k - 1), stepOf(k)].sort((x, y) => x - y)\n        appendEdit(edits, 'I', hapAt[hi!]! - hapAt[lo! + 1]!)\n        appendEdit(edits, 'D', refAt[r]! - refAt[pairs[k - 1]![1] + 1]!)\n      }\n      appendEdit(edits, '=', lengthOf(ref[r]!))\n    })\n    const [lo, hi] = [stepOf(0), stepOf(pairs.length - 1)].sort((x, y) => x - y)\n    return [\n      {\n        queryStart: hapAt[lo!]!,\n        queryEnd: hapAt[hi! + 1]!,\n        targetStart: refAt[pairs[0]![1]]!,\n        targetEnd: refAt[pairs.at(-1)![1] + 1]!,\n        strand: reverse ? '-' : '+',\n        edits,\n        sharedBases,\n      },\n    ]\n  }\n}\n\n/**\n * One record of a walk aligned to another, with its short balanced bubbles as\n * mismatches\n */\nexport function chainFeature({\n  chain,\n  target,\n  query,\n  assemblyName,\n  refName,\n  mateAssemblyName,\n}: {\n  chain: PairChain\n  target: WalkFragment\n  query: WalkFragment\n  assemblyName: string\n  refName: string\n  mateAssemblyName: string\n}) {\n  const edits = bubblesAsMismatches(chain.edits)\n  return matchFeature({\n    target: {\n      name: target.name,\n      assemblyName,\n      refName,\n      start: target.hapStart + chain.targetStart,\n      end: target.hapStart + chain.targetEnd,\n    },\n    query: {\n      name: query.name,\n      assemblyName: mateAssemblyName,\n      refName: panSNContig(query.name),\n      start: query.hapStart + chain.queryStart,\n      end: query.hapStart + chain.queryEnd,\n    },\n    strand: chain.strand,\n    cigar: pairCigar(edits),\n    matches: edits.reduce((sum, [op, n]) => sum + (op === '=' ? n : 0), 0),\n    columns: edits.reduce((sum, [, n]) => sum + n, 0),\n  })\n}\n", "import {\n  assemblyByPanSNPrefix,\n  panSNContig,\n  panSNHaplotype,\n  panSNMatchesPrefix,\n  panSNSample,\n  resolvePanSNPrefix,\n} from '@jbrowse/bandage-core/pansn'\nimport { updateStatus } from '@jbrowse/core/util'\nimport { ObservableCreate } from '@jbrowse/core/util/rxjs'\nimport { walksKept } from '@jbrowse/graph-walks'\n\nimport { chainFeature, referenceAligner, walkAligner } from './walkLanes.ts'\nimport { WalkIndex } from '../RgfaTabixAdapter/walkReader.ts'\nimport { isNodeLimitError } from '../nodeLimitError.ts'\nimport { PanSNRefNames, openTabixSlot } from '../panSNTabix.ts'\nimport { ComparativeAdapterBase } from '../synteny/ComparativeAdapterBase.ts'\nimport {\n  laneAssemblyName,\n  lanePairsStatus,\n  requestedPairs,\n} from '../synteny/lanePairs.ts'\n\nimport type { WalkTabixSyntenyAdapterConfig } from './configSchema.ts'\nimport type { SubgraphAdapterOptions } from '../GetSubgraph.ts'\nimport type { LaneFeatureOptions, LanePair } from '../synteny/lanePairs.ts'\nimport type { BaseOptions } from '@jbrowse/core/data_adapters/BaseAdapter'\nimport type { Feature } from '@jbrowse/core/util'\nimport type { Region } from '@jbrowse/core/util/types'\nimport type { WalkFragment } from '@jbrowse/graph-walks'\n\nconst haplotypeOf = (fragment: WalkFragment) =>\n  panSNHaplotype(fragment.name) ?? fragment.name\n\nexport default class WalkTabixSyntenyAdapter extends ComparativeAdapterBase<WalkTabixSyntenyAdapterConfig> {\n  private readonly walks: WalkIndex = new WalkIndex(\n    openTabixSlot(this, ['walksLocation'], ['walksIndex']),\n    this,\n  )\n  private readonly refNames: PanSNRefNames = new PanSNRefNames(\n    this.walks.file,\n    this,\n  )\n\n  private get anchor() {\n    const anchor = this.getConf('assemblyNames')[0]\n    if (anchor === undefined) {\n      throw new Error(\n        'WalkTabixSyntenyAdapter needs assemblyNames: its first entry is the assembly the reference sample is loaded as',\n      )\n    }\n    return anchor\n  }\n\n  /**\n   * The haplotypes the walk file's header names, `sample#haplotype` in byte\n   * order, or undefined when it names none\n   */\n  async getHaplotypeNames(opts: BaseOptions = {}) {\n    return this.walks.haplotypeNames(opts)\n  }\n\n  /**\n   * `lanes` is every haplotype the header names but the anchor's own,\n   * declared up front so the display can offer the whole graph's haplotypes\n   * before a fetch has placed any of them\n   */\n  async getHeader(opts: BaseOptions = {}) {\n    const { haplotypes } = await this.walks.reader.header(opts)\n    const { anchor } = this\n    const anchorPrefix = resolvePanSNPrefix(this, anchor)\n    const asmByPrefix = assemblyByPanSNPrefix(this)\n    return {\n      hasCoarseTier: false,\n      anchorAssemblyName: anchor,\n      lanes: haplotypes\n        .filter(\n          prefix =>\n            prefix !== anchorPrefix && panSNSample(prefix) !== anchorPrefix,\n        )\n        .map(prefix => ({\n          name: laneAssemblyName(asmByPrefix, prefix),\n          label: prefix,\n          group: panSNSample(prefix),\n        })),\n    }\n  }\n\n  // A lane's contigs are named only in its walk rows, so only the anchor's\n  // are listed\n  async getRefNames(opts: BaseOptions = {}) {\n    const { assemblyName } = opts\n    return assemblyName === undefined || assemblyName === this.anchor\n      ? this.refNames.assemblyRefNames({ ...opts, assemblyName: this.anchor })\n      : []\n  }\n\n  /**\n   * The graph display's cut of the window, as RgfaTabixAdapter cuts a\n   * walk-indexed graph: the reference walk first, then the walks `haplotypes`\n   * asks for, and the nodes and links they visit\n   */\n  async getSubgraph(region: Region, opts: SubgraphAdapterOptions = {}) {\n    const refName = await this.refNames.resolve(region, { signal: opts.signal })\n    if (refName === undefined) {\n      throw new Error(\n        `${region.assemblyName} ${region.refName} is not in this graph's index; the graph is cut on ${this.anchor}, mapped to its PanSN prefix in assemblyNameToPanSN`,\n      )\n    }\n    return this.walks.subgraph(refName, region, opts)\n  }\n\n  // The window's walks for the haplotypes named and the reference, with no\n  // link read; a window past a budget fails as a zoom-in notice for lanes\n  private async laneWalks(\n    refName: string,\n    region: Region,\n    prefixes: string[] | undefined,\n    opts: LaneFeatureOptions,\n    status: string,\n  ) {\n    return updateStatus(status, opts.statusCallback, () =>\n      this.walks.reader\n        .cut(refName, region, {\n          ...this.walks.budgets(),\n          signal: opts.signal,\n          keep: walksKept(prefixes, refName),\n          links: false,\n        })\n        .catch((error: unknown) => {\n          if (isNodeLimitError(error) && error instanceof Error) {\n            error.message = error.message.replace(\n              'to see the graph',\n              'to see lanes',\n            )\n          }\n          throw error\n        }),\n    )\n  }\n\n  /**\n   * One record per stretch a haplotype's walk shares with the reference's,\n   * on the reference with the haplotype as its mate\n   */\n  private async anchorFeatures(\n    refName: string,\n    region: Region,\n    opts: LaneFeatureOptions,\n  ) {\n    const wanted = opts.haplotypes?.length\n      ? opts.haplotypes.map(lane => resolvePanSNPrefix(this, lane))\n      : undefined\n    const target = resolvePanSNPrefix(this, opts.targetAssemblyName)\n    const prefixes =\n      target === undefined\n        ? wanted\n        : wanted === undefined ||\n            wanted.some(\n              prefix =>\n                panSNMatchesPrefix(target, prefix) ||\n                panSNMatchesPrefix(prefix, target),\n            )\n          ? [target]\n          : []\n    if (prefixes?.length === 0) {\n      return []\n    }\n    const { start, end } = region\n    const { graph, fragments } = await this.laneWalks(\n      refName,\n      region,\n      prefixes,\n      opts,\n      `Reading walks ${region.refName}:${start.toLocaleString()}-${end.toLocaleString()}`,\n    )\n    const align = referenceAligner(graph.nodes)\n    const asmByPrefix = assemblyByPanSNPrefix(this)\n    const references = fragments.filter(f => f.name === refName)\n    // lanes come back in the order the fetch names them, which is the order\n    // the display stacks lanes of equal weight in\n    const rank = (fragment: WalkFragment) =>\n      prefixes === undefined\n        ? 0\n        : prefixes.findIndex(prefix =>\n            panSNMatchesPrefix(fragment.name, prefix),\n          )\n    const shown = fragments\n      .filter(fragment => fragment.name !== refName && rank(fragment) >= 0)\n      .sort((a, b) => rank(a) - rank(b))\n    return shown.flatMap(query =>\n      references.flatMap(reference =>\n        align(query, reference).map(chain =>\n          chainFeature({\n            chain,\n            target: reference,\n            query,\n            assemblyName: region.assemblyName,\n            refName: region.refName,\n            mateAssemblyName: laneAssemblyName(asmByPrefix, haplotypeOf(query)),\n          }),\n        ),\n      ),\n    )\n  }\n\n  /**\n   * Each pair's two lanes read out of the anchor window, all pairs in one\n   * read, and each walk of a pair's query lane aligned to each walk of its\n   * target lane. A pair's records sit on its query lane's contigs, the lane\n   * the display draws on top.\n   */\n  private async pairFeatures(\n    refName: string,\n    region: Region,\n    pairs: LanePair[],\n    opts: LaneFeatureOptions,\n  ) {\n    const sides = pairs.map(pair => ({\n      pair,\n      featurePrefix: resolvePanSNPrefix(this, pair.queryAssemblyName),\n      matePrefix: resolvePanSNPrefix(this, pair.targetAssemblyName),\n    }))\n    const { graph, fragments } = await this.laneWalks(\n      refName,\n      region,\n      sides.flatMap(side => [side.featurePrefix, side.matePrefix]),\n      opts,\n      lanePairsStatus(pairs),\n    )\n    const align = walkAligner(graph.nodes)\n    const walksOf = (prefix: string) =>\n      fragments.filter(f => panSNMatchesPrefix(f.name, prefix))\n    return sides.flatMap(({ pair, featurePrefix, matePrefix }) =>\n      walksOf(featurePrefix).flatMap(target =>\n        walksOf(matePrefix).flatMap(query =>\n          align(query, target).map(chain =>\n            chainFeature({\n              chain,\n              target,\n              query,\n              assemblyName: pair.queryAssemblyName,\n              refName: panSNContig(target.name),\n              mateAssemblyName: pair.targetAssemblyName,\n            }),\n          ),\n        ),\n      ),\n    )\n  }\n\n  // The files are filed under the reference alone, so a window on a\n  // haplotype lane has no answer: a lane pair is read inside the anchor's\n  getFeatures(region: Region, opts: LaneFeatureOptions = {}) {\n    return ObservableCreate<Feature>(async observer => {\n      const refName =\n        region.assemblyName === this.anchor\n          ? await this.refNames.resolve(region, opts)\n          : undefined\n      if (refName !== undefined) {\n        const pairs = requestedPairs(opts)\n        const features =\n          pairs.length > 0\n            ? await this.pairFeatures(refName, region, pairs, opts)\n            : await this.anchorFeatures(refName, region, opts)\n        for (const feature of features) {\n          observer.next(feature)\n        }\n      }\n      observer.complete()\n    }, opts.signal)\n  }\n}\n"],
-  "mappings": "2nBAWA,IAAMA,GAAyB,GAOxB,SAASC,GAAoBC,EAAmB,CACrD,IAAMC,EAAkB,CAAC,EACzB,QAASC,EAAI,EAAGA,EAAIF,EAAM,OAAQE,IAAK,CACrC,GAAM,CAACC,EAAIC,CAAG,EAAIJ,EAAME,CAAC,EACnB,CAACG,EAAQC,CAAO,EAAIN,EAAME,EAAI,CAAC,GAAK,CAAC,EAEzCE,IAAQE,GACRF,GAAON,KACLK,IAAO,KAAOE,IAAW,KAASF,IAAO,KAAOE,IAAW,MAE7DJ,EAAI,KAAK,CAAC,IAAKG,CAAG,CAAC,EACnBF,KAEAD,EAAI,KAAK,CAACE,EAAIC,CAAG,CAAC,CAEtB,CACA,OAAOH,CACT,CAGA,SAASM,EAAUC,EAAwB,CACzC,OAAO,MAAM,KAAKA,EAAS,IAAK,CAACC,EAAIP,IAAM,EAAIO,EAAKD,EAAS,IAAIN,CAAC,CAAE,CACtE,CAEA,SAASQ,EAAWC,EAA8BF,EAAY,CAC5D,IAAMG,EAAOD,EAAM,IAAIF,CAAE,EACzB,OAAOG,IAAS,OAAY,EAAIA,EAAK,IAAMA,EAAK,KAClD,CAOO,SAASC,EAAYF,EAA8B,CACxD,IAAMG,EAAU,IAAI,IACdC,EAAcN,GAAe,CACjC,IAAMO,EAASN,EAAWC,EAAOF,CAAE,EAC/BQ,EAAWH,EAAQ,IAAIE,CAAM,EACjC,OAAIC,IAAa,SACfA,EAAW,IAAI,OAAOD,CAAM,EAC5BF,EAAQ,IAAIE,EAAQC,CAAQ,GAEvBA,CACT,EACMC,EAAU,IAAI,IACdC,EAAiBX,GAA2B,CAChD,IAAIY,EAAQF,EAAQ,IAAIV,CAAQ,EAChC,OAAIY,IAAU,SACZA,EAAQb,EAAUC,CAAQ,EAC1BU,EAAQ,IAAIV,EAAUY,CAAK,GAEtBA,CACT,EACA,MAAO,CAACC,EAAqBC,IAC3BC,EAAe,CACb,MAAOJ,EAAcE,CAAK,EAC1B,OAAQF,EAAcG,CAAM,EAC5B,WAAAP,EACA,MAAO,EACT,CAAC,CACL,CAIA,IAAMS,GAAe,IAErB,SAASC,EAAWzB,EAAmBG,EAAiBC,EAAa,CACnE,IAAMsB,EAAO1B,EAAM,GAAG,EAAE,EACpBI,EAAM,IACJsB,IAAO,CAAC,IAAMvB,EAChBuB,EAAK,CAAC,GAAKtB,EAEXJ,EAAM,KAAK,CAACG,EAAIC,CAAG,CAAC,EAG1B,CAUO,SAASuB,EAAiBhB,EAA8B,CAC7D,IAAMiB,EAAYC,GAAmBnB,EAAWC,EAAOkB,GAAU,CAAC,EAC5DC,EAAWZ,GAAsB,CACrC,IAAMjB,EAAM,IAAI,aAAaiB,EAAQ,OAAS,CAAC,EAC/C,OAAAA,EAAQ,QAAQ,CAACW,EAAQ3B,IAAM,CAC7BD,EAAIC,EAAI,CAAC,EAAID,EAAIC,CAAC,EAAK0B,EAASC,CAAM,CACxC,CAAC,EACM5B,CACT,EAEA,MAAO,CAACoB,EAAqBC,IAAsC,CACjE,IAAMS,EAAMxB,EAAUe,CAAM,EACtBU,EAAMzB,EAAUc,CAAK,EACrB,CAACY,EAAMC,CAAU,EAAIC,EAAYH,EAAKD,EAAKH,CAAQ,EACnD,CAACQ,EAAQC,CAAY,EAAIF,EAC7BH,EAAI,IAAIH,GAAUA,EAAS,CAAC,EAAE,QAAQ,EACtCE,EACAH,CACF,EACMU,EAAUD,EAAeH,EACzBK,EAAQD,EAAUF,EAASH,EAC3BO,EAAc,KAAK,IAAIN,EAAYG,CAAY,EACrD,GAAIG,EAAchB,GAChB,MAAO,CAAC,EAEV,IAAMiB,EAAQX,EAAQC,CAAG,EACnBW,EAAQZ,EAAQE,CAAG,EAEnBW,EAAUC,GACdN,EAAUN,EAAI,OAAS,EAAIO,EAAMK,CAAC,EAAG,CAAC,EAAIL,EAAMK,CAAC,EAAG,CAAC,EACjD5C,EAAoB,CAAC,EAC3BuC,EAAM,QAAQ,CAAC,CAAC,CAAEM,CAAC,EAAGD,IAAM,CAC1B,GAAIA,EAAI,EAAG,CACT,GAAM,CAACE,EAAIC,CAAE,EAAI,CAACJ,EAAOC,EAAI,CAAC,EAAGD,EAAOC,CAAC,CAAC,EAAE,KAAK,CAACI,EAAGC,IAAMD,EAAIC,CAAC,EAChExB,EAAWzB,EAAO,IAAK0C,EAAMK,CAAG,EAAKL,EAAMI,EAAM,CAAC,CAAE,EACpDrB,EAAWzB,EAAO,IAAKyC,EAAMI,CAAC,EAAKJ,EAAMF,EAAMK,EAAI,CAAC,EAAG,CAAC,EAAI,CAAC,CAAE,CACjE,CACAnB,EAAWzB,EAAO,IAAK4B,EAASG,EAAIc,CAAC,CAAE,CAAC,CAC1C,CAAC,EACD,GAAM,CAACC,EAAIC,CAAE,EAAI,CAACJ,EAAO,CAAC,EAAGA,EAAOJ,EAAM,OAAS,CAAC,CAAC,EAAE,KAAK,CAACS,EAAGC,IAAMD,EAAIC,CAAC,EAC3E,MAAO,CACL,CACE,WAAYP,EAAMI,CAAG,EACrB,SAAUJ,EAAMK,EAAM,CAAC,EACvB,YAAaN,EAAMF,EAAM,CAAC,EAAG,CAAC,CAAC,EAC/B,UAAWE,EAAMF,EAAM,GAAG,EAAE,EAAG,CAAC,EAAI,CAAC,EACrC,OAAQD,EAAU,IAAM,IACxB,MAAAtC,EACA,YAAAwC,CACF,CACF,CACF,CACF,CAMO,SAASU,EAAa,CAC3B,MAAAC,EACA,OAAA7B,EACA,MAAAD,EACA,aAAA+B,EACA,QAAAC,EACA,iBAAAC,CACF,EAOG,CACD,IAAMtD,EAAQD,GAAoBoD,EAAM,KAAK,EAC7C,OAAOI,EAAa,CAClB,OAAQ,CACN,KAAMjC,EAAO,KACb,aAAA8B,EACA,QAAAC,EACA,MAAO/B,EAAO,SAAW6B,EAAM,YAC/B,IAAK7B,EAAO,SAAW6B,EAAM,SAC/B,EACA,MAAO,CACL,KAAM9B,EAAM,KACZ,aAAciC,EACd,QAASE,EAAYnC,EAAM,IAAI,EAC/B,MAAOA,EAAM,SAAW8B,EAAM,WAC9B,IAAK9B,EAAM,SAAW8B,EAAM,QAC9B,EACA,OAAQA,EAAM,OACd,MAAOM,EAAUzD,CAAK,EACtB,QAASA,EAAM,OAAO,CAAC0D,EAAK,CAACvD,EAAIwD,CAAC,IAAMD,GAAOvD,IAAO,IAAMwD,EAAI,GAAI,CAAC,EACrE,QAAS3D,EAAM,OAAO,CAAC0D,EAAK,CAAC,CAAEC,CAAC,IAAMD,EAAMC,EAAG,CAAC,CAClD,CAAC,CACH,CCvKA,IAAMC,GAAeC,GACnBC,EAAeD,EAAS,IAAI,GAAKA,EAAS,KAEvBE,EAArB,cAAqDC,CAAsD,CAA3G,kCACE,KAAiB,MAAmB,IAAIC,EACtCC,EAAc,KAAM,CAAC,eAAe,EAAG,CAAC,YAAY,CAAC,EACrD,IACF,EACA,KAAiB,SAA0B,IAAIC,EAC7C,KAAK,MAAM,KACX,IACF,EAEA,IAAY,QAAS,CACnB,IAAMC,EAAS,KAAK,QAAQ,eAAe,EAAE,CAAC,EAC9C,GAAIA,IAAW,OACb,MAAM,IAAI,MACR,gHACF,EAEF,OAAOA,CACT,CAMA,MAAM,kBAAkBC,EAAoB,CAAC,EAAG,CAC9C,OAAO,KAAK,MAAM,eAAeA,CAAI,CACvC,CAOA,MAAM,UAAUA,EAAoB,CAAC,EAAG,CACtC,GAAM,CAAE,WAAAC,CAAW,EAAI,MAAM,KAAK,MAAM,OAAO,OAAOD,CAAI,EACpD,CAAE,OAAAD,CAAO,EAAI,KACbG,EAAeC,EAAmB,KAAMJ,CAAM,EAC9CK,EAAcC,EAAsB,IAAI,EAC9C,MAAO,CACL,cAAe,GACf,mBAAoBN,EACpB,MAAOE,EACJ,OACCK,GACEA,IAAWJ,GAAgBK,EAAYD,CAAM,IAAMJ,CACvD,EACC,IAAII,IAAW,CACd,KAAME,EAAiBJ,EAAaE,CAAM,EAC1C,MAAOA,EACP,MAAOC,EAAYD,CAAM,CAC3B,EAAE,CACN,CACF,CAIA,MAAM,YAAYN,EAAoB,CAAC,EAAG,CACxC,GAAM,CAAE,aAAAS,CAAa,EAAIT,EACzB,OAAOS,IAAiB,QAAaA,IAAiB,KAAK,OACvD,KAAK,SAAS,iBAAiB,CAAE,GAAGT,EAAM,aAAc,KAAK,MAAO,CAAC,EACrE,CAAC,CACP,CAOA,MAAM,YAAYU,EAAgBV,EAA+B,CAAC,EAAG,CACnE,IAAMW,EAAU,MAAM,KAAK,SAAS,QAAQD,EAAQ,CAAE,OAAQV,EAAK,MAAO,CAAC,EAC3E,GAAIW,IAAY,OACd,MAAM,IAAI,MACR,GAAGD,EAAO,YAAY,IAAIA,EAAO,OAAO,sDAAsD,KAAK,MAAM,qDAC3G,EAEF,OAAO,KAAK,MAAM,SAASC,EAASD,EAAQV,CAAI,CAClD,CAIA,MAAc,UACZW,EACAD,EACAE,EACAZ,EACAa,EACA,CACA,OAAOC,EAAaD,EAAQb,EAAK,eAAgB,IAC/C,KAAK,MAAM,OACR,IAAIW,EAASD,EAAQ,CACpB,GAAG,KAAK,MAAM,QAAQ,EACtB,OAAQV,EAAK,OACb,KAAMe,EAAUH,EAAUD,CAAO,EACjC,MAAO,EACT,CAAC,EACA,MAAOK,GAAmB,CACzB,MAAIC,EAAiBD,CAAK,GAAKA,aAAiB,QAC9CA,EAAM,QAAUA,EAAM,QAAQ,QAC5B,mBACA,cACF,GAEIA,CACR,CAAC,CACL,CACF,CAMA,MAAc,eACZL,EACAD,EACAV,EACA,CACA,IAAMkB,EAASlB,EAAK,YAAY,OAC5BA,EAAK,WAAW,IAAImB,GAAQhB,EAAmB,KAAMgB,CAAI,CAAC,EAC1D,OACEC,EAASjB,EAAmB,KAAMH,EAAK,kBAAkB,EACzDY,EACJQ,IAAW,OACPF,EACAA,IAAW,QACTA,EAAO,KACLZ,GACEe,EAAmBD,EAAQd,CAAM,GACjCe,EAAmBf,EAAQc,CAAM,CACrC,EACA,CAACA,CAAM,EACP,CAAC,EACT,GAAIR,GAAU,SAAW,EACvB,MAAO,CAAC,EAEV,GAAM,CAAE,MAAAU,EAAO,IAAAC,CAAI,EAAIb,EACjB,CAAE,MAAAc,EAAO,UAAAC,CAAU,EAAI,MAAM,KAAK,UACtCd,EACAD,EACAE,EACAZ,EACA,iBAAiBU,EAAO,OAAO,IAAIY,EAAM,eAAe,CAAC,IAAIC,EAAI,eAAe,CAAC,EACnF,EACMG,EAAQC,EAAiBH,EAAM,KAAK,EACpCpB,EAAcC,EAAsB,IAAI,EACxCuB,EAAaH,EAAU,OAAOI,GAAKA,EAAE,OAASlB,CAAO,EAGrDmB,EAAQtC,GACZoB,IAAa,OACT,EACAA,EAAS,UAAUN,GACjBe,EAAmB7B,EAAS,KAAMc,CAAM,CAC1C,EAIN,OAHcmB,EACX,OAAOjC,GAAYA,EAAS,OAASmB,GAAWmB,EAAKtC,CAAQ,GAAK,CAAC,EACnE,KAAK,CAACuC,EAAGC,IAAMF,EAAKC,CAAC,EAAID,EAAKE,CAAC,CAAC,EACtB,QAAQC,GACnBL,EAAW,QAAQM,GACjBR,EAAMO,EAAOC,CAAS,EAAE,IAAIC,GAC1BC,EAAa,CACX,MAAAD,EACA,OAAQD,EACR,MAAAD,EACA,aAAcvB,EAAO,aACrB,QAASA,EAAO,QAChB,iBAAkBF,EAAiBJ,EAAab,GAAY0C,CAAK,CAAC,CACpE,CAAC,CACH,CACF,CACF,CACF,CAQA,MAAc,aACZtB,EACAD,EACA2B,EACArC,EACA,CACA,IAAMsC,EAAQD,EAAM,IAAIE,IAAS,CAC/B,KAAAA,EACA,cAAepC,EAAmB,KAAMoC,EAAK,iBAAiB,EAC9D,WAAYpC,EAAmB,KAAMoC,EAAK,kBAAkB,CAC9D,EAAE,EACI,CAAE,MAAAf,EAAO,UAAAC,CAAU,EAAI,MAAM,KAAK,UACtCd,EACAD,EACA4B,EAAM,QAAQE,GAAQ,CAACA,EAAK,cAAeA,EAAK,UAAU,CAAC,EAC3DxC,EACAyC,EAAgBJ,CAAK,CACvB,EACMX,EAAQgB,EAAYlB,EAAM,KAAK,EAC/BmB,EAAWrC,GACfmB,EAAU,OAAOI,GAAKR,EAAmBQ,EAAE,KAAMvB,CAAM,CAAC,EAC1D,OAAOgC,EAAM,QAAQ,CAAC,CAAE,KAAAC,EAAM,cAAAK,EAAe,WAAAC,CAAW,IACtDF,EAAQC,CAAa,EAAE,QAAQxB,GAC7BuB,EAAQE,CAAU,EAAE,QAAQZ,GAC1BP,EAAMO,EAAOb,CAAM,EAAE,IAAIe,GACvBC,EAAa,CACX,MAAAD,EACA,OAAAf,EACA,MAAAa,EACA,aAAcM,EAAK,kBACnB,QAASO,EAAY1B,EAAO,IAAI,EAChC,iBAAkBmB,EAAK,kBACzB,CAAC,CACH,CACF,CACF,CACF,CACF,CAIA,YAAY7B,EAAgBV,EAA2B,CAAC,EAAG,CACzD,OAAO+C,EAA0B,MAAMC,GAAY,CACjD,IAAMrC,EACJD,EAAO,eAAiB,KAAK,OACzB,MAAM,KAAK,SAAS,QAAQA,EAAQV,CAAI,EACxC,OACN,GAAIW,IAAY,OAAW,CACzB,IAAM0B,EAAQY,EAAejD,CAAI,EAC3BkD,EACJb,EAAM,OAAS,EACX,MAAM,KAAK,aAAa1B,EAASD,EAAQ2B,EAAOrC,CAAI,EACpD,MAAM,KAAK,eAAeW,EAASD,EAAQV,CAAI,EACrD,QAAWmD,KAAWD,EACpBF,EAAS,KAAKG,CAAO,CAEzB,CACAH,EAAS,SAAS,CACpB,EAAGhD,EAAK,MAAM,CAChB,CACF",
-  "names": ["BALANCED_BUBBLE_MAX_BP", "bubblesAsMismatches", "edits", "out", "i", "op", "len", "nextOp", "nextLen", "handlesOf", "fragment", "id", "nodeLength", "nodes", "node", "walkAligner", "standIn", "sequenceOf", "length", "sequence", "handles", "cachedHandles", "steps", "query", "target", "pairAlignments", "MIN_MATCH_BP", "appendEdit", "last", "referenceAligner", "lengthOf", "handle", "offsets", "ref", "hap", "same", "sameWeight", "weightedLcs", "turned", "turnedWeight", "reverse", "pairs", "sharedBases", "refAt", "hapAt", "stepOf", "k", "r", "lo", "hi", "x", "y", "chainFeature", "chain", "assemblyName", "refName", "mateAssemblyName", "matchFeature", "panSNContig", "pairCigar", "sum", "n", "haplotypeOf", "fragment", "panSNHaplotype", "WalkTabixSyntenyAdapter", "ComparativeAdapterBase", "WalkIndex", "openTabixSlot", "PanSNRefNames", "anchor", "opts", "haplotypes", "anchorPrefix", "resolvePanSNPrefix", "asmByPrefix", "assemblyByPanSNPrefix", "prefix", "panSNSample", "laneAssemblyName", "assemblyName", "region", "refName", "prefixes", "status", "updateStatus", "walksKept", "error", "isNodeLimitError", "wanted", "lane", "target", "panSNMatchesPrefix", "start", "end", "graph", "fragments", "align", "referenceAligner", "references", "f", "rank", "a", "b", "query", "reference", "chain", "chainFeature", "pairs", "sides", "pair", "side", "lanePairsStatus", "walkAligner", "walksOf", "featurePrefix", "matePrefix", "panSNContig", "ObservableCreate", "observer", "requestedPairs", "features", "feature"]
-}

package/dist/chunks/chunk-IJJZC7A4.js

@@ -1,4 +0,0 @@
-import{b as ze}from"./chunk-EDSIYH4H.js";import{a as He}from"./chunk-GUXZESDR.js";import{a as $e,c as Ye}from"./chunk-TENPGIPX.js";function Ve(e){let r=[],t=0,o;for(let n=0,i=e.length;n<i;n++){let a=e.charCodeAt(n);if(a>=48&&a<=57)t=t*10+a-48;else if(a===58)o=t,t=0;else{let f=e[n];f==="M"||f==="="||f==="X"?r.push({own:o===void 0?t:o,mate:t,op:"M"}):f==="I"?r.push({own:0,mate:t,op:f}):(f==="D"||f==="N")&&r.push({own:t,mate:0,op:f}),o=void 0,t=0}}return r}function Ae(e){let r="";for(let{own:t,mate:o,op:n}of Ve(e))r+=n==="M"?t===0?`${o}I`:o===0?`${t}D`:`${t}M`:`${n==="I"?o:t}${n}`;return r}var Se=2**28-1;function ve(e,r,t){for(let o=r;o>0;o-=Se)e.push((Math.min(o,Se)<<4|t)>>>0)}function Nr(e,r,t){if(r===t)ve(e,r,0);else{let o=Math.ceil(Math.max(r,t)/Se);for(let n=0;n<o;n++){let i=Math.floor(r*(n+1)/o)-Math.floor(r*n/o),a=Math.floor(t*(n+1)/o)-Math.floor(t*n/o);e.push((i<<4|9)>>>0,(a<<4|9)>>>0)}}}function _e(e){let r=[];for(let{own:t,mate:o,op:n}of Ve(e))n==="M"?Nr(r,t,o):n==="I"?ve(r,o,1):ve(r,t,n==="N"?3:2);return Uint32Array.from(r)}function kr(e){return e>=48&&e<=57}function Gr(e){return e!==void 0&&/[A-Za-z]/.test(e)}function qe(e,r){let t=r;for(;t<e.length&&Gr(e[t]);)t++;return t}function Qe(e,r){let t=r,o=0;for(;t<e.length&&kr(e.charCodeAt(t));)o=o*10+(e.charCodeAt(t)-48),t++;return{value:o,next:t}}function er(e,r){let t=0;for(;t<e.length;){let o=e[t];if(o===":"){let{value:n,next:i}=Qe(e,t+1);r(":",n,n,t+1,i),t=i}else if(o==="="){let n=qe(e,t+1),i=n-t-1;r("=",i,i,t+1,n),t=n}else if(o==="*")r("*",1,1,t+1,Math.min(t+3,e.length)),t+=3;else if(o==="+"||o==="-"){let n=qe(e,t+1),i=n-t-1;r(o,o==="-"?i:0,o==="+"?i:0,t+1,n),t=n}else if(o==="~"){let{value:n,next:i}=Qe(e,t+3),a=Math.min(i+2,e.length);r("~",n,0,t+1,a),t=a}else t++}}function Ce(e,r,t,o){let n=t??Number.NEGATIVE_INFINITY,i=o??Number.POSITIVE_INFINITY,a=0;er(e,(f,p,s,c,u)=>{if(f==="*")a>=n&&a<i&&r(88,a,1,e[c+1]??"",-1,0,0);else if(f==="+"){if(a>=n&&a<=i){let m=e.slice(c,u);r(73,a,s,m,-1,0,s)}}else(f==="-"||f==="~")&&a<i&&a+p>n&&r(f==="-"?68:78,a,p,"",-1,0,0);a+=p})}function rr(e,r,t,o){let n=0,i=0,a=[],f=t&&r;for(let p=0,s=e.length;p<s;p++){let c=e[p],u=c>>>4,m=c&15;if(m===0||m===7){if(f)for(let l=0;l<u;l++)(r.charCodeAt(i+l)|32)!==(t.charCodeAt(n+l)|32)&&a.push({start:n+l,type:"mismatch",base:r[i+l],altbase:t[n+l],length:1});i+=u,n+=u}else if(m===1)a.push({start:n,type:"insertion",insertlen:u,insertedBases:r?.slice(i,i+u),length:0}),i+=u;else if(m===2)a.push({start:n,type:"deletion",length:u}),n+=u;else if(m===3)a.push({start:n,type:"skip",length:u}),n+=u;else if(m===8){for(let l=0;l<u;l++)a.push({start:n+l,type:"mismatch",base:r?.[i+l]||"X",qual:o?.[i+l],length:1});i+=u,n+=u}else m===5?a.push({start:n,type:"hardclip",cliplen:u,length:1}):m===4&&(a.push({start:n,type:"softclip",cliplen:u,length:1}),i+=u)}return a}function tr(e,r,t,o,n){if(!r)return[];let i=[],a=r.length,f=o.length,p=n!==void 0,s=t.length,c=!1;for(let b=0;b<s;b++)if(t[b].type==="skip"){c=!0;break}let u=0,m=0,l=0,y=0,d=0,x=0,g=e.length;for(;x<g;){let b=e.charCodeAt(x);if(b>=48&&b<=57){let v=0;for(;x<g;){let S=e.charCodeAt(x);if(S>=48&&S<=57)v=v*10+(S-48),x++;else break}u+=v}else if(b===94)for(x++;x<g&&e.charCodeAt(x)>=65;)x++,u++;else if(b>=65){let v=e[x];if(x++,c&&s>0)for(let I=d;I<s;I++){let R=t[I];R.type==="skip"&&u>=R.start&&(u+=R.length,d=I+1)}let S=l,C=y;for(let I=m;I<a&&C<=u;I++,m=I){let R=r[I],L=R>>>4,A=R&15;A===4||A===1?S+=L:A===2||A===6||A===3?C+=L:A!==5&&(S+=L,C+=L)}l=S,y=C;let F=S-(C-u),q=F<f?o[F]:"X";i.push({start:u,base:q,qual:p?n[F]:void 0,altbase:v,length:1,type:"mismatch"}),u++}else x++}return i}var or={77:0,73:1,68:2,78:3,83:4,72:5,80:6,61:7,88:8};function nr(e=""){let r=0,t=[];for(let o=0,n=e.length;o<n;o++){let i=e.charCodeAt(o);if(i>=48&&i<=57)r=r*10+(i-48);else{let a=or[i];t.push(r<<4|a),r=0}}return t}function Te(e=""){let r=0;for(let i=0,a=e.length;i<a;i++){let f=e.charCodeAt(i);(f<48||f>57)&&r++}let t=new Uint32Array(r),o=0,n=0;for(let i=0,a=e.length;i<a;i++){let f=e.charCodeAt(i);f>=48&&f<=57?o=o*10+(f-48):(t[n++]=o<<4|or[f],o=0)}return t}function Z(e,r,t,o,n){let i=nr(e),a=e?rr(i,t,o,n):[];return r&&t?a.concat(tr(r,i,a,t,n)):a}var P=class extends $e{get(r){return r==="mismatches"?Z(this.walkableCigar):r==="clipLengthAtStartOfRead"?this.clipLengthAtStartOfRead:r==="name"?super.get("name")??this.mate?.refName:super.get(r)}get mate(){return super.get("mate")}get walkableCigar(){let r=super.get("CIGAR"),t=super.get("coarseCigar");return typeof r=="string"?r:typeof t=="string"?Ae(t):void 0}get clipLengthAtStartOfRead(){return this.mate?.start??0}forEachMismatch(r,t){let o=this.get("start"),n=t?.start===void 0?void 0:t.start-o,i=t?.end===void 0?void 0:t.end-o,a=this.get("cs");if(a)Ce(a,r,n,i);else{let f=n??Number.NEGATIVE_INFINITY,p=i??Number.POSITIVE_INFINITY;for(let s of Z(this.walkableCigar))(s.type==="deletion"||s.type==="skip"?s.start<p&&s.start+s.length>f:s.start>=f&&s.start<=p)&&(s.type==="mismatch"?r(88,s.start,s.length,s.base,s.qual??-1,0,0):s.type==="insertion"?r(73,s.start,s.length,s.insertedBases??"",-1,0,s.insertlen):s.type==="deletion"?r(68,s.start,s.length,"",-1,0,0):s.type==="skip"&&r(78,s.start,s.length,"",-1,0,0))}}};var we=function(e,r){return we=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,o){t.__proto__=o}||function(t,o){for(var n in o)Object.prototype.hasOwnProperty.call(o,n)&&(t[n]=o[n])},we(e,r)};function H(e,r){if(typeof r!="function"&&r!==null)throw new TypeError("Class extends value "+String(r)+" is not a constructor or null");we(e,r);function t(){this.constructor=e}e.prototype=r===null?Object.create(r):(t.prototype=r.prototype,new t)}function ir(e,r,t,o){function n(i){return i instanceof t?i:new t(function(a){a(i)})}return new(t||(t=Promise))(function(i,a){function f(c){try{s(o.next(c))}catch(u){a(u)}}function p(c){try{s(o.throw(c))}catch(u){a(u)}}function s(c){c.done?i(c.value):n(c.value).then(f,p)}s((o=o.apply(e,r||[])).next())})}function ee(e,r){var t={label:0,sent:function(){if(i[0]&1)throw i[1];return i[1]},trys:[],ops:[]},o,n,i,a=Object.create((typeof Iterator=="function"?Iterator:Object).prototype);return a.next=f(0),a.throw=f(1),a.return=f(2),typeof Symbol=="function"&&(a[Symbol.iterator]=function(){return this}),a;function f(s){return function(c){return p([s,c])}}function p(s){if(o)throw new TypeError("Generator is already executing.");for(;a&&(a=0,s[0]&&(t=0)),t;)try{if(o=1,n&&(i=s[0]&2?n.return:s[0]?n.throw||((i=n.return)&&i.call(n),0):n.next)&&!(i=i.call(n,s[1])).done)return i;switch(n=0,i&&(s=[s[0]&2,i.value]),s[0]){case 0:case 1:i=s;break;case 4:return t.label++,{value:s[1],done:!1};case 5:t.label++,n=s[1],s=[0];continue;case 7:s=t.ops.pop(),t.trys.pop();continue;default:if(i=t.trys,!(i=i.length>0&&i[i.length-1])&&(s[0]===6||s[0]===2)){t=0;continue}if(s[0]===3&&(!i||s[1]>i[0]&&s[1]<i[3])){t.label=s[1];break}if(s[0]===6&&t.label<i[1]){t.label=i[1],i=s;break}if(i&&t.label<i[2]){t.label=i[2],t.ops.push(s);break}i[2]&&t.ops.pop(),t.trys.pop();continue}s=r.call(e,t)}catch(c){s=[6,c],n=0}finally{o=i=0}if(s[0]&5)throw s[1];return{value:s[0]?s[1]:void 0,done:!0}}}function N(e){var r=typeof Symbol=="function"&&Symbol.iterator,t=r&&e[r],o=0;if(t)return t.call(e);if(e&&typeof e.length=="number")return{next:function(){return e&&o>=e.length&&(e=void 0),{value:e&&e[o++],done:!e}}};throw new TypeError(r?"Object is not iterable.":"Symbol.iterator is not defined.")}function D(e,r){var t=typeof Symbol=="function"&&e[Symbol.iterator];if(!t)return e;var o=t.call(e),n,i=[],a;try{for(;(r===void 0||r-- >0)&&!(n=o.next()).done;)i.push(n.value)}catch(f){a={error:f}}finally{try{n&&!n.done&&(t=o.return)&&t.call(o)}finally{if(a)throw a.error}}return i}function j(e,r,t){if(t||arguments.length===2)for(var o=0,n=r.length,i;o<n;o++)(i||!(o in r))&&(i||(i=Array.prototype.slice.call(r,0,o)),i[o]=r[o]);return e.concat(i||Array.prototype.slice.call(r))}function k(e){return this instanceof k?(this.v=e,this):new k(e)}function ar(e,r,t){if(!Symbol.asyncIterator)throw new TypeError("Symbol.asyncIterator is not defined.");var o=t.apply(e,r||[]),n,i=[];return n=Object.create((typeof AsyncIterator=="function"?AsyncIterator:Object).prototype),f("next"),f("throw"),f("return",a),n[Symbol.asyncIterator]=function(){return this},n;function a(l){return function(y){return Promise.resolve(y).then(l,u)}}function f(l,y){o[l]&&(n[l]=function(d){return new Promise(function(x,g){i.push([l,d,x,g])>1||p(l,d)})},y&&(n[l]=y(n[l])))}function p(l,y){try{s(o[l](y))}catch(d){m(i[0][3],d)}}function s(l){l.value instanceof k?Promise.resolve(l.value.v).then(c,u):m(i[0][2],l)}function c(l){p("next",l)}function u(l){p("throw",l)}function m(l,y){l(y),i.shift(),i.length&&p(i[0][0],i[0][1])}}function sr(e){if(!Symbol.asyncIterator)throw new TypeError("Symbol.asyncIterator is not defined.");var r=e[Symbol.asyncIterator],t;return r?r.call(e):(e=typeof N=="function"?N(e):e[Symbol.iterator](),t={},o("next"),o("throw"),o("return"),t[Symbol.asyncIterator]=function(){return this},t);function o(i){t[i]=e[i]&&function(a){return new Promise(function(f,p){a=e[i](a),n(f,p,a.done,a.value)})}}function n(i,a,f,p){Promise.resolve(p).then(function(s){i({value:s,done:f})},a)}}function h(e){return typeof e=="function"}function fr(e){var r=function(o){Error.call(o),o.stack=new Error().stack},t=e(r);return t.prototype=Object.create(Error.prototype),t.prototype.constructor=t,t}var re=fr(function(e){return function(t){e(this),this.message=t?t.length+` errors occurred during unsubscription:
-`+t.map(function(o,n){return n+1+") "+o.toString()}).join(`
-  `):"",this.name="UnsubscriptionError",this.errors=t}});function Oe(e,r){if(e){var t=e.indexOf(r);0<=t&&e.splice(t,1)}}var te=(function(){function e(r){this.initialTeardown=r,this.closed=!1,this._parentage=null,this._finalizers=null}return e.prototype.unsubscribe=function(){var r,t,o,n,i;if(!this.closed){this.closed=!0;var a=this._parentage;if(a)if(this._parentage=null,Array.isArray(a))try{for(var f=N(a),p=f.next();!p.done;p=f.next()){var s=p.value;s.remove(this)}}catch(d){r={error:d}}finally{try{p&&!p.done&&(t=f.return)&&t.call(f)}finally{if(r)throw r.error}}else a.remove(this);var c=this.initialTeardown;if(h(c))try{c()}catch(d){i=d instanceof re?d.errors:[d]}var u=this._finalizers;if(u){this._finalizers=null;try{for(var m=N(u),l=m.next();!l.done;l=m.next()){var y=l.value;try{pr(y)}catch(d){i=i??[],d instanceof re?i=j(j([],D(i)),D(d.errors)):i.push(d)}}}catch(d){o={error:d}}finally{try{l&&!l.done&&(n=m.return)&&n.call(m)}finally{if(o)throw o.error}}}if(i)throw new re(i)}},e.prototype.add=function(r){var t;if(r&&r!==this)if(this.closed)pr(r);else{if(r instanceof e){if(r.closed||r._hasParent(this))return;r._addParent(this)}(this._finalizers=(t=this._finalizers)!==null&&t!==void 0?t:[]).push(r)}},e.prototype._hasParent=function(r){var t=this._parentage;return t===r||Array.isArray(t)&&t.includes(r)},e.prototype._addParent=function(r){var t=this._parentage;this._parentage=Array.isArray(t)?(t.push(r),t):t?[t,r]:r},e.prototype._removeParent=function(r){var t=this._parentage;t===r?this._parentage=null:Array.isArray(t)&&Oe(t,r)},e.prototype.remove=function(r){var t=this._finalizers;t&&Oe(t,r),r instanceof e&&r._removeParent(this)},e.EMPTY=(function(){var r=new e;return r.closed=!0,r})(),e})();var Kt=te.EMPTY;function oe(e){return e instanceof te||e&&"closed"in e&&h(e.remove)&&h(e.add)&&h(e.unsubscribe)}function pr(e){h(e)?e():e.unsubscribe()}var w={onUnhandledError:null,onStoppedNotification:null,Promise:void 0,useDeprecatedSynchronousErrorHandling:!1,useDeprecatedNextContext:!1};var U={setTimeout:function(e,r){for(var t=[],o=2;o<arguments.length;o++)t[o-2]=arguments[o];var n=U.delegate;return n?.setTimeout?n.setTimeout.apply(n,j([e,r],D(t))):setTimeout.apply(void 0,j([e,r],D(t)))},clearTimeout:function(e){var r=U.delegate;return(r?.clearTimeout||clearTimeout)(e)},delegate:void 0};function ne(e){U.setTimeout(function(){var r=w.onUnhandledError;if(r)r(e);else throw e})}function Re(){}var cr=(function(){return Me("C",void 0,void 0)})();function ur(e){return Me("E",void 0,e)}function lr(e){return Me("N",e,void 0)}function Me(e,r,t){return{kind:e,value:r,error:t}}var G=null;function mr(e){if(w.useDeprecatedSynchronousErrorHandling){var r=!G;if(r&&(G={errorThrown:!1,error:null}),e(),r){var t=G,o=t.errorThrown,n=t.error;if(G=null,o)throw n}}else e()}function dr(e){w.useDeprecatedSynchronousErrorHandling&&G&&(G.errorThrown=!0,G.error=e)}var z=(function(e){H(r,e);function r(t){var o=e.call(this)||this;return o.isStopped=!1,t?(o.destination=t,oe(t)&&t.add(o)):o.destination=$r,o}return r.create=function(t,o,n){return new ae(t,o,n)},r.prototype.next=function(t){this.isStopped?Le(lr(t),this):this._next(t)},r.prototype.error=function(t){this.isStopped?Le(ur(t),this):(this.isStopped=!0,this._error(t))},r.prototype.complete=function(){this.isStopped?Le(cr,this):(this.isStopped=!0,this._complete())},r.prototype.unsubscribe=function(){this.closed||(this.isStopped=!0,e.prototype.unsubscribe.call(this),this.destination=null)},r.prototype._next=function(t){this.destination.next(t)},r.prototype._error=function(t){try{this.destination.error(t)}finally{this.unsubscribe()}},r.prototype._complete=function(){try{this.destination.complete()}finally{this.unsubscribe()}},r})(te);var Ur=Function.prototype.bind;function Fe(e,r){return Ur.call(e,r)}var Br=(function(){function e(r){this.partialObserver=r}return e.prototype.next=function(r){var t=this.partialObserver;if(t.next)try{t.next(r)}catch(o){ie(o)}},e.prototype.error=function(r){var t=this.partialObserver;if(t.error)try{t.error(r)}catch(o){ie(o)}else ie(r)},e.prototype.complete=function(){var r=this.partialObserver;if(r.complete)try{r.complete()}catch(t){ie(t)}},e})(),ae=(function(e){H(r,e);function r(t,o,n){var i=e.call(this)||this,a;if(h(t)||!t)a={next:t??void 0,error:o??void 0,complete:n??void 0};else{var f;i&&w.useDeprecatedNextContext?(f=Object.create(t),f.unsubscribe=function(){return i.unsubscribe()},a={next:t.next&&Fe(t.next,f),error:t.error&&Fe(t.error,f),complete:t.complete&&Fe(t.complete,f)}):a=t}return i.destination=new Br(a),i}return r})(z);function ie(e){w.useDeprecatedSynchronousErrorHandling?dr(e):ne(e)}function Wr(e){throw e}function Le(e,r){var t=w.onStoppedNotification;t&&U.setTimeout(function(){return t(e,r)})}var $r={closed:!0,next:Re,error:Wr,complete:Re};var B=(function(){return typeof Symbol=="function"&&Symbol.observable||"@@observable"})();function xr(e){return e}function hr(e){return e.length===0?xr:e.length===1?e[0]:function(t){return e.reduce(function(o,n){return n(o)},t)}}var _=(function(){function e(r){r&&(this._subscribe=r)}return e.prototype.lift=function(r){var t=new e;return t.source=this,t.operator=r,t},e.prototype.subscribe=function(r,t,o){var n=this,i=Hr(r)?r:new ae(r,t,o);return mr(function(){var a=n,f=a.operator,p=a.source;i.add(f?f.call(i,p):p?n._subscribe(i):n._trySubscribe(i))}),i},e.prototype._trySubscribe=function(r){try{return this._subscribe(r)}catch(t){r.error(t)}},e.prototype.forEach=function(r,t){var o=this;return t=yr(t),new t(function(n,i){var a=new ae({next:function(f){try{r(f)}catch(p){i(p),a.unsubscribe()}},error:i,complete:n});o.subscribe(a)})},e.prototype._subscribe=function(r){var t;return(t=this.source)===null||t===void 0?void 0:t.subscribe(r)},e.prototype[B]=function(){return this},e.prototype.pipe=function(){for(var r=[],t=0;t<arguments.length;t++)r[t]=arguments[t];return hr(r)(this)},e.prototype.toPromise=function(r){var t=this;return r=yr(r),new r(function(o,n){var i;t.subscribe(function(a){return i=a},function(a){return n(a)},function(){return o(i)})})},e.create=function(r){return new e(r)},e})();function yr(e){var r;return(r=e??w.Promise)!==null&&r!==void 0?r:Promise}function Yr(e){return e&&h(e.next)&&h(e.error)&&h(e.complete)}function Hr(e){return e&&e instanceof z||Yr(e)&&oe(e)}function zr(e){return h(e?.lift)}function E(e){return function(r){if(zr(r))return r.lift(function(t){try{return e(t,this)}catch(o){this.error(o)}});throw new TypeError("Unable to lift unknown Observable type")}}function M(e,r,t,o,n){return new Vr(e,r,t,o,n)}var Vr=(function(e){H(r,e);function r(t,o,n,i,a,f){var p=e.call(this,t)||this;return p.onFinalize=a,p.shouldUnsubscribe=f,p._next=o?function(s){try{o(s)}catch(c){t.error(c)}}:e.prototype._next,p._error=i?function(s){try{i(s)}catch(c){t.error(c)}finally{this.unsubscribe()}}:e.prototype._error,p._complete=n?function(){try{n()}catch(s){t.error(s)}finally{this.unsubscribe()}}:e.prototype._complete,p}return r.prototype.unsubscribe=function(){var t;if(!this.shouldUnsubscribe||this.shouldUnsubscribe()){var o=this.closed;e.prototype.unsubscribe.call(this),!o&&((t=this.onFinalize)===null||t===void 0||t.call(this))}},r})(z);var se=(function(e){return e&&typeof e.length=="number"&&typeof e!="function"});function fe(e){return h(e?.then)}function pe(e){return h(e[B])}function ce(e){return Symbol.asyncIterator&&h(e?.[Symbol.asyncIterator])}function ue(e){return new TypeError("You provided "+(e!==null&&typeof e=="object"?"an invalid object":"'"+e+"'")+" where a stream was expected. You can provide an Observable, Promise, ReadableStream, Array, AsyncIterable, or Iterable.")}function qr(){return typeof Symbol!="function"||!Symbol.iterator?"@@iterator":Symbol.iterator}var le=qr();function me(e){return h(e?.[le])}function de(e){return ar(this,arguments,function(){var t,o,n,i;return ee(this,function(a){switch(a.label){case 0:t=e.getReader(),a.label=1;case 1:a.trys.push([1,,9,10]),a.label=2;case 2:return[4,k(t.read())];case 3:return o=a.sent(),n=o.value,i=o.done,i?[4,k(void 0)]:[3,5];case 4:return[2,a.sent()];case 5:return[4,k(n)];case 6:return[4,a.sent()];case 7:return a.sent(),[3,2];case 8:return[3,10];case 9:return t.releaseLock(),[7];case 10:return[2]}})})}function xe(e){return h(e?.getReader)}function O(e){if(e instanceof _)return e;if(e!=null){if(pe(e))return Qr(e);if(se(e))return Kr(e);if(fe(e))return Xr(e);if(ce(e))return gr(e);if(me(e))return Jr(e);if(xe(e))return Zr(e)}throw ue(e)}function Qr(e){return new _(function(r){var t=e[B]();if(h(t.subscribe))return t.subscribe(r);throw new TypeError("Provided object does not correctly implement Symbol.observable")})}function Kr(e){return new _(function(r){for(var t=0;t<e.length&&!r.closed;t++)r.next(e[t]);r.complete()})}function Xr(e){return new _(function(r){e.then(function(t){r.closed||(r.next(t),r.complete())},function(t){return r.error(t)}).then(null,ne)})}function Jr(e){return new _(function(r){var t,o;try{for(var n=N(e),i=n.next();!i.done;i=n.next()){var a=i.value;if(r.next(a),r.closed)return}}catch(f){t={error:f}}finally{try{i&&!i.done&&(o=n.return)&&o.call(n)}finally{if(t)throw t.error}}r.complete()})}function gr(e){return new _(function(r){et(e,r).catch(function(t){return r.error(t)})})}function Zr(e){return gr(de(e))}function et(e,r){var t,o,n,i;return ir(this,void 0,void 0,function(){var a,f;return ee(this,function(p){switch(p.label){case 0:p.trys.push([0,5,6,11]),t=sr(e),p.label=1;case 1:return[4,t.next()];case 2:if(o=p.sent(),!!o.done)return[3,4];if(a=o.value,r.next(a),r.closed)return[2];p.label=3;case 3:return[3,1];case 4:return[3,11];case 5:return f=p.sent(),n={error:f},[3,11];case 6:return p.trys.push([6,,9,10]),o&&!o.done&&(i=t.return)?[4,i.call(t)]:[3,8];case 7:p.sent(),p.label=8;case 8:return[3,10];case 9:if(n)throw n.error;return[7];case 10:return[7];case 11:return r.complete(),[2]}})})}function T(e,r,t,o,n){o===void 0&&(o=0),n===void 0&&(n=!1);var i=r.schedule(function(){t(),n?e.add(this.schedule(null,o)):this.unsubscribe()},o);if(e.add(i),!n)return i}function he(e,r){return r===void 0&&(r=0),E(function(t,o){t.subscribe(M(o,function(n){return T(o,e,function(){return o.next(n)},r)},function(){return T(o,e,function(){return o.complete()},r)},function(n){return T(o,e,function(){return o.error(n)},r)}))})}function ye(e,r){return r===void 0&&(r=0),E(function(t,o){o.add(e.schedule(function(){return t.subscribe(o)},r))})}function br(e,r){return O(e).pipe(ye(r),he(r))}function Sr(e,r){return O(e).pipe(ye(r),he(r))}function vr(e,r){return new _(function(t){var o=0;return r.schedule(function(){o===e.length?t.complete():(t.next(e[o++]),t.closed||this.schedule())})})}function Ar(e,r){return new _(function(t){var o;return T(t,r,function(){o=e[le](),T(t,r,function(){var n,i,a;try{n=o.next(),i=n.value,a=n.done}catch(f){t.error(f);return}a?t.complete():t.next(i)},0,!0)}),function(){return h(o?.return)&&o.return()}})}function ge(e,r){if(!e)throw new Error("Iterable cannot be null");return new _(function(t){T(t,r,function(){var o=e[Symbol.asyncIterator]();T(t,r,function(){o.next().then(function(n){n.done?t.complete():t.next(n.value)})},0,!0)})})}function _r(e,r){return ge(de(e),r)}function Cr(e,r){if(e!=null){if(pe(e))return br(e,r);if(se(e))return vr(e,r);if(fe(e))return Sr(e,r);if(ce(e))return ge(e,r);if(me(e))return Ar(e,r);if(xe(e))return _r(e,r)}throw ue(e)}function Pe(e,r){return r?Cr(e,r):O(e)}function V(e,r){return E(function(t,o){var n=0;t.subscribe(M(o,function(i){o.next(e.call(r,i,n++))}))})}function Ir(e,r,t,o,n,i,a,f){var p=[],s=0,c=0,u=!1,m=function(){u&&!p.length&&!s&&r.complete()},l=function(d){return s<o?y(d):p.push(d)},y=function(d){i&&r.next(d),s++;var x=!1;O(t(d,c++)).subscribe(M(r,function(g){n?.(g),i?l(g):r.next(g)},function(){x=!0},void 0,function(){if(x)try{s--;for(var g=function(){var b=p.shift();a?T(r,a,function(){return y(b)}):y(b)};p.length&&s<o;)g();m()}catch(b){r.error(b)}}))};return e.subscribe(M(r,l,function(){u=!0,m()})),function(){f?.()}}function W(e,r,t){return t===void 0&&(t=1/0),h(r)?W(function(o,n){return V(function(i,a){return r(o,i,n,a)})(O(e(o,n)))},t):(typeof r=="number"&&(t=r),E(function(o,n){return Ir(o,n,e,t)}))}function Er(e,r,t,o,n){return function(i,a){var f=t,p=r,s=0;i.subscribe(M(a,function(c){var u=s++;p=f?e(p,c,u):(f=!0,c),o&&a.next(p)},n&&(function(){f&&a.next(p),a.complete()})))}}function Tr(e,r){return E(Er(e,r,arguments.length>=2,!1,!0))}var rt=function(e,r){return e.push(r),e};function be(){return E(function(e,r){Tr(rt,[])(e).subscribe(r)})}var tt=397,ot=387,nt=385;function wr(e){return(1<<e&tt)!==0}function Or(e){return(1<<e&ot)!==0}function Rr(e){return(1<<e&nt)!==0}function Ne(e,r,t,o,n,i,a){let f=n===-1?-1:1,p=r,s=n===-1?o:t,c=[],u=1/0,m=-1/0,l=1/0,y=-1/0,d=(x,g)=>{l=Math.min(l,x,g),y=Math.max(y,x,g)};for(let x=0;x<e.length;x++){let g=e[x],b=g>>>4,v=g&15,S=v===9,C=S||wr(v)?b:0,F=S?e[++x]>>>4:Or(v)?b:0,q=p+C,I=s+F*f,R=p,L=q;if(L>=i&&R<=a)if(C>0){let A=Math.max(R,i),$=Math.min(L,a);if($>A)if(u=Math.min(u,A),m=Math.max(m,$),S){let je=F/b,Ue=$-A,Be=Math.round(Ue*je),We=Math.round(s+(A-p)*je*f);c.push(Ue<<4|9,Be<<4|9),d(We,We+Be*f)}else c.push($-A<<4|v),Rr(v)?d(s+(A-p)*f,s+($-p)*f):d(s,s)}else F>0&&(S?c.push(g,e[x]):c.push(g),u=Math.min(u,p),m=Math.max(m,p),d(s,I));if(p=q,s=I,p>a)break}if(c.length!==0)return{start:u,end:m,mateStart:l,mateEnd:y,cigar:Uint32Array.from(c)}}function it(e){return e===1||e===2||e===3}function ke(e,r,t,o,n,i){let a=n===-1?-1:1,f=[],p=r,s=n===-1?o:t,c,u=!1,m=()=>{c!==void 0&&u&&c.qHi>c.qLo&&f.push({start:c.qLo,end:c.qHi,mateStart:c.tLo,mateEnd:c.tHi,cigar:Uint32Array.from(c.ops)}),c=void 0,u=!1};for(let l=0;l<e.length;l++){let y=e[l],d=y>>>4,x=y&15,g=x===9,b=g?e[++l]:void 0,v=g||wr(x)?d:0,S=b!==void 0?b>>>4:Or(x)?d:0,C=s+S*a;it(x)&&d>=i?m():(v>0||S>0)&&(c===void 0&&(c={qLo:p,qHi:p,tLo:s,tHi:s,ops:[]}),c.qHi=p+v,c.tLo=Math.min(c.tLo,s,C),c.tHi=Math.max(c.tHi,s,C),c.ops.push(y),b!==void 0&&c.ops.push(b),u=u||g||Rr(x)),p+=v,s=C}return m(),f}function Mr(e){let r=e.get("CIGAR");return typeof r=="string"?r:void 0}function Fr(e){let r=e.get("coarseCigar");return typeof r=="string"?r:void 0}function Ge(e){let r=Mr(e),t=r===void 0?Fr(e):void 0;return r!==void 0?Te(r):t!==void 0?_e(t):void 0}var at=["CIGAR","cs","coarseCigar","cg","cr"];function st(e){return typeof e=="object"&&e!==null&&"refName"in e&&"start"in e&&"end"in e&&typeof e.refName=="string"&&typeof e.start=="number"&&typeof e.end=="number"}function ft(e){let r=e.get("mate");return st(r)?r:void 0}function pt(e,r,t,o){let n=Math.max(e.start,o.start),i=Math.min(e.end,o.end),a=(r.end-r.start)/Math.max(e.end-e.start,1),f=c=>t===-1?r.end-(c-e.start)*a:r.start+(c-e.start)*a,p=Math.round(f(n)),s=Math.round(f(i));return i>n?{start:n,end:i,mateStart:Math.min(p,s),mateEnd:Math.max(p,s)}:void 0}function ct(e,r,t,o,n){let i={start:e.get("start"),end:e.get("end")},a=e.get("strand")===-1?-1:1,f=i.start>=t.start&&i.end<=t.end,p=f&&o===void 0&&!n?void 0:Ge(e);if(p===void 0){let s=f?{...i,mateStart:r.start,mateEnd:r.end}:pt(i,r,a,t);return s===void 0?[]:[s]}else return(o===void 0?[{...i,mateStart:r.start,mateEnd:r.end,cigar:p}]:ke(p,i.start,r.start,r.end,a,o)).flatMap(c=>{let u=Ne(c.cigar,c.start,c.mateStart,c.mateEnd,a,t.start,t.end);return u===void 0?[]:[u]})}function ut(e,r,t,o,n,i){let a=`:${o.start}-${o.end}${n}`,f=e.toJSON(),p={...f,uniqueId:`${e.id()}${a}`,recordId:f.recordId??e.id(),start:t.start,end:t.end,mate:{...r,start:t.mateStart,end:t.mateEnd}};f.syntenyId!==void 0&&(p.syntenyId=`${String(f.syntenyId)}${a}`);for(let s of at)delete p[s];return i&&t.cigar&&(p.alignmentOps=t.cigar),new P(p)}function Lr(e,r,t,o=!1){let n=ft(e);if(n===void 0)return[e];{let i=ct(e,n,r,t,o);return i.map((a,f)=>ut(e,n,a,r,i.length>1?`/${f}`:"",o))}}var Pr=class extends ze{constructor(){super(...arguments);this.recordsAreAlignments=!0}static{this.capabilities=["getFeatures","getRefNames"]}async hasDataForRefName(){return!0}getFeaturesInMultipleRegions(t,o={}){let{clipToRegion:n,splitAtGapBp:i,keepAlignment:a,...f}=o,p=n&&this.recordsAreAlignments,s=Ye(f.statusCallback);return Pe(t).pipe(W((c,u)=>this.getFeatures(c,{...f,statusCallback:s()}).pipe(W(m=>p?Lr(m,m.get("assemblyName")===c.assemblyName?c:{start:m.get("start"),end:m.get("end")},i,a):[m]),be(),V(m=>({index:u,features:m})))),be(),W(c=>c.sort((u,m)=>u.index-m.index).flatMap(u=>u.features)))}};var De=class extends Error{constructor(t){super(`a pair query names both lanes: queryAssemblyName ${t} came without a targetAssemblyName`);this.name="PairTargetError"}};function Qi(e){let{lanePairs:r,queryAssemblyName:t,targetAssemblyName:o}=e;if(r?.length)return r;if(t===void 0)return[];if(o===void 0)throw new De(t);return[{queryAssemblyName:t,targetAssemblyName:o}]}function Ki(e){let[r]=e;return e.length===1&&r?`Reading ${r.queryAssemblyName} against ${r.targetAssemblyName}`:`Reading ${e.length} lane pairs`}function Xi(e,r){return e[r]??e[He(r)]??r}function ea({target:e,query:r,strand:t,cigar:o,matches:n,columns:i}){let a=`${e.name}:${e.start}-${e.end}|${r.name}:${r.start}-${r.end}`;return new P({uniqueId:a,assemblyName:e.assemblyName,refName:e.refName,start:e.start,end:e.end,type:"match",strand:t==="-"?-1:1,CIGAR:o,syntenyId:a,identity:n/Math.max(i,1),numMatches:n,blockLen:i,mate:{refName:r.refName,start:r.start,end:r.end,assemblyName:r.assemblyName}})}export{P as a,Pr as b,De as c,Qi as d,Ki as e,Xi as f,ea as g};
-//# sourceMappingURL=chunk-IJJZC7A4.js.map

package/dist/chunks/chunk-PJ43KEV6.js

@@ -1,2 +0,0 @@
-function n(e){return e instanceof Error&&(e.name==="NodeLimitError"||e.regionTooLarge===!0||/reads more than nodeLimit|^Subgraph size limit of \d+ nodes exceeded/.test(e.message))}export{n as a};
-//# sourceMappingURL=chunk-PJ43KEV6.js.map

package/dist/chunks/chunk-PJ43KEV6.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../src/nodeLimitError.ts"],
-  "sourcesContent": ["// The GBZ adapter's own refusal, marked regionTooLarge so core shows it as a\n// zoom-in notice, or gbz-base's when it reaches the display unwrapped\nexport function isNodeLimitError(error: unknown) {\n  return (\n    error instanceof Error &&\n    (error.name === 'NodeLimitError' ||\n      (error as { regionTooLarge?: unknown }).regionTooLarge === true ||\n      /reads more than nodeLimit|^Subgraph size limit of \\d+ nodes exceeded/.test(\n        error.message,\n      ))\n  )\n}\n"],
-  "mappings": "AAEO,SAASA,EAAiBC,EAAgB,CAC/C,OACEA,aAAiB,QAChBA,EAAM,OAAS,kBACbA,EAAuC,iBAAmB,IAC3D,uEAAuE,KACrEA,EAAM,OACR,EAEN",
-  "names": ["isNodeLimitError", "error"]
-}

package/dist/chunks/chunk-T4HOC6O3.js

@@ -1,2 +0,0 @@
-function St(t,e){return 2*t+(e==="reverse"?1:0)}function C(t){return Math.floor(t/2)}function vt(t){return t%2===0?"forward":"reverse"}function v(t){return t%2===1}function Ct(t){return t%2===0?t+1:t-1}function Dt(t){return t==="left"?"right":"left"}function kt(t){return t==="forward"?"left":"right"}function Nt(t){return t==="forward"?"right":"left"}function Rt(t){return t==="left"?"forward":"reverse"}function Tt(t){return t==="right"?"forward":"reverse"}function ct(t,e){let n=C(t),s=C(e);return v(t)?s>n||s===n&&!v(e):s>=n}function Ot(t){return lt(t[0],t[t.length-1])}function lt(t,e){return t===void 0||e===void 0?!0:v(t)===v(e)?!v(t):ct(t,e)}var ft=["","A","C","G","T","N"];function Lt(t){let e=t[t.length-1];if(e===void 0)return 0;let n=e,s=0;for(let o=0;o<3&&n%6!==0;o++)n=Math.floor(n/6),s+=1;return 3*(t.length-1)+s}function _t(t){let e="";for(let n of t){let s=n;for(let o=0;o<3;o++){let r=ft[s%6];if(r==="")return e;s=Math.floor(s/6),e+=r}}return e}var at={A:"T",C:"G",G:"C",T:"A",N:"N"};function T(t){let e="";for(let n=t.length-1;n>=0;n--)e+=at[t[n]]??"N";return e}function O(t,e){let n=0,s=t.length;for(;n<s;){let o=n+s>>1;t[o]<e?n=o+1:s=o}return n}var B=class{ending;tree;constructor(e){this.ending=new Float64Array(e),this.tree=new Int32Array(e+1).fill(-1)}bestBefore(e){let n=-1;for(let s=e;s>0;s-=s&-s){let o=this.tree[s];o!==-1&&(n===-1||this.ending[o]>this.ending[n])&&(n=o)}return n}raise(e,n){this.ending[e]=n;for(let s=e+1;s<this.tree.length;s+=s&-s){let o=this.tree[s];(o===-1||n>this.ending[o])&&(this.tree[s]=e)}}},G=class{pairs=[];total=0;a;b;weight;occurrences=new Map;constructor(e,n,s){this.a=e,this.b=n,this.weight=s,n.forEach((o,r)=>{let i=this.occurrences.get(o);i?i.push(r):this.occurrences.set(o,[r])})}solve(e,n,s,o){let r=0;for(;e+r<n&&s+r<o&&this.a[e+r]===this.b[s+r];)this.match(e+r,s+r),r+=1;let i=0;for(;n-i>e+r&&o-i>s+r&&this.a[n-i-1]===this.b[o-i-1];)i+=1;this.solveMiddle(e+r,n-i,s+r,o-i);for(let c=i;c>0;c--)this.match(n-c,o-c)}match(e,n){this.pairs.push([e,n]),this.total+=this.weight(this.a[e])}solveMiddle(e,n,s,o){if(e===n||s===o)return;let r=this.matchCount(e,n,s,o);if(r===0)return;if(r<=n-e+(o-s)){this.chain(e,n,s,o,r);return}let i=e+n>>1,c=this.split(e,i,n,s,o);this.solve(e,i,s,c),this.solve(i,n,c,o)}matchCount(e,n,s,o){let r=0;for(let i=e;i<n;i++){let c=this.occurrences.get(this.a[i]);c&&(r+=O(c,o)-O(c,s))}return r}sweep(e,n,s,o,r,i,c){for(let u=e;u!==n;u+=s){let f=this.occurrences.get(this.a[u]);if(!f)continue;let a=this.weight(this.a[u]),p=O(f,o),h=O(f,r);for(let g=0;g<h-p;g++){let d=s===1?f[h-1-g]-o:r-1-f[p+g],m=i.bestBefore(d),w=(m===-1?0:i.ending[m])+a;if(w>i.ending[d]&&(i.raise(d,w),c)){let y=c.count++;c.row[y]=u,c.column[y]=d,c.previous[y]=m===-1?-1:c.endingMatch[m],c.endingMatch[d]=y}}}}chain(e,n,s,o,r){let i=new B(o-s),c={row:new Int32Array(r),column:new Int32Array(r),previous:new Int32Array(r),endingMatch:new Int32Array(o-s),count:0};this.sweep(e,n,1,s,o,i,c);let u=i.bestBefore(o-s);if(u===-1)return;this.total+=i.ending[u];let f=[];for(let a=c.endingMatch[u];a!==-1;a=c.previous[a])f.push([c.row[a],s+c.column[a]]);for(let a=f.length-1;a>=0;a--)this.pairs.push(f[a])}frontier(e,n,s,o,r){let i=new B(r-o);this.sweep(e,n,s,o,r,i);let c=new Float64Array(r-o+1);for(let u=0;u<r-o;u++)c[u+1]=Math.max(c[u],i.ending[u]);return c}split(e,n,s,o,r){let i=r-o,c=this.frontier(e,n,1,o,r),u=this.frontier(s-1,n-1,-1,o,r),f=0,a=-1;for(let p=0;p<=i;p++){let h=c[p]+u[i-p];h>a&&(a=h,f=p)}return o+f}};function Gt(t,e,n){let s=new G(t,e,n);return s.solve(0,t.length,0,e.length),[s.pairs,s.total]}var ut=100,j=4e6,ht=5e3,A=15,pt=64,dt=8,nt=1,H=-4,I=-6,D=-1,R=-(2**30),_=0,P=1,st=2;function k(t,e,n){let s=t.at(-1);n>0&&(s?.[0]===e?s[1]+=n:t.push([e,n]))}function L(t,e,n){return t>=n&&t>=e?_:n>=e?st:P}function rt(t,e,n){let s=t.length,o=e.length,r=o+1,i=new Uint8Array((s+1)*r),c=new Int32Array(r).fill(R),u=new Int32Array(r).fill(R),f=new Int32Array(r).fill(R);c[0]=0;for(let d=1;d<=o;d++)f[d]=I+(d-1)*D,i[d]=(d===1?_:st)<<4;for(let d=1;d<=s;d++){let m=new Int32Array(r).fill(R),w=new Int32Array(r).fill(R),y=new Int32Array(r).fill(R);w[0]=I+(d-1)*D,i[d*r]=(d===1?_:P)<<2;let M=t.charCodeAt(d-1);for(let l=1;l<=o;l++){let q=L(c[l-1],u[l-1],f[l-1]);m[l]=Math.max(c[l-1],u[l-1],f[l-1])+(M===e.charCodeAt(l-1)?nt:H);let E=L(c[l]+I,u[l]+D,f[l]+I);w[l]=Math.max(c[l]+I,u[l]+D,f[l]+I);let x=L(m[l-1]+I,w[l-1]+I,y[l-1]+D);y[l]=Math.max(m[l-1]+I,w[l-1]+I,y[l-1]+D),i[d*r+l]=q|E<<2|x<<4}c=m,u=w,f=y}let a=[],p=s,h=o,g=L(c[o],u[o],f[o]);for(;p>0||h>0;){let d=i[p*r+h]>>2*g&3;g===_?(a.push(t[p-1]===e[h-1]?"=":"X"),p-=1,h-=1):g===P?(a.push("I"),p-=1):(a.push("D"),h-=1),g=d}for(let d of a.reverse())k(n,d,1)}function gt(t,e){let n=Math.abs(t-e);return(n===0?0:Math.min(-I-(n-1)*D,-I+10*Math.log2(n)))+(Math.min(t,e)>0?-H:0)}function ot(t,e){let n=Math.abs(t-e);return n===0?0:.01*A*n+.5*Math.log2(n)}function W(t,e,n){return{qs:t.qs+e,qe:t.qs+n,ts:t.flipped?t.te-n:t.ts+e,te:t.flipped?t.te-e:t.ts+n,flipped:t.flipped}}function qt(t,e,n){let s=t.qe-t.qs,o=[];for(let[c,u]of e){let f=Math.max(0,c-t.qs),a=Math.min(s,u-t.qs);f<a&&o.push([f,a])}for(let[c,u]of n){let f=Math.max(0,t.flipped?t.te-u:c-t.ts),a=Math.min(s,t.flipped?t.te-c:u-t.ts);f<a&&o.push([f,a])}if(o.length===0)return[t];o.sort((c,u)=>c[0]-u[0]);let r=[],i=0;for(let[c,u]of o)c-i>=A&&r.push(W(t,i,c)),i=Math.max(i,u);return s-i>=A&&r.push(W(t,i,s)),r}function K(t,e,n,s,o=1/0){let r=[],i={query:[],target:[]},c={forward:{query:[],target:[]},flipped:{query:[],target:[]}},u=[...t].sort((f,a)=>f.qs-a.qs||f.ts-a.ts);for(;u.length>0&&r.length<o;){let f=u.map(l=>l.qe-l.qs),a=new Int32Array(u.length).fill(-1),p=new Int32Array(u.length);for(let l=0;l<u.length;l++){let q=u[l],E=q.qe-q.qs;for(let x=l-1;x>=Math.max(0,l-ht);x--){if(f[x]+E<=f[l])continue;let S=u[x];if(S.flipped===q.flipped&&S.qs<q.qs&&(q.flipped?q.te<S.te:S.ts<q.ts)){let N=Math.max(0,S.qe-q.qs,q.flipped?q.te-S.ts:S.te-q.ts),Q=q.qs+N-S.qe,z=q.flipped?S.ts-(q.te-N):q.ts+N-S.te;if(N<E&&Q<=e&&z<=e){let V=f[x]+E-N-s(Q,z);V>f[l]&&(f[l]=V,a[l]=x,p[l]=N)}}}}let h=new Int32Array(u.length),g=-1;for(let l=0;l<u.length;l++){let q=u[l];h[l]=(h[a[l]]??0)+q.qe-q.qs-p[l],h[l]>=n&&(g<0||f[l]>f[g])&&(g=l)}if(g<0)break;let d=[];for(let l=g;l>=0;l=a[l])d.push({run:u[l],trim:p[l]});d.reverse(),r.push(d);let m=d[0],w=d.at(-1),{flipped:y}=m.run,M=y?c.flipped:c.forward;M.query.push([m.run.qs+m.trim,w.run.qe]),M.target.push(y?[w.run.ts,m.run.te-m.trim]:[m.run.ts+m.trim,w.run.te]);for(let{run:l,trim:q}of d)i.query.push([l.qs+q,l.qe]),i.target.push(l.flipped?[l.ts,l.te-q]:[l.ts+q,l.te]);u=u.flatMap(l=>{let q=l.flipped?c.flipped:c.forward;return qt(l,[...i.query,...q.query],[...i.target,...q.target])}).sort((l,q)=>l.qs-q.qs||l.ts-q.ts)}return r}function X(t,e){let n=new Map;for(let r=0;r+A<=e.length;r++){let i=e.slice(r,r+A),c=n.get(i);c?c.push(r):n.set(i,[r])}let s=[],o=new Map;for(let r=0;r+A<=t.length;r++){let i=n.get(t.slice(r,r+A));if(i&&i.length<=pt)for(let c of i){let u=c-r,f=o.get(u);if(f&&r<=f.qe)f.qe=r+A,f.te=c+A;else{let a={qs:r,qe:r+A,ts:c,te:c+A,flipped:!1};o.set(u,a),s.push(a)}}}return s}function mt(t,e){return[...X(t,e),...X(t,T(e)).map(n=>({...n,ts:e.length-n.te,te:e.length-n.ts,flipped:!0}))]}function U(t,e,n,s,o){let r;for(let{run:i,trim:c}of t){let u=i.qs+c;if(r){let f=i.flipped?i.te-c:r.te,a=i.flipped?r.ts:i.ts+c,p=n.slice(f,a);o(e.slice(r.qe,u),i.flipped?T(p):p,s,r.qe,f)}k(s,"=",i.qe-u),r=i}}function $(t,e,n){k(n,"I",t.length),k(n,"D",e.length)}function it(t,e,n){t.length*e.length<=j?rt(t,e,n):$(t,e,n)}function J(t,e,n,s=0){let[o]=t.length*e.length>j&&s<dt?K(X(t,e),1/0,A,ot,1):[];if(!o){it(t,e,n);return}let r=(u,f,a)=>{J(u,f,a,s+1)},i=o[0].run,c=o.at(-1).run;r(t.slice(0,i.qs),e.slice(0,i.ts),n),U(o,t,e,n,r),r(t.slice(c.qe),e.slice(c.te),n)}function wt(t,e,n){J(t,e,n)}function yt(t,e,n){let s=[];U(t,e,n,s,wt);let o=t[0],r=t.at(-1),{flipped:i}=o.run;return{queryStart:o.run.qs+o.trim,queryEnd:r.run.qe,targetStart:i?r.run.ts:o.run.ts+o.trim,targetEnd:i?o.run.te-o.trim:r.run.te,strand:i?"-":"+",edits:i?s.reverse():s,sharedBases:0}}function Mt(t,e,n,s){let o=[];if(t.length*e.length<=j)rt(t,e,n);else{let r=K(mt(t,e),1/0,Math.max(s,A),ot),i=r.find(c=>!c[0].run.flipped);if(o=r.filter(c=>c[0].run.flipped).map(c=>yt(c,t,e)),i){let c=(a,p,h,g,d)=>{o.some(w=>g<w.queryEnd&&w.queryStart<g+a.length||d<w.targetEnd&&w.targetStart<d+p.length)?it(a,p,h):J(a,p,h)},u=i[0].run,f=i.at(-1).run;c(t.slice(0,u.qs),e.slice(0,u.ts),n,0,0),U(i,t,e,n,c),c(t.slice(f.qe),e.slice(f.te),n,f.qe,f.te)}else $(t,e,n)}return o}function F(t,e){let n=t.strand==="-",s=0,o=0;for(let[r,i]of t.edits)e(r,i,n?t.queryEnd-1-s:t.queryStart+s,t.targetStart+o),r!=="D"&&(s+=i),r!=="I"&&(o+=i)}function Y(t,e,n,s){let o=e==="query"&&t.strand==="-"?-1:1,r=0;return F(t,(i,c,u,f)=>{let a=e==="query"?u:f,p=h=>{let g=a+o*h;return g>=n&&g<s};if(i==="="||i==="X")for(let h=0;h<c;h++)p(h)&&(r+=i==="="?nt:H);else if(i==="I"==(e==="query"))for(let h=0;h<c;h++)p(h)&&(r+=h===0?I:D);else p(0)&&(r+=I+(c-1)*D)}),r}function Z(t,e){return e==="query"?[t.queryStart,t.queryEnd]:[t.targetStart,t.targetEnd]}function Et(t,e){let n=t.strand==="-",s=[],o=0,r=0,i=0,c=0,u=new Uint8Array(t.queryEnd-t.queryStart);for(let[g,d]of t.shared)u.fill(1,g-t.queryStart,d-t.queryStart);let f=g=>u[g-t.queryStart]===1,a=()=>{k(s,"I",o),k(s,"D",r),o=0,r=0};F(t,(g,d,m)=>{if(g==="I")o+=d;else if(g==="D")r+=d;else{for(let w=0;w<d;w++)e[i+w]?(o+=1,r+=1,f(n?m-w:m+w)&&(c+=1)):((o>0||r>0)&&a(),k(s,g,1));i+=d}}),a();let p={I:0,D:0};for(;s[0]?.[0]==="I"||s[0]?.[0]==="D";){let[g,d]=s.shift();p[g]+=d}let h={I:0,D:0};for(;s.at(-1)?.[0]==="I"||s.at(-1)?.[0]==="D";){let[g,d]=s.pop();h[g]+=d}return s.length===0?void 0:{...t,queryStart:t.queryStart+(n?h.I:p.I),queryEnd:t.queryEnd-(n?p.I:h.I),targetStart:t.targetStart+p.D,targetEnd:t.targetEnd-h.D,edits:s,sharedBases:t.sharedBases-c}}function It(t,e,n,s){let o={query:new Uint8Array(e),target:new Uint8Array(n)},r=t.map(f=>{let a=[];F(f,(p,h,g,d)=>{if(p==="="||p==="X")for(let m=0;m<h;m++)a.push([f.strand==="-"?g-m:g+m,d+m])});for(let[p,h]of a)o.query[p]=Math.min(255,o.query[p]+1),o.target[h]=Math.min(255,o.target[h]+1);return a}),i={query:new Map,target:new Map};r.forEach((f,a)=>{for(let[p,h]of f)for(let[g,d]of[["query",p],["target",h]])if(o[g][d]>1){let m=i[g].get(d);m?m.at(-1)!==a&&m.push(a):i[g].set(d,[a])}});let c=new Map,u=(f,a,p)=>{let h=`${p}:${f}:${a}`,g=c.get(h);if(g===void 0){let[d,m]=Z(t[f],p),[w,y]=Z(t[a],p),M=Math.max(d,w),l=Math.min(m,y),[q,E]=[t[f],t[a]];g=[Y(E,p,M,l)-Y(q,p,M,l),E.sharedBases-q.sharedBases,f-a].find(S=>S!==0)>0,c.set(h,g)}return g};return t.flatMap((f,a)=>{let p=r[a],h=new Uint8Array(p.length);if(p.forEach(([m,w],y)=>{for(let[M,l]of[["query",m],["target",w]])!h[y]&&i[M].get(l)?.some(q=>q!==a&&u(a,q,M))&&(h[y]=1)}),!h.includes(1))return[f];let g=Et(f,h),d=g?.edits.reduce((m,[w,y])=>m+(w==="="?y:0),0)??0;return g&&d>=s?[g]:[]})}function b(t,e){return t.map(n=>{let s=e(C(n));return v(n)?T(s):s}).join("")}function tt(t,e){let n=[0];for(let s of t)n.push(n.at(-1)+e(C(s)).length);return n}function et(t){let e=new Map,n=new Map;t.forEach((i,c)=>{let u=C(i);e.has(u)?n.set(u,c):e.set(u,c)});let s=new Int32Array(t.length+1);for(let[i,c]of n)s[e.get(i)]+=1,s[c+1]-=1;let o=new Uint8Array(t.length),r=0;for(let i=0;i<t.length;i++)r+=s[i],o[i]=r>0?1:0;return o}function At(t,e,n,s){let o=et(t),r=et(e),i=new Map;e.forEach((p,h)=>{r[h]||i.set(C(p),[h])});let c=2*e.length,u=(p,h,g)=>p*c+2*h+(g?1:0),f=new Set;t.forEach((p,h)=>{for(let g of o[h]?[]:i.get(C(p))??[])f.add(u(h,g,v(p)!==v(e[g])))});let a=[];return t.forEach((p,h)=>{for(let g of o[h]?[]:i.get(C(p))??[]){let d=v(p)!==v(e[g]),m=d?-1:1,w=g-m;if(!(h>0&&w>=0&&w<e.length&&f.has(u(h-1,w,d)))){let M=h,l=g;for(;M<t.length&&l>=0&&l<e.length&&f.has(u(M,l,d));)M+=1,l+=m;let q=l-m;a.push({qs:n[h],qe:n[M],ts:s[Math.min(g,q)],te:s[Math.max(g,q)+1],flipped:d})}}}),a}function Ht(t){let{query:e,target:n,sequenceOf:s}=t,o=b(e,s),r=b(n,s),i=At(e,n,tt(e,s),tt(n,s)),c=t.minMatch??ut,u=t.bases??!0,f=[];for(let a of K(i,t.maxGap??1/0,c,gt)){let p=[],h=a[0],g=a.at(-1),{flipped:d}=h.run;U(a,o,r,p,u?(w,y,M,l,q)=>{for(let E of Mt(w,y,M,c)){let x=q+y.length;f.push({...E,queryStart:l+E.queryStart,queryEnd:l+E.queryEnd,targetStart:d?x-E.targetEnd:q+E.targetStart,targetEnd:d?x-E.targetStart:q+E.targetEnd,strand:d?"+":"-",edits:d?E.edits.reverse():E.edits,shared:[]})}}:$),f.push({queryStart:h.run.qs+h.trim,queryEnd:g.run.qe,targetStart:d?g.run.ts:h.run.ts+h.trim,targetEnd:d?h.run.te-h.trim:g.run.te,strand:d?"-":"+",edits:d?p.reverse():p,sharedBases:a.reduce((w,{run:y,trim:M})=>w+y.qe-y.qs-M,0),shared:a.map(({run:w,trim:y})=>[w.qs+y,w.qe])})}return It(f,o.length,r.length,c).map(({shared:a,...p})=>p).sort((a,p)=>a.queryStart-p.queryStart)}function Kt(t){return t.map(([e,n])=>`${n}${e}`).join("")}export{St as a,C as b,vt as c,v as d,Ct as e,Dt as f,kt as g,Nt as h,Rt as i,Tt as j,ct as k,Ot as l,lt as m,Lt as n,_t as o,Gt as p,Ht as q,Kt as r};
-//# sourceMappingURL=chunk-T4HOC6O3.js.map