@jbrowse/bandage-core 11.1.0 → 11.3.0

package/dist/viewport.js

@@ -5,8 +5,8 @@ import {
   screenToLayout,
   viewportOf,
   zoomAbout
-} from "./chunks/chunk-AI5PTOSV.js";
-import "./chunks/chunk-KDU4EF66.js";
+} from "./chunks/chunk-CE6ZIKJX.js";
+import "./chunks/chunk-REOWLPH4.js";
 import "./chunks/chunk-3PZSBNLI.js";
 import "./chunks/chunk-CKUVEHSS.js";
 import "./chunks/chunk-OPPVSPEF.js";
@@ -14,7 +14,7 @@ import "./chunks/chunk-VPE4AYP7.js";
 import "./chunks/chunk-FFHJGWDK.js";
 import "./chunks/chunk-QYBZZI5H.js";
 import "./chunks/chunk-5I3K4R2G.js";
-import "./chunks/chunk-3XSRT7RQ.js";
+import "./chunks/chunk-B5ARSBOH.js";
 import "./chunks/chunk-B5X2RLJG.js";
 import "./chunks/chunk-VX656OAZ.js";
 import "./chunks/chunk-DZR37KXT.js";

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@jbrowse/bandage-core",
-  "version": "11.1.0",
+  "version": "11.3.0",
   "description": "Pangenome graph layout and drawing with no host: GFA in, the Bandage force-directed engine and reference-anchored layouts, a Canvas2D renderer, hit testing and labels out",
   "license": "GPL-3.0-or-later",
   "repository": {

package/dist/chunks/chunk-DEDD7TFJ.js

@@ -1,322 +0,0 @@
-import {
-  pathOrigin
-} from "./chunk-B5X2RLJG.js";
-import {
-  gapParts
-} from "./chunk-EIY2SKD3.js";
-import {
-  groupBy
-} from "./chunk-BSOZW3FC.js";
-import {
-  panSNContig,
-  panSNSample
-} from "./chunk-4XWZNPQ2.js";
-
-// src/layout/walkRows.ts
-function sampleOf(path) {
-  return path.sample ?? panSNSample(path.name);
-}
-function labelOf(path) {
-  return path.haplotype !== void 0 && path.sample !== void 0 ? `${path.sample}#${path.haplotype}` : sampleOf(path);
-}
-var NodeTable = class {
-  constructor(graph) {
-    this.index = /* @__PURE__ */ new Map();
-    this.ids = [];
-    this.lengths = [];
-    this.onReference = new Uint8Array(0);
-    this.referenceStart = new Float64Array(0);
-    this.referenceEnd = new Float64Array(0);
-    for (const node of graph.nodes) {
-      this.lengths[this.indexOf(node.id)] = node.length;
-    }
-  }
-  indexOf(id) {
-    let i = this.index.get(id);
-    if (i === void 0) {
-      i = this.lengths.length;
-      this.index.set(id, i);
-      this.ids.push(id);
-      this.lengths.push(0);
-    }
-    return i;
-  }
-  nodesOf(path) {
-    const nodes = new Int32Array(path.nodeIds.length);
-    path.nodeIds.forEach((id, k) => {
-      nodes[k] = this.indexOf(id);
-    });
-    return nodes;
-  }
-  spanAt(steps, k) {
-    const node = k >= 0 && k < steps.length ? steps[k] : -1;
-    return node >= 0 && this.onReference[node] ? { start: this.referenceStart[node], end: this.referenceEnd[node] } : void 0;
-  }
-};
-function stepsOf(pieces, table) {
-  const out = [];
-  const gaps = [];
-  let end;
-  let previous;
-  for (const piece of pieces) {
-    if (end !== void 0 && piece.start !== void 0 && piece.start > end) {
-      gaps.push(gapParts(piece.start - end, previous?.after, piece.before));
-      out.push(-gaps.length);
-    }
-    let bp = 0;
-    for (const node of piece.nodes) {
-      out.push(node);
-      bp += table.lengths[node];
-    }
-    end = piece.start === void 0 ? void 0 : piece.start + bp;
-    previous = piece;
-  }
-  return { steps: Float64Array.from(out), gaps };
-}
-function stepSpan(pieces, table, k) {
-  let end;
-  let at = 0;
-  let found;
-  for (const piece of pieces) {
-    if (piece.start === void 0 || end !== void 0 && piece.start < end) {
-      return void 0;
-    }
-    if (end !== void 0 && piece.start > end) {
-      if (at++ === k) {
-        found = { start: end, end: piece.start };
-      }
-    }
-    let pos = piece.start;
-    for (const node of piece.nodes) {
-      const len = table.lengths[node];
-      if (at++ === k) {
-        found = { start: pos, end: pos + len };
-      }
-      pos += len;
-    }
-    end = pos;
-  }
-  return found;
-}
-function sliceBetween(steps, table, region, flanked = true) {
-  if (!region || !flanked) {
-    return { ids: steps, complete: true, from: -1, to: -1 };
-  }
-  const { onReference, referenceStart, referenceEnd } = table;
-  let i0 = -1;
-  let i1 = -1;
-  let bestEnd = -Infinity;
-  let bestStart = Infinity;
-  for (let i = 0; i < steps.length; i++) {
-    const node = steps[i];
-    if (node >= 0 && onReference[node]) {
-      const end2 = referenceEnd[node];
-      const start = referenceStart[node];
-      if (end2 <= region.start && end2 > bestEnd) {
-        bestEnd = end2;
-        i0 = i;
-      }
-      if (start >= region.end && start < bestStart) {
-        bestStart = start;
-        i1 = i;
-      }
-    }
-  }
-  if (i0 >= 0 && i1 >= 0) {
-    const ids2 = steps.slice(Math.min(i0, i1) + 1, Math.max(i0, i1));
-    return {
-      ids: i0 < i1 ? ids2 : ids2.reverse(),
-      complete: true,
-      from: i0,
-      to: i1
-    };
-  }
-  const spanAt = (k) => table.spanAt(steps, k);
-  const flank = i0 >= 0 ? i0 : i1;
-  let near = -1;
-  for (let d = 1; flank >= 0 && near < 0 && d < steps.length; d++) {
-    near = [flank - d, flank + d].find((j) => spanAt(j) !== void 0) ?? -1;
-  }
-  if (near < 0) {
-    return { ids: steps, complete: false, from: -1, to: -1 };
-  }
-  const forward = near > flank === spanAt(near).start > spanAt(flank).start;
-  const after = forward === (flank === i0);
-  const ids = after ? steps.slice(flank + 1) : steps.slice(0, flank).reverse();
-  const last = ids.length > 0 ? ids.length - 1 : -1;
-  const end = last < 0 ? spanAt(flank) : spanAt(after ? flank + 1 + last : 0);
-  const stop = {
-    contigEnds: end !== void 0,
-    shortBp: !end ? 0 : Math.max(0, region.start - end.end, end.start - region.end)
-  };
-  return {
-    ids,
-    complete: false,
-    from: flank,
-    to: after ? steps.length : -1,
-    stop
-  };
-}
-function filterSamples(rows, samples) {
-  return samples ? rows.filter((r) => samples.includes(r.sample)).sort(
-    (a, b) => samples.indexOf(a.sample) - samples.indexOf(b.sample) || a.label.localeCompare(b.label)
-  ) : rows;
-}
-function referenceWalkName(graph) {
-  const names = (graph.paths ?? []).map((p) => pathOrigin(p.name).name);
-  if (graph.referencePath !== void 0 && names.includes(graph.referencePath)) {
-    return graph.referencePath;
-  }
-  const rankZero = new Set(
-    graph.nodes.flatMap((n) => n.stable?.rank === 0 ? [n.stable.refName] : [])
-  );
-  return names.find((n) => rankZero.has(n)) ?? names[0];
-}
-function walkRows(graph, region, unit) {
-  const paths = graph.paths ?? [];
-  const nameOf = (p) => pathOrigin(p.name).name;
-  const referenceName = referenceWalkName(graph);
-  const referencePieces = paths.filter((p) => nameOf(p) === referenceName).sort((a, b) => (a.start ?? 0) - (b.start ?? 0));
-  const first = referencePieces[0];
-  const others = paths.filter((p) => !referencePieces.includes(p));
-  if (!first || others.length === 0) {
-    return void 0;
-  }
-  const walks = groupBy(others, nameOf);
-  const table = new NodeTable(graph);
-  const referenceStart = first.start ?? 0;
-  const cut = region && region.end > region.start ? region : void 0;
-  const referenceNodes = referencePieces.map((piece) => table.nodesOf(piece));
-  const nodeCount = table.lengths.length;
-  table.onReference = new Uint8Array(nodeCount);
-  table.referenceStart = new Float64Array(nodeCount);
-  table.referenceEnd = new Float64Array(nodeCount);
-  let reachesBefore = false;
-  let reachesAfter = false;
-  for (const [p, piece] of referencePieces.entries()) {
-    let pos = piece.start ?? 0;
-    for (const node of referenceNodes[p]) {
-      const len = table.lengths[node];
-      if (!table.onReference[node]) {
-        table.onReference[node] = 1;
-        table.referenceStart[node] = pos;
-        table.referenceEnd[node] = pos + len;
-        reachesBefore ||= cut !== void 0 && pos + len <= cut.start;
-        reachesAfter ||= cut !== void 0 && pos >= cut.end;
-      }
-      pos += len;
-    }
-  }
-  const flanked = cut === void 0 || reachesBefore && reachesAfter;
-  const rowOf = (paths2, nodes) => {
-    const path = paths2[0];
-    const pieces = paths2.map((piece, p) => ({
-      start: piece.start,
-      nodes: nodes?.[p] ?? table.nodesOf(piece),
-      before: piece.before,
-      after: piece.after
-    })).sort((a, b) => (a.start ?? 0) - (b.start ?? 0));
-    const { steps, gaps } = stepsOf(pieces, table);
-    const { ids, complete, from, to, stop } = sliceBetween(
-      steps,
-      table,
-      cut,
-      flanked
-    );
-    const contig = path.contig ?? panSNContig(pathOrigin(path.name).name);
-    const axisSpan = stepSpan(pieces, table, from < 0 ? 0 : from);
-    const axis = !axisSpan ? void 0 : from < 0 ? { contig, start: axisSpan.start, reversed: false } : from < to ? { contig, start: axisSpan.end, reversed: false } : { contig, start: axisSpan.start, reversed: true };
-    const {
-      ids: nodeIds,
-      lengths,
-      onReference,
-      referenceStart: referenceStart2,
-      referenceEnd
-    } = table;
-    const runs = [];
-    const visits = [];
-    let last;
-    let bp = 0;
-    let offReferenceBp = 0;
-    let gapBp = 0;
-    let step = 0;
-    const backwards = from >= 0 && from > to;
-    for (const node of ids) {
-      if (node < 0) {
-        const parts = gaps[-node - 1];
-        for (const { bp: partBp, ...why } of backwards ? [...parts].reverse() : parts) {
-          last = {
-            start: bp,
-            bp: partBp,
-            onReference: false,
-            gap: true,
-            ...why
-          };
-          runs.push(last);
-          bp += partBp;
-          gapBp += partBp;
-        }
-        step = 0;
-        continue;
-      }
-      const len = lengths[node];
-      const on = onReference[node] === 1;
-      visits.push({ node: nodeIds[node], start: bp, onReference: on });
-      const at = last?.referenceStart;
-      const forward = on && at !== void 0 && step >= 0 && at + last.bp === referenceStart2[node];
-      const backward = on && at !== void 0 && step <= 0 && referenceEnd[node] === at;
-      if (!on && last && !last.onReference && !last.gap) {
-        last.bp += len;
-      } else if (forward || backward) {
-        last.bp += len;
-        if (!forward) {
-          last.referenceStart = referenceStart2[node];
-          last.reversed = true;
-        }
-        step = forward ? 1 : -1;
-      } else {
-        last = {
-          start: bp,
-          bp: len,
-          onReference: on,
-          referenceStart: on ? referenceStart2[node] : void 0
-        };
-        runs.push(last);
-        step = 0;
-      }
-      bp += len;
-      if (!on) {
-        offReferenceBp += len;
-      }
-    }
-    return {
-      name: path.name,
-      label: labelOf(path),
-      sample: sampleOf(path),
-      haplotype: path.haplotype,
-      bp,
-      offReferenceBp,
-      gapBp,
-      complete,
-      stop,
-      runs,
-      visits,
-      axis
-    };
-  };
-  const origin = cut ? cut.start : referenceStart;
-  return {
-    origin,
-    unit,
-    reference: rowOf(referencePieces, referenceNodes),
-    rows: [...walks.values()].map((paths2) => rowOf(paths2)).sort(
-      (a, b) => Number(b.complete) - Number(a.complete) || b.bp - a.bp || a.label.localeCompare(b.label)
-    )
-  };
-}
-
-export {
-  filterSamples,
-  referenceWalkName,
-  walkRows
-};