@dev.fast/whiteboard 0.3.4-preview.20261019.127 → 0.3.4

package/dist/lens-selection-CyJapcsl.js

@@ -1,214 +0,0 @@
-import "./src-BiWNbcF_.js";
-import { z } from "zod";
-//#region src/viewed-coverage.ts
-const coverageSchema = z.object({
-	base: z.array(z.tuple([z.number().int().nonnegative(), z.number().int().nonnegative()])),
-	head: z.array(z.tuple([z.number().int().nonnegative(), z.number().int().nonnegative()]))
-});
-const emptyCoverage = () => ({
-	base: [],
-	head: []
-});
-function unionIntervals(ranges) {
-	const result = [];
-	for (const [start, end] of [...ranges].sort((a, b) => a[0] - b[0])) {
-		if (end <= start) continue;
-		const last = result.at(-1);
-		if (last && start <= last[1]) last[1] = Math.max(last[1], end);
-		else result.push([start, end]);
-	}
-	return result;
-}
-function intersectIntervals(left, right) {
-	const result = [];
-	const a = unionIntervals(left), b = unionIntervals(right);
-	let i = 0, j = 0;
-	while (i < a.length && j < b.length) {
-		const start = Math.max(a[i][0], b[j][0]), end = Math.min(a[i][1], b[j][1]);
-		if (start < end) result.push([start, end]);
-		if (a[i][1] < b[j][1]) i++;
-		else j++;
-	}
-	return result;
-}
-function subtractIntervals(left, right) {
-	const result = [];
-	const removed = unionIntervals(right);
-	for (const [start, end] of unionIntervals(left)) {
-		let cursor = start;
-		for (const [from, to] of removed) {
-			if (to <= cursor) continue;
-			if (from >= end) break;
-			if (from > cursor) result.push([cursor, from]);
-			cursor = Math.min(end, Math.max(cursor, to));
-		}
-		if (cursor < end) result.push([cursor, end]);
-	}
-	return result;
-}
-function updateCoverage(current, scope, viewed) {
-	const apply = (side) => viewed ? unionIntervals([...current[side], ...scope[side]]) : subtractIntervals(current[side], scope[side]);
-	return {
-		base: apply("base"),
-		head: apply("head")
-	};
-}
-function scopedCoverage(file, sources) {
-	if (!sources) return file.changed;
-	const side = (side) => intersectIntervals(file.changed[side], sources.flatMap((source) => source.side === side && source.file === (side === "base" ? file.previousPath ?? file.path : file.path) ? [[source.fromLine - 1, source.toLine]] : []));
-	return {
-		base: side("base"),
-		head: side("head")
-	};
-}
-function coverageSources(file, coverage = file.viewed) {
-	return ["base", "head"].flatMap((side) => coverage[side].map(([start, end]) => ({
-		side,
-		file: side === "base" ? file.previousPath ?? file.path : file.path,
-		fromLine: start + 1,
-		toLine: end
-	})));
-}
-//#endregion
-//#region src/lens-selection.ts
-const ANCHOR_FORMS = "\"head/path#L10-L24\" or \"base/path#L7\" (one side, lines 10–24 or line 7); across sides, GitHub diff style \"diff/path#L84-R90\" (L = base line, R = head line)";
-const sameSideAnchor = /^(head|base)\/(.+)#L(\d+)(?:-L(\d+))?$/;
-const crossSideAnchor = /^diff\/(.+)#([LR])(\d+)-([LR])(\d+)$/;
-const commitLinkAnchor = /^([0-9a-f]{7,40})\/(.+#L\d+(?:-L\d+)?)$/i;
-/** A source link's commit form, "<sha>/path#L10-L24" (without its
-* `whiteboard:source/` prefix): lines of that commit of the board's own
-* repository, read as their head side. Undefined for any other form. */
-function commitLinkTarget(target) {
-	const match = commitLinkAnchor.exec(target);
-	return match ? {
-		commit: match[1].toLowerCase(),
-		anchor: `head/${match[2]}`
-	} : void 0;
-}
-/** An anchor's selection, as markdown source links write it too (without
-* their `whiteboard:source/` prefix). Undefined when it isn't one. */
-function parseAnchor(text) {
-	const same = sameSideAnchor.exec(text);
-	if (same) {
-		const side = same[1] === "base" ? "base" : "head";
-		return {
-			file: same[2],
-			start: {
-				side,
-				line: Number(same[3])
-			},
-			end: {
-				side,
-				line: Number(same[4] ?? same[3])
-			}
-		};
-	}
-	const cross = crossSideAnchor.exec(text);
-	if (!cross || cross[2] === cross[4]) return void 0;
-	const side = (letter) => letter === "L" ? "base" : "head";
-	return {
-		file: cross[1],
-		start: {
-			side: side(cross[2]),
-			line: Number(cross[3])
-		},
-		end: {
-			side: side(cross[4]),
-			line: Number(cross[5])
-		}
-	};
-}
-/** Why a parsed selection can't be quoted, or undefined when it can. */
-function selectionProblem(selection) {
-	if (selection.start.line < 1 || selection.end.line < 1) return "Source lines count from 1.";
-	if (selection.start.side === selection.end.side && selection.start.line > selection.end.line) return "Source range ends before it starts.";
-	if (selection.pins && selection.pins.base === void 0 && (selection.start.side === "base" || selection.end.side === "base")) return "A base-side anchor needs base pins.";
-}
-const anchorSchema = z.string({ error: `Expected a source anchor: ${ANCHOR_FORMS}.` }).superRefine((text, context) => {
-	const selection = parseAnchor(text);
-	const problem = selection ? selectionProblem(selection) : `Use ${ANCHOR_FORMS} for a source anchor.`;
-	if (problem) context.addIssue({
-		code: "custom",
-		message: problem
-	});
-}).describe("head/path#L10-L24, base/path#L7, or diff/path#L84-R90");
-/** A stored anchor's selection, read at the pins of whatever holds it. */
-function anchorSelection(anchor, pins) {
-	const selection = parseAnchor(anchor);
-	if (!selection) throw new Error(`Not a source anchor: ${anchor}`);
-	return pins ? {
-		...selection,
-		pins
-	} : selection;
-}
-/** The anchor that writes a selection; its pins belong to its holder. */
-function formatAnchor(selection) {
-	const { file, start, end } = selection;
-	if (start.side === end.side) return start.line === end.line ? `${start.side}/${file}#L${start.line}` : `${start.side}/${file}#L${start.line}-L${end.line}`;
-	const letter = (side) => side === "base" ? "L" : "R";
-	return `diff/${file}#${letter(start.side)}${start.line}-${letter(end.side)}${end.line}`;
-}
-/** Pins-less selections keep the key they always had. */
-function selectionKey(source) {
-	return JSON.stringify([
-		source.file,
-		source.start.side,
-		source.start.line,
-		source.end.side,
-		source.end.line,
-		...source.pins ? [sourcePinsKey(source.pins)] : []
-	]);
-}
-function sourcePinsKey(pins) {
-	return `${pins.repositoryId}:${pins.base ?? ""}:${pins.head}`;
-}
-/** The comparison a source's pins name: head alone means head against
-* itself. Reference coverage is grouped under this key on both sides. */
-function comparisonKey(pins) {
-	return `${pins.repositoryId}:${pins.base ?? pins.head}:${pins.head}`;
-}
-/** Navigation/quote anchors only; never use these as lens coverage. */
-function sourceAnchors(source) {
-	return ["head", "base"].flatMap((side) => {
-		const lines = [source.start, source.end].flatMap((endpoint) => endpoint.side === side ? [endpoint.line] : []);
-		if (!lines.length) return [];
-		const anchor = {
-			file: source.file,
-			side,
-			fromLine: Math.min(...lines),
-			toLine: Math.max(...lines)
-		};
-		if (source.pins) anchor.pins = source.pins;
-		return [anchor];
-	});
-}
-/** Why a selection cannot be resolved at its pins, as telemetry reports it. */
-const SELECTION_UNAVAILABLE_REASONS = [
-	"missing_file",
-	"no_alignment",
-	"outside_lines",
-	"other"
-];
-var SelectionUnavailableError = class extends Error {
-	reason;
-	constructor(reason, message) {
-		super(message);
-		this.reason = reason;
-	}
-};
-/** Resolve once against the renderer's rows. No matching or context expansion. */
-function resolveDiffSelection(source, rows, file) {
-	const locate = (endpoint) => rows.findIndex((row) => row[endpoint.side === "base" ? 0 : 1] === endpoint.line - 1);
-	const start = locate(source.start);
-	const end = locate(source.end);
-	if (start < 0 || end < start) throw new SelectionUnavailableError("outside_lines", "Lens endpoints do not identify an ordered interval in this diff.");
-	const selected = rows.slice(start, end + 1);
-	return ["base", "head"].flatMap((side, index) => unionIntervals(selected.flatMap((row) => row[index] === null ? [] : [[row[index], row[index] + 1]])).map(([from, to]) => ({
-		file: side === "base" ? file.previousPath ?? file.path : file.path,
-		side,
-		fromLine: from + 1,
-		toLine: to
-	})));
-}
-//#endregion
-export { scopedCoverage as _, commitLinkTarget as a, updateCoverage as b, parseAnchor as c, selectionProblem as d, sourceAnchors as f, intersectIntervals as g, emptyCoverage as h, anchorSelection as i, resolveDiffSelection as l, coverageSources as m, SelectionUnavailableError as n, comparisonKey as o, coverageSchema as p, anchorSchema as r, formatAnchor as s, SELECTION_UNAVAILABLE_REASONS as t, selectionKey as u, subtractIntervals as v, unionIntervals as y };

package/dist/profile-DJvkBJNQ.js

@@ -1,2 +0,0 @@
-import { t as openReviewProfile } from "./profile-BadSkCkI.js";
-export { openReviewProfile };

package/dist/runtime-Bj2tD33R.js

@@ -1,27 +0,0 @@
-import { E as runVcs } from "./src-WPaQn75m.js";
-import path from "node:path";
-//#region src/runtime.ts
-async function resolveReviewRoot(cwd, execFile = execFilePromise) {
-	const initialCwd = path.resolve(cwd);
-	try {
-		const { stdout } = await execFile("jj", ["root"], { cwd: initialCwd });
-		const root = stdout.trim();
-		if (root) return path.resolve(root);
-	} catch {}
-	try {
-		const { stdout } = await execFile("git", [
-			"-C",
-			initialCwd,
-			"rev-parse",
-			"--show-toplevel"
-		]);
-		const root = stdout.trim();
-		if (root) return path.resolve(root);
-	} catch {}
-	return initialCwd;
-}
-function execFilePromise(file, args, options = {}) {
-	return runVcs(file, args, options);
-}
-//#endregion
-export { resolveReviewRoot as t };

package/src/heading-anchors.ts

@@ -1,42 +0,0 @@
-import { slugify, uniqueId } from "./slug.js";
-
-// A board's headings, as the server publishes them and the editor shows
-// them: one rule for both, so a heading's anchor is the same in each.
-
-/** Whether a Markdown heading with this many `#`s is one of the board's
- * headings, with an anchor and a Contents row: `##` and `###`. */
-export function isBoardHeading(hashes: number | undefined): boolean {
-  return hashes === 2 || hashes === 3;
-}
-
-/** Hands out heading anchors in document order: `slugify(text)`, made
- * unique, so imported `#fragment` links still land. */
-export function headingAnchors(): (text: string) => string {
-  const used = new Set<string>();
-
-  return (text) => {
-    const id = uniqueId(slugify(text) || "section", used);
-
-    used.add(id);
-
-    return id;
-  };
-}
-
-/**
- * A Markdown heading's depth in Contents: one step under its section,
- * whose blocks sit at `base`, and under the block's bigger headings before
- * it. `open` holds those headings by `#` count, and takes this one.
- */
-export function markdownHeadingDepth(
-  open: number[],
-  hashes: number,
-  base: number,
-): number {
-  while (open.length && open.at(-1)! >= hashes) open.pop();
-  const depth = base + open.length;
-
-  open.push(hashes);
-
-  return depth;
-}

package/src/review-api/board-order.ts

@@ -1,144 +0,0 @@
-/** What sibling order reads about a board. */
-export interface SiblingFacts {
-  id: string;
-  /** When it was made: an edit never moves it. */
-  createdAt: string;
-  /** Its pins: commits of repositoryId. Plans have none. */
-  repositoryId?: string;
-  base?: string;
-  head?: string;
-  /** A PR board's head branch, and its PR's base branch, when known. */
-  headBranch?: string;
-  baseBranch?: string;
-}
-
-/**
- * Siblings in reading order. A comes after B when A reaches B through
- * depends_on, directly or through boards outside the siblings. Between two
- * siblings with no such chain either way, commits decide: A comes after B
- * when A's base is, or descends from, B's head, or A's PR merges into B's
- * branch. Remaining ties go newest made first, then by id, so an edit
- * never reorders them.
- */
-export function orderSiblings(
-  siblings: readonly SiblingFacts[],
-  dependsOn: (id: string) => readonly string[],
-  isAncestor: (repositoryId: string, ancestor: string, of: string) => boolean,
-): string[] {
-  const reach = new Map(
-    siblings.map((board) => [board.id, reachable(board.id, dependsOn)]),
-  );
-
-  const after = (a: SiblingFacts, b: SiblingFacts) => {
-    if (reach.get(a.id)!.has(b.id)) return true;
-
-    if (reach.get(b.id)!.has(a.id)) return false;
-
-    return buildsOn(a, b, isAncestor) && !buildsOn(b, a, isAncestor);
-  };
-
-  const before = new Map(
-    siblings.map((a) => [
-      a.id,
-      new Set(siblings.flatMap((b) => (b !== a && after(a, b) ? [b.id] : []))),
-    ]),
-  );
-
-  const newestFirst = [...siblings].sort(
-    (a, b) =>
-      Date.parse(b.createdAt) - Date.parse(a.createdAt) ||
-      a.id.localeCompare(b.id),
-  );
-
-  const placed = new Set<string>();
-  const order: string[] = [];
-
-  while (order.length < siblings.length) {
-    const remaining = newestFirst.filter((board) => !placed.has(board.id));
-
-    // Inferred order can disagree with itself; then age breaks the loop.
-    const next =
-      remaining.find((board) =>
-        [...before.get(board.id)!].every((id) => placed.has(id)),
-      ) ?? remaining[0]!;
-
-    placed.add(next.id);
-    order.push(next.id);
-  }
-
-  return order;
-}
-
-function reachable(
-  id: string,
-  dependsOn: (id: string) => readonly string[],
-): Set<string> {
-  const seen = new Set<string>();
-  const stack = [...dependsOn(id)];
-
-  while (stack.length) {
-    const next = stack.pop()!;
-
-    if (seen.has(next)) continue;
-    seen.add(next);
-    stack.push(...dependsOn(next));
-  }
-
-  return seen;
-}
-
-/** Whether a's change sits on top of b's. */
-function buildsOn(
-  a: SiblingFacts,
-  b: SiblingFacts,
-  isAncestor: (repositoryId: string, ancestor: string, of: string) => boolean,
-): boolean {
-  if (a.repositoryId !== b.repositoryId) return false;
-
-  if (a.baseBranch && a.baseBranch === b.headBranch) return true;
-
-  if (!a.base || !b.head) return false;
-
-  if (a.base === b.head) return true;
-
-  // A board with no change of its own builds on nothing.
-  return a.base !== a.head && isAncestor(a.repositoryId!, b.head, a.base);
-}
-
-/**
- * The path that adding `from → to` would close, from `from` back to itself,
- * or undefined when it closes none.
- */
-export function dependencyCycle(
-  from: string,
-  to: string,
-  dependsOn: (id: string) => readonly string[],
-): string[] | undefined {
-  if (from === to) return [from, from];
-
-  const previous = new Map<string, string>();
-  const queue = [to];
-  const seen = new Set([to]);
-
-  while (queue.length) {
-    const current = queue.shift()!;
-
-    if (current === from) {
-      const path = [from];
-
-      for (let at = from; at !== to; at = previous.get(at)!)
-        path.unshift(previous.get(at)!);
-
-      return [from, ...path];
-    }
-
-    for (const next of dependsOn(current))
-      if (!seen.has(next)) {
-        seen.add(next);
-        previous.set(next, current);
-        queue.push(next);
-      }
-  }
-
-  return undefined;
-}